Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


arun_dissertation.pdf (996.22 KB)

ETD Abstract Container

Abstract Header

Low Complexity Scheduling in Wireless Networks

Sridharan, Arun
http://rave.ohiolink.edu/etdc/view?acc_num=osu1366072589

Abstract Details

2013, Doctor of Philosophy, Ohio State University, Electrical and Computer Engineering.
Scheduling complexity is an important bottleneck in the efficient design and control of wireless networks. Owing to the high computational complexity of throughputoptimal link schedulers, low-complexity schedulers such as Greedy Maximal Scheduling (GMS)that often yield good throughput performance have received significant attention in the recent past, with the performance of GMS having been characterized using the Local Pooling Factor (LPF) of a network graph. Unlike optimal scheduling however, the insights and performance guarantees of low complexity scheduling policies are restricted to specific network models and do not generalize easily. In this dissertation, motivated by a desire to understand cross-layer properties of greedy link scheduling, we develop and analyze low complexity greedy schedulers for wireless networks under various physical layer scenarios. One such scenario incorporates developments in multi-user information theory. Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node respectively. For wireless networks containing nodes with BC and MAC capabilities, we develop a greedy scheduling policy and show that the performance of our algorithm can be characterized using the associated parameter, the multiuser local pooling factor. We use the multiuser local pooling factor to demonstrate the improvement in throughput performance someexamples of network graphs with BCs and MACs. We also identify cross-layer design issues governing the performance of greedy algorithms in such wireless networks. While previous work on link scheduling has extensively focused on wireless networks with static link rates, we also investigate the performance of greedy schedulers in wireless networks with fading channels. We show that the performance of a greedy scheduler in wireless networks with fading channels can be characterized using the LPF of an associated static network graph. Finally, we motivate the LPF as a cross layer parameter, by proposing an energy efficient joint greedy scheduling and power control policy for wireless networks with average power constraints. Thus, the central theme of the dissertation is that by adopting an appropriate choice of algorithm and cross-layer design, the performance guarantees of greedy algorithms can be extended to network models that capture a wide variety of physical layer scenarios.
Can Emre Koksal (Advisor)
Ness. B Shroff (Committee Member)
Atilla Eryilmaz (Committee Member)
Dong Xuan (Committee Member)
131 p.
Electrical Engineering; Engineering

Recommended Citations

Citations

  • Sridharan, A. (2013). Low Complexity Scheduling in Wireless Networks [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366072589

    APA Style (7th edition)

  • Sridharan, Arun. Low Complexity Scheduling in Wireless Networks. 2013. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1366072589.

    MLA Style (8th edition)

  • Sridharan, Arun. "Low Complexity Scheduling in Wireless Networks." Doctoral dissertation, Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366072589

    Chicago Manual of Style (17th edition)

osu1366072589
440
© 2013, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.