Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
Making Sensor Networks Practical with Robots
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Towards mobility as a network control primitive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Intelligent fluid infrastructure for embedded networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
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
Message ferry route design for sparse ad hoc networks with mobile nodes
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Wireless sensor network localization techniques
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobile Element Scheduling with Dynamic Deadlines
IEEE Transactions on Mobile Computing
Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
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
Path planning on a cuboid using genetic algorithms
Information Sciences: an International Journal
Data Aggregation with Multiple Spanning Trees in Wireless Sensor Networks
ICESS '08 Proceedings of the 2008 International Conference on Embedded Software and Systems
Using sink mobility to increase wireless sensor networks lifetime
WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks
Reducing the Path Length of a Mobile BS in WSNs
FBIE '08 Proceedings of the 2008 International Seminar on Future BioMedical Information Engineering
Genetic Algorithm Based Length Reduction of a Mobile BS Path in WSNs
ICIS '09 Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science
Fast track article: Improved sensor network lifetime with multiple mobile sinks
Pervasive and Mobile Computing
Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
IEEE Transactions on Computers
Using predictable observer mobility for power efficient design of sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Evolutionary trajectory planning for an industrial robot
International Journal of Automation and Computing
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
Mobility-based communication in wireless sensor networks
IEEE Communications Magazine
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation
IEEE Transactions on Parallel and Distributed Systems
A novel adaptive cooperative location algorithm for wireless sensor networks
International Journal of Automation and Computing
An efficient algorithm for mobile localization in sensor networks
International Journal of Automation and Computing
| Hi-index | 0.00 |
Exploiting mobile elements (MEs) to accomplish data collection in wireless sensor networks (WSNs) can improve the energy efficiency of sensor nodes, and prolong network lifetime. However, it will lead to large data collection latency for the network, which is unacceptable for data-critical applications. In this paper, we address this problem by minimizing the traveling length of MEs. Our methods mainly consist of two steps: we first construct a virtual grid network and select the minimal stop point set (SPS) from it; then, we make optimal scheduling for the MEs based on the SPS in order to minimize their traveling length. Different implementations of genetic algorithm (GA) are used to solve the problem. Our methods are evaluated by extensive simulations. The results show that these methods can greatly reduce the traveling length of MEs, and decrease the data collection latency.