Abstract
In this paper, we first put forward a mathematical model to find a path between two nodes in network based on Brownian particles’ random walk from multiple sources. The performance analysis proves that this model is as good as traditional multiple Brownian particles’ random walk. Then we propose a method to find the efficient path between two nodes in wireless sensor networks according to this mathematical model. The core of the method is to divide the nodes in WSN into two different types: general type and base-station type. The general type nodes forwards messages randomly to one of its’ neighbors and the base-station type nodes broadcast messages to all of its’ neighbors. The experiment shows that after huge number of simulations this way could find the efficient path between two nodes with high probability.
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.
