An evaluation of location-demographic replacement policies for zebroids

In an ad-hoc network of mobile devices, a device is termed a zebroid when it carries a data item residing on a server-device to a client-device referencing that item. The system employs a zebroid when its travel path intersects that of the server and the client and this information is known in advance. The motivation for use of a zebroid is to minimize the delay incurred by the client for the referenced data item, termed the availability latency. This paper considers the performance of alternative policies that manage the identity of data items assigned to a zebroid when its storage is exhausted. One novel policy is LoDeR that manages storage of zebroids based on the demographics of a geographical region where the zebroid rendezvous with the client. Experimental results demonstrate a host of tradeoffs between the different performance metrics such as the number of data items lost by a policy and the percentage of requests that reference these data items, availability latency, and number of replaced data items. The mobility model has a significant impact on these metrics for a given policy.

[1]  S. Ghandeharizadeh,et al.  Evaluation of 802.11a for streaming data in ad-hoc networks , 2004, 2004 4th Workshop on Applications and Services in Wireless Networks, 2004. ASWN 2004..

[2]  Ellen W. Zegura,et al.  Trading latency for energy in wireless ad hoc networks using message ferrying , 2005, Third IEEE International Conference on Pervasive Computing and Communications Workshops.

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

[4]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

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

[6]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[7]  Alex Pentland,et al.  DakNet: rethinking connectivity in developing nations , 2004, Computer.

[8]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[9]  Bhaskar Krishnamachari,et al.  Comparison of replication strategies for content availability in C2P2 networks , 2005, MDM '05.

[10]  Asit Dan,et al.  Buffering and caching in large-scale video servers , 1995, Digest of Papers. COMPCON'95. Technologies for the Information Superhighway.

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

[12]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[13]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[14]  Bhaskar Krishnamachari,et al.  C2P2: a peer-to-peer network for on-demand automobile information services , 2004 .

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