Abstract
The increasing technological progress in electronics provides network nodes with new and enhanced capabilities that allow the revisit of the traditional information dissemination (and collection) problem. The probabilistic nature of information dissemination using random walkers is exploited here to deal with challenges imposed by unconventional modern environments. In such systems, node operation is not deterministic (e.g., does not depend only on network nodes’ battery), but it rather depends on the particulars of the ambient environment (e.g., in the case of energy harvesting: sunshine, wind). The mechanism of information dissemination using one random walker is studied and analyzed in this paper under a different and novel perspective. In particular, it takes into account the stochastic nature of random walks, enabling further understanding of network coverage. A novel and original analysis is presented, which reveals the evolution network coverage by a random walker with respect to time. The derived analytical results reveal certain additional interesting aspects regarding network coverage, thus shedding more light on the random walker mechanism. Further analytical results, regarding the walker’s spatial movement and its associated neighborhood, are also confirmed through experimentation. Finally, simulation results considering random geometric graph topologies, which are suitable for modeling mobile environments, support and confirm the analytical findings.
Highlights
During the last two decades, numerous wireless sensor networks (WSN) have been deployed for various activities [1,2,3,4,5,6]
The analysis resulted in Equations (5) and (6), which demonstrate the evolution of the network coverage using a random walker in relation to time
There is disadvantage with respect to the increased time required for the coverage of the network
Summary
During the last two decades, numerous wireless sensor networks (WSN) have been deployed for various activities [1,2,3,4,5,6]. The probabilistic nature of this mechanism is suitable for dealing with the problem of nodes operating or not from time to time due to the energy availability This mechanism is expected to probabilistically cover the whole network (i.e., reach all network nodes) using significantly less messages (one random walker movement corresponds to one message) in comparison to the use of deterministic flooding at the expense of increased termination time [22]. Extended simulations provide results that sufficiently support the analytical expectations Another contribution of this paper corresponds to additional results considering the walker’s spatial movement and its associated neighborhood, producing useful analytical results that subsequently enable the study of network coverage. There are three appendices containing the detailed proofs for the corresponding theorems and corollaries that lie within the main text
Sign-in/Register to view highlights & summary 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.
