Bloom Filter Routing Protocol for Wireless Sensor Networks

Abstract:

Although the geographic routing protocols have better hop stretch,control overhead, storage cost and scalability than other existing routingprotocols for wireless sensor networks, source nodes need to know thecoordinates of destinations before routing data packets. To deploy thegeographic routing protocols on the real networks, it should integrate theseprotocols with location service and even virtual coordinates assignmentalgorithms. However, so far, because of the limited executable memory of sensornode, there is not a geographic routing system presented, which integrates withgeographic routing protocols and location service. Based on the above reason, anew Bloom Filter routing protocol for wireless sensor networks (BFR) ispro-posed. Like VRR, BFR is based on the identifier of sensor node butEuclidean space, so when it routes, it does not depend on the geographicinformation of nodes. Experimental results show that, compared to VRR, BFR haslower hop stretch, the storage cost and control overhead are much lower. Theresults also show that BFR is more scalable than VRR. Same as VRR, BFR can bedirectly deployed on the real sensor networks.

• Periodical: Advanced Materials Research (Volumes 779-780)
• Pages: 1723-1726
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.779-780.1723
• Online since: September 2013
• Authors: Jiang Wei Zhou
• Keywords: Bloom Filter, Routing Protocol, Wireless Sonsor Networks

References

[1] B. H. Bloom. Space/time trade-offs in hash coding with allowable errors[J]. Communications of the ACM, 13: 422–426, (1970).

DOI: 10.1145/362686.362692

[2] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure routing for structured peer-to-peer overlay networks[C]. In the Fifth Symposium on Operating Systems Design and Implementation (OSDI 2002), pages 299–314, (2002).

DOI: 10.1145/1060289.1060317

[3] B. Chen and R. Morris. Scalable landmark routing and address lookup for multi-hop wireless networks[R], (2002).

[4] R. Fonseca, S. Ratnasamy, J. Zhao, C. T. Ee, D. Culler, S. Shenker, and I. Stoica. Beacon vector routing: Scalable point- to-point routing in wireless sensornets. In Proceedings of NSDI (2005).

[5] Z. J. Haas and M. R. Pearlman. The zone routing protocol(zrp) for ad hoc networks[R], (2000).

[6] B. Karp and H. T. Kung. GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of Mobicom 2000, pages 243–254.

DOI: 10.21236/ada440078

[7] Y. -J. Kim, R. Govindan, B. Karp, and S. Shenker. Geographic routing made practical. In Proceedings of NSDI 2005, May (2005).

[8] J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris. A scalable location service for geographic ad hoc routing[C]. In The 6th Annual International Conference on Mobile Computing and Networking (ACM Mobicom 2000), pages 120–130.

DOI: 10.1145/345910.345931

[9] G. Pei, M. Gerla, and X. Hong. Lanmar: Landmark routing for large scale wireless ad hoc networks with group mobility[C]. In The First Annual Workshop on Mobile and Ad Hoc Networking and Computing, pages 11–18, (2000).

DOI: 10.1109/mobhoc.2000.869208

[10] C. Perkins. Ad-hoc on-demand distance vector routing. In Proceedings of IEEE MILCOM 1997, November (1997).

[11] C. E. Perkins and P. Bhagwat. Highly dynamic destination sequenced distance-vector routing (dsdv) for mobile computers[J]. Computer Communication Review, 24(4): 234–44, October (1994).

DOI: 10.1145/190809.190336

[12] C. Qing and A. Tarek. A scalable logical coordinates framework for routing in wireless sensor networks. In Proceedings of RTSS 2004, pages 349–358, Washington, DC, USA, 2004. IEEE Computer Society.

[13] M. Doddavenkatappa, A. L. Ananda, and M. C. Chan. INDRIYA: A wireless sensor network testbed, 2009. http: /indriya. ddns. comp. nus. edu. sg.

[14] M. Caesar, M. Castro, and E. B. Nightingale. Virtual ring routing: network routing inspired by DHTs. In Proceedings of ACM SIGCOMM 2006, pages 351–362. ACM Press, (2006).

DOI: 10.1145/1151659.1159954