Paper Info
Title
A Decomposition Method for Transmission Scheduling in Multi-Channel Wireless Sensor Networks
Abstract
We consider wireless sensor networks with multiple frequency channels, multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs. The objective is to devise joint routing 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 a decomposition algorithm drawing upon large-scale decomposition ideas in mathematical programming. We show that our algorithm terminates in a finite number of iterations. Every iteration requires the solution of a subproblem which is NP-hard. To solve the subproblem we (i) devise a particular relaxation that is solvable in polynomial time and (ii) leverage polynomial time approximation schemes. A combination of both approaches enables an improved decomposition algorithm which is much more efficient for solving large problem instances.
Year
DOI
Venue
2008
10.1109/INFOCOM.2008.286
Phoenix, AZ
Keywords
Field
DocType
approximation theory,computational complexity,internetworking,mathematical programming,scheduling,wireless channels,wireless sensor networks,decomposition method,joint routing,mathematical programming,multi-channel wireless sensor networks,multiple frequency channels,multiple gateways,polynomial time approximation,transmission scheduling
Algorithm design,Polynomial,Computer science,Scheduling (computing),Computer network,Approximation theory,Decomposition method (constraint satisfaction),Time complexity,Wireless sensor network,Distributed computing,Computational complexity theory
Conference
ISSN
ISBN
Citations 
0743-166X
978-1-4244-2025-4
2
PageRank 
References 
Authors
0.37
3
3
Name
Order
Citations
PageRank
Ioannis Ch. Paschalidis120.37
Wei Lai2332.72
Xiangdong Song320.37