Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
An efficient leader election protocol for mobile networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
An asynchronous leader election algorithm for dynamic networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Regional consecutive leader election in mobile ad-hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Slf-stabiliezing leader election in dynamic networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Dynamic networks: models and algorithms
ACM SIGACT News
An efficient leader election algorithm for mobile ad hoc networks
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
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.