You searched for +publisher:"University of Southern California" +contributor:("Neely, Michael J.").
Showing records 1 – 22 of
22 total matches.
No search limiters apply to these results.
University of Southern California
1.
Alresaini, Majed.
Backpressure delay enhancement for encounter-based mobile
networks while sustaining throughput optimality.
Degree: PhD, Computer Engineering, 2012, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019 
► Backpressure scheduling and routing, in which packets are preferentially transmitted over links with high queue differentials, offers the promise of throughput-optimal operation for a wide…
(more)
▼ Backpressure scheduling and routing, in which packets
are preferentially transmitted over links with high queue
differentials, offers the promise of throughput-optimal operation
for a wide range of communication networks. However, when the
traffic load is low, due to the corresponding low queue occupancy,
backpressure scheduling/routing experiences long delays. This is
particularly of concern in intermittent encounter-based mobile
networks which are already delay-limited due to the sparse and
highly dynamic network connectivity. While state of the art
mechanisms for such networks have proposed the use of redundant
transmissions to improve delay, they do not work well when the
traffic load is high. We propose in this dissertation a novel
hybrid approach that we refer to as backpressure with adaptive
redundancy (BWAR), which provides the best of both worlds. This
approach is highly robust and distributed and does not require any
prior knowledge of network load conditions. We present an enhanced
variant of BWAR so that duplicates are removed based on
distributed, easy-to-implement, time-out mechanism in order to
obtain close delay performance compared to ideal removal of
delivered packets. In addition, we introduce an energy optimized
variant of BWAR while at the same time maintaining the great delay
and throughput performance of BWAR. We evaluate BWAR through both
mathematical analysis and simulations based on a cell-partitioned
model and real traces of taxis in Beijing. We prove theoretically
that BWAR does not perform worse than traditional backpressure in
terms of the maximum throughput, while yielding a better delay
bound. The simulations confirm that BWAR outperforms traditional
backpressure at low load, while outperforming state of the art
encounter-routing schemes (Spray & Wait and Spray & Focus)
at high load.
Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Neely, Michael J. (Committee Member), Golubchik, Leana (Committee Member).
Subjects/Keywords: delay tolerant networks; DTN; intermittently connected; Lyapunov; stability; redundancy; duplicates; scheduling; routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Alresaini, M. (2012). Backpressure delay enhancement for encounter-based mobile
networks while sustaining throughput optimality. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019
Chicago Manual of Style (16th Edition):
Alresaini, Majed. “Backpressure delay enhancement for encounter-based mobile
networks while sustaining throughput optimality.” 2012. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019.
MLA Handbook (7th Edition):
Alresaini, Majed. “Backpressure delay enhancement for encounter-based mobile
networks while sustaining throughput optimality.” 2012. Web. 24 Jan 2021.
Vancouver:
Alresaini M. Backpressure delay enhancement for encounter-based mobile
networks while sustaining throughput optimality. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019.
Council of Science Editors:
Alresaini M. Backpressure delay enhancement for encounter-based mobile
networks while sustaining throughput optimality. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/61078/rec/1019
University of Southern California
2.
Honnappa, Harsha.
Strategic and transitory models of queueing systems.
Degree: PhD, Electrical Engineering, 2014, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081
► Stochastic network theory, and queueing theory in particular, is the bedrock for the analysis and control of resource constrained systems. Such systems are manifest in…
(more)
▼ Stochastic network theory, and queueing theory in
particular, is the bedrock for the analysis and control of resource
constrained systems. Such systems are manifest in our world: in
healthcare delivery, shared computing, communications and
transportation systems, system operators observe high demand for
services necessitating queue management. 'Classical' queueing
theory has largely focused on the analysis of stationary and
ergodic models. However, most real world resource allocation
systems exhibit time-dependent arrival and service. Further, many
systems operate only on a finite time horizon, or system operators
are interested in the 'small-time' or transient behavior of a
queueing system. In this dissertation, we initiate the development
of models of such 'transitory' queueing systems. Our first
contribution is the introduction of several disparate models of
multiple server transitory queues. We develop fluid and diffusion
approximations, using a mathematical technique called 'Population
Acceleration'. Next, we extend this analysis to generalized Jackson
networks. The diffusion approximations are completely unlike the
conventional heavy-traffic diffusion approximations. Our second
major contribution is the development of game theoretic models of
traffic and routing in generalized Jackson networks. Almost all
queueing models assume exogeneous arrivals, routing and service.
However, in many situations, like early morning commutes, users are
strategic in when they decide to join a service system and which
route to take, so that they minimize their sojourn time. We
identify the Nash equilibrium traffic and routing profile when
users are strategic.
Advisors/Committee Members: Jain, RahulWard, Amy R. (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Neely, Michael J. (Committee Member).
Subjects/Keywords: queueing theory; applied probability; game theory; stochastic process limits; empirical process theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Honnappa, H. (2014). Strategic and transitory models of queueing systems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081
Chicago Manual of Style (16th Edition):
Honnappa, Harsha. “Strategic and transitory models of queueing systems.” 2014. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081.
MLA Handbook (7th Edition):
Honnappa, Harsha. “Strategic and transitory models of queueing systems.” 2014. Web. 24 Jan 2021.
Vancouver:
Honnappa H. Strategic and transitory models of queueing systems. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081.
Council of Science Editors:
Honnappa H. Strategic and transitory models of queueing systems. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/487938/rec/6081
University of Southern California
3.
Isenalumhe, Leidy L.
The pharmacokinetics and pharmacodynamics of vincristine in
the adolescent and young adult population compared to younger
patients.
Degree: MS, Clinical and Biomedical Investigations, 2016, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/624095/rec/7080
► Improvement in survival from many forms of cancer among the adolescent and young adult (AYA) population has lagged behind that of younger patients. One contributing…
(more)
▼ Improvement in survival from many forms of cancer
among the adolescent and young adult (AYA) population has lagged
behind that of younger patients. One contributing factor may be
differences in tolerance of cancer treatments that lead to reduced
adherence and efficacy. It has been shown that the AYA population
has an increased prevalence of vincristine related neuropathy
(VRNT), where dosage attenuation and/or increasing the dosing
intervals which may decrease their cancer survival and reduced
quality of life. Previous studies evaluated the relationship of age
and vincristine pharmacokinetics (PK) have resulted in conflicting
conclusions. These studies demarcated the AYA population as >10
years of age, which not only included adolescents and young adults,
but also young children and pre-adolescent children. The proper
characterization of this age group is critical, since developmental
changes, as characterized by the Tanner staging, are associated
with physiological variation that could significantly affect drug
distribution and metabolism. Additionally, there are currently no
means for predicting VRNT in any patient, regardless of age. ❧ We
hypothesize that the pharmacokinetics/pharmacodynamics of
vincristine differs between AYA and younger children, which may
contribute to the excess VRNT found in the AYA population. One of
our aims is to show that the PK of vincristine and its metabolite
M1 will differ between young children and AYA as defined by Tanner
stage. This is a novel way to define AYA compared with previously
published VCR PK studies. Additionally, we hypothesize that
calpain, a calcium-dependent protease that is believed to be
associated with calcium mediated cell injury in the nervous system
can serve as a biomarker predicting for VRNT in this age group.
Hence, compared to baseline, serum calpain will increase after
administration of vincristine. Changes in serum calpain,
particularly if correlated with vincristine and/or M1 PK, would
support further study of calpain as a biomarker of
VRNT.
Advisors/Committee Members: Freyer, David (Committee Chair), Neely, Michael J. (Committee Member), Azen, Stanley P. (Committee Member).
Subjects/Keywords: AYA; adolescent and young adults; VCR; vincristine; VRNT; vincristine related neuropathy; ALL; acute lymphoblastic leukemia
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Isenalumhe, L. L. (2016). The pharmacokinetics and pharmacodynamics of vincristine in
the adolescent and young adult population compared to younger
patients. (Masters Thesis). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/624095/rec/7080
Chicago Manual of Style (16th Edition):
Isenalumhe, Leidy L. “The pharmacokinetics and pharmacodynamics of vincristine in
the adolescent and young adult population compared to younger
patients.” 2016. Masters Thesis, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/624095/rec/7080.
MLA Handbook (7th Edition):
Isenalumhe, Leidy L. “The pharmacokinetics and pharmacodynamics of vincristine in
the adolescent and young adult population compared to younger
patients.” 2016. Web. 24 Jan 2021.
Vancouver:
Isenalumhe LL. The pharmacokinetics and pharmacodynamics of vincristine in
the adolescent and young adult population compared to younger
patients. [Internet] [Masters thesis]. University of Southern California; 2016. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/624095/rec/7080.
Council of Science Editors:
Isenalumhe LL. The pharmacokinetics and pharmacodynamics of vincristine in
the adolescent and young adult population compared to younger
patients. [Masters Thesis]. University of Southern California; 2016. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/624095/rec/7080
University of Southern California
4.
Yardley, Megan M.
Development of ivermectin as a platform for the treatment
and/or prevention of alcohol use disorders.
Degree: PhD, Molecular Pharmacology and Toxicology, 2016, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/444768/rec/1949
► Alcohol use disorders (AUDs) affect over 18 million people in the United States alone, cost over $235 billion, and yet only 8% of this population…
(more)
▼ Alcohol use disorders (AUDs) affect over 18 million
people in the United States alone, cost over $235 billion, and yet
only 8% of this population receives treatment and even less use a
medication approved by the U.S. Food and Drug Administration (FDA)
as part of that treatment. Despite considerable efforts focusing on
new drug development to reduce ethanol abuse, high rates of harmful
drinking persist. This is, in part, due to the fact that current
therapeutic strategies are largely inadequate to treat these
disorders. Thus, developing novel therapeutics for the treatment of
AUDs is of paramount importance. The working hypothesis of our
laboratory is that ivermectin (IVM) can be repurposed as a
therapeutic agent for the treatment of AUDs. As IVM is currently
FDA‐approved and used by millions of humans each year for other
indications, the repurposing of IVM for the treatment of AUDs
represents a fast and economically feasible approach for drug
development. Initial support suggesting that IVM can be developed
as a novel drug candidate for the treatment of AUDs comes from
previous work demonstrating that IVM is able to antagonize the
effect of ethanol in vitro on P2X4 receptors (PRX4Rs). Studies
included in this dissertation test the hypothesis that IVM can be
repurposed as a therapeutic agent for the treatment of AUDs using
multiple preclinical mouse models of ethanol intake and behavior.
Chapter 2 describes initial efficacy studies using 3 distinct
models of ethanol intake and explores the pharmacokinetics (PK) of
IVM. Chapter 3 characterizes the intrinsic properties of IVM using
a battery of behavioral paradigms to test for effects such as
depression, anxiety, locomotion, memory, and rewarding properties.
Chapter 4 evaluates the sustainability and safety of multi‐day IVM
administration. Finally, Chapter 5 focuses on the use of IVM as a
platform for developing novel therapeutics for AUDs by testing two
related avermectins, selamectin (SEL) and abamectin (ABM). Findings
from my work support the hypothesis that IVM is able to reduce
ethanol intake using multiple murine models of ethanol intake
without causing overt toxicity. Overall, the studies presented
within this dissertation set the stage for first-in-human testing
of IVM for this new indication.
Advisors/Committee Members: Cadenas, EnriqueDavies, Daryl L. (Committee Chair), Richmond, Frances J. (Committee Member), Neely, Michael J. (Committee Member).
Subjects/Keywords: medications development; alcoholism therapy; drug repositioning
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yardley, M. M. (2016). Development of ivermectin as a platform for the treatment
and/or prevention of alcohol use disorders. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/444768/rec/1949
Chicago Manual of Style (16th Edition):
Yardley, Megan M. “Development of ivermectin as a platform for the treatment
and/or prevention of alcohol use disorders.” 2016. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/444768/rec/1949.
MLA Handbook (7th Edition):
Yardley, Megan M. “Development of ivermectin as a platform for the treatment
and/or prevention of alcohol use disorders.” 2016. Web. 24 Jan 2021.
Vancouver:
Yardley MM. Development of ivermectin as a platform for the treatment
and/or prevention of alcohol use disorders. [Internet] [Doctoral dissertation]. University of Southern California; 2016. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/444768/rec/1949.
Council of Science Editors:
Yardley MM. Development of ivermectin as a platform for the treatment
and/or prevention of alcohol use disorders. [Doctoral Dissertation]. University of Southern California; 2016. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/444768/rec/1949
University of Southern California
5.
Urgaonkar, Rahul.
Optimal resource allocation and cross-layer control in
cognitive and cooperative wireless networks.
Degree: PhD, Electrical Engineering, 2011, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609
► We investigate four problems on optimal resource allocation and cross-layer control in cognitive and cooperative wireless networks with time-varying channels. The first three problems consider…
(more)
▼ We investigate four problems on optimal resource
allocation and cross-layer control in cognitive and cooperative
wireless networks with time-varying channels. The first three
problems consider different models and capabilities associated with
cognition and cooperation in such networks. Specifically, the first
problem focuses on the dynamic spectrum access model for cognitive
radio networks and assumes no cooperation between the licensed (or
"primary") and unlicensed (or "secondary") users. Here, the
secondary users try to avoid interfering with the primary users
while seeking transmission opportunities on vacant primary channels
in frequency, time, or space. The second problem considers a
relay-based fully cooperative wireless network. Here, cooperative
communication techniques at the physical layer are used to improve
the reliability and energy cost of data transmissions. The third
problem considers a cooperative cognitive radio network where the
secondary users can cooperatively transmit with the primary users
to improve the latter's effective transmission rate. In return, the
secondary users get more opportunities for transmitting their own
data when the primary users are idle.; In all of these scenarios,
our goal is to design optimal control algorithms that maximize
time-average network utilities (such as throughput) subject to
time-average constraints (such as power, reliability, etc.). To
this end, we make use of the technique of Lyapunov optimization to
design online control algorithms that can operate without requiring
any knowledge of the statistical description of network dynamics
(such as fading channels, node mobility, and random packet
arrivals) and are provably optimal. The algorithms for the first
two problems use greedy decisions over one slot and two-slot
frames, whereas the algorithm for the third problem involves a
stochastic shortest path decision over a variable length frame, and
this is explicitly solved, remarkably without requiring knowledge
of the network arrival rates.; Finally, in the fourth problem, we
investigate optimal routing and scheduling in static wireless
networks with rateless codes. Rateless codes allow each node of the
network to accumulate mutual information with every packet
transmission. This enables a significant performance gain over
conventional shortest path routing. Further, it also outperforms
cooperative communication techniques that are based on energy
accumulation. However, it requires complex and combinatorial
networking decisions concerning which nodes participate in
transmission, and which decode ordering to use. We formulate the
general problems as combinatorial optimization problems and
identify several structural properties of the optimal solutions.
This enables us to derive optimal greedy algorithms to solve these
problems. This work uses a different set of tools and can be read
independently of the other chapters.
Advisors/Committee Members: Neely, Michael J. (Committee Chair), Krishnamachari, Bhaskar (Committee Member), Caire, Giuseppe (Committee Member), Golubchik, Leana (Committee Member).
Subjects/Keywords: cognitive radio; cooperative communication; optimal control; resource allocation; stochastic optimization; wireless networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Urgaonkar, R. (2011). Optimal resource allocation and cross-layer control in
cognitive and cooperative wireless networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609
Chicago Manual of Style (16th Edition):
Urgaonkar, Rahul. “Optimal resource allocation and cross-layer control in
cognitive and cooperative wireless networks.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609.
MLA Handbook (7th Edition):
Urgaonkar, Rahul. “Optimal resource allocation and cross-layer control in
cognitive and cooperative wireless networks.” 2011. Web. 24 Jan 2021.
Vancouver:
Urgaonkar R. Optimal resource allocation and cross-layer control in
cognitive and cooperative wireless networks. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609.
Council of Science Editors:
Urgaonkar R. Optimal resource allocation and cross-layer control in
cognitive and cooperative wireless networks. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/449856/rec/4609
University of Southern California
6.
Sathiamoorthy, Maheswaran.
Optimizing distributed storage in cloud environments.
Degree: PhD, Electrical Engineering, 2013, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617
► Cloud storage, in the context of this research, is defined to be the abstraction of storage spanning multiple machines into a single storage pool that…
(more)
▼ Cloud storage, in the context of this research, is
defined to be the abstraction of storage spanning multiple machines
into a single storage pool that end-users can access without
knowing the internal details of where or how the storage is
maintained. Traditionally, cloud storage is used to refer to the
storage pool in data centers. In our work, in addition to data
center based cloud storage, we also consider a vehicular network
based cloud storage – storage obtained by pooling together the
storage on vehicles, typically connected by a vehicular network. ❧
In this thesis, we optimize the distributed storage in these two
cloud environments. Specifically, we identify two challenges each
in the two cloud environments and propose solutions to these
challenges. ❧ In Chapter 3, we consider the first important
challenge in the vehicular cloud, namely the high latencies of
on-demand content access. We investigate the benefits of using
erasure codes in reducing the content access latencies through both
analysis and realistic trace-based simulations. We show that a key
parameter affecting the file download latency is the ratio of file
size to download bandwidth. When this ratio is small so that a file
can be communicated in a single encounter, we find that coding
techniques offer very little benefit over simple file replication.
However, we analytically show that for large ratios, for a
memoryless contact model, distributed erasure coding yields a
latency benefit of N/α over uncoded replication, where N is the
number of vehicles and α the redundancy factor. Effectively, in
this regime, coding yields the same performance as replicating all
the files at all other vehicles, but using much less storage. We
also evaluate the benefits of coded storage using large real
vehicle traces of taxis in Beijing and buses in Chicago. These
simulations, which include a realistic radio link quality model for
a IEEE 802.11p dedicated short range communication (DSRC) radio,
validate the observations from the analysis, demonstrating that
coded storage dramatically speeds up the download of large files in
vehicular networks. ❧ In Chapter 4, we consider the second
challenge, namely the problem of helper node allocation. In order
to relay a file from a node that has the file to another that wants
the file, it may be necessary to enlist the help of other relaying
nodes. When there are multiple types of files, an existing pool of
helper nodes cannot help the dissemination of all the files due to
storage and bandwidth constraints. In the chapter, we formulate and
address mathematically this fundamental problem of resource
allocation in the form of helper nodes in disseminating multiple
contents. We consider a stochastic homogeneous contact process for
the nodes in the vehicular network, or more generally an
intermittently connected mobile network. We consider and solve two
variations of the problem – one in which the goal is to maximize
the expected number of demands satisfied and another in which the
goal is to minimize the time taken to disseminate…
Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Neely, Michael J. (Committee Member), Yu, Minlan (Committee Member), Dimakis, Alexandros G. (Committee Member), Bai, Fan (Committee Member).
Subjects/Keywords: cloud environment; data centers; distributed storage; erasure codes; optimization; vehicular networking
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sathiamoorthy, M. (2013). Optimizing distributed storage in cloud environments. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617
Chicago Manual of Style (16th Edition):
Sathiamoorthy, Maheswaran. “Optimizing distributed storage in cloud environments.” 2013. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617.
MLA Handbook (7th Edition):
Sathiamoorthy, Maheswaran. “Optimizing distributed storage in cloud environments.” 2013. Web. 24 Jan 2021.
Vancouver:
Sathiamoorthy M. Optimizing distributed storage in cloud environments. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617.
Council of Science Editors:
Sathiamoorthy M. Optimizing distributed storage in cloud environments. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/351890/rec/4617
University of Southern California
7.
Li, Chih-ping.
Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay.
Degree: PhD, Electrical Engineering, 2011, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078
► This dissertation addresses several optimal stochastic scheduling problems that arise in partially observable wireless networks and multi-class queueing systems. They are single-hop network control problems…
(more)
▼ This dissertation addresses several optimal stochastic
scheduling problems that arise in partially observable wireless
networks and multi-class queueing systems. They are single-hop
network control problems under different channel connectivity
assumptions and different scheduling constraints. Our goals are
two-fold: To identify stochastic scheduling problems of practical
interest, and to develop analytical tools that lead to efficient
control algorithms with provably optimal performance. ❧ In wireless
networks, we study three sets of problems. First, we explore how
the energy and timing overhead due to channel probing affects
network performance. We develop a dynamic channel probing algorithm
that is both throughput and energy optimal. The second problem is
how to exploit time correlations of wireless channels to improve
network throughput when instantaneous channel states are
unavailable. Specifically, we study the network capacity region
over a set of Markov ON/OFF channels with unknown current states.
Recognizing that this is a difficult restless multi-armed bandit
problem, we construct a non-trivial inner bound on the network
capacity region by randomizing well-designed round robin policies.
This inner bound is considered as an operational network capacity
region because it is large and easily achievable. A queue-dependent
round robin policy is constructed to support any throughput vector
within the inner bound. In the third problem, we study throughput
utility maximization over partially observable Markov ON/OFF
channels (specifically, over the inner bound provided in the
previous problem). It has applications in wireless networks with
limited channel probing capability, cognitive radio networks,
target tracking of unmanned aerial vehicles, and restless
multi-armed bandit systems. An admission control and channel
scheduling policy is developed to achieve near-optimal throughput
utility within the inner bound. Here we use a novel ratio MaxWeight
policy that generalizes the existing MaxWeight-type policies from
time-slotted networks to frame-based systems that have
policy-dependent random frame sizes. ❧ In multi-class queueing
systems, we study how to optimize average service cost and
per-class average queueing delay in a nonpreemptive multi-class
M/G/1 queue that has adjustable service rates. Several convex delay
penalty and service cost minimization problems with time-average
constraints are investigated. We use the idea of virtual queues to
transform these problems into a new set of queue stability
problems, and the queue-stable policies are the desired solutions.
The solutions are variants of dynamic c-mu rules, and implement
weighted priority policies in every busy period, where the weights
are functions of past queueing delays in each job class. ❧
Throughout these problems, our analysis and algorithm design uses
and generalizes an achievable region approach driven by Lyapunov
drift theory. We study the performance region (in throughput,
power, or delay) of interest and identify, or design, a policy
space so…
Advisors/Committee Members: Neely, Michael J. (Committee Chair), Caire, Giuseppe (Committee Member), Jain, Rahul (Committee Member), Krishnamachari, Bhaskar (Committee Member), Ward, Amy R. (Committee Member).
Subjects/Keywords: stochastic network optimization; queueing theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, C. (2011). Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078
Chicago Manual of Style (16th Edition):
Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078.
MLA Handbook (7th Edition):
Li, Chih-ping. “Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay.” 2011. Web. 24 Jan 2021.
Vancouver:
Li C. Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078.
Council of Science Editors:
Li C. Stochastic optimization over parallel queues: channel-blind
scheduling, restless bandit, and optimal delay. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/159793/rec/6078
University of Southern California
8.
Yao, Yuan.
QoS-aware algorithm design for distributed systems.
Degree: PhD, Electrical Engineering, 2012, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/114853/rec/5341
► With the fast development of networking technology, modern distributed systems are designed to provide a variety of services. In this dissertation, we focus on algorithm…
(more)
▼ With the fast development of networking technology,
modern distributed systems are designed to provide a variety of
services. In this dissertation, we focus on algorithm design for
four different types of distributed systems with consideration of
quality of service as well as resource constraints. ❧ We design
algorithms for (i) data transmission system (ii) geographically
distributed data centers, (iii) structured peer to peer video
streaming systems, and (iv) wireless sensor systems. These systems
differ from each other in several dimensions — functionality,
resource availability, and workload characteristics. As illustrated
in this dissertation, our approaches are built on a common theme:
understanding and exploitation of resource avail- ability and
workload characteristics. ❧ More specifically, in this document we
focus on the following topics: for data trans- mission systems, we
provide scheduling algorithms as well as performance bounds aimed
at reducing the cost on bandwidth, which is accounted based on 95th
percentile rule. For geographically distributed data centers that
serve delay tolerant workloads, we design a stochastic optimization
based approach for making routing and server management decisions,
so as to reduce the cost of power, while maintaining quality of
service. For structured peer to peer streaming systems, we provide
two different peer communication algorithms that achieve different
levels of trade-offs in performance metrics such as playback delay
and buffer size. For wireless sensor systems, we develop an online,
low resource usage anomaly detection algorithm that accurately
identifies interesting events in sensor readings.
Advisors/Committee Members: Golubchik, Leana (Committee Chair), Neely, Michael J. (Committee Member), Govindan, Ramesh (Committee Member), Teng, Shang-hua (Committee Member).
Subjects/Keywords: performance analysis; distributed system; algorithm
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yao, Y. (2012). QoS-aware algorithm design for distributed systems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/114853/rec/5341
Chicago Manual of Style (16th Edition):
Yao, Yuan. “QoS-aware algorithm design for distributed systems.” 2012. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/114853/rec/5341.
MLA Handbook (7th Edition):
Yao, Yuan. “QoS-aware algorithm design for distributed systems.” 2012. Web. 24 Jan 2021.
Vancouver:
Yao Y. QoS-aware algorithm design for distributed systems. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/114853/rec/5341.
Council of Science Editors:
Yao Y. QoS-aware algorithm design for distributed systems. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/114853/rec/5341
University of Southern California
9.
Jones, Allan C.
A rational pharmacokinetic model for predicting
osteonecrosis of the jaws related to alendronate and
pamidronate.
Degree: MS, Pharmaceutical Sciences, 2011, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644887/rec/331
► Alendronate is the most frequently prescribed drug for the treatment and prevention of low bone mineral density worldwide. It is nearly identical to pamidronate, the…
(more)
▼ Alendronate is the most frequently prescribed drug for
the treatment and prevention of low bone mineral density worldwide.
It is nearly identical to pamidronate, the first
aminobisphosphonate used for therapeutic inhibition of bone
resorption. Approved in 1991, pamidronate has become widely used as
an intravenous drug for treatment of metastatic lesions of cancer
in bone since 2000. In 2003, osteonecrosis of the jaws was
discovered to occur in cancer patients treated with pamidronate
and, to a much lesser degree, those who were treated with oral
alendronate for osteopenia and osteoporosis. The necrotic lesions
of the jaws occurred in dental patients who had undergone surgery.
This malady is now commonly described as bisphosphonate-related
osteonecrosis of the jaws. ❧ There is controversy in the dental
profession regarding the route of administration in the
pathogenesis of this disease. Organized dentistry, with no rational
basis, has promulgated the opinion that alendronate, though nearly
identical in all manner of pharmacological behavior, carries less
risk for causing osteonecrosis. It is the opinion of two prominent
dental organizations that there is no risk of osteonecrosis for
patients undergoing oral surgical procedures for the first three
years of therapy with oral alendronate. ❧ A recent USC School of
Dentistry study disagrees. Here it was discovered that surgery
patients were at risk for this disease within one year of initiated
oral therapy with alendronate. This study shows that oral
bisphosphonates do indeed pose the same risk as intravenous
bisphosphonates. ❧ Intravenous pamidronate and oral alendronate
differ only in the dosing and rate of accumulation in the skeleton.
This thesis is a rational attempt to quantify the time required for
oral pamidronate and, by analogy oral alendronate, to reach the
toxic threshold for induction of osteonecrosis. This threshold was
recently proposed through in vitro methodology by Landesberg et al.
❧ Serge Cremers, the Dutch pharmacokinetics expert, developed a
model in 2002 for bisphosphonate accumulation in bone that
comingled data for alendronate. He reasoned, as we do in this
study, that the molecular features of the two drugs would confer
similar pharmacokinetic characteristics. The urine and serum data
from this study were provided to the Laboratory of Applied
Pharmacokinetic (LAPK), Keck School of Medicine of USC. This
allowed for the creation of a new model of pamidronate accumulation
in skeletal tissues with nonparametric adaptive grid software
(NPAG), LAPK’s Bayesian approach to nonparametric pharmacokinetic
studies. As a coauthor with Landesberg et al, Cremers and his
colleagues established an in vitro threshold for toxicity to
keratinocyte migration that defines the most plausible mechanism to
date for bisphosphonate-related osteonecrosis of the jaws.
Specifically, they determined a threshold concentration for
pamidronate in solution wherein cellular migration essential to
healing is completely inhibited without apoptosis. LAPK determined
the concentration of…
Advisors/Committee Members: Okamoto, Curtis T. (Committee Chair), Jelliffe, Roger (Committee Member), Neely, Michael J. (Committee Member), Hamm-Alvarez, Sarah F. (Committee Member).
Subjects/Keywords: bisphosphonate; osteonecrosis; alendronate; pamidronate; Bayesian; pharmacokinetic
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jones, A. C. (2011). A rational pharmacokinetic model for predicting
osteonecrosis of the jaws related to alendronate and
pamidronate. (Masters Thesis). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644887/rec/331
Chicago Manual of Style (16th Edition):
Jones, Allan C. “A rational pharmacokinetic model for predicting
osteonecrosis of the jaws related to alendronate and
pamidronate.” 2011. Masters Thesis, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644887/rec/331.
MLA Handbook (7th Edition):
Jones, Allan C. “A rational pharmacokinetic model for predicting
osteonecrosis of the jaws related to alendronate and
pamidronate.” 2011. Web. 24 Jan 2021.
Vancouver:
Jones AC. A rational pharmacokinetic model for predicting
osteonecrosis of the jaws related to alendronate and
pamidronate. [Internet] [Masters thesis]. University of Southern California; 2011. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644887/rec/331.
Council of Science Editors:
Jones AC. A rational pharmacokinetic model for predicting
osteonecrosis of the jaws related to alendronate and
pamidronate. [Masters Thesis]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/644887/rec/331
University of Southern California
10.
Huang, Longbo.
Deterministic mathematical optimization in stochastic
network control.
Degree: PhD, Electrical Engineering, 2011, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900
► In this thesis, we extend the recently developed Lyapunov optimization technique (also known as Max-Weight or Backpressure) for stochastic queueing networks in two important directions:…
(more)
▼ In this thesis, we extend the recently developed
Lyapunov optimization technique (also known as Max-Weight or
Backpressure) for stochastic queueing networks in two important
directions: (1) guaranteeing small network delay; and (2) resolving
underflows. ❧ To achieve our objective, we first establish an
explicit connection between the Lyapunov technique and a randomized
dual subgradient method. Based on this connection, we develop a
novel exponential attraction result, which states that the network
queue backlog under a Lyapunov algorithm deviates from a certain
fixed point with a probability that decreases exponentially in the
deviation distance. Inspired by the exponential attraction result,
we develop three delay-efficient algorithms and show that they
achieve near-optimal utility-delay tradeoffs for a general class of
multi-hop communication networks. One of the algorithms has also
been implemented on a sensor network testbed and was shown to be
able to guarantee very small network delay in practical systems. ❧
We later consider the problem of resolving underflows in general
complex network scheduling problems. In this case, we propose the
weight perturbation technique and develop the Perturbed Max-Weight
algorithm (PMW). We show that PMW effectively resolves underflow
constraints without sacrificing utility performance. We then apply
the perturbation technique to construct utility optimal scheduling
algorithms for two important classes of networks – stochastic
processing networks and energy harvesting networks. ❧ The results
developed in this thesis highlight the importance of Lagrange
multiplier engineering in queueing networks. Specifically, our
results show that the queues under the Lyapunov technique indeed
correspond to the Lagrange multiplier values under the randomized
dual subgradient method. This not only helps us better understand
the Lyapunov technique, but also gives us general guidelines on how
should one design its algorithm to achieve the desire properties of
the queues.
Advisors/Committee Members: Neely, Michael J. (Committee Chair), Caire, Giuseppe (Committee Member), Jain, Rahul (Committee Member), Kempe, David (Committee Member), Krishnamachari, Bhaskar (Committee Member), Wierman, Adam (Committee Member).
Subjects/Keywords: stochastic network control; network delay; queueing; Lyapunov analysis; processing networks; energy harvesting networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Huang, L. (2011). Deterministic mathematical optimization in stochastic
network control. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900
Chicago Manual of Style (16th Edition):
Huang, Longbo. “Deterministic mathematical optimization in stochastic
network control.” 2011. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900.
MLA Handbook (7th Edition):
Huang, Longbo. “Deterministic mathematical optimization in stochastic
network control.” 2011. Web. 24 Jan 2021.
Vancouver:
Huang L. Deterministic mathematical optimization in stochastic
network control. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900.
Council of Science Editors:
Huang L. Deterministic mathematical optimization in stochastic
network control. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/620567/rec/1900
University of Southern California
11.
Sharma, Abhishek Bhan.
Adaptive resource management in distributed systems.
Degree: PhD, Computer Science, 2010, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420633/rec/514
► In this dissertation, we focus on resource management in distributed systems. The essence of resource management is to match the requirements of computing tasks with…
(more)
▼ In this dissertation, we focus on resource management
in distributed systems. The essence of resource management is to
match the requirements of computing tasks with the available
resources. We propose and develop approaches to resource management
in three qualitatively different systems: (1) server clusters
providing computing-as-a-service, (2) tiered-architecture (of
servers) hosting web services, and (3) networks of wireless
sensors. These systems differ from each other along multiple
dimensions: available resources, system dynamics, workload, etc.
Still, a common theme in effective resource management for these
systems (as demonstrated in this dissertation) is that we must be
cognizant of the system heterogeneity (computing resources as well
as workload), and adapt to system dynamics. Our work improves upon
the state-of-the-art in the three systems in the following way. For
systems providing computing-as-a-service, we design and implement a
service model that provides predictability in job finish times and
prioritized service to delay sensitive jobs. We also develop a
machine learning based workload characterization technique for web
services that categorizes users' request based on their resource
usage. Such categorization is useful in improving the accuracy of
performance models for these systems. In the context of wireless
sensor networks, we make the following two contributions: (1) we
design an online algorithm that makes joint compression and
transmission decisions to save energy, and (2) we explore
techniques for detecting anomalies in data collected using these
networks.
Advisors/Committee Members: Govindan, RameshGolubchik, Leana (Committee Chair), Neely, Michael J. (Committee Member).
Subjects/Keywords: computing-as-a-service; wireless networks; stochastic network optimization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sharma, A. B. (2010). Adaptive resource management in distributed systems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420633/rec/514
Chicago Manual of Style (16th Edition):
Sharma, Abhishek Bhan. “Adaptive resource management in distributed systems.” 2010. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420633/rec/514.
MLA Handbook (7th Edition):
Sharma, Abhishek Bhan. “Adaptive resource management in distributed systems.” 2010. Web. 24 Jan 2021.
Vancouver:
Sharma AB. Adaptive resource management in distributed systems. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420633/rec/514.
Council of Science Editors:
Sharma AB. Adaptive resource management in distributed systems. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420633/rec/514
University of Southern California
12.
Paek, Jeongyeup.
Rate adaptation in networks of wireless sensors.
Degree: PhD, Computer Science, 2010, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/419890/rec/5408
► In this dissertation we explore rate-adaptation in networks of wireless sensors. We investigate how the concept of rate adaptation can be used to build sensing…
(more)
▼ In this dissertation we explore rate-adaptation in
networks of wireless sensors. We investigate how the concept of
rate adaptation can be used to build sensing systems that adapt to
the network and environment dynamics. Specifically, we design a
rate-adaptive transport protocol that can reliably and efficiently
deliver sensor data on an architecture that respects the
technological constraints of the embedded sensors. We also design a
rate-adaptive sensing system that adapts to the environment and the
behavior of the user to provide energy-efficient location sensing.;
We first present the Tenet architecture that respects the
technological constraints of the embedded sensors. Tenet constrains
multinode fusion to the master tier while allowing motes to process
locally-generated sensor data. We show through extensive evaluation
and real-world deployments that Tenet architecture simplifies
application development and allows mote-tier software to be reused
without significant loss of performance. We also show that tiered
architecture scales network capacity and allows reliable delivery
of high rate data.; We next present RCRT, a rate-controlled
reliable transport protocol suitable for resource constrained
sensor nodes in wireless sensor networks. RCRT uses end-to-end
explicit loss recovery, but places all the congestion detection and
rate adaptation functionality in the sinks. We show that, because
sinks make rate allocation decisions, they are able to achieve
greater efficiency and flexibility since they have a more
comprehensive view of network behavior. We evaluate RCRT
extensively on a real wireless sensor network testbed and show that
RCRT achieves a significantly better rate than that achieved by
IFRC and WRCP, two recently proposed interference-aware distributed
rate-control protocols. We also present results from a 3-month-long
real world deployment of RCRT in an imaging application and show
that RCRT works well in real long-term deployments.; Finally, we
present RAPS, a rate-adaptive positioning system for smartphone
applications. It is based on the observation that GPS is generally
less accurate in urban areas, so it suffices to turn on GPS only as
often as necessary to achieve this accuracy. RAPS uses a collection
of techniques and sensors to cleverly determine whether and when to
turn on GPS. We evaluate RAPS through real-world experiments using
a prototype implementation on a modern smartphone and show that it
can increase phone lifetimes by more than a factor of 3.8 over an
approach where GPS is always on.
Advisors/Committee Members: Govindan, Ramesh (Committee Chair), Neely, Michael J. (Committee Member), Psounis, Konstantinos (Committee Member).
Subjects/Keywords: rate adaptation; tiered embedded network; wireless sensor network; mobile smartphone; centralized congestion control; energy efficiency; wireless network; software architecture
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Paek, J. (2010). Rate adaptation in networks of wireless sensors. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/419890/rec/5408
Chicago Manual of Style (16th Edition):
Paek, Jeongyeup. “Rate adaptation in networks of wireless sensors.” 2010. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/419890/rec/5408.
MLA Handbook (7th Edition):
Paek, Jeongyeup. “Rate adaptation in networks of wireless sensors.” 2010. Web. 24 Jan 2021.
Vancouver:
Paek J. Rate adaptation in networks of wireless sensors. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/419890/rec/5408.
Council of Science Editors:
Paek J. Rate adaptation in networks of wireless sensors. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/419890/rec/5408
University of Southern California
13.
Sridharan, Avinash.
Transport layer rate control protocols for wireless sensor
networks: from theory to practice.
Degree: PhD, Electrical Engineering, 2009, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/182703/rec/7605
► Because of limited bandwidth availability and their typical dense, multi-hop deployment, wireless sensor networks have a fundamental need for efficient transport layer rate control. State…
(more)
▼ Because of limited bandwidth availability and their
typical dense, multi-hop deployment, wireless sensor networks have
a fundamental need for efficient transport layer rate control.
State of the art transport layer rate control protocols in wireless
sensor networks are primarily heuristics that rely on Additive
Increase Multiplicative Decrease (AIMD) mechanisms. This
heuristic-based design of state of the art rate control protocols
raises two key issues: first, due to the AIMD based mechanism the
protocols suffer from long convergence times and large end-to-end
packet delays; second, existing protocols are monolithic in design,
either focusing purely on congestion control functionality without
regard for rate utility optimization, or trying to optimize for a
specific rate utility function. We improve upon the state of the
art by proposing two rate control protocols that address the above
issues. To address the issue of long convergence times and large
end-to-end packet delays, we propose the Wireless Rate Control
Protocol (WRCP). To address the issue of monolithic protocol
design, we propose the Backpressure-based Rate Control Protocol
(BRCP).; WRCP, to our knowledge, is the first explicit and precise
rate control protocol for wireless sensor networks. WRCP has been
designed using a novel interference model, called the receiver
capacity model. The model helps determine the exact available
capacity at each receiver in the network. WRCP uses the available
capacity information presented by the model, and distributes this
capacity amongst contending flows in a neighborhood in order to
achieve a lexicographic max-min fair rate allocation. The use of
explicit capacity information allows WRCP to exhibit fast
convergence time. The explicit capacity information also allows
WRCP to operate within the capacity region, resulting in small
end-to-end delays.; BRCP is a, novel, flexible rate control
protocol that has the ability to optimize for any concave
rate-utility function. The design of BRCP is achieved by applying
Lyapunov drift based stochastic optimization techniques to a
Carrier Sense Medium Access (CSMA) based MAC. The ability of BRCP
to make rate control decisions purely on local queue information
makes it extremely useful in a wireless sensor network, since it
requires minimal control information exchange.
Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Govindan, Ramesh (Committee Member), Neely, Michael J. (Committee Member).
Subjects/Keywords: wireless sensor networks; congestion control; rate control; transport layer protocol; protocol design; wireless networks; cross-layer protocol design
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sridharan, A. (2009). Transport layer rate control protocols for wireless sensor
networks: from theory to practice. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/182703/rec/7605
Chicago Manual of Style (16th Edition):
Sridharan, Avinash. “Transport layer rate control protocols for wireless sensor
networks: from theory to practice.” 2009. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/182703/rec/7605.
MLA Handbook (7th Edition):
Sridharan, Avinash. “Transport layer rate control protocols for wireless sensor
networks: from theory to practice.” 2009. Web. 24 Jan 2021.
Vancouver:
Sridharan A. Transport layer rate control protocols for wireless sensor
networks: from theory to practice. [Internet] [Doctoral dissertation]. University of Southern California; 2009. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/182703/rec/7605.
Council of Science Editors:
Sridharan A. Transport layer rate control protocols for wireless sensor
networks: from theory to practice. [Doctoral Dissertation]. University of Southern California; 2009. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/182703/rec/7605
University of Southern California
14.
Moeller, Scott Harrison.
Dynamic routing and rate control in stochastic network
optimization: from theory to practice.
Degree: PhD, Electrical Engineering, 2010, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/422505/rec/2130
► Real-world applications of wireless sensor networks are frequently faced with network capacity constraints, restricting the sensing frequency or scalability of the deployment. In the absence…
(more)
▼ Real-world applications of wireless sensor networks
are frequently faced with network capacity constraints, restricting
the sensing frequency or scalability of the deployment. In the
absence of transport-layer rate control the allocation of network
capacity can be highly asymmetric, favoring sensing nodes near the
collection agent. Further, external interference and new
participatory sensing paradigms can result in highly dynamic
collection topologies. Lastly, protocols for the
resource-constrained networks must emphasize low complexity while
minimizing control overhead. Addressing these challenges, we
present a novel backpressure-based routing and rate-control stack
that is motivated by stochastic network optimization theory.;
Current data collection protocols for wireless sensor networks are
mostly based on quasi-static minimum-cost routing trees. We first
consider an alternative, highly-agile approach called backpressure
routing, in which routing and forwarding decisions are made on a
per-packet basis. Although there is considerable theoretical
literature on backpressure routing, it has not been previously
implemented on practical systems due to concerns of packet looping,
the effect of link losses, large packet delays, and scalability. We
present the Backpressure Collection Protocol (BCP) for sensor
networks, the first- ever implementation of dynamic backpressure
routing in wireless networks. In particular, we demonstrate for the
first time that replacing the traditional FIFO queue service in
backpressure routing with LIFO queues reduces the average
end-to-end packet delays for delivered packets drastically (75%
under high load, 98% under low load). Further, we improve
backpressure scalability by introducing a new concept of floating
queues into the backpressure framework. Under static network
settings, BCP shows a more than 60% improvement in max-min rate
over the state of the art Collection Tree Protocol (CTP). We also
empirically demonstrate the superior delivery performance of BCP in
dynamic network settings, including conditions of extreme external
interference and highly mobile sinks.; Backpressure-based
stochastic network optimization theory employs a tunable
optimization parameter, V . As V is increased, utility or penalty
performance approaches the optimal like O( 1 ) while delay grows
linearly in V . We provide analysis motivating V the novel usage of
the LIFO queueing discipline in backpressure stacks, suggesting
that delay scales near-optimally like O(log2(V )) for all but a
small fraction of traffic. We then empirically evaluate delay and
discard performance of BCP as the V parameter is raised, and find
the results in strong agreement with theory.; Finally, we turn our
attention to state of the art rate control protocols for wireless
sensor networks, which are traditionally assumed to run atop the
aforementioned quasi- static routing trees. We implement and
empirically explore a backpressure rate controller, theoretically
capable of maximizing an aggregate source utility function while
the underlying…
Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Neely, Michael J. (Committee Member), Govindan, Ramesh (Committee Member).
Subjects/Keywords: wireless sensor networks; stochastic network optimization; systems; computer networks; backpressure; routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Moeller, S. H. (2010). Dynamic routing and rate control in stochastic network
optimization: from theory to practice. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/422505/rec/2130
Chicago Manual of Style (16th Edition):
Moeller, Scott Harrison. “Dynamic routing and rate control in stochastic network
optimization: from theory to practice.” 2010. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/422505/rec/2130.
MLA Handbook (7th Edition):
Moeller, Scott Harrison. “Dynamic routing and rate control in stochastic network
optimization: from theory to practice.” 2010. Web. 24 Jan 2021.
Vancouver:
Moeller SH. Dynamic routing and rate control in stochastic network
optimization: from theory to practice. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/422505/rec/2130.
Council of Science Editors:
Moeller SH. Dynamic routing and rate control in stochastic network
optimization: from theory to practice. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/422505/rec/2130
University of Southern California
15.
Chen, Wanshi.
Energy-efficient packet transmissions with delay constraints
for wireless communications.
Degree: PhD, Electrical Engineering, 2009, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/168069/rec/2362
► There exists a fundamental trade-off between transmission energy and packet delay in wireless communications. In a static channel, a closed form solution of the optimal…
(more)
▼ There exists a fundamental trade-off between
transmission energy and packet delay in wireless communications. In
a static channel, a closed form solution of the optimal offline
scheduling (vis-à-vis total transmission energy), assuming
information of all packet arrivals, for a set of packets each
subject to an individual delay constraint is derived. It is shown
that when packet arrivals are identically and independently
distributed, the optimal packet transmission durations (or,
equivalently, transmission rates) exhibit a symmetry property,
which leads to a simple and exact solution of the average packet
delay. The delay performance for the optimal offline scheduling of
a set of packets subject to a single transmission deadline is also
analyzed and shown to be potentially unbounded. The problem of
optimal offline scheduling is then extended to fading channels. The
properties of the optimal offline transmission rates and the
corresponding delay performance are also characterized. Heuristic
online schedulers, assuming causal information only, are also
studied. The properties of the optimal offline scheduling are
demonstrated via simulations.; Delay-constrained energy-efficient
packet transmission is then considered under a multihop link. For
static channels, given an end-to-end delay constraint for each
packet, the optimal offline scheduling over a multihop link is
obtained. The transmission energy and average packet delay
performance are analyzed and characterized. Extension to fading
channels is also considered. It is further demonstrated via
simulations that energy savings via multihopping are possible, but
heavily depend on factors such as multihop resource
orthogonalization mode, scheduling algorithms, delay constraints,
SNR operation regions, and channel variations.; Packet transmission
over wireless channels is subject to losses. Note that some
applications can tolerate a small fraction of packet losses.
Therefore, we initiate the study of proactive packet dropping,
while satisfying the required maximum packet loss rate, to maximize
transmission energy savings. The optimal and suboptimal packet
dropping schemes are investigated under both the single
transmission deadline model and the individual delay constraint
model. It is found that proactive packet dropping yields
substantial transmission energy savings, as evidenced via
simulation results.
Advisors/Committee Members: Mitra, Urbashi (Committee Chair), Neely, Michael J. (Committee Member), Govindan, Ramesh (Committee Member).
Subjects/Keywords: minimum energy transmission; optimal scheduler; individual delay constraint; single transmission deadline; majorization theory; fading channels; packet dropping; multithop
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, W. (2009). Energy-efficient packet transmissions with delay constraints
for wireless communications. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/168069/rec/2362
Chicago Manual of Style (16th Edition):
Chen, Wanshi. “Energy-efficient packet transmissions with delay constraints
for wireless communications.” 2009. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/168069/rec/2362.
MLA Handbook (7th Edition):
Chen, Wanshi. “Energy-efficient packet transmissions with delay constraints
for wireless communications.” 2009. Web. 24 Jan 2021.
Vancouver:
Chen W. Energy-efficient packet transmissions with delay constraints
for wireless communications. [Internet] [Doctoral dissertation]. University of Southern California; 2009. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/168069/rec/2362.
Council of Science Editors:
Chen W. Energy-efficient packet transmissions with delay constraints
for wireless communications. [Doctoral Dissertation]. University of Southern California; 2009. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/168069/rec/2362
University of Southern California
16.
Chang, Yu-Jung.
Resource allocation in OFDM/OFDMA cellular networks:
protocol design and performance analysis.
Degree: PhD, Electrical Engineering, 2008, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/118908/rec/5560
► Orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) are two promising technologies adopted in the IEEE 802.16 standard to support broadband…
(more)
▼ Orthogonal frequency division multiplexing (OFDM) and
orthogonal frequency division multiple access (OFDMA) are two
promising technologies adopted in the IEEE 802.16 standard to
support broadband wireless access as well as multimedia
quality-of-service (QoS). In this dissertation, we discuss several
important topics regarding OFDM/OFDMA: cross-layer performance
analysis of OFDM and OFDMA downlinks in terms of several QoS
metrics; the medium access control (MAC) protocol design for the
OFDMA uplink; and the inter-cell interference (ICI) management in
multi-cell OFDMA networks through a systematic approach.; First,
performance analysis of OFDM-TDMA and OFDMA networks is performed
in terms of cross-layer QoS measures which include the bit rate and
the bit error rate (BER) in the physical layer, and packet average
throughput/delay and packet maximum delay in the link layer. We
adopt a cross-layer QoS framework similar to that in IEEE 802.16,
where service classification, flow control and opportunistic
scheduling with different subcarrier/bit allocation schemes are
implemented. Our analysis provides important insights into the
performance differences of these two multiaccess systems. In
addition, it is shown by analysis and simulation that OFDMA
outperforms OFDM-TDMA in QoS metrics of interest. Thus, we conclude
that OFDMA has higher potential in supporting multimedia services.;
Second, a distributed MAC algorithm for uplink OFDMA networks under
the IEEE 802.16 framework is proposed and analyzed. We present a
simple yet efficient algorithm to enhance the system throughput by
integrating opportunistic medium access and collision resolution
through random subchannel backoff. Consequently, the resulting
algorithm is called the opportunistic access with random subchannel
backoff (OARSB) scheme. OARSB not only achieves distributed
coordination among users but also reduces the amount of information
exchange between the base station and users. The throughput and
delay performance analysis of OARSB is conducted, and the superior
performance of OARSB over an existing scheme is demonstrated by
analysis as well as computer simulation. Besides, the proposed
OARSB scheme can be easily implemented in 802.16 due to its
simplicity.; Lastly, a practical and low-complexity multi-cell
OFDMA downlink channel assignment method using a graphic framework
is proposed. Our solution consists of two phases: 1) a coarse-scale
inter-cell interference (ICI) management scheme and 2) a fine-scale
channel-aware resource allocation scheme. In the first phase, the
task of managing the performance-limiting ICI in cellular networks
is accomplished by a graphic approach, in which no ICI measurement
is needed and state-of-the-art ICI management schemes such as ICI
coordination (ICIC) and base station cooperation (BSC) can be
incorporated easily. In the second phase, channel assignment is
accomplished by taking instantaneous channel conditions into
account. Heuristic algorithms are proposed to solve both phases of
the problem efficiently. Extensive simulation…
Advisors/Committee Members: Kuo, C.-C. Jay (Committee Chair), Neely, Michael J. (Committee Member), Govindan, Ramesh (Committee Member).
Subjects/Keywords: OFDM; OFDMA; MAC protocol design; performance analysis; resource allocation; interference management; IEEE 802.16; cellular networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chang, Y. (2008). Resource allocation in OFDM/OFDMA cellular networks:
protocol design and performance analysis. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/118908/rec/5560
Chicago Manual of Style (16th Edition):
Chang, Yu-Jung. “Resource allocation in OFDM/OFDMA cellular networks:
protocol design and performance analysis.” 2008. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/118908/rec/5560.
MLA Handbook (7th Edition):
Chang, Yu-Jung. “Resource allocation in OFDM/OFDMA cellular networks:
protocol design and performance analysis.” 2008. Web. 24 Jan 2021.
Vancouver:
Chang Y. Resource allocation in OFDM/OFDMA cellular networks:
protocol design and performance analysis. [Internet] [Doctoral dissertation]. University of Southern California; 2008. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/118908/rec/5560.
Council of Science Editors:
Chang Y. Resource allocation in OFDM/OFDMA cellular networks:
protocol design and performance analysis. [Doctoral Dissertation]. University of Southern California; 2008. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/118908/rec/5560
University of Southern California
17.
Hsu, Alex Chia-Chun.
Coexistence mechanisms for legacy and next generation
wireless networks protocols.
Degree: PhD, Electrical Engineering, 2008, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/591411/rec/1422
► Effective usage of unlicensed bands (UB) has received a lot of attention due to its potential in ubiquitous computing and networking. One key issue in…
(more)
▼ Effective usage of unlicensed bands (UB) has received
a lot of attention due to its potential in ubiquitous computing and
networking. One key issue in effective UB usage is the coexistence
among devices of homogeneous or heterogeneous systems, e.g.
wireless local area networks (WLAN) and wireless personal area
networks (WPAN). To resolve the coexistence problem, we need to
understand the interaction between concurrent transmissions in
overlapping frequency bands. Although some basic interference
resolving process is mentioned in the standards, further
performance improvement can be achieved by careful system analysis
and parameter selection. In this research, we analyze the
coexistence problem that these systems face and devise coexistence
mechanisms to enhance performance.; We develop a suitable
analytical model that can accurately model the interference
phenomena between WLANs and WPANs. Then, we propose
non-collaborative solutions for WLAN and WPAN, respectively. For
WLAN, we propose a dynamic fragmentation (DF) mechanism to optimize
the packet length such that Wi-Fi devices have better chance to
avoid the interference caused by Bluetooth piconets. Both
theoretical analysis and simulation results confirm that DF can
significantly improve the performance of Wi-Fi in terms of
throughput and transmission delay.; For WPAN, we propose an
adaptive hopset frequency hopping (AHFH) mechanism to avoid the
interference from coexisting WLAN as well as the self-interference
from collocating Bluetooth piconets. With AHFH, a piconet adjusts
its hopset to minimize the interference adaptively. Results show
that AHFH improves performance and adaptability to the dynamic
changes in the environment.; Stale and inefficient current spectrum
regulation and the crowded ISM band makes flexible "cognitive radio
(CR)" the logical next step. Along this research direction, we
propose a statistic channel allocation MAC (SCA-MAC) and a dynamic
spectrum access MAC (DSA-MAC). Both protocols can exploit the
"spectrum hole" on unlicensed bands and minimize their interference
on incumbent users and collision with other CR nodes. SCA-MAC
avoids interference with primary services through statistics, and
improves spectrum efficiency. DSA-MAC further investigates
strategies of the operation range assignment. Three strategies,
namely, non-sharing (NS), partial sharing (PS) and full sharing
(FS), were discussed and compared under various scenarios. It is
shown that FS gives the best throughput.
Advisors/Committee Members: Kuo, C. C. Jay (Committee Chair), Neely, Michael J. (Committee Member), Govindan, Ramesh (Committee Member).
Subjects/Keywords: MAC protocol; Wi-Fi 802.11; Bluetooth 802.15
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hsu, A. C. (2008). Coexistence mechanisms for legacy and next generation
wireless networks protocols. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/591411/rec/1422
Chicago Manual of Style (16th Edition):
Hsu, Alex Chia-Chun. “Coexistence mechanisms for legacy and next generation
wireless networks protocols.” 2008. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/591411/rec/1422.
MLA Handbook (7th Edition):
Hsu, Alex Chia-Chun. “Coexistence mechanisms for legacy and next generation
wireless networks protocols.” 2008. Web. 24 Jan 2021.
Vancouver:
Hsu AC. Coexistence mechanisms for legacy and next generation
wireless networks protocols. [Internet] [Doctoral dissertation]. University of Southern California; 2008. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/591411/rec/1422.
Council of Science Editors:
Hsu AC. Coexistence mechanisms for legacy and next generation
wireless networks protocols. [Doctoral Dissertation]. University of Southern California; 2008. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/591411/rec/1422
University of Southern California
18.
Gummadi, Ramakrishna.
Reliable languages and systems for sensor networks.
Degree: PhD, Computer Science, 2007, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/539187/rec/5524
► Sensor networks promise to allow the world around us to be observed, measured, and even controlled at a fine granularity. However, in order to realize…
(more)
▼ Sensor networks promise to allow the world around us
to be observed, measured, and even controlled at a fine
granularity. However, in order to realize the full potential of
sensor networks, it is increasingly apparent that they should be
easily, reliably, and efficiently programmable. Surprisingly, the
tate-of-the-art programming languages and systems focus mostly on
programmability and efficiency, and only poorly support
reliability, if at all. In this thesis, we take the first step
toward achieving all three goals by building three related
languages and systems, each of which supports reliability. –
First, we show how one can easily modify existing code, which is
primarily designed for efficiency, in order to provide reliability.
Since today's programming systems are not easily accessible to
non-experts, we design and implement two languages that are easy to
program, and also offer trade-offs in terms of reliability and
efficiency. Our experimental results from these three systems
indicate that it is possible to build reliable and efficiency
systems that are also simple to program.
Advisors/Committee Members: Govindan, Ramesh (Committee Chair), Millstein, Todd (Committee Member), Neely, Michael J. (Committee Member), Shahabi, Cyrus (Committee Member).
Subjects/Keywords: sensor networks; programming languages; wireless; computer systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Gummadi, R. (2007). Reliable languages and systems for sensor networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/539187/rec/5524
Chicago Manual of Style (16th Edition):
Gummadi, Ramakrishna. “Reliable languages and systems for sensor networks.” 2007. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/539187/rec/5524.
MLA Handbook (7th Edition):
Gummadi, Ramakrishna. “Reliable languages and systems for sensor networks.” 2007. Web. 24 Jan 2021.
Vancouver:
Gummadi R. Reliable languages and systems for sensor networks. [Internet] [Doctoral dissertation]. University of Southern California; 2007. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/539187/rec/5524.
Council of Science Editors:
Gummadi R. Reliable languages and systems for sensor networks. [Doctoral Dissertation]. University of Southern California; 2007. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/539187/rec/5524
University of Southern California
19.
Syed, Affan Ahmed.
Understanding and exploiting the acoustic propagation delay
in underwater sensor networks.
Degree: PhD, Computer Science (Computer Networks), 2009, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/249132/rec/7672
► An understanding of the key areas of difference in acoustic underwater sensor networks and their impact on network design is essential for a rapid deployment…
(more)
▼ An understanding of the key areas of difference in
acoustic underwater sensor networks and their impact on network
design is essential for a rapid deployment of aquatic sensornets.
Such an understanding will allow system designers to harvest the
vast literature of research present in RF sensornets and focus on
just those key aspects that are different for acoustic sensornets.
Most complexities at the physical layer will eventually be handled
either by assuming short ranges or with technology advancements
making complex algorithms both cost and power efficient. However,
the impact of large latency and the resulting magnification of
multipath will remain a great impediment for developing robust
sensor networks. This thesis contributes towards an understanding
of, and solutions to, the impact of latency on sensornet migration
to an underwater acoustic environment.; The thesis of this
dissertation is that Latency-awareness allows both migration of
existing terrestrial sensornet protocols and design of new
underwater protocols that can overcome and exploit the large
propagation delay inherent to acoustic underwater networks. We
present four studies that contribute to this thesis. First, we
formalize the impact of large propagation delay on networking
protocols in the concept of space-time uncertainty. Second, we use
the understanding developed from this concept to design the first
high-latency aware time synchronization protocol for acoustic
sensor networks that is able to overcome an error source unique to
the underwater environment. Third, we exploit the space-time volume
during medium access to propose T-Lohi, a new class of energy and
throughput efficient medium access control (MAC) protocols. Last,
with our protocol implementations we are able to indicate the
importance of a different type of multipath which we call
self-multipath. This self-multipath adversely affects the
throughput of T-Lohi MAC, and to overcome this affect we develop a
novel Bayesian learning algorithm that can learn-and-ignore such
multipath.
Advisors/Committee Members: Heidemann, John (Committee Chair), Ye, Wei (Committee Member), Krishnamachari, Bhaskar (Committee Member), Neely, Michael J. (Committee Member).
Subjects/Keywords: underwater; acoustic; networks; sensor networks; latency-aware
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Syed, A. A. (2009). Understanding and exploiting the acoustic propagation delay
in underwater sensor networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/249132/rec/7672
Chicago Manual of Style (16th Edition):
Syed, Affan Ahmed. “Understanding and exploiting the acoustic propagation delay
in underwater sensor networks.” 2009. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/249132/rec/7672.
MLA Handbook (7th Edition):
Syed, Affan Ahmed. “Understanding and exploiting the acoustic propagation delay
in underwater sensor networks.” 2009. Web. 24 Jan 2021.
Vancouver:
Syed AA. Understanding and exploiting the acoustic propagation delay
in underwater sensor networks. [Internet] [Doctoral dissertation]. University of Southern California; 2009. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/249132/rec/7672.
Council of Science Editors:
Syed AA. Understanding and exploiting the acoustic propagation delay
in underwater sensor networks. [Doctoral Dissertation]. University of Southern California; 2009. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/249132/rec/7672
University of Southern California
20.
Yan, Xijin.
Network coding capacity and performance optimization.
Degree: PhD, Electrical Engineering, 2007, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/523725/rec/4364
► Network coding has been shown to provide gains in terms of the achievable information rate region in modern communication networks. It generalizes the classical routing…
(more)
▼ Network coding has been shown to provide gains in
terms of the achievable information rate region in modern
communication networks. It generalizes the classical routing by
allowing information mixing at each intermediate node to take
better advantage of the redundant resources in the network.; In
this research, we study the network coding capacity for general
acyclic multi-source multi-sink networks with arbitrary
transmission requirements. In particular, we develop a series of
useful techniques that provide a systematic approach toward such
general characterization. These techniques allow us to decompose an
arbitrary acyclic multi-source network into a set of block-building
units and build the general capacity characterization from ground
up. Furthermore, these techniques have also been extended to
determining the capacity region for a class of time-varying
wireless networks with constrained coding. As an alternative
approach, we also study an implicit characterization by using tools
developed from the theory of entropy function. These tools allow us
to look into the geometric properties of the rate region
characterized by all the information inequalities that must be
satisfied to meet the given transmission requirements.; Along with
the capacity problems, a number of closely related performance
optimization problems are also investigated to provide practical
design guidelines. Equivalence between the physical layer capacity
region and the network layer stability region has also been
established to facilitate the design and analysis of algorithms
that jointly achieve network stability and performance
optimizations in a time-varying setting.
Advisors/Committee Members: Zhang, Zhen (Committee Chair), Caire, Giuseppe (Committee Member), Neely, Michael J. (Committee Member), Ordóñez, Fernando I. (Committee Member).
Subjects/Keywords: network coding
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yan, X. (2007). Network coding capacity and performance optimization. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/523725/rec/4364
Chicago Manual of Style (16th Edition):
Yan, Xijin. “Network coding capacity and performance optimization.” 2007. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/523725/rec/4364.
MLA Handbook (7th Edition):
Yan, Xijin. “Network coding capacity and performance optimization.” 2007. Web. 24 Jan 2021.
Vancouver:
Yan X. Network coding capacity and performance optimization. [Internet] [Doctoral dissertation]. University of Southern California; 2007. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/523725/rec/4364.
Council of Science Editors:
Yan X. Network coding capacity and performance optimization. [Doctoral Dissertation]. University of Southern California; 2007. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/523725/rec/4364
University of Southern California
21.
Shirani-Mehr, Hooman.
Channel state information feedback, prediction and
scheduling for the downlink of MIMO-OFDM wireless systems.
Degree: PhD, Electrical Engineering, 2010, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/314564/rec/1288
► Multiple input multiple output (MIMO) communication systems and multiuser diversity play important rolls in future wireless systems and enable them to achieve high data rates.…
(more)
▼ Multiple input multiple output (MIMO) communication
systems and multiuser diversity play important rolls in future
wireless systems and enable them to achieve high data rates.
Earlier studies on multi-user MIMO (MU-MIMO) systems were based on
some ideal assumptions on system such as perfect channel state
knowledge, perfect feedback channel and known inter-cell
interference. This thesis investigates design and performance of
MU-MIMO systems under more practical assumptions.; We first
consider channel state information (CSI) feedback schemes for
MIMO-OFDM broadcast channel. By considering simple zero-forcing
beamforming (ZFBF) precoder and ignoring user selection problem, we
compare achievable ergodic rates under different channel state
feedback schemes. We propose a novel ''time-domain'' channel
quantized feedback which is inspired by rate-distortion theory of
Gaussian correlated sources and takes advantage of the channel
frequency correlation structure.; Next, we consider spacial channel
model (SCM) which is used as a benchmark in standardization and
examine some alternatives for channel estimation and prediction
scheme. We show that a parametric method based on ESPRIT is able to
accurately predict the channel even for relatively high user
mobility as long as the angular spread is large.; Subsequently, we
study the problem of user scheduling in MIMO broadcast systems
under non-perfect CSI. We propose a dynamic novel opportunistic
scheme that, depending on the channel state quality of user
terminals, categorizes user terminals into ''predictable'' and
''non-predictable'' users and at each scheduling slot, serves one
non-predictable user (transmit diversity) or several predictable
users (multi-user diversity).; In our final analysis, we
investigate user scheduling in the presence of unknown inter-cell
interference. We present a systematic method for joint
scheduler/ARQ design. We define ''optimistic'' throughput as the
throughput that can be achieved if the transmitter knew the
instantaneous user ICI and transmitted to each scheduled user at
the maximum possible instantaneous rate and show that properly
designed incremental-redundancy hybrid ARQ schemes can achieve any
desired fraction of the ''optimistic'' throughputs with finite
average decoding delay where optimistic.
Advisors/Committee Members: Caire, Giuseppe (Committee Chair), Molisch, Andreas F. (Committee Member), Neely, Michael J. (Committee Member), Kuo, C.-C. Jay (Committee Member), Baxendale, Peter H. (Committee Member).
Subjects/Keywords: channel state information; feedback; hybrid ARQ; MIMO; scheduling; wireless
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shirani-Mehr, H. (2010). Channel state information feedback, prediction and
scheduling for the downlink of MIMO-OFDM wireless systems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/314564/rec/1288
Chicago Manual of Style (16th Edition):
Shirani-Mehr, Hooman. “Channel state information feedback, prediction and
scheduling for the downlink of MIMO-OFDM wireless systems.” 2010. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/314564/rec/1288.
MLA Handbook (7th Edition):
Shirani-Mehr, Hooman. “Channel state information feedback, prediction and
scheduling for the downlink of MIMO-OFDM wireless systems.” 2010. Web. 24 Jan 2021.
Vancouver:
Shirani-Mehr H. Channel state information feedback, prediction and
scheduling for the downlink of MIMO-OFDM wireless systems. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/314564/rec/1288.
Council of Science Editors:
Shirani-Mehr H. Channel state information feedback, prediction and
scheduling for the downlink of MIMO-OFDM wireless systems. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/314564/rec/1288
University of Southern California
22.
Huang, Pai-Han.
Time synchronization and scheduling in underwater wireless
networks.
Degree: PhD, Electrical Engineering, 2010, University of Southern California
URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/370515/rec/7487
► Because of our limited knowledge of the huge water body that covers 70% of Earth's surface, Underwater Acoustic Sensor Network (UWASN) is an emerging topic…
(more)
▼ Because of our limited knowledge of the huge water
body that covers 70% of Earth's surface, Underwater Acoustic Sensor
Network (UWASN) is an emerging topic in the research society.
However, the unique properties of acoustic communication systems,
such as high propagation delay, high communication power
consumption, low transmission rate, distance dependent bandwidth,
all make the networking issues of UWASN very challenging. In this
thesis, we study three different topics that can be applied in
UWASN, with a focus on addressing the challenge of high propagation
delay. One is time synchronization, another one is link scheduling,
and the last one is random access.; Because of high propagation
delay, time synchronization protocols which are designed for
terrestrial-RF networks may not be suitable for UWASN. We perform
extensive analysis of existing solutions, and conclude their pros
and cons. Based on our findings, we propose a hybrid
synchronization scheme, which outperforms existing solutions in
terms of precision, has bounded multi-hop error, and low variance.
In addition, we also analyze the proposed solution with other
schemes in multi-hop settings. The performance of hybrid scheme is
not only analyzed theoretically, but also veried by traced-based
simulations.; In the second topic, we formally prove the
NP-hardness and best possible approximation ratio for Metric
Underwater Scheduling problem. We then use a complete SAT solver to
study the feasibility of a given scheduling length, regarding a
network under consideration. We notice that UWASN has good
throughput when the deployment density is low, but deteriorates
when density goes up.; Due to the inflexibility and high
communication power consumption of centralized schedulers, we
finally study the performance of a ALOHA-like random access scheme.
We use non-linear programming to improve its throughput by
modifying the channel access distribution. Based on our findings,
the improvement can be several orders compared to primitive
solutions. While packet length increases, schedule length
decreases, and deployment density increases, the improvement ratio
also goes up accordingly.
Advisors/Committee Members: Krishnamachari, Bhaskar (Committee Chair), Kuo, C.-C. Jay (Committee Member), Sukhatme, Gaurav S. (Committee Member), Neely, Michael J. (Committee Member), Kempe, David (Committee Member), Raghavendra, Cauligi S. (Committee Member).
Subjects/Keywords: time synchronization; scheduling; underwater; wireless
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Huang, P. (2010). Time synchronization and scheduling in underwater wireless
networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/370515/rec/7487
Chicago Manual of Style (16th Edition):
Huang, Pai-Han. “Time synchronization and scheduling in underwater wireless
networks.” 2010. Doctoral Dissertation, University of Southern California. Accessed January 24, 2021.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/370515/rec/7487.
MLA Handbook (7th Edition):
Huang, Pai-Han. “Time synchronization and scheduling in underwater wireless
networks.” 2010. Web. 24 Jan 2021.
Vancouver:
Huang P. Time synchronization and scheduling in underwater wireless
networks. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2021 Jan 24].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/370515/rec/7487.
Council of Science Editors:
Huang P. Time synchronization and scheduling in underwater wireless
networks. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/370515/rec/7487
. 
Open Access Theses and Dissertations