5 research outputs found
Unicast Barrage Relay Networks: Outage Analysis and Optimization
Barrage relays networks (BRNs) are ad hoc networks built on a rapid
cooperative flooding primitive as opposed to the traditional point-to-point
link abstraction. Controlled barrage regions (CBRs) can be used to contain this
flooding primitive for unicast and multicast, thereby enabling spatial reuse.
In this paper, the behavior of individual CBRs is described as a Markov process
that models the potential cooperative relay transmissions. The outage
probability for a CBR is found in closed form for a given topology, and the
probability takes into account fading and co-channel interference (CCI) between
adjacent CBRs. Having adopted this accurate analytical framework, this paper
proceeds to optimize a BRN by finding the optimal size of each CBR, the number
of relays contained within each CBR, the optimal relay locations when they are
constrained to lie on a straight line, and the code rate that maximizes the
transport capacity.Comment: 7 pages, 4 figures, 1 table, in IEEE Military Commun. Conf. (MILCOM),
201
Deploy-As-You-Go Wireless Relay Placement: An Optimal Sequential Decision Approach using the Multi-Relay Channel Model
We use information theoretic achievable rate formulas for the multi-relay
channel to study the problem of as-you-go deployment of relay nodes. The
achievable rate formulas are for full-duplex radios at the relays and for
decode-and-forward relaying. Deployment is done along the straight line joining
a source node and a sink node at an unknown distance from the source. The
problem is for a deployment agent to walk from the source to the sink,
deploying relays as he walks, given that the distance to the sink is
exponentially distributed with known mean. As a precursor, we apply the
multi-relay channel achievable rate formula to obtain the optimal power
allocation to relays placed along a line, at fixed locations. This permits us
to obtain the optimal placement of a given number of nodes when the distance
between the source and sink is given. Numerical work suggests that, at low
attenuation, the relays are mostly clustered near the source in order to be
able to cooperate, whereas at high attenuation they are uniformly placed and
work as repeaters. We also prove that the effect of path-loss can be entirely
mitigated if a large enough number of relays are placed uniformly between the
source and the sink. The structure of the optimal power allocation for a given
placement of the nodes, then motivates us to formulate the problem of as-you-go
placement of relays along a line of exponentially distributed length, and with
the exponential path-loss model, so as to minimize a cost function that is
additive over hops. The hop cost trades off a capacity limiting term, motivated
from the optimal power allocation solution, against the cost of adding a relay
node. We formulate the problem as a total cost Markov decision process,
establish results for the value function, and provide insights into the
placement policy and the performance of the deployed network via numerical
exploration.Comment: 21 pages. arXiv admin note: substantial text overlap with
arXiv:1204.432
Optimal Capacity Relay Node Placement in a Multi-hop Wireless Network on a Line
We use information theoretic achievable rate formulas for the multi-relay
channel to study the problem of optimal placement of relay nodes along the
straight line joining a source node and a sink node. The achievable rate
formulas that we use are for full-duplex radios at the relays and decode-
and-forward relaying. For the single relay case, and individual power
constraints at the source node and the relay node, we provide explicit formulas
for the optimal relay location and the optimal power allocation to the
source-relay channel, for the exponential and the power-law path-loss channel
models. For the multiple relay case, we consider exponential path-loss and a
total power constraint over the source and the relays, and derive an
optimization problem, the solution of which provides the optimal relay
locations. Numerical results suggest that at low attenuation the relays are
mostly clustered close to the source in order to be able to cooperate among
themselves, whereas at high attenuation they are uniformly placed and work as
repeaters.
The structure of the optimal power allocation for a given placement of the
nodes, then motivates us to formulate the problem of impromptu ("as-you-go")
placement of relays along a line of exponentially distributed length, with
exponential path- loss, so as to minimize a cost function that is additive over
hops. The hop cost trades off a capacity limiting term, motivated from the
optimal power allocation solution, against the cost of adding a relay node. We
formulate the problem as a total cost Markov decision process, for which we
prove results for the value function, and provide insights into the placement
policy via numerical exploration.Comment: 22 pages, 12 figures; the initial version of this work was accepted
in RAWNET 2012 (an workshop of WiOpt 2012); this is a substantial extension
of the workshop pape
Role of Interference and Computational Complexity in Modern Wireless Networks: Analysis, Optimization, and Design
Owing to the popularity of smartphones, the recent widespread adoption of wireless broadband has resulted in a tremendous growth in the volume of mobile data traffic, and this growth is projected to continue unabated. In order to meet the needs of future systems, several novel technologies have been proposed, including cooperative communications, cloud radio access networks (RANs) and very densely deployed small-cell networks. For these novel networks, both interference and the limited availability of computational resources play a very important role. Therefore, the accurate modeling and analysis of interference and computation is essential to the understanding of these networks, and an enabler for more efficient design.;This dissertation focuses on four aspects of modern wireless networks: (1) Modeling and analysis of interference in single-hop wireless networks, (2) Characterizing the tradeoffs between the communication performance of wireless transmission and the computational load on the systems used to process such transmissions, (3) The optimization of wireless multiple-access networks when using cost functions that are based on the analytical findings in this dissertation, and (4) The analysis and optimization of multi-hop networks, which may optionally employ forms of cooperative communication.;The study of interference in single-hop wireless networks proceeds by assuming that the random locations of the interferers are drawn from a point process and possibly constrained to a finite area. Both the information-bearing and interfering signals propagate over channels that are subject to path loss, shadowing, and fading. A flexible model for fading, based on the Nakagami distribution, is used, though specific examples are provided for Rayleigh fading. The analysis is broken down into multiple steps, involving subsequent averaging of the performance metrics over the fading, the shadowing, and the location of the interferers with the aim to distinguish the effect of these mechanisms that operate over different time scales. The analysis is extended to accommodate diversity reception, which is important for the understanding of cooperative systems that combine transmissions that originate from different locations. Furthermore, the role of spatial correlation is considered, which provides insight into how the performance in one location is related to the performance in another location.;While it is now generally understood how to communicate close to the fundamental limits implied by information theory, operating close to the fundamental performance bounds is costly in terms of the computational complexity required to receive the signal. This dissertation provides a framework for understanding the tradeoffs between communication performance and the imposed complexity based on how close a system operates to the performance bounds, and it allows to accurately estimate the required data processing resources of a network under a given performance constraint. The framework is applied to Cloud-RAN, which is a new cellular architecture that moves the bulk of the signal processing away from the base stations (BSs) and towards a centralized computing cloud. The analysis developed in this part of the dissertation helps to illuminate the benefits of pooling computing assets when decoding multiple uplink signals in the cloud. Building upon these results, new approaches for wireless resource allocation are proposed, which unlike previous approaches, are aware of the computing limitations of the network.;By leveraging the accurate expressions that characterize performance in the presence of interference and fading, a methodology is described for optimizing wireless multiple-access networks. The focus is on frequency hopping (FH) systems, which are already widely used in military systems, and are becoming more common in commercial systems. The optimization determines the best combination of modulation parameters (such as the modulation index for continuous-phase frequency-shift keying), number of hopping channels, and code rate. In addition, it accounts for the adjacent-channel interference (ACI) and determines how much of the signal spectrum should lie within the operating band of each channel, and how much can be allowed to splatter into adjacent channels.;The last part of this dissertation contemplates networks that involve multi-hop communications. Building on the analytical framework developed in early parts of this dissertation, the performance of such networks is analyzed in the presence of interference and fading, and it is introduced a novel paradigm for a rapid performance assessment of routing protocols. Such networks may involve cooperative communications, and the particular cooperative protocol studied here allows the same packet to be transmitted simultaneously by multiple transmitters and diversity combined at the receiver. The dynamics of how the cooperative protocol evolves over time is described through an absorbing Markov chain, and the analysis is able to efficiently capture the interference that arises as packets are periodically injected into the network by a common source, the temporal correlation among these packets and their interdependence