GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Statistical model of lossy links in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Flooding strategy for target discovery in wireless networks
Wireless Networks
An analysis of unreliability and asymmetry in low-power wireless links
ACM Transactions on Sensor Networks (TOSN)
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
ACM SIGCOMM Computer Communication Review
The β-factor: measuring wireless link burstiness
Proceedings of the 6th ACM conference on Embedded network sensor systems
Hi-index | 0.00 |
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature and present two important limitations. First, they are mainly based on simple random walks, where at each step, the next hop is selected uniformly at random among neighbors. This mechanism permits analytical tractability but wastes energy by unnecessarily visiting neighbors that have been visited before. Second, the studies usually assume static graphs which do not consider the impact of link dynamics on the temporal variation of neighborhoods. In this work we evaluate the querying performance of Non-Revisiting Random Walks (NRWs). At each step, NRWs avoid re-visiting neighbors by selecting the next hop randomly among the neighbors with the minimum number of visits. We evaluated Pull-only and Pull-Push queries with NRWs in two ways: (i) on a test-bed with 102 tmotes and (ii) on a simulation environment considering link unreliability and asymmetry. Our main results show that non-revisiting random walks significantly improve upon simple random walks in terms of querying cost and load balancing, and that the push-pull mechanism is more efficient than the push-only for query resolution.