WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
RandomWalk Routing for Wireless Sensor Networks
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
IEEE/ACM Transactions on Networking (TON)
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
ACM SIGCOMM Computer Communication Review
Query Processing in Sensor Networks
IEEE Pervasive Computing
IEEE Communications Magazine
Information discovery in mission-critical wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Detecting proximity events in sensor networks
Information Systems
| Hi-index | 0.00 |
In this paper, we consider the problem of information discovery in Wireless Sensor Networks (WSNs), where the search initiator is unaware of any of the γ locations of target information. One of the fundamental techniques which is used for this purpose is Random walk since it has several advantages like low cost (number of bytes transmitted) compared to flooding, load balancing among nodes, and minimal state maintenance. Even though Random walk reduces cost, it is still high enough for energy constrained networks like WSNs. Furthermore, Random walk incurs high latencies making it infeasible for delay sensitive applications. To alleviate the above mentioned problems in Random walk, we propose a variant of Random walk called Level Biased Random Walk (LBRW). In LBRW, the search packet traverses from the sink node (search initiator) to the circumference nodes (nodes without children) of the network and vice versa via random paths. The idea is to improve the node coverage of LBRW compared to that of Random walk by forcing it to move in some particular directions. We show by extensive simulations that the cost and latency of LBRW are only 56-69% of that by Random walk, when γ = 3 and at reasonable densities.