Transmission scheduling with deadline and throughput constraints

Today wireless networks are increasingly used to perform applications with Quality of Service constraints (QoS) such as delay, delivery ratio, and channel reliability. Especially, as demand for real-time transmissions increases, transmitting packets with hard delivery deadlines poses an important network control problem. In this thesis, we propose a framework for characterizing feasibility regions and finding an optimal scheduling policy in various wireless networks. First, we start with a wireless network with multiple unicast flows. We investigate how delay in feedback information decreases the feasibility region. Second, we consider time-varying channels and how delay in network state information decreases the feasibility region. Third, we characterize the feasibility region of a wireless network with multiple multicast flows. In each case, we characterize the feasibility region, prove that a max-weight policy is a feasibility optimal policy and present the results of simulation studies verifying the theoretical studies.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2013

Author dc:creator

• Kim, Kyu Seob

Advisor dc:contributor.advisor

• Eytan Modiano.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/84868

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/84868