Bloom Filter Routing Protocol for Wireless Sensor Networks

Although the geographic routing protocols have better hop stretch, control overhead, storage cost and scalability than other existing routing protocols for wireless sensor networks, source nodes need to know the coordinates of destinations before routing data packets. To deploy the geographic routing protocols on the real networks, it should integrate these protocols with location service and even virtual coordinates assignment algorithms. However, so far, because of the limited executable memory of sensor node, there is not a geographic routing system presented, which integrates with geographic routing protocols and location service. Based on the above reason, a new Bloom Filter routing protocol for wireless sensor networks (BFR) is pro-posed. Like VRR, BFR is based on the identifier of sensor node but Euclidean space, so when it routes, it does not depend on the geographic information of nodes. Experimental results show that, compared to VRR, BFR has lower hop stretch, the storage cost and control overhead are much lower. The results also show that BFR is more scalable than VRR. Same as VRR, BFR can be directly deployed on the real sensor networks.