Rendezvous Data Collection Using a Mobile Element in Heterogeneous Sensor Networks

We study the rendezvous data collection problem for the Mobile Element (ME) in heterogeneous sensor networks where data generation rates of sensors are distinct. The link quality is instable in our network model and the sensory data cannot be aggregated when transmitting. The Mobile Element is able to efficiently collect network wide data within a given delay bound; meanwhile the network eliminates the energy bottleneck to prolong its lifetime. For case study, we consider the trajectory planning for both Mobile Relay and Mobile Sink on a tree-shaped network. In the Mobile Relay case where the ME's trajectory must pass through a sink to upload sensory data for further processing, an O(n lg n) algorithm named RP-MR is proposed to approach (1) the optimal Rendezvous Points (RPs) to collect global sensory data; (2) the optimal data collection trajectory for the Mobile Relay to gather the cached data from RPs. In the Mobile Sink case where the Mobile Element can process the sensory on its motion, we develop an O(n lg2n) algorithm named RP-MS to recursively investigate the optimal solution. Both the theoretical analysis and extensive simulations verify the correctness and effectiveness of proposals.

[1]  Yunhao Liu,et al.  Sweep coverage with mobile sensors , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[2]  Hyung Seok Kim,et al.  Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks , 2003, SenSys '03.

[3]  Bhaskar Krishnamachari,et al.  Learning-enforced time domain routing to mobile sinks in wireless sensor fields , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[4]  Gaetano Borriello,et al.  Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks , 2006, Mob. Networks Appl..

[5]  Deepak Ganesan,et al.  Ultra-low power data storage for sensor networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[6]  Catherine Rosenberg,et al.  A minimum cost heterogeneous sensor network with a lifetime constraint , 2005, IEEE Transactions on Mobile Computing.

[7]  Ashutosh Sabharwal,et al.  Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks , 2003, IPSN.

[8]  Tony Hoare,et al.  Algorithm 63‚ Partition; Algorithm 64‚ Quicksort; Algorithm 65‚ Find , 1961 .

[9]  Peter Desnoyers,et al.  Ultra-low power data storage for sensor networks , 2009, TOSN.

[10]  Lang Tong,et al.  Sensor networks with mobile access: optimal random access and coding , 2004, IEEE Journal on Selected Areas in Communications.

[11]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.

[12]  Guoliang Xing,et al.  Rendezvous Planning in Mobility-Assisted Wireless Sensor Networks , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[13]  Saurabh Bagchi,et al.  Efficient collection of sensor data in remote fields using mobile collectors , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[14]  Lang Tong,et al.  Sensor networks with mobile agents , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[15]  Ivan Stojmenovic,et al.  Exploiting Actuator Mobility for Energy-Efficient Data Collection in Delay-Tolerant Wireless Sensor Networks , 2009, 2009 Fifth International Conference on Networking and Services.

[16]  R. Ernst,et al.  Scenario Aware Analysis for Complex Event Models and Distributed Systems , 2007, RTSS 2007.

[17]  William Stallings,et al.  Data and Computer Communications , 1985 .

[18]  L. Tong,et al.  Energy Efficient Data Collection in Sensor Networks , 2022 .

[19]  Baoxian Zhang,et al.  Data Gathering Protocols for Wireless Sensor Networks with Mobile Sinks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[20]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[21]  Jun Luo,et al.  MobiRoute: Routing Towards a Mobile Sink for Improving Lifetime in Sensor Networks , 2006, DCOSS.

[22]  Yunhao Liu,et al.  Rendered Path: Range-Free Localization in Anisotropic Sensor Networks With Holes , 2007, IEEE/ACM Transactions on Networking.

[23]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[24]  Mo Li,et al.  Ubiquitous data collection for mobile users in wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[25]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.