Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
Transportation Science
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
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
Call and response: experiments in sampling the environment
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Learning-Enforced Time Domain Routing to Mobile Sinks in Wireless Sensor Fields
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Cyclops: in situ image sensing and interpretation in wireless sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Networked infomechanical systems: a mobile embedded networked sensor platform
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Controllably Mobile Infrastructure for Low Energy Embedded Networks
IEEE Transactions on Mobile Computing
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
A collaborative approach to in-place sensor calibration
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
RAGOBOT: a new platform for wireless mobile sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
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
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
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
Speed control and scheduling of data mules in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Biased sink mobility with adaptive stop times for low latency data collection in sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Prolonging network lifetime through the use of mobile base station in wireless sensor networks
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Delay tolerant event collection in sensor networks with mobile sink
INFOCOM'10 Proceedings of the 29th conference on Information communications
Barrier coverage with sensors of limited mobility
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Mobile element assisted cooperative localization for wireless sensor networks with obstacles
IEEE Transactions on Wireless Communications
Optimizing data collection path in sensor networks with mobile elements
International Journal of Automation and Computing
Path Planning of Data Mules in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey
ACM Transactions on Sensor Networks (TOSN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Probabilistic path selection in mobile wireless sensor networks for stochastic events detection
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
Energy efficiency mechanism using mobile-based Fermat's spiral in WSN
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
Monitoring quality optimization in wireless sensor networks with a mobile sink
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Analyzing multi-hop routing feasibility for sensor data harvesting using mobile sinks
Journal of Parallel and Distributed Computing
Scheduling job families on non-identical parallel machines with time constraints
Proceedings of the Winter Simulation Conference
Collecting data in ad-hoc networks with reduced uncertainty
Ad Hoc Networks
Hi-index | 0.00 |
Wireless networks have historically considered support for mobile elements as an extra overhead. However, recent research has provided the means by which a network can take advantage of mobile elements. Particularly in the case of wireless sensor networks, mobile elements can be deliberately built into the system to improve the lifetime of the network and act as mechanical carriers of data. The mobile element, whose mobility is controlled, visits the nodes to collect their data before their buffers are full. In general, the spatio-temporal dynamics of the sensed phenomenon may require sensor nodes to collect samples at different rates, in which case, some nodes need to be visited more frequently than others. This work formulates the problem of scheduling the mobile element in the network so that there is no data loss due to buffer overflow. The problem is shown to be NP-complete and an Integer-Linear-Programming formulation is given. Finally, some computationally practical algorithms for a single mobile and for the case of multiple mobiles are presented and their performances compared.