Introduction to algorithms
Sending messages to mobile users in disconnected ad-hoc wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Multidimensional binary search trees used for associative searching
Communications of the ACM
The vehicle routing problem
Smart-tag based data dissemination
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
A message ferrying approach for data delivery in sparse mobile ad hoc networks
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
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Traffic analysis of mobile sensor networks
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
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
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Adaptive redundancy for data propagation exploiting dynamic sensory mobility
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Algorithmic Aspects of Wireless Sensor Networks
Efficient data gathering in partially connected and delay-tolerant wireless sensor networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
On providing location privacy for mobile sinks in wireless sensor networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Sensor relocation for emergent data acquisition in sparse mobile sensor networks
Mobile Information Systems
Query-driven data collection and data forwarding in intermittently connected mobile sensor networks
Proceedings of the Seventh International Workshop on Data Management for Sensor Networks
Path Planning of Data Mules in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Stability analysis of multi-hop routing in sensor networks with mobile sinks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Direction-based adaptive data propagation for heterogeneous sensor mobility
Journal of Parallel and Distributed Computing
TrainSense: a novel infrastructure to support mobility in wireless sensor networks
EWSN'13 Proceedings of the 10th European conference on Wireless Sensor Networks
Hi-index | 0.00 |
In recent studies, using mobile elements (MEs) as mechanical carriers to relay data has been shown to be an effective way of prolonging sensor network life time and relaying information in partitioned networks. As the data generation rates of sensors may vary, some sensors need to be visited more frequently than others. In this paper, a partitioning-based algorithm is presented that schedules the movements of MEs in a sensor network such that there is no data loss due to buffer overflow. Simulation results show that the proposed Partitioning-Based Scheduling (PBS) algorithm performs well in terms of reducing the minimum required ME speed to prevent data loss, providing high predictability in inter-visit durations, and minimizing the data loss rate for the cases when the ME is constrained to move slower than the minimum required ME speed.