Generating Quality Dominating Sets for Sensor Network

Authors:
K. Mohammed;L. Gewali;V. Muthukumar
Affiliations:
University of Nevada at Las Vegas;University of Nevada at Las Vegas;University of Nevada at Las Vegas
Venue:
ICCIMA '05 Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications
Year:
2005

Citing 0
Cited 5

Trade-off scheme for fault tolerant connected dominating sets on size and diameter

Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Heuristic algorithms for constructing connected dominating sets with minimum size and bounded diameter in wireless networks

WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Review: A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks

Journal of Network and Computer Applications
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

Quantified Score

Hi-index	0.02

Visualization

Abstract

We consider the problem of generating dominating sets for applications in information communication and sensor network. Known algorithms for solving this problem consider number of nodes in the dominating set as the sole criteria. We report algorithms for generating dominating sets by considering diameter and interference as the additional factors. Experimental investigation shows that the proposed algorithms can generate diameter reduced and interference aware dominating sets without increasing the size of the solution.