By Topic

Energy-efficient connected d-hop dominating sets in wireless sensor 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. ; Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX ; Huynh, D.T.

In most applications involving wireless sensor networks (WSN), each sensor equipped with a battery collects data in the surrounding area, and forwards it for processing. Since the battery is irreplaceable, many researchers have investigated the issue of extending the network lifetime by reducing the total energy consumption by the network. A possible solution is to construct a backbone of a reasonable size for the network that consumes as little energy as possible. A common approach to construct a backbone for a WSN is to build a set of nodes such that every other node is close to a node in this set. Such a set is known as a dominating set in graph theory. In this paper, we study the problem of assigning minimum total power to a set of nodes in the plane yielding a graph containing a connected d-hop dominating set of bounded size. We prove that this problem is NP-complete. We also introduce several heuristics for this problem and discuss their performance through simulations.

Published in:

Pervasive Computing and Communications, 2009. PerCom 2009. IEEE International Conference on

Date of Conference:

9-13 March 2009