Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Approximate Coverage in Wireless Sensor Networks
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
The coverage problem in a wireless sensor network
Mobile Networks and Applications
A survey on wireless multimedia sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved approximation algorithms for connected sensor cover
Wireless Networks
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
IEEE Transactions on Mobile Computing
Maximising α-lifetime for wireless sensor networks
International Journal of Sensor Networks
Energy-aware node placement, topology control and MAC scheduling for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Variable radii connected sensor cover in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
A dynamic multiobjective hybrid approach for designing wireless sensor networks
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
An Introduction to Evolutionary Computation in Finance
IEEE Computational Intelligence Magazine
Energy Minimization for Real-Time Data Gathering in Wireless Sensor Networks
IEEE Transactions on Wireless Communications
Cross-Layer Energy and Delay Optimization in Small-Scale Sensor Networks
IEEE Transactions on Wireless Communications
Improving the coverage of randomized scheduling in wireless sensor networks
IEEE Transactions on Wireless Communications - Part 1
Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms
IEEE Transactions on Evolutionary Computation
A New Crossover Operator in Genetic Programming for Object Classification
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Energy-efficient deployment of Intelligent Mobile sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A genetic algorithm for constructing a reliable MCDS in probabilistic wireless networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Relay node positioning in wireless sensor networks by means of evolutionary techniques
AIS'12 Proceedings of the Third international conference on Autonomous and Intelligent Systems
A cognitive WSN framework for highway safety based on weighted cognitive maps and Q-learning
Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
Maximizing the lifetime of a sensor network by scheduling operations of sensors is an effective way to construct energy efficient wireless sensor networks. After the random deployment of sensors in the target area, the problem of finding the largest number of disjoint sets of sensors, with every set being able to completely cover the target area, is nondeterministic polynomial-complete. This paper proposes a hybrid approach of combining a genetic algorithm with schedule transition operations, termed STHGA, to address this problem. Different from other methods in the literature, STHGA adopts a forward encoding scheme for chromosomes in the population and uses some effective genetic and sensor schedule transition operations. The novelty of the forward encoding scheme is that the maximum gene value of each chromosome is increased consistently with the solution quality, which relates to the number of disjoint complete cover sets. By exerting the restriction on chromosomes, the forward encoding scheme reflects the structural features of feasible schedules of sensors and provides guidance for further advancement. Complying with the encoding requirements, genetic operations and schedule transition operations in STHGA cooperate to change the incomplete cover set into a complete one, while the other sets still maintain complete coverage through the schedule of redundant sensors in the sets. Applications for sensing a number of target points, termed point-coverage, and for the whole area, termed area-coverage, have been used for evaluating the effectiveness of STHGA. Besides the number of sensors and sensors' sensing ranges, the influence of sensors' redundancy on the performance of STHGA has also been analyzed. Results show that the proposed algorithm is promising and outperforms the other existing approaches by both optimization speed and solution quality.