By Topic

Reducing connected dominating set size with multipoint relays in ad hoc wireless networks

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
$33 $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

2 Author(s)
Xiao Chen ; Dept. of Math., Texas State Univ., San Marcos, TX, USA ; Jian Shen

Broadcasting is an important communication mechanism in ad hoc wireless networks. The simplest way to do broadcasting is pure flooding, in which each node retransmits a packet after receiving it, thus generates many redundant retransmissions. The rule based on dominating sets can reduce the number of retransmissions. A dominating set is a set of nodes such that any node in the network is a neighbor of some element in the set. However, computing a minimum size connected dominating set is NP hard. Several existing algorithms use the idea of multipoint relays to reduce the size of the connected dominating set. The authors of this paper observed that these algorithms can be further improved. Thus, three improvements are introduced here. It is proved that these improvements can compute a connected dominating set of the network, and simulation results show that they can further reduce the size of the dominating set. Also, extensions to power-aware broadcasting algorithms are discussed.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004