Jie Wu
- 1.M. S. Corson and A. Ephremides. A distributed routing algorithm for mobile wireless networks. A CM j. Wireless Networks, 1(1):61- 81, 1995. Google Scholar
Digital Library
- 2.B. Das and V. Bhaxgavan. Routing in ad-hoc networks using minimum connected dominating sets. iEEE International Conference on Communications (ICC '97), June 1997. Google ScholarDigital Library
- 3.B. Das, E. Sivakumar, and V. Bhaxgavan. Routing in ad-hoc networks using a virtual backbone. Proceedings of the 6th International Conference on Computer Communications and Networks(IC3N '97), pages 1 - 20, Sept. 1997. Google ScholarDigital Library
- 4.B. Das, R. Sivakumar, and V. Bhargavan. Routing in ad-hoc networks using a spine. IEEE International Conference on Computers and Communications Networks '97, 1997. Google ScholarDigital Library
- 5.E. Gafni and D. P. Bertsekas. Distributed algorithms for generating loop-free routes with frequently changing topology. IEEE ffYansactions on Communications, COM-29(1):11 - 18, 1981.Google Scholar
- 6.S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374- 387, April 1998. Google ScholarDigital Library
- 7.D. B. Johnson. Routing in ad hoc networks of mobile hosts. Proceedings of Workshop on Mobile Computing Systems and Applications, pages 158 - 163, December 1994.Google Scholar
- 8.D. B. Johnson and D. A. Malts. Dynamic source routing in ad-hoc wireless networks. In T. Imielinski, H. Korth, editor, Mobile Computing. Kluwer Academic Publishers, 1996.Google ScholarCross Ref
- 9.P. Krishna, M. Chatterjee, N. H. Vaidya, and D. K. Pradhan. A cluster-based approach for routing in adhoc networks. Proceedings of the Second USENIX Symposium on Mobile and Location-Independent Computing, pages I- 10, 1995. Google ScholarDigital Library
- 10.S. Murthy and J. J. Garcia-Luna-Aveces. A routing protocol for packet radio networks. Proceedings of A CM International Conference on Mobile Computing and Networking, pages 86- 95, November 1995. Google ScholarDigital Library
- 11.C. E. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance vector routing (DSDV) for mobile computers. Computer Communications Review (ACM SIGCOMM 199~), 24(4):234 - 244, 1994. Google ScholarDigital Library
- 12.R. Sivakumar, B. Das, and V. Bharghavan. An improved spine-based infrastructure for routing in ad hoc networks. Proceedings of the International Symposium on Computers and Communications (ISCC'98), 1998.Google Scholar
Index Terms
On calculating connected dominating set for efficient routing in ad hoc wireless networks
Recommendations
A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced ...
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
Efficient routing among a set of mobile hosts is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. ...
On-demand multicast routing protocol in multihop wireless mobile networks
An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge ...
Comments