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)
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
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)
Gossiping on MANETs: the beauty and the beast
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
ACM Transactions on Computer Systems (TOCS)
Energy efficient searching in delay-tolerant wireless sensor networks
Proceedings of the 1st ACM international workshop on Heterogeneous sensor and actor networks
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
ACM SIGCOMM Computer Communication Review
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
IEEE Transactions on Computers
Query Processing in Sensor Networks
IEEE Pervasive Computing
Random walk with long jumps for wireless ad hoc networks
Ad Hoc Networks
Energy Efficient and Scalable Search in Dense Wireless Sensor Networks
IEEE Transactions on Computers
Coverage based expanding ring search for dense wireless sensor networks
HiPC'08 Proceedings of the 15th international conference on High performance computing
Random walk with jumps in large-scale random geometric graphs
Computer Communications
On the scalability of expanding ring search for dense wireless sensor networks
Journal of Parallel and Distributed Computing
IEEE Communications Magazine
Hi-index | 0.00 |
Random walk is one of the widely used techniques for information discovery in unstructured networks like Ad hoc Wireless Networks (AWNs) and Wireless Sensor Networks (WSNs). In a random walk, instead of taking all steps uniform randomly, our idea is to modify the random walk to take some level biased steps to improve its energy efficiency and latency which are important design parameters of protocols for WSNs. The level of a node is defined as the minimum number of hops in which it can reach the sink node. We propose three protocols viz., Several Short Random Walks (SSRW) search, Random Walk with Level Biased Jumps (RWLBJ) search, and Level Biased Random Walk (LBRW) search. The proposed protocols use a combination of random and level biased steps to search for the target information. As we move from SSRW to LBRW, the percentage of biased steps increases and the percentage of random steps decreases i.e., SSRW uses fewer biased steps compared to the other proposals, LBRW uses only biased steps, and the usage of biased steps in RWLBJ is somewhere in between. We show by extensive simulations and testbed experiments that SSRW, RWLBJ, and LBRW are better choices compared to that of a pure Random walk in terms of the energy consumption and latency of search, and we also show that among the proposed protocols, LBRW and RWLBJ are the best.