Home // INFOCOMP 2011, The First International Conference on Advanced Communications and Computation // View article

Connected Dominating Set Problem and its Application to Wireless Sensor Networks

Authors:
Razieh Asgarnezhad
Javad Akbari Torkestani

Keywords: wireless sensor network; maximal independent set; connected dominating set

Abstract:
In Wireless Sensor Networks, all nodes are energy constrained. There are no predefined and no fixed infrastructures in networks. A Connected Dominating Set can be created by different algorithms to organize nodes in a better way. A Connected Dominating Set can be shown as a backbone. A backbone is a subset of nodes that are able to perform especial tasks and serve nodes which are not in the backbone. A backbone reduces the communication overhead, increases the bandwidth efficiency, decreases the overall energy consumption, and, at last, increases network effective lifetime in a Wireless Sensor Network. For example, Connected Dominating Set nodes can perform efficient routing and broadcasting in networks. This paper tries to survey and classify different Connected Dominating Set formation algorithms. We compare their performances with each other.

Pages: 46 to 51

Copyright: Copyright (c) IARIA, 2011

Publication date: October 23, 2011

Published in: conference

ISSN: 2308-3484

ISBN: 978-1-61208-161-8

Location: Barcelona, Spain

Dates: from October 23, 2011 to October 29, 2011