WSN01-3: Improving Search Efficiency Using Bloom Filters in Partially Connected Ad Hoc Networks: A Location-Centric Analysis

We examine query based (QB) and Bloom filter based (BF) schemes for data retrieval in a partially connected ad hoc network. For the QB scheme, a node retrieves data from another node by querying. Search efficiency deteriorates when the query success probability is small. We propose a Bloom filter based (BF) scheme to improve search efficiency. A data holder summarizes its content by a Bloom filter and broadcasts it to the data querier, which sends a query only if the requested data is available. We derive the bandwidth utilization in the single neighbor scenario and search efficiency as a function of node density in the multiple neighbors scenario. Numerical results show that the BF scheme offers significant gain in search efficiency. Our performance evaluation makes use of the M/M/oo queue to model mobility and is novel. It is useful for studying the impact of mobility in other mobile networks.

[1]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[2]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

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

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

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

[6]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[7]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2005, IEEE Trans. Inf. Theory.

[8]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

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

[11]  A. Prasad Sistla,et al.  Opportunistic Data Dissemination in Mobile Peer-to-Peer Networks , 2005, SSTD.

[12]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[13]  Roy D. Yates,et al.  Exploiting data diversity and multiuser diversity in noncooperative mobile infostation networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[15]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[16]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[17]  Wei Wang,et al.  Using mobile relays to prolong the lifetime of wireless sensor networks , 2005, MobiCom '05.

[18]  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.

[19]  Henning Schulzrinne,et al.  Performance Evaluation of Time-Based and Hop-Based TTL Schemes in Partially Connected Ad Hoc Networks , 2006, 2006 IEEE International Conference on Communications.

[20]  Henning Schulzrinne,et al.  Seven degrees of separation in mobile ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).