Computers and Operations Research
Coding TSP tours as permutations via an insertion heuristic
Proceedings of the 1999 ACM symposium on Applied computing
Experiments on traveling salesman heuristics
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
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
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Transmission power control in MAC protocols for wireless sensor networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing
Fault-resilient sensing in wireless sensor networks
Computer Communications
Fast and energy efficient sensor data collection by multiple mobile sinks
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
Efficient data propagation strategies in wireless sensor networks using a single mobile sink
Computer Communications
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A Data Gathering Algorithm for a Mobile Sink in Large-Scale Sensor Networks
ICWMC '08 Proceedings of the 2008 The Fourth International Conference on Wireless and Mobile Communications
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Energy Constrained Dominating Set for Clustering in Wireless Sensor Networks
AINA '10 Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers and Operations Research
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
ELACCA: Efficient Learning Automata Based Cell Clustering Algorithm for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
One common approach to extend Wireless Sensors Networks (WSN) lifetime is to use mobile sinks to gather sensed information through the network, avoiding that sensor nodes spend their limited energy in relaying other nodes' messages to the sinks. Such approach, however, tends to significantly increase message delivery latency. On the other hand, it is widely recognized that the optimization of any Quality of Service parameter in WSN, message delivery latency included, must always be conducted bearing in mind the implied impact in the network lifetime. In this paper, we introduce a network model to seek for a good solution for this inherent multi-objective optimization problem. In our approach, optimization algorithms are used to define optimal (or near-optimal) density control policies, sensors clustering and sink routes to collect sensed data. We deal with the multi-objective nature of the design in WSN by explicitly minimizing message delivery latency and by imposing topology constraints that help to reduce energy consumption. Our proposal differs from most studies in the literature by the integrated way in which we tackle clustering and routing decisions. Various metaheuristic based heuristics that solve the integrated problem were incorporated into a dynamic simulation environment. Through extensive simulation experiments, we compared our approach to others in the literature, in terms of Quality of Service parameters. Our results indicate that the integrated model proposed here compares favorably to other approaches, allowing a good balance among conflicting parameters like message delivery latency, network lifetime and rate of messages received.