Abstract
The leader election problem is one of the fundamental problems in distributed computing. Different from most of the existing results studying the multi-leader election in static networks or one leader election in dynamic networks, in this paper, we focus on the multi-leader election in dynamic sensor networks where nodes are deployed randomly. A centralized simple leader election algorithm (VLE), a distributed leader election algorithm (NMDLE), and a multi-leader election algorithm (PSMLE) are proposed so as to elect multi-leaders for the purpose of saving energy and prolonging the network lifetime, respectively. Specifically, the proposed algorithms aim at using less leaders to control the whole network, which is controlled by at least kopt leaders, here kopt denotes the optimal number of network partitions. Then we analyze the impacts of the sleep scheme of nodes and node moving on energy consumption and establish a theoretical model for energy cost. Finally, we provide extensive simulation results valuating the correctness of theoretical analysis.
Highlights
A sensor network (SN) is a wireless network that consists of small, low-cost sensors, which can sense the environment information, collect and disseminate message
An improved result of [10] was shown in [11], in which the regional consecutive leader election (RCLE) requires that mobile nodes must elect a leader in bounded time, and an algorithm with the time complexity of (Dn) was proposed, where D is the diameter of the network and n is the number of nodes
7 Conclusions In this paper, we propose a new approach to partition the network based on Voronoi, and run the leader election algorithm in each cell
Summary
A sensor network (SN) is a wireless network that consists of small, low-cost sensors, which can sense the environment information, collect and disseminate message. An improved result of [10] was shown in [11], in which the RCLE requires that mobile nodes must elect a leader in bounded time, and an algorithm with the time complexity of (Dn) was proposed, where D is the diameter of the network and n is the number of nodes.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
