Name
Title | ||
|---|---|---|
Asymptotically Optimal Transmission Policies for Large-Scale Low-Power Wireless Sensor Networks |
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 and propose an efficient decomposition algorithm drawing upon large-scale decomposition ideas in mathematical programming. We show that our algorithm terminates in a finite number of iterations and produces a policy that is asymptotically optimal at low transmission power levels. Furthermore, we establish that the utility maximization problem we consider can, in principle, be solved in polynomial time. Numerical results show that our policy is near-optimal, even at high power levels, and far superior to the best known heuristics at low power levels. We also demonstrate how to adapt our algorithm to accommodate energy constraints and node failures. The approach we introduce can efficiently determine near-optimal transmission policies for dramatically larger problem instances than an alternative enumeration approach. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/TNET.2006.890108 | Networking, IEEE/ACM Transactions |
Keywords | Field | DocType |
iterative methods,mathematical programming,scheduling,telecommunication traffic,wireless sensor networks,asymptotically optimal transmission policies,large-scale low-power wireless sensor networks,multiple gateways,near-optimal transmission policies,traffic carrying data,transmission scheduling,Mathematical programming/optimization,routing,transmission scheduling,wireless sensor networks | Mathematical optimization,Iterative method,Computer science,Scheduling (computing),Power control,Computer network,Utility maximization problem,Heuristics,Time complexity,Asymptotically optimal algorithm,Wireless sensor network,Distributed computing | Journal |
Volume | Issue | ISSN |
15 | 1 | 1063-6692 |
Citations | PageRank | References |
16 | 1.29 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ioannis Ch. Paschalidis | 1 | 170 | 18.77 |
| Wei Lai | 2 | 33 | 2.72 |
| D. Starobinski | 3 | 157 | 16.95 |