An effective genetic algorithm for improving wireless sensor network lifetime

Authors:
Chih-Chung Lai;Chuan-Kang Ting;Ren-Song Ko
Affiliations:
National Chung Cheng University, Chia-Yi, Taiwan Roc;National Chung Cheng University, Chia-Yi, Taiwan Roc;National Chung Cheng University, Chia-Yi, Taiwan Roc
Venue:
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Year:
2007

Citing 1
Cited 2

Improving wireless sensor network lifetime through power aware organization

Wireless Networks

A genetic algorithm based approach for energy efficient routing in two-tiered sensor networks

Ad Hoc Networks
Solving Target Coverage Problem Using Cover Sets in Wireless Sensor Networks Based on Learning Automata

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important scheme for extending sensor network lifetime is to divide sensor nodes into disjoint groups such that each group covers all targets and works alternatively. This scheme can be transformated to the Disjoint Set Covers (DSC) problem, which is proved to be NP-complete. Existing heuristic algorithms either get barely satisfactory solutions or take exponential time complexity. In this paper, we present a genetic algorithm to solve the DSC problem. Simulation results show that the proposed genetic algorithm can improve the most constrained-minimum constraining heuristic algorithm (MCMCC) in solution quality by $99\%$ with only polynomial computation time complexity.