A leader election algorithm within candidates on ad hoc mobile networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4523 LNCS, Issue , 2007, Pages 728-738

  Lee, SungSoo ^a   Muhammad, Rahman M ^a   Kim, ChongGun ^a  

^a Yeungnam University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MESSAGE PASSING; TOPOLOGY;

ELECTION ALGORITHMS; LEADER ELECTIONS;

AD HOC NETWORKS;

EID: 38749117596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72685-2_67     Document Type: Conference Paper

References (15)

1. Vasudevan, S., Kurose, J, Towsley, D. Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks. Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP) (2004) 350-360
2. Y. Afek and A. Bremler. Self-stabilizing unidirectional network algorithms by power supply. Chicago Journal of Theoretical Computer Science, December 1998.
3. Bayazit, J. Lien, and N. Amato. Better group behaviors in complex environments using global roadmaps. 8th International Conference on the Simulation and Synthesis of living systems (Alife '02), Sydney, NSW, Australia, pp. 362-370, December 2002.
4. DeCleene et al. Secure group communication for Wireless Networks. In proceedings of MILCOM 2001, VA, October 2001
5. Perkins and E. Royer. Ad-hoc On-Demand Distance Vector Routing. In proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999,pp. 90-100
6. W. Heinzelman, A. Chandrakasan and H. Balakrishnan. Energy-Efficient Communication Protocol for Wireless Micro sensor networks. In proceedings of Hawaiian International Conference on Systems Science, January 2000.
7. N. Malpani, J. Welch and N. Vaidya. Leader election Algorithms for Mobile Ad Hoc Networks. In fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Boston, MA, August 2000.
8. N. Lynch. Distributed Algorithms. 1996, Morgan Kaufmann Publishers, Inc.
9. R. Gallager, P. Humblet and P. Humblet and P. Spira. A Distributed Algorithm for Minimum Weight Spanning Trees. In ACM Transactions on Programming Languages and Systems, vol.4, no.1, pages 66-77, January 1983.
10. Peleg. Time Optimal Leader Election in General Networks. In journal of Parallel and Distributed Computing, vol.8, no.1, pages 96-99, January 1990.
11. Coore, R. Nagpal and R. Weiss. Paradigms for Structure in an Amorphous Computer. Technical report 1614, Massachussetts Institute of Technology Artificial Intelligence Laboratory, October 1997.
12. Y. Afek, S. Kutten and M.Yung. Local Detection for Global Self Stabilization. In Theoretical Computer Science, Vol 186, No. 1-2, 339 pp. 199-230, October 1997.
13. S. Dolev, A. Israeli and S. Moran. Uniform dynamic self-stabilizing leader election part 1: Complete graph protocols. Preliminary version appeared in proceedings of 6th International Workshop on Distributed Algorithms (S. Toueg et.al., eds.), LNCS 579, 167-180, 1992),1993.
14. C Lin and M. Gerla. Adaptive Clustering for Mobile Wireless Networks. In IEEE journal on selected areas in communications, 15(7): 1265-75, Sep 1997.
15. E.W. Dijkstra and C.S. Schölten. Termination detection for diffusing computations. In Information Processing Letters, vol. 11, no. 1, pp. 1-4, August 1980.