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
Making Sensor Networks Practical with Robots
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
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
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
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
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
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Reliable and energy-efficient data collection in sparse sensor networks with mobile elements
Performance Evaluation
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey
ACM Transactions on Sensor Networks (TOSN)
Local information guided autonomous exploration in sensor networks: Algorithms and experiments
Computer Communications
| Hi-index | 0.00 |
In recent years, mobile elements (MEs) have been proposed as mechanical carriers of data to prolong the lifetime of sensor networks and to overcome network partitioning problem. A scheduling approach is proposed in [1] for MEs to collect periodically generated data, also called regular messages (RMs), from nearby sensor nodes with no buffer overflow. However, increased delay in message delivery with ME-based communication compared to multi-hop communication may not be tolerated in some cases. Some messages can be more urgent than others due to critical values of the sensed data. Such messages maybe required to be delivered to the ME within a specified deadline. In this paper, this new problem of Differentiated Message Delivery (DMD) considering both regular and urgent message collection is addressed. The proposed solution incorporates multi-hop communication into the ME scheduling problem. The investigated performance metrics are the minimum required ME speed to prevent data loss and guarantee the maximum tolerated urgent message delay, as well as urgent and regular message loss rates for a given ME speed. The proposed solution is shown to perform well in terms of these metrics in various network scenarios. Furthermore, comparisons with existing ME scheduling algorithms show that the proposed solution meets the urgent message delivery requirement with a reasonable increase in ME speed.