TY - GEN
T1 - An optimization framework for opportunistic receiver scheduling in wireless multi-hop networks
AU - Kwak, Jaewook
AU - Park, Joon Sang
AU - Mo, Jeonghoon
AU - Gerla, Mario
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77955017484&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955017484&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2010.5506281
DO - 10.1109/WCNC.2010.5506281
M3 - Conference contribution
AN - SCOPUS:77955017484
SN - 9781424463985
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings
T2 - IEEE Wireless Communications and Networking Conference 2010, WCNC 2010
Y2 - 18 April 2010 through 21 April 2010
ER -