On shortest path routing schemes for wireless ad hoc networks

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

Volumn 2913, Issue , 2003, Pages 130-141

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

^a SAN JOSE STATE UNIVERSITY   (United States)

^b DRAKE UNIVERSITY   (United States)

^c MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

AD HOC WIRELESS NETWORKS; CONSTANT TIME COMPLEXITY; SHORTEST PATH; SHORTEST PATH ROUTING;

AD HOC NETWORKS;

EID: 35248838808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24596-4_15     Document Type: Article

References (7)

1. N. Alon and J. Spencer. The Probabilistic Method, John Wiely & Sons, 2000.
2. D. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences, 9:256-278, 1974.
3. 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.
4. L. Lovász. On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics, 13:383-390, 1975.
5. 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.
6. 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 Intl Conference on High Performance Computing in Asia Pacific, Vol 2, pp 443-450, 2003.
7. J. Wu and H. 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.