By Topic

Connected D-Hop Dominating Sets in Mobile Ad Hoc 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
$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

2 Author(s)
Nguyen, T.N. ; Department of Computer Science, University of Texas at Dallas, Richardson, Texas 75083-0688, E-mail: nguyentn@utdallas.edu ; Huynh, D.T.

A mobile ad hoc network may be logically represented as a set of clusters, and the clusterheads form what is known as a dominating set in graph theory. The clusterheads can be used to perform a variety of functions for nodes in their cluster such as channel access, routing, data collection, broadcasting, etc. There have been several heuristics proposed for forming 1-hop as well as d-hop clusters. In d-hop clustering, the value of d, a constant representing the number of wireless hops in ad hoc networks, is a parameter of the heuristic and controls the size of the clusters. The problem of finding a minimum d-hop connected dominating set was shown to be NP-complete in [9], where the authors raised the question of whether the problem is still NP-complete for the restricted model of unit disk graphs. In this paper, we provide an affirmative answer to this open question. In fact, we show that the minimum d-hop connected dominating set problem is NP-complete for planar unit disk graphs with maximum degree 4. We also review some known 1-hop heuristics that we generalize to the d-hop case and compare their performance. The experimental results show that the algorithm proposed in [9] is the most efficient one.

Published in:

Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006 4th International Symposium on

Date of Conference:

03-06 April 2006