Hyun Chul Chung
ABSTRACT
In 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 currently elected leader, can fail by crashing, and might enter or exit the region of interest at any time. We require the existence of certain paths that ensures a bound on the time for propagation of information within the region. We present and prove correct an algorithm that solves RCLE for a fixed region in 2 or 3-dimensional space. Our algorithm does not rely on the knowledge of the total number of nodes in the system nor on a common startup time. In the second part of the paper, we introduce a condition on mobility that is sufficient to ensure the existence of the paths required by our RCLE algorithm.
- }}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
- }}J. Brunekreef, J. P. Katoen, R. Koymans, and S. Mauw. Design and analysis of dynamic leader election protocols in broadcast networks. Distributed Computing, 9(4):157--171, 1996. Google ScholarDigital Library
- }}K. Hatzis, G. Pentaris, P. Spirakis, V. Tampakis, and R. Tan. Fundamental control algorithms in mobile networks. In Proc. 11th ACM Symposium on Parallel Algorithms and Architectures, 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. 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 1--12, 2009. Google ScholarDigital Library
- }}B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proc. 6th Annual International Conference on Mobile Computing and Networking (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. 2nd IEEE Workshop on Mobile Computing Systems and Applications (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. 23rd International Symposium on Distributed Computing (DISC 2009), LNCS 5805, pages 48--62, 2009. Google ScholarDigital Library
- }}N. Malpani, J. L. Welch, and N. Vaidya. Leader election algorithms for mobile ad hoc networks. In Proc. 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 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
- Regional consecutive leader election in mobile ad-hoc networks
Recommendations
Optimal regional consecutive leader election in mobile ad-hoc networks
FOMC '11: Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile ComputingThe 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 ...
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