Abstract
AbstractThis paper investigates the MINimum-energy-cost-k-Disjoint-Paths (MIN-k-DP) problem : in a sensor network, given two nodes s and t, a positive integer k, finding k (node) disjoint paths connecting s and t with minimum total energy cost. An efficient distributed algorithm named Optimally-Finding-Disjoint-Paths (OFDP) is proposed for this problem. OFDP guarantees correctness and optimality, i.e., 1) it will find k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise; 2) the disjoint paths it outputs do have minimum total energy cost. To the best of our knowledge, OFDP is the first distributed algorithm that can solve the MIN-k-DP problem with correctness and optimality guarantee. Compared with the existing centralized algorithms which also guarantee correctness and optimality, OFDP is shown to be much more efficient by simulation results.
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.
