HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/3285
Title: Low-overhead dominating set based algorithms for maximizing lifetime in wireless sensor networks
Authors: Ni, Lionel M.
Ma, Jian
Keywords: Wireless sensor networks
Synchronisation
Telecommunication network reliability
Network lifetime
Topology control
Issue Date: 2007
Citation: Proceedings IEEE International Conference on Mobile Adhoc and Sensor Systems, 2007. MASS 2007. Pisa, 8-11 October 2007
Abstract: In wireless sensor networks, connected dominating set (CDS) has become a key technique to identify redundant nodes and extend network lifetime. Most CDS-based algorithms focus on building the minimal CDS to find as many redundant nodes as possible. However, role rotation is not considered so that the dominating nodes will run out of energy much faster than the non-dominating nodes. Existing CDS-based algorithms for maximizing network lifetime rely on the up-to-date remaining energy level (REL) information within h-hop neighborhood to rotate node roles iteratively. Furthermore, global time synchronization is required to synchronize every round. The overhead on REL updating and time synchronization can lead to energy waste and packet collision. In this paper, we first propose a randomized rotation algorithm, which can totally avoid REL updating. Then, dominating node history is added as an enhancement to further extend network lifetime. Finally, we propose a broadcast-based synchronization mechanism to reduce the synchronization overhead and assist dominating node selection. Extensive simulations show that our proposed algorithm can significantly reduce overhead without sacrificing network lifetime.
Rights: © 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
URI: http://hdl.handle.net/1783.1/3285
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
044286061.pdf339KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.