Optimizing transmissions and routing in sensor networks is polynomially solvable

Ioannis Ch. Paschalidis; Wei Lai; David Starobinski

doi:10.1117/12.630880

17 November 2005 Optimizing transmissions and routing in sensor networks is polynomially solvable

Ioannis Ch. Paschalidis, Wei Lai, David Starobinski

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.

Citation Download Citation

Ioannis Ch. Paschalidis, Wei Lai, and 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); https://doi.org/10.1117/12.630880

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available