Computers and Operations Research
Coding TSP tours as permutations via an insertion heuristic
Proceedings of the 1999 ACM symposium on Applied computing
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Intelligent fluid infrastructure for embedded networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
An integrated approach for density control and routing in wireless sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers and Operations Research
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In this paper, we propose optimization algorithms for the problem of multiple mobile sinks route planning in Wireless Sensor Networks (WSN). Our aim is to reduce the length of the sink routes, in order to reduce the message delivery delay. Our approach differs from others in the literature since clustering and route planning are dealt simultaneously. We compare the proposed algorithms and the best of them are used to perform WSNs simulations. By comparing our approaches to others in the literature, significant gains in terms of message delivery delay rates are attained.