Rendezvous design algorithms for wireless sensor networks with a mobile base station

By Guoliang Xing, Tian-sheng Wang, Weijia Jia, Minming Li. ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

354 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Compressed data aggregation for energy efficient wireless sensor networks (2011, background): “It has been tackled from various aspects since the outset of WSNs, which include, among others, energy conserving sleep scheduling (e.g., [1]), topology control (e.g., [2]), mobile data collectors (e.g., [3]), and data aggregation 1 (e.g., [4]).”
Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks (2011, methodology): “A problem similar to the one in [15] based on multiple mobile elements is considered in [18].”
An Energy-Efficient Mobile-Sink Path Selection Strategy for Wireless Sensor Networks (2014, methodology): “[33] propose RD-FT, where the movement of a mobile sink is governed by application deadline.”
Joint mobile energy replenishment and data gathering in wireless rechargeable sensor networks (2011, neutral): “Xing et al. [15] proposed a rendezvous design, which aims to find a set of rendezvous points (RPs) to be visited by the mobile collector within a required delay bound, while the network cost incurred in transmitting data from sources to RPs is minimized.”