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. Furthermore, we exploit the special structure of the subproblem and show that a particular relaxation is solvable in polynomial time. This enables an improved algorithm based on the decomposition algorithm which is much more efficient for solving large problem instances.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
