Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
