Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks

Authors:
Ling Ding;Weili Wu;James Willson;Hongjie Du;Wonjun Lee;Ding-Zhu Du
Affiliations:
The University of Texas at Dallas, Richardson;The University of Texas at Dallas, Richardson;The University of Texas at Dallas, Richardson;The University of Texas at Dallas, Richardson;Korea University, Seoul;The University of Texas at Dallas, Richardson
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2011

Citing 0
Cited 4

Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks

Theoretical Computer Science
Review: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

Computer Communications
Connected dominating set algorithms for wireless sensor networks

International Journal of Sensor Networks
An energy-efficient topology construction algorithm for wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this paper, a special CDS, named \alpha Minimum rOuting Cost CDS (\alpha-MOC-CDS), will be studied to improve the performance of CDS based broadcasting and routing. In this paper, we prove that construction of a minimum \alpha-MOC-CDS is NP-hard in a general graph and we propose a heuristic algorithm for construction of \alpha-MOC-CDS.