Top k-leader election in wireless ad hoc networks

Proceedings - International Conference on Computer Communications and Networks, ICCCN

Volumn , Issue , 2008, Pages 87-92

  Raychoudhury, Vaskar ^a   Cao, Jiannong ^a   Wu, Weigang ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; INTELLIGENT AGENTS; PARALLEL ALGORITHMS; WIRELESS TELECOMMUNICATION SYSTEMS;

BATTERY POWERS; COMPUTATIONAL CAPABILITIES; DETERMINISTIC ALGORITHMS; DIFFUSING COMPUTATIONS; DIRECTORY SERVICES; DISTRIBUTED ALGORITHMS; DISTRIBUTED COORDINATIONS; LEADER ELECTIONS; NODE FAILURES; SIMULATION RESULTS; WEIGHT INFORMATIONS; WEIGHT VALUES; WIRELESS AD HOC NETWORKS;

AD HOC NETWORKS;

EID: 57849111390     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2008.ECP.35     Document Type: Conference Paper

References (13)

1. M. Aguilera, C. Gallet, H, Fauconnier, S. Toueg. Stable leader election, LNCS 2180, p. 108 ff.
2. J. Brunekreef, J, Katoen, R, Koymans and S, Mauw, Design and Analysis of Leader Election Protocols in Broadcast Networks, Distributed Computing, vol, 9 no. 4, pages 157-171,1996.
3. E.W. Dijkstra and C.S. Scholten. Termination Detection for Diffusing Computations, Information Processing Letters, vol. 11, no. 1, 1980.
4. R. Ferreira, M. Ramanafhan, A. Grama and S. Jagannathan, Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems, IEEE Trans. Parallel Distrib. Syst. 18(5): 686-696 (2007).
5. H. Garcia-Molian, Elections in a Distributed Computing System, IEEE Transactions on Computers, vol. C-31,no. 1,1982.
6. Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas and Richard B. Tan, Fundamental Control Algorithms in Mobile Networks, Proc. 11th Annual ACM Symposium on Parallel Algorithms and Architectures, 1999.
7. N. Malpani, J. L. Welch, and N. vaidya, Leader Election Algorithms for Mobile Ad Hoc Networks, Proc. of the 4th int'l workshop on Discrete algorithms and methods for mobile comp. and comm., Aug. 2000.
8. K. Nakano and S. Olariu, Randomized Leader election protocols for ad hoc networks, Proc. of SIROCCO, 2000.
9. Sung-Hoon Park, An Election Protocol in a Mobile Environment, Proc. of PDPTA2000, pp. 200-210, June 2000.
10. V. D. Park, and M. S. Corson. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks, Proc. IEEE INFOCOM, Apr 1997.
11. V. Sundramoorthy, and J. Scholten, Ir. and P.G.Jansen, Ir. and P.H. Hartel, Service discovery at home, Proc. of Joint Conf. of the 4th Int'l Conf. on Info., Comm. and Signal Processing, and the 4th Pacific Rim Conf. on Multimedia, 2003.
12. G. Taubenfeld. Leader Election in presence of n-1 initial failures, Information Processing Letters, vol.33, no. 1, pages 25-28, October 1989.
13. S. Vasudevan, J. Kurose and D. Towsley, Design and Analysis of a Leader Election Algorithms for Mobile Ad Hoc Networks, Proc. of ICNP04, pp. 350-360.