Abstract
Massively-dense wireless sensor networks (WSNs) may increase the difficulty of designing efficient and optimal routing algorithms. Since, from a macroscopic perspective, the optimal load-balancing routing problem may be formulated as a set of partial differential equations (PDEs), a scalable routing algorithm may be obtained by using WSNs themselves to solve the PDEs numerically, e.g., through the Gauss–Seidel iteration. To accelerate convergence without sacrificing precision, the proposed distributed Multiplicative Schwarz routing (DMSR) algorithm uses domain decomposition to iteratively solve the PDEs. Furthermore, the precision and parallelism may be improved by adapting an appropriately defined iteration order. Algorithm performance is analyzed theoretically for parallelism and errors, and numerical simulation results are presented to assess the efficiency and effectiveness of DMSR in achieving load balancing.
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.
