Hyun Chul Chung
ABSTRACT
The regional consecutive leader election (RCLE) problem requires mobile nodes to elect a leader within bounded time upon entering a specific region. We prove that any algorithm requires Ω(Dn) rounds for leader election, where D is the diameter of the network and n is the total number of nodes. We then present a fault-tolerant distributed algorithm that solves the RCLE problem and works even in settings where nodes do not have access to synchronized clocks. Since nodes set their leader variable within O(Dn) rounds, our algorithm is asymptotically optimal with respect to time complexity. Due to its low message bit complexity, we believe that our algorithm is of practical interest for mobile wireless ad-hoc networks. Finally, we present a novel and intuitive constraint on mobility that guarantees a bounded communication diameter among nodes within the region of interest.
- A. Boukerche and K. Abrougui. An efficient leader election protocol for mobile networks. In Proc. 2006 International Conference on Wireless Communications and Mobile Computing, pages 1129--1134, 2006. Google Scholar
Digital Library
- H. C. Chung, P. Robinson, and J. L. Welch. Regional consecutive leader election in mobile ad-hoc networks. In Proc. of DIALM-POMC'10, pages 81--90, 2010. Google ScholarDigital Library
- H. C. Chung, P. Robinson, and J. L. Welch. Optimal regional consecutive leader election in mobile ad-hoc networks. Technical Report 2011-5-1, Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77843, USA, 2011.Google ScholarDigital Library
- A. K. Datta, L. L. Larmore, and H. Piniganti. Self-stabilizing leader election in dynamic networks. In Proc. of SSS'10, LNCS 6366, pages 35--49, 2010. Google ScholarDigital Library
- K. Hatzis, G. Pentaris, P. Spirakis, V. Tampakis, and R. Tan. Fundamental control algorithms in mobile networks. In Proc. of SPAA'99, pages 251--260, 1999. Google ScholarDigital Library
- R. Ingram, P. Shields, J. Walter, and J. L. Welch. An asynchronous leader election algorithm for dynamic networks. In Proc. of IPDPS'09, pages 1--12, 2009. Google ScholarDigital Library
- B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proc. of MobiCom'00, pages 243--254, 2000. Google ScholarDigital Library
- Y. B. Ko and N. Vaidya. Geocasting in mobile ad-hoc networks: location-based multicast algorithms. In Proc. of WMCSA'99, pages 101--110, 1999. Google ScholarDigital Library
- Y.-B. Ko and N. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. Wireless Networks, 6(4):307--321, 2000. Google ScholarDigital Library
- F. Kuhn, N. Lynch, and C. Newport. The abstract MAC layer. In Proc. of DISC'09, LNCS 5805, pages 48--62, 2009. Google ScholarDigital Library
- F. Kuhn and R. Oshman. Dynamic networks: Models and algorithms. SIGACT News, 42(1):82--96, 2011. Google ScholarDigital Library
- N. Malpani, J. L. Welch, and N. Vaidya. Leader election algorithms for mobile ad hoc networks. In Proc. of DIALM'00, pages 96--104, 2000. Google ScholarDigital Library
- S. Masum, A. Ali, and M. Bhuiyan. Fundamental control algorithms in mobile networks. In Proc. International Conference on Advanced Information Networking and Applications, pages 29--34, 2006.Google Scholar
- P. Parvathipuram, V. Kumar, and G.-C. Yang. An efficient leader election algorithm for mobile ad hoc networks. In Proc. 1st International Conference on Distributed Computing and Internet Technology, LNCS 3347, pages 32--41, 2004. Google ScholarDigital Library
- S. Vasudevan, J. Kurose, and D. Towsley. Design and analysis of a leader election algorithm for mobile ad hoc networks. In Proc. IEEE International Conference on Network Protocols, pages 350--360, 2004. Google ScholarDigital Library
Index Terms
- Optimal regional consecutive leader election in mobile ad-hoc networks
Recommendations
Regional consecutive leader election in mobile ad-hoc networks
DIALM-POMC '10: Proceedings of the 6th International Workshop on Foundations of Mobile ComputingIn this paper we introduce the regional consecutive leader election (RCLE) problem, which extends the classic leader election problem to the continuously-changing environment of mobile ad-hoc networks. We assume that mobile nodes, including the ...
Top K-leader election in mobile ad hoc networks
Many applications in mobile ad hoc networks (MANETs) require multiple nodes to act as leaders. Given the resource constraints of mobile nodes, it is desirable to elect resource-rich nodes with higher energy or computational capabilities as leaders. In ...
Reputation based selfishness prevention techniques for mobile ad-hoc networks
Mobile ad-hoc networks require nodes to cooperate in the relaying of data from source to destination. However, due to their limited resources, selfish nodes may be unwilling to forward packets, which can deteriorate the multi-hop connectivity. Different ...
Comments