DocumentCode
3324527
Title
Energy Aware Distributed Clustering in Two-Tiered Sensor Networks
Author
Bari, Ataul ; Chaturvedi, Ritu ; Jaekel, Arunita ; Bandyopadhyay, Subir
Author_Institution
Sch. of Comput. Sci., Univ. of Windsor, Windsor, ON, Canada
fYear
2009
fDate
3-6 Aug. 2009
Firstpage
1
Lastpage
8
Abstract
Two-tiered sensor networks, where higher-powered relay nodes are used as cluster heads, have been proposed recently for designing sensor networks. Assigning sensor nodes to clusters, in an energy efficient way, is known to improve the lifetime of such networks. In this paper we have proposed an efficient distributed algorithm for assigning sensor nodes to clusters in two-tiered networks, using both single-hop and multi- hop routing schemes. Our distributed clustering strategy allocates sensor nodes to clusters, based on limited local information only. However, the solutions generated are shown to be comparable to optimal solutions obtained using an ILP formulation. We have also compared our approach to a number of existing heuristics recently proposed in the literature and have shown, through simulations, that our approach consistently outperforms current heuristics. In summary, the quality of the solutions obtained using our approach is comparable to those obtained using an ILP formulation, but the solutions can be generated very quickly, making it suitable for practical-sized networks with hundreds of sensor nodes.
Keywords
sensor fusion; telecommunication network routing; wireless sensor networks; distributed algorithm; energy aware distributed clustering; multihop routing; sensor node assignment; single hop routing; two tiered sensor networks; Base stations; Batteries; Centralized control; Computer science; Data communication; Distributed algorithms; Electronic mail; Relays; Routing; Spread spectrum communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks, 2009. ICCCN 2009. Proceedings of 18th Internatonal Conference on
Conference_Location
San Francisco, CA
ISSN
1095-2055
Print_ISBN
978-1-4244-4581-3
Electronic_ISBN
1095-2055
Type
conf
DOI
10.1109/ICCCN.2009.5235368
Filename
5235368
Link To Document