Data MULEs: modeling a three-tier architecture for sparse sensor networks

This paper presents and analyzes an architecture to collect sensor data in sparse sensor networks. Our approach exploits the presence of mobile entities (called MULEs) present in the environment. MULEs pick up data from the sensors when in close range, buffer it, and drop off the data to wired access points. This can lead to substantial power savings at the sensors as they only have to transmit over a short range. This paper focuses on a simple analytical model for understanding performance as system parameters are scaled. Our model assumes two-dimensional random walk for mobility and incorporates key system variables such as number of MULEs, sensors and access points. The performance metrics observed are the data success rate (the fraction of generated data that reaches the access points) and the required buffer capacities on the sensors and the MULEs. The modeling along with simulation results can be used for further analysis and provide certain guidelines for deployment of such systems.

[1]  F. Spitzer.  Principles Of Random Walk , 1966 .

[2]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[3]  Zhuyu Lei,et al.  Probability criterion based location tracking approach for mobility management of personal communications systems , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[4]  Sheldon M. Ross.  Introduction to probability models , 1998 .

[5]  Christopher Rose,et al.  Wireless subscriber mobility management using adaptive individual location areas for PCS systems , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[6]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[7]  Jan M. Rabaey,et al.  PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking , 2000, Computer.

[8]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[9]  Deborah Estrin,et al.  Embedded Every-where: A Research Agenda for Networked Systems of Embedded Computers , 2001 .

[10]  Paul G. Spirakis,et al.  An efficient communication strategy for ad-hoc mobile networks , 2001, PODC '01.

[11]  David G. Leeper,et al.  A Long-Term View of Short-Range Wireless , 2001, Computer.

[12]  Christian Bettstetter,et al.  Smooth is better than sharp: a random mobility model for simulation of wireless networks , 2001, MSWIM '01.

[13]  H. T. Kung,et al.  Ad hoc relay wireless networks over moving vehicles on highways , 2001, MobiHoc '01.

[14]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[17]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[18]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[19]  Philippe Bonnet,et al.  Smart-tag based data dissemination , 2002, WSNA '02.

[20]  . Markov Chains and Random Walks on Graphs , .