A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The Mathematica book (4th edition)
The Mathematica book (4th edition)
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ad hoc Networking
On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
On the Data Delivery Delay taken by Random Walks in Wireless Sensor Networks
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Design and performance of wireless data gathering networks based on unicast random walk routing
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we investigate random walk based routing in wireless sensor networks (WSN) that contains sink nodes independently distributed at random. Our goal is to quantify the effectiveness of such techniques based on the derivation of closed-form expressions. In particular, we focus on the global delay taken for the random walk to deliver data packets from sensor to sink nodes and study its statistics through closed-form derivations. At low concentration of sink nodes, we analytically establish an approximate formula that provides the cumulative distribution function of the global delay. We also perform a series of simulations to validate the analytical results. These simulation studies clearly agree with the analytical results provided that the concentration of sink nodes remains small. The main result of this paper is that the performance of data gathering based on random walks in randomized deployment can be significantly enhanced if the concentration of sink nodes is well tuned.