A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
Using predictable observer mobility for power efficient design of sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Opportunistic data dissemination in mobile peer-to-peer networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.24 |
In a partially connected ad hoc network, two nodes communicate and share data when they are in proximity. For the query based (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. The data querier then transmits a query only when the requested data is available. We first consider the single neighbor scenario, and derive the long run bandwidth utilization of a connection. More generally, a node may find multiple neighbors and neighbor relationship changes dynamically with time. Querying is more efficient due to the presence of multiple data holders. There may also be multiple Bloom filter transmissions over a busy period, reducing the effective data transmission time of the BF scheme. For a fair comparison of the QB and BF scheme, we characterize the search efficiency, as a function of node density. Numerical study shows that an optimal Bloom filter consumes negligible overhead, even in low bandwidth scenarios. We conclude that the BF scheme is superior for data retrieval. Our performance evaluation makes use of the M/M/~ queue to model mobility, parametrized on node encounter rate and connection time. Moreover, the analysis is node-centric, avoiding the use of discrete locations, unrealistic mobility and interference models. This technique is novel and can be used for studying the impact of mobility in other mobile networks.