Reducing Energy Consumption through the Union of Disjoint Set Forests Algorithm in Sensor Networks

Authors:
Byoungyong Lee;Kyungseo Park;Ramez Elmasri
Affiliations:
Computer Science and Engineering, The University of Texas at Arlington, Arlington, USA TX 76019;Computer Science and Engineering, The University of Texas at Arlington, Arlington, USA TX 76019;Computer Science and Engineering, The University of Texas at Arlington, Arlington, USA TX 76019
Venue:
Information Networking. Towards Ubiquitous Networking and Services
Year:
2008

Citing 7
Cited 1

Introduction to Algorithms

Introduction to Algorithms
The cougar approach to in-network query processing in sensor networks

ACM SIGMOD Record
Energy-aware data-centric routing in microsensor networks

MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Simulating the power consumption of large-scale sensor network applications

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Synopsis diffusion for robust aggregation in sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks

IEEE Transactions on Mobile Computing
Automatic decentralized clustering for wireless sensor networks

EURASIP Journal on Wireless Communications and Networking

An effective data collection algorithm for wireless sensor network

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, wireless sensor networks have improved for many applications aimed at collecting information. However wireless sensor networks have many challenges to be solved. One of the most critical problems is the energy restriction. Therefore in order to extend the lifetime of sensor nodes, we need to minimize the amount of energy consumption. In many cases, sensor networks use routing schemes based on the tree routing structure. But when we collect information from a restricted area within the sensor field using the tree routing structure, the information is often assembled by sensor nodes located on different tree branches. In this case unnecessary energy consumption happens in ancestor nodes located out of the target area. In this paper, we propose the Sensor Network Subtree Merge algorithm, called SNSM, which uses the union of disjoint set forest algorithm for preventing unnecessary energy consumption in ancestor nodes for routing. SNSM algorithm has 3-phases: first finding the disjoint set of the subtree in the sensor field; second connecting each disjoint subtree with the closest node; and third virtually disconnect the subtree connected to new tree branch from previous tree structure. In the simulation, we apply SNSM algorithm to a minimum spanning tree structure. Simulation results show that SNSM algorithm reduces the energy consumption. Especially, SNSM is more efficient as number of sensor nodes in a sensor field increases.