Load-balanced CDS construction in wireless sensor networks via genetic algorithm

Authors:
Jing He;Shouling Ji;Mingyuan Yan;Yi Pan;Yingshu Li
Affiliations:
Department of Computer Science, Georgia State University, Atlanta, Georgia 30303, USA.;Department of Computer Science, Georgia State University, Atlanta, Georgia 30303, USA.;Department of Computer Science, Georgia State University, Atlanta, Georgia 30303, USA.;Department of Computer Science, Georgia State University, Atlanta, Georgia 30303, USA.;Department of Computer Science, Georgia State University, Atlanta, Georgia 30303, USA
Venue:
International Journal of Sensor Networks
Year:
2012

Citing 24
Cited 2

On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic Programming IV: Routine Human-Competitive Machine Intelligence

Genetic Programming IV: Routine Human-Competitive Machine Intelligence
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
On greedy construction of connected dominating sets in wireless networks: Research Articles

Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles

Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Middleware: Middleware Challenges and Approaches for Wireless Sensor Networks

IEEE Distributed Systems Online
Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks

ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A genetic algorithm based approach for energy efficient routing in two-tiered sensor networks

Ad Hoc Networks
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks

IEEE Transactions on Mobile Computing
Minimum-latency aggregation scheduling in multihop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
On the Connected k-Coverage Problem in Heterogeneous Sensor Nets: The Curse of Randomness and Heterogeneity

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks

ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Hybrid genetic algorithm using a forward encoding scheme for lifetime maximization of wireless sensor networks

IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms

Studying the stochastic capturing of moving intruders by mobile sensors

Computers & Mathematics with Applications
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Connected Dominating Set (CDS) is used as a virtual backbone for Wireless Sensor Networks (WSNs). Most existing works focus on a Minimum CDS (MCDS), a k-connect m-dominating CDS, a minimum routing cost CDS or a bounded-diameter CDS, ignoring the load-balance factor of CDSs. In this paper, we propose a novel problem the Load-Balanced CDS (LBCDS) problem, in which constructing an LBCDS and load-balancedly allocating dominatees to dominators are investigated simultaneously. A Genetic Algorithm based strategy called LBCDS-GA is proposed to construct an LBCDS. Building an LBCDS and load-balancedly allocating dominatees to dominators can prolong network lifetime through balancing the workloads of all the dominators. Through extensive simulations, we demonstrate that our proposed methods extend network lifetime by 65% on average compared with the best and latest MCDS construction algorithm.