Rendezvous Planning in Wireless Sensor Networks with Mobile Elements

Authors:
Guoliang Xing;Tian Wang;Zhihui Xie;Weijia Jia
Affiliations:
City University of Hong Kong, Kowloon;City University of Hong Kong, Hong Kong;City University of Hong Kong, Hong Kong;City University of Hong Kong, Hong Kong
Venue:
IEEE Transactions on Mobile Computing
Year:
2008

Citing 0
Cited 8

Mobile Sinks for Information Retrieval from Cluster-Based WSN Islands

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Network-assisted sink navigation for distributed data gathering: Stability and delay-energy trade-offs

Computer Communications
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey

ACM Transactions on Sensor Networks (TOSN)
Review: From wireless sensor networks towards cyber physical systems

Pervasive and Mobile Computing
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
Analyzing multi-hop routing feasibility for sensor data harvesting using mobile sinks

Journal of Parallel and Distributed Computing
Coordination in wireless sensor-actuator networks: A survey

Journal of Parallel and Distributed Computing
Large scale simulation for human evacuation and rescue

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile elements (MEs) capable of carrying data mechanically. However, the low movement speed of MEs hinders their use in data-intensive sensing applications with temporal constraints. To address this issue, we propose a rendezvous-based approach in which a subset of nodes serve as the rendezvous points (RPs) that buffer data originated from sources and transfer to MEs when they arrive. RPs enable MEs to collect a large volume of data at a time without traveling long distances, which can achieve a desirable balance between network energy saving and data collection delay. We develop two rendezvous planning algorithms, RP-CP and RP-UG. RP-CP finds the optimal RPs when MEs move along the data routing tree while RP-UG greedily chooses the RPs with maximum energy saving to travel distance ratios. We design the Rendezvous-based Data Collection protocol that facilitates reliable data transfers from RPs to MEs in presence of significant unexpected delays in ME movement and network communication. Our approach is validated through extensive simulations.