Minimal connected dominating set algorithms and application for a MANET routing protocol

IEEE International Performance, Computing and Communications Conference, Proceedings

Volumn , Issue , 2003, Pages 157-164

  Lin, Tao ^a   Midkiff, Scott F ^a   Park, Jahng S ^a  

^a Virginia Polytechnic Institute and State University   (United States)

Author keywords

Broadcast; Connected dominating set

Indexed keywords

ALGORITHMS; BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); GRAPH THEORY; MOBILE TELECOMMUNICATION SYSTEMS; PACKET SWITCHING; PERFORMANCE; RESOURCE ALLOCATION; AD HOC NETWORKS; APPROXIMATION ALGORITHMS; ROUTERS; ROUTING PROTOCOLS; TELECOMMUNICATION NETWORKS; WIRELESS AD HOC NETWORKS;

BROADCAST; MINIMAL CONNECTED DOMINATING SET ALGORITHMS; MOBILE AD HOC NETWORKS ROUTING PROTOCOL; WIRELESS AD HOC NETWORKS;

NETWORK PROTOCOLS; MOBILE AD HOC NETWORKS;

ANALYTICAL RESULTS; BROADCAST MESSAGES; CONNECTED DOMINATING SET; CONNECTED DOMINATING SETS; DISCOVERY ALGORITHM; LINK STATE ROUTING PROTOCOL; MANET ROUTING PROTOCOLS; MINIMAL CONNECTED DOMINATING SETS;

EID: 84954410475     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. D. B. West, "Introduction to Graph Theory, 2nd ed., Prentice Hall, Upper Saddle River, NJ, 2001, pp. 116-118.
2. S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Proc. European Symp. on Algorithms, 1996, pp. 179-193.
3. B. Das and V. Bhargavan, "Routing in ad-hoc networks using minimum connected dominating sets," Proc. IEEE Int'l. Conf. on Communications, June 1997, pp. 376-380.
4. J. Wu and H. Li, "A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks," Telecommunication Systems Journal, Vol. 3, pp. 63-84, 2001.
5. I. Stojmenovic, M. Seddigh and J. Zunic, "Dominating Sets and Neighbor Elimination-based Broadcasting Algorithms in Wireless Networks," IEEE Trans. on Parallel and Distributed Systems, Vol. 13, No. 1, pp. 14-25, Jan. 2002.
6. J. J. Garcia-Luna-Aceves and M. Spohn, "Scalable Link-State Internet Routing," Proc. IEEE International Conf. on Network Protocols, Oct. 1998, pp. 52-61.
7. B. Bellur and R. G. Ogier, "A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks," Proc. IEEE INFOCOM, March 1999, pp. 178-186.
8. R. G. Ogier, F. L. Templin, B. Bellur, and M. G. Lewis, "Topology Broadcast Based on Reverse-Path Forwarding (TBRPF)," Internet Engineering Task Force, March 2002. Available at www.ietf.org/internet-drafts/draft-ietf-manet-tbrpf-05.txt.
9. J. Moy, "OSPF Version 2," Internet Engineering Task Force, April 1998. Available at www.ietf.org/rfc/rfc2328.txt.
10. R. Sedgewick, Algorithms in C++. Addison-Wesley Publishing, Reading, MA, 1992, pp. 427.