Enforcing cooperation and providing quality of service in wireless networks

Jaramillo Jimenez, Juan J.

Permalink

https://hdl.handle.net/2142/16085 Copy

Description

Title

Enforcing cooperation and providing quality of service in wireless networks

Author(s)

Jaramillo Jimenez, Juan J.

Issue Date

2010-05-19T18:34:22Z

Director of Research (if dissertation) or Advisor (if thesis)

Srikant, Rayadurgam

Doctoral Committee Chair(s)

Srikant, Rayadurgam

Committee Member(s)

• Kumar, P.R.
• Vaidya, Nitin H.
• Veeravalli, Venugopal V.

Department of Study

Electrical & Computer Eng

Discipline

Electrical & Computer Engr

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

Ph.D.

Degree Level

Dissertation

Keyword(s)

• wireless networks
• ad hoc networks
• cooperation
• quality of service

Abstract

The purpose of this dissertation is to design algorithms that provide quality of service and enforce cooperation in wireless ad hoc networks. Using a simple network model, we first study the performance of some previously proposed cooperation-enforcing strategies and then present a new mechanism. We prove that our mechanism is robust to imperfect measurements, is collusion-resistant, and can achieve full cooperation among nodes. Assuming cooperation is being enforced, we then study the problem of optimal routing and admission control for flows which require a pre-specified bandwidth from the network. We develop an algorithm whose performance is close to that of an omniscient off-line algorithm that has complete a priori knowledge of the entire sequence of flow arrivals and their bandwidth requests, including the future. We then study the problem of congestion control and scheduling in wireless ad hoc networks that have to support a mixture of best-effort and real-time traffic. We propose a model for incorporating the requirements of packets with deadlines in an optimization framework. The solution to the problem results in a joint congestion control and scheduling algorithm which fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows, and the per-packet delay requirements of inelastic flows.

Graduation Semester

2010-5

Permalink

http://hdl.handle.net/2142/16085

Copyright and License Information

Copyright 2010 Juan Jose Jaramillo Jimenez

Owning Collections