RUcore: Rutgers University Community Repository
Resource allocation in coordinated and un-coordinated wireless systems with greedy or non-greedy users
Descriptive
TitleInfo
(displayLabel = Citation Title);
(type = uniform)
Title
Resource allocation in coordinated and un-coordinated wireless systems with greedy or non-greedy users
Name
(ID = NAME001);
(type = personal)
NamePart
(type = family)
Singh
NamePart
(type = given)
Jasvinder
DisplayForm
Jasvinder Singh
Role
RoleTerm
(authority = RULIB)
author
Name
(ID = NAME002);
(type = personal)
NamePart
(type = family)
Rose
NamePart
(type = given)
Christopher
Affiliation
Advisory Committee
DisplayForm
Christopher Rose
Role
RoleTerm
(authority = RULIB)
chair
Name
(ID = NAME003);
(type = personal)
NamePart
(type = family)
Yates
NamePart
(type = given)
Roy
Affiliation
Advisory Committee
DisplayForm
Roy D Yates
Role
RoleTerm
(authority = RULIB)
internal member
Name
(ID = NAME004);
(type = personal)
NamePart
(type = family)
Mandayam
NamePart
(type = given)
Narayan
Affiliation
Advisory Committee
DisplayForm
Narayan B Mandayam
Role
RoleTerm
(authority = RULIB)
internal member
Name
(ID = NAME005);
(type = personal)
NamePart
(type = family)
Spasojevic
NamePart
(type = given)
Predrag
Affiliation
Advisory Committee
DisplayForm
Predrag Spasojevic
Role
RoleTerm
(authority = RULIB)
internal member
Name
(ID = NAME006);
(type = personal)
NamePart
(type = family)
Balachandran
NamePart
(type = given)
Krishna
Affiliation
Advisory Committee
DisplayForm
Krishna Balachandran
Role
RoleTerm
(authority = RULIB)
outside member
Name
(ID = NAME007);
(type = corporate)
NamePart
Rutgers University
Role
RoleTerm
(authority = RULIB)
degree grantor
Name
(ID = NAME008);
(type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm
(authority = RULIB)
school
TypeOfResource
Text
Genre
(authority = marcgt)
theses
OriginInfo
DateCreated
(qualifier = exact)
2007
DateOther
(qualifier = exact);
(type = degree)
2007
Language
LanguageTerm
English
PhysicalDescription
Form
(authority = marcform)
electronic
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
x, 89 pages
Abstract
In this thesis, we investigate wireless resource optimization problems arising in the context of unlicensed bands. The first half of this thesis assumes a multiple access channel communication model (many transmitters talking to a single receiver), while the second half assumes an interference channel (a collection of multiple interfering transmitter-receiver pairs). The problems considered can further be classified based on the level of coordination available among the devices, and based on the optimization objectives of the devices. The devices are either greedy (they choose their actions to maximize their own utility), or are non-greedy (they choose their actions to maximize/satisfy a common social objective). We investigate four resource optimization scenarios that encompass the possibilities of presence or absence of coordination infrastructure as well as the cases of greedy and non-greedy devices. As an example of the greedy uncoordinated scenario, we consider application of interference avoidance algorithms in generalized CDMA systems.
We introduce variants of standard interference avoidance procedures which produce more easily tracked incremental codewords, and study the response of the system to abrupt changes in the background interference as might be encountered in a practical system. Next we consider a sensor network scenario where multiple sensors are transmitting correlated symbols to a common receiver, with an objective of minimizing the total mean square error (TMSE) in the symbol estimates at the receiver. The source-channel separation theorem for the point to point case does not hold for this problem and the optimal communication scheme is unknown. We propose a CDMA based transmission scheme that exploits the correlation between the sensors' symbols and facilitates statistical cooperation among the sensors through the choice of their codewords. We give an analytical characterization of the TMSE-minimizing codeword set for this scheme, and compare its performance both with a separation-based scheme, and an information-theoretic upper bound.
The second half of this thesis considers scheduling problems for interfering links where each link employs an ON-OFF modulation scheme in each time slot. First we consider the case of non-greedy interfering links and come up with a distributed scheduling solution that requires no coordination among the links. We prove the convergence of our distributed scheduling algorithm and compare its
performance with centralized scheduling. After this, we consider the case of greedy interfering links that coordinate with each other through a mediating authority called the "spectrum server". Each link reports the set of links that interfere with it, based on which the spectrum server constructs the interference graph and finds an optimal schedule for the links (maximizing a certain global objective). Since the links are greedy, they will choose their reports to maximize their individual utilities. We therefore investigate the following natural question: "Under what conditions is it realistic to assume that the links will send truthful reports?" and present some preliminary results.
We introduce variants of standard interference avoidance procedures which produce more easily tracked incremental codewords, and study the response of the system to abrupt changes in the background interference as might be encountered in a practical system. Next we consider a sensor network scenario where multiple sensors are transmitting correlated symbols to a common receiver, with an objective of minimizing the total mean square error (TMSE) in the symbol estimates at the receiver. The source-channel separation theorem for the point to point case does not hold for this problem and the optimal communication scheme is unknown. We propose a CDMA based transmission scheme that exploits the correlation between the sensors' symbols and facilitates statistical cooperation among the sensors through the choice of their codewords. We give an analytical characterization of the TMSE-minimizing codeword set for this scheme, and compare its performance both with a separation-based scheme, and an information-theoretic upper bound.
The second half of this thesis considers scheduling problems for interfering links where each link employs an ON-OFF modulation scheme in each time slot. First we consider the case of non-greedy interfering links and come up with a distributed scheduling solution that requires no coordination among the links. We prove the convergence of our distributed scheduling algorithm and compare its
performance with centralized scheduling. After this, we consider the case of greedy interfering links that coordinate with each other through a mediating authority called the "spectrum server". Each link reports the set of links that interfere with it, based on which the spectrum server constructs the interference graph and finds an optimal schedule for the links (maximizing a certain global objective). Since the links are greedy, they will choose their reports to maximize their individual utilities. We therefore investigate the following natural question: "Under what conditions is it realistic to assume that the links will send truthful reports?" and present some preliminary results.
Note
(type = degree)
Ph.D.
Note
(type = bibliography)
Includes bibliographical references (p. 84-88).
Subject
(ID = SUBJ1);
(authority = RUETD)
Topic
Electrical and Computer Engineering
Subject
(ID = SUBJ2);
(authority = ETD-LCSH)
Topic
Wireless communication systems
Subject
(ID = SUBJ3);
(authority = ETD-LCSH)
Topic
Code division multiple access
Subject
(ID = SUBJ4);
(authority = ETD-LCSH)
Topic
Adaptive signal processing--Algorithms
RelatedItem
(type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier
(type = local)
rucore19991600001
Identifier
(type = hdl)
http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16780
Identifier
ETD_525
Location
PhysicalLocation
(authority = marcorg);
(displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier
(type = doi)
doi:10.7282/T3PG1S4T
Genre
(authority = ExL-Esploro)
ETD doctoral
Back to the top
Rights
RightsDeclaration
(AUTHORITY = GS);
(ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
AssociatedEntity
(AUTHORITY = rulib);
(ID = 1)
Name
Jasvinder Singh
Role
Copyright holder
Affiliation
Rutgers University. Graduate School - New Brunswick
RightsEvent
(AUTHORITY = rulib);
(ID = 1)
Type
Permission or license
Detail
Non-exclusive ETD license
AssociatedObject
(AUTHORITY = rulib);
(ID = 1)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top
Technical
Format
(TYPE = mime);
(VERSION = )
application/x-tar
FileSize
(UNIT = bytes)
1179648
Checksum
(METHOD = SHA1)
03976e0953d0179e2e4773ef2306411cea6c3aa1
ContentModel
ETD
CompressionScheme
other
OperatingSystem
(VERSION = 5.1)
windows xp
Format
(TYPE = mime);
(VERSION = NULL)
application/x-tar
Back to the top
Statistical Profile