Various distributed shortest path routing strategies for wireless Ad Hoc networks

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

Volumn 2918, Issue , 2004, Pages 255-264

  Dhar, Subhankar ^a   Rieck, Michael Q ^b   Pai, Sukesh ^c   Kim, Eun Jik ^a  

^a SAN JOSE STATE UNIVERSITY   (United States)

^b DRAKE UNIVERSITY   (United States)

^c MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; TELECOMMUNICATION NETWORKS;

AD HOC WIRELESS NETWORKS; CONNECTED SETS; DISTRIBUTED GREEDY ALGORITHMS; PERFOMANCE; SHORTEST PATH; SHORTEST PATH ROUTING; VIRTUAL BACKBONE;

WIRELESS AD HOC NETWORKS;

EID: 35048847009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (11)

1. K.M. Alzoubi, P. Wan, O. Frieder. New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks. Proceedings of 35th Hawaii International Conference on System Sciences, Hawaii 2002.
2. Bevan Das and Vaduvur Bharghavan. Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets. IEEE International Conference on Communications (ICC '97), (1) 1997: 376-380.
3. Subhankar Dhar, Michael Q. Rieck and Sukesh Pai. On Shortest Path Routing Schemes for Wireless Ad-Hoc Networks. 10th International Conference on High Performance Computing (HiPC'03), December 2003.
4. S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, Vol 20, 1998.
5. D. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences, 9:256-278, 1974.
6. L. Jia, R Rajaraman, T. Suel. An Efficient Distributed Algorithm for Constructing Small Dominating Sets. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp 33-42, August 2001.
7. L. Lovasz. On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics, 13:383-390, 1975.
8. B. Liang and Z. J. Haas. Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management. Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. INFOCOM, vol. 3, pp. 1293-1302, 2000.
9. Salvatore Rampone. Probability-driven Greedy Algorithms for Set Cover. VIII SIGEF Congress "New Logics for the New Economy", Naples, September 2001.
10. M. Q. Rieck, S. Pai, S. Dhar. Distributed Routing Algorithms for Wireless Ad Hoc Networks Using d-hop Connected d-hop Dominating Sets. Proceedings of the 6th International Conference on High Performance Computing: Asia Pacific, (HPC Asia 2002), December 2002.
11. Jie Wu and Hailian Li. A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks. Special issue on Wireless Networks in the Telecommunication Systems Journal, Vol. 3, 2001, 63-84.