An optimization framework for opportunistic receiver scheduling in wireless multi-hop networks

Jaewook Kwak, Joon Sang Park, Jeonghoon Mo, Mario Gerla

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Network Utility Maximization (NUM) has been extensively used in both wired and wireless networks and has been very helpful to provide insight on optimal controls of various parameters such as power, scheduling and rate control. However, the popular opportunistic scheduling mechanism, that improves the system performance by exploiting time varying channel conditions at different receivers, has not been incorporated in the framework yet. In this paper, we extend the framework and derive optimal flow control and link scheduling for wireless multi-hop networks with opportunistic scheduling. More precisely, we formulate the NUM problem with new resource constraints to include the benefits of opportunistic scheduling and then proceed to solve the problem. The formulation turns out to be a non-convex problem, however we propose an algorithm that approximates the optimum solution. Numerical results show that the proposed algorithm achieves significant throughput gain.

Original languageEnglish
Title of host publication2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings
DOIs
Publication statusPublished - 2010
EventIEEE Wireless Communications and Networking Conference 2010, WCNC 2010 - Sydney, NSW, Australia
Duration: 2010 Apr 182010 Apr 21

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Other

OtherIEEE Wireless Communications and Networking Conference 2010, WCNC 2010
Country/TerritoryAustralia
CitySydney, NSW
Period10/4/1810/4/21

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint

Dive into the research topics of 'An optimization framework for opportunistic receiver scheduling in wireless multi-hop networks'. Together they form a unique fingerprint.

Cite this