An asynchronous leader election algorithm for dynamic networks

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Ingram, Rebecca ^a   Shields, Patrick ^b   Walter, Jennifer E ^b   Welch, Jennifer L ^c  

^a TRINITY UNIVERSITY   (United States)

^b VASSAR COLLEGE   (United States)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS NETWORKS; COMMUNICATION LINKS; COMMUNICATION TOPOLOGIES; CONNECTED COMPONENT; DYNAMIC NETWORK; LEADER ELECTION ALGORITHM; TEMPORALLY ORDERED ROUTING ALGORITHMS; WAVE ALGORITHMS;

AD HOC NETWORKS; DISTRIBUTED PARAMETER NETWORKS; MOBILE AD HOC NETWORKS; TELECOMMUNICATION LINKS; TOPOLOGY; WIRELESS TELECOMMUNICATION SYSTEMS;

ROUTING ALGORITHMS;

EID: 70450103690     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161028     Document Type: Conference Paper

References (23)

1. B. Awerbuch, A. Richa, and C. Scheideler. A jamming-resistant MAC protocol for single-hop wireless networks. In Proc. 27th ACMSymp. on Principles of Distributed Computing, pp. 45-54, 2008.
2. 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.
3. O. Dagdeviren and K. Erciyes. A hierarchical leader election protocol for mobile ad hoc networks. In Proc. 8thInt'l Conf. on Computational Science, LNCS5101, pp. 509-518, 2008.
4. A. Derhab and N. Badache. A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Trans. on Parallel and Distributed Systems, 19(7):926-939, 2008.
5. C. Fetzer and F. Cristian. A highly available local leader election service. IEEE Trans. on Software Engineering, 25(5):603-618, 1999.
6. E. Gafni and D. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Trans. on Communications, C-29(1):11-18, 1981.
7. Z. Haas. A new routing protocol for the reconfigurable wireless networks. In Proc. 6th IEEE Int'l Conf. on Universal Personal Comm., pp. 562-566, 1997.
8. S. Han and Y. Xia. Optimal leader election scheme for peer-to-peer applications. In Proc. 6th Int'l. Conf. on Networking, page 29, 2007.
9. K. Hatzis, G. Pentaris, P. Spirakis, V. Tampakis, and R. Tan. Fundamental control algorithms in mobile networks. In Proc. 11th ACM Symp. on Parallel Algorithms and Architectures, pp. 251-260, 1999.
10. R. Ingram, P. Shields, J. Walter, and J. Welch. An Asynchronous Leader Election Algorithm for Dynamic Networks. Technical Report 2009-1-1, Department of Computer Science and Engineering, Texas A&M University, 2009.
11. N. Lynch and M. Tuttle. An introduction to input/output automata. CWI-Quarterly, 2(3):219-246, 1988.
12. N. Malpani, J. Welch, and N. Vaidya. Leader election algorithms for mobile ad hoc networks. In Proc. ACM DIAL-M Workshop, pp. 96-104, 2000.
13. B. Mans and N. Santoro. Optimal Elections in Faulty Loop Networks and Applications. IEEE Trans. on Computers, 47(3):286-297, 1998.
14. S. Masum, A. Ali, and M. Bhuiyan. Asynchronous leader election in mobile ad hoc networkd. In Proc. Int'l Conf. on Advanced Information Networking and Applications, pp. 29-34, 2006.
15. Y. Pan and G. Singh. A fault-tolerant protocol for election in chordal-ring networks with fail-stop processor failures. IEEE Trans. on Reliability, 46(1): 11-17, 1997.
16. V. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proc. INFOCOM '97, pp. 1405-1413,1997.
17. P. Parvathipuram, V. Kumar, and G.-C. Yang. An efficient leader election algorithm for mobile ad hoc networks. In Proc. 1st Int'l Conf. on Dist. Computing and Internet Technology, LNCS 3347, pp. 32-41, 2004.
18. M. Rahman, M. Abdullah-Al-Wadud, and O. Chae. Performance analysis of leader election algorithms in mobile ad hoc networks. Int'l J. of Computer Science and Network Security, 8(2):257-263, 2008.
19. G. Singh. Leader Election in the Presence of Link Failures. IEEE Trans. on Parallel and Distributed Systems, 7(3):231-236, 1996.
20. S. Stoller. Leader election in distributed systems with crash failures. Technical Report, Department of Computer Science, Indiana University, 1997.
21. G. Tel. Introduction to Distributed Algorithms, Second Edition. Cambridge University Press, 2000.
22. S. Vasudevan, J. Kurose, and D. Towsley. Design and analysis of a leader election algorithm for mobile ad hoc networks. In Proc.IEEE Int'l Conf. on Network Protocols, pp. 350-360, 2004.
23. Y. Wang and H. Wu. Replication-based efficient data delivery scheme for delay/fault- tolerant mobile sensor network (dft-msn). In Proc. Pervasive Computing and Communications Workshop, p. 5, 2006.