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.
|
1345
|
A.: The Temporal Logic of Reactive and Concurrent Systems
– Manna, Pnueli
- 1992
|
|
1105
|
Ad Hoc On-Demand Distance Vector Routing
– Perkins, Royer
- 1999
|
|
1027
|
Distributed Algorithms
– Lynch
- 1996
|
|
792
|
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks
– Karp, Kung
- 2000
|
|
588
|
Energy-efficient communication protocol for wireless microsensor networks
– Heinzelman, Chandrakasan, et al.
- 2000
|
|
574
|
Next century challenges: scalable coordination in sensor networks
– Estrin, Govindan, et al.
- 1999
|
|
449
|
Self-Stabilizing Systems in Spite of Distributed Control
– Dijkstra
- 1974
|
|
308
|
GloMoSim: A library for parallel simulation of large-scale wireless networks
– Zeng, Bagrodia, et al.
- 1998
|
|
268
|
Secure group communications using key graphs
– Wong, Gouda, et al.
- 1998
|
|
237
|
Adaptive clustering for mobile wireless networks
– Lin, Gerla
- 1997
|
|
229
|
A Distributed Algorithm for Minimum-Weight Spanning Tree
– Gallager, Humblet, et al.
- 1983
|
|
212
|
Termination detection for diffusing computations
– Dijkstra, Scholten
- 1980
|
|
208
|
DSR The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks, ch
– Johnson, Maltz, et al.
- 2001
|
|
203
|
Random waypoint considered harmful
– Yoon, Liu, et al.
- 2003
|
|
172
|
Adhoc on demand distance vector routing
– Perkins
- 1997
|
|
119
|
Distributed reset
– Arora, Gouda
- 1994
|
|
117
|
Max-Min D-cluster formation in wireless ad hoc networks
– Amis, Prakash, et al.
- 1999
|
|
70
|
Uniform dynamic selfstabilizing leader election part 1: Complete graph protocols. Preliminary version appeared
– Dolev, Israeli, et al.
|
|
48
|
Leader election algorithms for mobile ad hoc networks
– Malpani, Welch, et al.
- 2000
|
|
30
|
Paradigms for Structure in an Amorphous Computer
– Coore, Nagpal, et al.
- 1997
|
|
28
|
Fundamental control algorithms in mobile networks
– Hatzis, Pentaris, et al.
- 1999
|
|
24
|
T.D.Little, “A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks
– Basu
- 2001
|
|
20
|
S.: Stable leader election
– Aguilera, Delporte-Gallet, et al.
- 2001
|
|
12
|
On the Artifacts of Random Waypoint Simulations
– Chu, Nikolaidis
- 2002
|
|
11
|
Time-optimal leader election in general networks
– Peleg
- 1990
|
|
11
|
Leader election algorithms for wireless ad hoc networks
– Vasudevan, DeCleene, et al.
- 2003
|
|
7
|
Local Detection for GlobalSelf Stabilization
– Afek, Kutten, et al.
- 1997
|
|
6
|
Unifying stabilization and termination in messagepassing systems
– Arora, Nesterenko
- 2001
|
|
3
|
et al. Secure Group Communication for Wireless Networks
– DeCleene
- 2001
|
|
3
|
Design and Analysis of Leader Election Protocols in Broadcast Networks
– Brunekreef, Katoen, et al.
- 1996
|
|
2
|
A Clsutering Scheme for Hierarchichal Control in Multi-Hop Wireless networks
– Banerjee, Khuller
- 2001
|
|
1
|
Leader Election in presence of n-1 initial failures
– Taubenfeld
- 1989
|
|
