By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tao Lin ; Bradley Dept. of Electr. & Comput. Eng., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA ; Midkiff, S.F. ; Park, J.S.

Blind broadcast in a wireless ad hoc network means any mobile node will rebroadcast all received broadcast messages. One node may receive the same copy of a message from more than one neighbor, so unnecessary overhead is introduced. A connected dominating set (CDS) can be used to reduce broadcast overhead. We propose a proactive link state routing protocol, integrated with CDS discovery algorithms, as a promising approach for routing in wireless ad hoc networks. This paper presents approximation algorithms to find a minimal CDS for a given network. A prototype of a proactive link state routing protocol integrated with CDS algorithms is introduced. Both simulation and analytical results indicate better performance than other algorithms.

Published in:

Performance, Computing, and Communications Conference, 2003. Conference Proceedings of the 2003 IEEE International

Date of Conference:

9-11 April 2003