17 November 2005 Optimizing transmissions and routing in sensor networks is polynomially solvable
Author Affiliations +
Proceedings Volume 5999, Intelligent Systems in Design and Manufacturing VI; 599905 (2005) https://doi.org/10.1117/12.630880
Event: Optics East 2005, 2005, Boston, MA, United States
Abstract
We consider wireless sensor networks with multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs. The objective is to devise joint routing, power control and transmission scheduling policies in order to gather data in the most efficient manner while respecting the needs of different sensing tasks (fairness). We formulate the problem as maximizing the utility of transmissions subject to explicit fairness constraints. We propose an efficient decomposition algorithm drawing upon large-scale decomposition ideas in mathematical programming, and prove the convergence of the algorithm. Furthermore, by exploring the property of the subproblem, we find that the utility maximization problem we consider can, in principle, be solved in polynomial time.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ioannis Ch. Paschalidis, Ioannis Ch. Paschalidis, Wei Lai, Wei Lai, David Starobinski, David Starobinski, "Optimizing transmissions and routing in sensor networks is polynomially solvable", Proc. SPIE 5999, Intelligent Systems in Design and Manufacturing VI, 599905 (17 November 2005); doi: 10.1117/12.630880; https://doi.org/10.1117/12.630880
PROCEEDINGS
12 PAGES


SHARE
Back to Top