This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks
July 2008 (vol. 19 no. 7)
pp. 926-939
The classical definition of a self-stabilizing algorithm assumes generally that there are no faults in the system long enough for the algorithm to stabilize. Such an assumption cannot be applied to ad hoc mobile networks characterized by their highly dynamic topology. In this paper, we propose a self-stabilizing leader election algorithm that can tolerate multiple concurrent topological changes. By introducing the time interval-based computations concept, the algorithm ensures that a network partition can within a finite time converge to a legitimate state even if topological changes occur during the convergence time. Our simulation results show that our algorithm can ensure that each node has a leader over 99$\%$ of the time. We also give an upper-bound on the frequency at which network components merge to guarantee the convergence.

[1] J.F. Allen, “Maintaining Knowledge about Temporal Intervals,” Comm. ACM, vol. 26, no. 11, pp. 832-843, 1983.
[2] J.F. Allen and G. Ferguson, “Actions and Events in Interval Temporal Logic,“ Technical Report TR521, Univ. of Rochester, 1994.
[3] A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh, “Maxmin D-Cluster Formation in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM '00, pp. 32-41, 2000.
[4] N. Asokan and P. Ginzboorg, “Key Agreement in Ad Hoc Networks,” Computer Comm., vol. 23, no. 17, pp. 1627-1637, 2000.
[5] D.J. Baker and A. Ephremides, “The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm,” IEEE Trans. Comm., vol. 29, no. 11, pp. 1694-1701, 1981.
[6] E.W. Dijkstra and C.S. Scholten, “Termination Detection for Diffusing Computations,” Information Processing Letters, vol. 11, no. 1, pp. 1-4, Aug. 1980.
[7] M. Gerla and J.T.-C. Tsai, “Multicluster, Mobile, Multimedia Radio Network,” ACM/Baltzer Wireless Networks, vol. 1, no. 3, pp.255-265, 1995.
[8] T.-C. Hou and T.-J. Tsai, “An Access-Based Clustering Protocol forMultihop Wireless Ad Hoc Networks,” IEEE J. Selected Areas inComm., vol. 19, no. 7, July 2001.
[9] E. Kaplan, Understanding GPS. Artech House, 1996.
[10] B. Lehane, L. Dolye, and D. O'Mahony, “Ad Hoc Key Management Infrastructure,” Proc. Int'l Conf. Information Technology: Coding and Computing (ITCC '05), vol. 2, pp. 540-545, 2005.
[11] N. Lynch, Distributed Algorithms. Morgan Kaufmann, 1996.
[12] N. Malpani, J.L. Welch, and N. Vaidya, “Leader Election Algorithms for Mobile Ad Hoc Networks,” Proc. Fourth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 96-103, 2000.
[13] A.B. McDonald and T.F. Znati, “A Mobility-Based Framework for Adaptive Clustering in Wireless Ad Hoc Networks,” IEEE J.Selected Areas in Comm., vol. 17, no. 8, pp. 1466-1487, Aug. 1999.
[14] D. Mills, Network Time Protocol, Specification, Implementation and Analysis, Internet draft 1119, RFC, Sept. 1989.
[15] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM '97, pp. 1405-1413, Apr. 1997.
[16] V. Ramasubramanian, R. Chandra, and D. Mosse, “Providing a Bidirectional Abstraction for Unidirectional Ad Hoc Networks,” Proc. IEEE INFOCOM, 2002.
[17] C.L. Richard and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 15, no. 7, pp. 1265-1275, Sept. 1997.
[18] G.-C. Roman, Q. Huang, and A. Hazemi, “Consistent Group Membership in Ad Hoc Networks,” Proc. 23rd Int'l Conf. Software Eng. (ICSE '01), pp. 381-388, 2001.
[19] K. Römer, “Time Synchronization in Ad Hoc Networks,” Proc.ACM MobiHoc '01, pp. 173-182, 2001.
[20] J. So and N. Vaidya, “MTSF: A Timing Synchronization Protocol to Support Synchronous Operations in Multihop Wireless Networks,” technical report, Univ. of Illinois, Urbana-Champaign, Oct. 2004.
[21] S. Vasudevan, J. Kurose, and D. Towsley, “Design and Analysis ofa Leader Election Algorithm for Mobile Ad Hoc Networks,” Proc. 12th IEEE Int'l Conf. Network Protocols (ICNP '04), pp. 350-360, Oct. 2004.
[22] X. Zeng, R. Bagrodia, and M. Gerla, “GloMoSim: A Library forParallel Simulation of Large-Scale Wireless Networks,” Proc. 12th Workshop Parallel and Distributed Simulation (PADS '98), pp.154-161, 1998.

Index Terms:
Network topology, Network Protocols, Algorithm/protocol design and analysis, Mobile communication systems, Mobile environments, Fault tolerance
Citation:
Abdelouahid Derhab, Nadjib Badache, "A Self-Stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Mobile Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 7, pp. 926-939, July 2008, doi:10.1109/TPDS.2007.70792
Usage of this product signifies your acceptance of the Terms of Use.