Share Email Print

Proceedings Paper

Optimizing transmissions and routing in sensor networks is polynomially solvable
Author(s): Ioannis Ch. Paschalidis; Wei Lai; David Starobinski
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 17 November 2005
PDF: 12 pages
Proc. SPIE 5999, Intelligent Systems in Design and Manufacturing VI, 599905 (17 November 2005); doi: 10.1117/12.630880
Show Author Affiliations
Ioannis Ch. Paschalidis, Boston Univ. (United States)
Wei Lai, Boston Univ. (United States)
David Starobinski, Boston Univ. (United States)

Published in SPIE Proceedings Vol. 5999:
Intelligent Systems in Design and Manufacturing VI
Bhaskaran Gopalakrishnan, Editor(s)

© SPIE. Terms of Use
Back to Top