Group management for mobile Ad Hoc networks: design, implementation and experiment
Proceedings of the 6th international conference on Mobile data management
An efficient leader election protocol for mobile networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Mixed-Mode Adaptation in Distributed Systems: A Case Study
SEAMS '07 Proceedings of the 2007 International Workshop on Software Engineering for Adaptive and Self-Managing Systems
Journal of Parallel and Distributed Computing
A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Design of Knowledge Discovery Agent for a Bit-Map on Ad Hoc Mobile Networks
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Fault-tolerant aggregator election and data aggregation in wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Research of asynchronous leader election algorithm on hierarchy ad hoc network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A process calculus for Mobile Ad Hoc Networks
Science of Computer Programming
REDMAN: An optimistic replication middleware for read-only resources in dense MANETs
Pervasive and Mobile Computing
An agent using matrix for backward path search on MANET
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Cooperative leader election algorithm for master/slave mobile ad hoc networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Regional consecutive leader election in mobile ad-hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Leader election based on centrality and connectivity measurements in ad hoc networks
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
Leader election in anonymous radio networks: model checking energy consumption
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
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 Computing
A process calculus for dynamic networks
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Sequence automata for researching consensus levels
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Single-Actor selection algorithms for wireless sensor and actor networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Stochastic restricted broadcast process theory
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Broadcast abstraction in a stochastic calculus for mobile networks
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
Leader election is a very important problem, not only in wired networks, but in mobile, ad hoc networks as well. Existing solutions to leader election do not handle frequent topology changes and dynamic nature of mobile networks. In this paper, we present a leader election algorithm that is highly adaptive to arbitrary (possibly concurrent) topological changes and is therefore well-suited for use in mobile ad hoc networks. The algorithm is based on finding an extrema and uses diffusing computations for this purpose. We show, using linear-time temporal logic, that the algorithm is "weakly" self-stabilizing and terminating. We also simulate the algorithm in a mobile ad hoc setting. Through our simulation study, we elaborate on several important issues that can significantly impact performance of such a protocol for mobile ad hoc networks such as choice of signaling, broadcast nature of wireless medium etc. Our simulation study shows that our algorithm is quite effective in that each node has a leader approximately 97-99% of the time in a variety of operating conditions.