Abstract
In a wireless sensor network, routing messages between two nodes s and t with multiple disjoint paths will increase the throughput, robustness and load balance of the network. The existing researches focus on finding multiple disjoint paths connecting s and t efficiently, but they do not consider length constraint of the paths. A too long path will be useless because of high latency and high packet loss rate. This paper deals with such a problem: given two nodes s and t in a sensor network, finding as many as possible disjoint paths connecting s and t whose lengths are no more than L, where L is the length bound set by the users. By now, we know that this problem is not only NP hard but also APX complete [1,2], which means that there is no PTAS for this problem. To the best of our knowledge, there is only one heuristic algorithm proposed for this problem [3], and it is not suitable for sensor network because it processes in a centralized way. This paper proposes an efficient distributed algorithm for this problem. By processing in a distributed way, the algorithm is very communication efficient. Simulation results show that our algorithm outperforms the existing algorithm in both aspects of found path number and communication efficiency.
Highlights
IntroductionA typical Wireless Sensor Network (WSN) comprises of thousands of small sensor nodes deployed in the monitoring area
This paper deals with such a problem: given two nodes s and t in a sensor network, finding as many as possible disjoint paths connecting s and t whose lengths are no more than L, where L is the length bound set by the users
A typical Wireless Sensor Network (WSN) comprises of thousands of small sensor nodes deployed in the monitoring area
Summary
A typical Wireless Sensor Network (WSN) comprises of thousands of small sensor nodes deployed in the monitoring area. Since link and node failures are very common in WSNs, messages can be lost while they are routed through a single path. On the other hand, routing messages often through a single fixed path would use up the energy of the nodes in the path quickly. In some applications, a sensitive message can be captured by eavesdropping nodes while it is routed through a single path. This paper proposes a distributed algorithm for this problem. The algorithm proposed in this paper can be extended to this situation by setting each edge a weight and using the product of per-edge weights as path metric.
Sign-in/Register to view highlights & summary 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.
