Leader election algorithms for wireless ad hoc networks

Proceedings - DARPA Information Survivability Conference and Exposition, DISCEX 2003

Volumn 1, Issue , 2003, Pages 261-272

  Vasudevan, S ^a   DeCleene, B ^b   Immerman, N ^a   Kurose, J ^a   Towsley, D ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b BAE SYSTEMS   (United Kingdom)

Author keywords

Ad hoc networks; Communication system security; Computer science; Cost accounting; Mobile ad hoc networks; Nominations and elections; Reactive power; Topology; Wireless application protocol; Wireless sensor networks

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; COMPUTER SCIENCE; COST ACCOUNTING; MOBILE AD HOC NETWORKS; NETWORK PROTOCOLS; NETWORK SECURITY; REACTIVE POWER; SENSOR NODES; SOCIAL SCIENCES; TELECOMMUNICATION NETWORKS; TOPOLOGY; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

COMMUNICATION SYSTEM SECURITY; ELECTION ALGORITHMS; EVALUATION FUNCTION; LEADER ELECTION ALGORITHM; NOMINATIONS AND ELECTIONS; SYNCHRONOUS DISTRIBUTED SYSTEMS; TOPOLOGICAL CHANGES; WIRELESS APPLICATION PROTOCOLS;

WIRELESS AD HOC NETWORKS;

EID: 79952569372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DISCEX.2003.1194890     Document Type: Conference Paper

References (28)

1. G. Tel. Introduction to Distributed Algorithms. Second Edition, 2000, Cambridge University Press.
2. N. Lynch. Distributed Algorithms. 1996, Morgan Kaufmann Publishers, Inc.
3. C. Wong, M. Gouda and S. Lam. Secure Group Communication using Key Graphs. In Proceedings of ACM SIGCOMM '98, September 1998.
4. B. DeCleene et al. Secure Group Communication for Wireless Networks. In Proceedings of MILCOM 2001, VA, October 2001.
5. H. Harney and E. Harder. Logical Key Hierarchy Protocol. Internet draft, draft-harney-sparta-lkhp-sec00.txt, March 1999.
6. 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.
7. K. Hatzis, G. Pentaris, P. Spirakis, V. Tampakas and R. Tan. Fundamental Control Algorithms in Mobile Networks. In Proceedings of 11th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 251-260, 1999.
8. E.W. Dijkstra and C.S. Scholten. Termination detection for diffusing computations. In Information Processing Letters, vol. 11, no. 1,pp. 1-4, August 1980.
9. D. Estrin, R. Govindan, J. Heidemann and S. Kumar. Next Century Challenges : Scalable Coordination in Sensor Networks. In Proceedings of ACM MobiComm,August 1999.
10. E. Royer and C. Perkins. Multicast Operations of the Ad Hoc On-Demand Distance Vector Routing Protocol. In Proceedings of Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), pages 207-218, August 15-20, 1999.
11. D. 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. P. Tsuchiya. The Landmark Hierarchy : A new hierarchy for routing in very large networks. In Proceedings of the ACM SIGCOMM, 1988.
13. W. Heinzelman,A. Chandrakasan and H. Balakrishnan. Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In Proceedings of Hawaiian International Conference on Systems Science, January 2000.
14. V. Park and M. Corson. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In Proceedings of IEEE INFOCOM, April 7-11, 1997.
15. A. Arora and M. Gouda. Distributed Reset. In IEEE Transactions on Computers, 43(9), 1026-1038,1994.
16. A. Arora and M. Nesterenko. Unifying Stabilization and Termination in Message-Passing Systems. In Proceedings of 21st International Conference on Distributed Computing Systems (ICDCS), Mesa, AZ, April 2001.
17. 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.
18. 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.
19. E. Gafni and D. Bertsekas. Distributed Algorithms for generating loop-free routes in networks with frequently changing topology. In IEEE Transactions on Communications, C-29(1):11-18, 1981.
20. E.W. Dijkstra. Self-stabilizing systems in spite of distributed control. In Communications of the ACM, 17:634-644,1974.
21. S. Vasudevan, B. DeCleene, J. Kurose and D. Towsley. Secure Leader Election for Wireless Ad Hoc Networks. UMass Computer Science Technical Report 01-50. http://wwwnet.cs.umass.edu/networks/publications.html
22. S. Vasudevan, N. Immerman, J. Kurose and D. Towsley. A Leader Election Algorithm for Ad Hoc Networks. UMass Computer Science Technical Report 03-01. http://wwwnet.cs.umass.edu/networks/publications.html
23. C. 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, pages 90-100.
24. R. Rivest. The MD5 Message Digest Algorithm. RFC 1320, April 1992.
25. J. Brunekreef, J. Katoen, R. Koymans and S. Mauw. Design and Analysis of Leader Election Protocols in Broadcast Networks. In Distributed Computing, vol. 9 no. 4, pages 157-171, 1996.
26. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems - Specification. InSpringer-Verlag, New York,1992.
27. R. Gotzhein. Temporal logic and its applications - a tutorial. In Computer Networks and ISDN systems, 24:203-218, 1992.
28. N. Francez. Fairness Springer-Verlag, 1986.