A tabu search heuristic for point coverage, sink location, and data routing in wireless sensor networks

Authors:
Evren Güney;İ. Kuban Altınel;Necati Aras;Cem Ersoy
Affiliations:
Boğaziçi University, İstanbul, Türkiye;Boğaziçi University, İstanbul, Türkiye;Boğaziçi University, İstanbul, Türkiye;Boğaziçi University, İstanbul, Türkiye
Venue:
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2010

Citing 11
Cited 1

Algorithm 97: Shortest path

Communications of the ACM
Tabu Search

Tabu Search
Wireless sensor networks for habitat monitoring

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Wireless Sensor Networks: Architectures and Protocols

Wireless Sensor Networks: Architectures and Protocols
Energy-aware routing in sensor networks: A large system approach

Ad Hoc Networks
Strategies and techniques for node placement in wireless sensor networks: A survey

Ad Hoc Networks
Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous 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
Efficient routing from multiple sources to multiple sinks in wireless sensor networks

EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks

ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking

Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The point coverage, sink location, and data routing problems are considered in an integrated way and two new mixed-integer programming formulations are proposed. As these models are difficult to solve, a nested solution procedure is proposed. The best sensor locations are sought by tabu search in the upper level. For the fixed sensor locations, the remaining problem of determining sink locations and data routes are solved efficiently in the lower level. According to the experimental results performed on a number of test instances, the performance of the nested solution approach is quite satisfactory, and the proposed heuristic method brings considerable improvements over a two-stage solution approach.