MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Doctoral Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Doctoral Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Dynamic channel allocation in satellite and wireless networks

Author(s)
Sun, Jun, 1975-
Thumbnail
DownloadFull printable version (6.758Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Eytan Modiano.
Terms of use
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. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
The objective of this thesis is to understand how to utilize wireless channels in a fair and efficient manner within a multi-users communication environment. We start by exploring the allocation of a single wireless downlink fading channel among competing users. The allocation of a single uplink multiacccess fading channel is studied as well. With multiple parallel fading channels, a MAC protocol based on pricing is proposed to allocate network resource according to users' demand. We also investigate the use of parallel transmissions and redundant packets to reduce the file transmission delay. Specifically, we develop a novel auction-based algorithm to allow users to fairly compete for a downlink wireless fading channel. We first use the second-price auction mechanism whereby user bids for the channel, during each time-slot, based on the fade state of the channel, and the user that makes the highest bid wins use of the channel by paying the second highest bid. Under the assumption that each user has a limited budget for bidding, we show the existence of a Nash equilibrium strategy. And the Nash equilibrium leads to a unique allocation for certain channel state distribution. We also show that the Nash equilibrium strategy leads to an allocation that is pareto optimal. We also investigate the use of another auction mechanism, the all-pay auction, in allocating a single downlink channel. A unique Nash equilibrium is shown to exist. We also show that the Nash equilibrium strategy achieves a throughput allocation for each user that is proportional to the user's budget For the uplink of a wireless channel, we present a game-theoretical model of a wireless communication system with multiple competing users sharing a multiaccess fading channel.
 
(cont.) With a specified capture rule and a limited amount of energy available, a user opportunistically adjusts its transmission power based on its own channel state to maximize the user's own individual throughput. We derive an explicit form of the Nash equilibrium power allocation strategy. Furthermore, as the number of users in the system increases, the total system throughput obtained by using a Nash equilibrium strategy approaches the maximum attainable throughput. In a communication scenario where multiple users sharing a set of multiple parallel channels to communicate with multiple satellites, we propose a novel MAC protocol based on pricing that allocates network resources efficiently according to users' demand. We first characterize the Pareto efficient throughput region (i.e., the achievable throughput region). The equilibrium price, where satellite achieve its objective and users maximize their payoffs, is shown to exist and is unique. The resulting throughput at the equilibrium is shown to be Pareto efficient. Finally, we explore how a user can best utilize the available parallel channels to reduce the delay in sending a file to the base-station or satellite. We study the reduction of the file delay by adding redundant packets (i.e., coding). Our objective here is to characterize the delay and coding tradeoff in a single flow case. We also want to address the question whether coding will help to reduce delay if every user in the system decides to add redundancy for its file transmission.
 
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
 
Includes bibliographical references (p. 161-165).
 
Date issued
2007
URI
http://hdl.handle.net/1721.1/40513
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Doctoral Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.