5,428 research outputs found
Fractional Power Control for Decentralized Wireless Networks
We consider a new approach to power control in decentralized wireless
networks, termed fractional power control (FPC). Transmission power is chosen
as the current channel quality raised to an exponent -s, where s is a constant
between 0 and 1. The choices s = 1 and s = 0 correspond to the familiar cases
of channel inversion and constant power transmission, respectively. Choosing s
in (0,1) allows all intermediate policies between these two extremes to be
evaluated, and we see that usually neither extreme is ideal. We derive
closed-form approximations for the outage probability relative to a target SINR
in a decentralized (ad hoc or unlicensed) network as well as for the resulting
transmission capacity, which is the number of users/m^2 that can achieve this
SINR on average. Using these approximations, which are quite accurate over
typical system parameter values, we prove that using an exponent of 1/2
minimizes the outage probability, meaning that the inverse square root of the
channel strength is a sensible transmit power scaling for networks with a
relatively low density of interferers. We also show numerically that this
choice of s is robust to a wide range of variations in the network parameters.
Intuitively, s=1/2 balances between helping disadvantaged users while making
sure they do not flood the network with interference.Comment: 16 pages, in revision for IEEE Trans. on Wireless Communicatio
Spatial networks with wireless applications
Many networks have nodes located in physical space, with links more common
between closely spaced pairs of nodes. For example, the nodes could be wireless
devices and links communication channels in a wireless mesh network. We
describe recent work involving such networks, considering effects due to the
geometry (convex,non-convex, and fractal), node distribution,
distance-dependent link probability, mobility, directivity and interference.Comment: Review article- an amended version with a new title from the origina
How do Wireless Chains Behave? The Impact of MAC Interactions
In a Multi-hop Wireless Networks (MHWN), packets are routed between source
and destination using a chain of intermediate nodes; chains are a fundamental
communication structure in MHWNs whose behavior must be understood to enable
building effective protocols. The behavior of chains is determined by a number
of complex and interdependent processes that arise as the sources of different
chain hops compete to transmit their packets on the shared medium. In this
paper, we show that MAC level interactions play the primary role in determining
the behavior of chains. We evaluate the types of chains that occur based on the
MAC interactions between different links using realistic propagation and packet
forwarding models. We discover that the presence of destructive interactions,
due to different forms of hidden terminals, does not impact the throughput of
an isolated chain significantly. However, due to the increased number of
retransmissions required, the amount of bandwidth consumed is significantly
higher in chains exhibiting destructive interactions, substantially influencing
the overall network performance. These results are validated by testbed
experiments. We finally study how different types of chains interfere with each
other and discover that well behaved chains in terms of self-interference are
more resilient to interference from other chains
Random Access Transport Capacity
We develop a new metric for quantifying end-to-end throughput in multihop
wireless networks, which we term random access transport capacity, since the
interference model presumes uncoordinated transmissions. The metric quantifies
the average maximum rate of successful end-to-end transmissions, multiplied by
the communication distance, and normalized by the network area. We show that a
simple upper bound on this quantity is computable in closed-form in terms of
key network parameters when the number of retransmissions is not restricted and
the hops are assumed to be equally spaced on a line between the source and
destination. We also derive the optimum number of hops and optimal per hop
success probability and show that our result follows the well-known square root
scaling law while providing exact expressions for the preconstants as well.
Numerical results demonstrate that the upper bound is accurate for the purpose
of determining the optimal hop count and success (or outage) probability.Comment: Submitted to IEEE Trans. on Wireless Communications, Sept. 200
A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks
This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST),
Pakistan, and the Higher Education Commission, Pakistan
Generalized Area Spectral Efficiency: An Effective Performance Metric for Green Wireless Communications
Area spectral efficiency (ASE) was introduced as a metric to quantify the
spectral utilization efficiency of cellular systems. Unlike other performance
metrics, ASE takes into account the spatial property of cellular systems. In
this paper, we generalize the concept of ASE to study arbitrary wireless
transmissions. Specifically, we introduce the notion of affected area to
characterize the spatial property of arbitrary wireless transmissions. Based on
the definition of affected area, we define the performance metric, generalized
area spectral efficiency (GASE), to quantify the spatial spectral utilization
efficiency as well as the greenness of wireless transmissions. After
illustrating its evaluation for point-to-point transmission, we analyze the
GASE performance of several different transmission scenarios, including
dual-hop relay transmission, three-node cooperative relay transmission and
underlay cognitive radio transmission. We derive closed-form expressions for
the GASE metric of each transmission scenario under Rayleigh fading environment
whenever possible. Through mathematical analysis and numerical examples, we
show that the GASE metric provides a new perspective on the design and
optimization of wireless transmissions, especially on the transmitting power
selection. We also show that introducing relay nodes can greatly improve the
spatial utilization efficiency of wireless systems. We illustrate that the GASE
metric can help optimize the deployment of underlay cognitive radio systems.Comment: 11 pages, 8 figures, accepted by TCo
The effect of information on scheduling performance in multi-hop wireless networks
Previous research has estimated the performance of wireless networks by assuming that nodes in the network can obtain precise network information. However, in reality, available network information is mostly imprecise and incomplete. In this paper, we study the relationship between wireless network performance and available network information. It is assumed that each node in the network can obtain the information about other nodes within its information collection range, and a distributed graph coloring algorithm is employed to perform scheduling with the available information. The analytical result on the quantitative relationship between the information collection range and the network throughput is derived. We also consider the communication overhead of collecting information, and analyze the tradeoff between network capacity improvement and information collection overhead. Based on the derived result, an optimal information collection range which maximizes the net data rate can be found. Since wireless networks are typically mobile, and the collected information may be inaccurate due to the dynamics of the networks, we analyze the effect of information for mobile wireless networks by considering the information updating rate, and the result can be used to determine the information collection range as well as the information updating period. © 2010 IEEE.published_or_final_versio
- …