alexa A load-balancing routing algorithm for wireless sensor networks based on domain decomposition

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

A load-balancing routing algorithm for wireless sensor networks based on domain decomposition

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.

For more details visit: omicsonline.com/open-access/sensor-networks-data-communications.php

 
  • Share this page
  • Facebook
  • Twitter
  • LinkedIn
  • Google+
  • Pinterest
  • Blogger
 
adwords