182 research outputs found
Dual Busy Tone Multiple Access (DBTMA)— A Multiple Access Control Scheme for Ad Hoc Networks
In ad hoc networks, the hidden- and the exposed-terminal
problems can severely reduce the network capacity on
the MAC layer. To address these problems, the ready-to-send
and clear-to-send (RTS/CTS) dialogue has been proposed in
the literature. However, MAC schemes using only the RTS/CTS
dialogue cannot completely solve the hidden and the exposed
terminal problems, as pure “packet sensing” MAC schemes are
not safe even in fully connected networks.We propose a new MAC
protocol, termed the dual busy tone multiple access (DBTMA)
scheme. The operation of the DBTMA protocol is based on
the RTS packet and two narrow-bandwidth, out-of-band busy
tones. With the use of the RTS packet and the receive busy tone,
which is set up by the receiver, our scheme completely solves
the hidden- and the exposed-terminal problems. The busy tone,
which is set up by the transmitter, provides protection for the RTS
packets, increasing the probability of successful RTS reception
and, consequently, increasing the throughput. This paper outlines
the operation rules of the DBTMA scheme and analyzes its
performance. Simulation results are also provided to support the
analytical results. It is concluded that the DBTMA protocol is
superior to other schemes that rely on the RTS/CTS dialogue on a
single channel or to those that rely on a single busy tone. As a point
of reference, the DBTMA scheme out-performs FAMA-NCS by
20–40% in our simulations using the network topologies borrowed
from the FAMA-NCS paper. In an ad hoc network with a large
coverage area, DBTMA achieves performance gain of 140% over
FAMA-NCS and performance gain of 20% over RI-BTMA
Capacity of Cellular Wireless Network
Earlier definitions of capacity for wireless networks, e.g., transport or
transmission capacity, for which exact theoretical results are known, are well
suited for ad hoc networks but are not directly applicable for cellular
wireless networks, where large-scale basestation (BS) coordination is not
possible, and retransmissions/ARQ under the SINR model is a universal feature.
In this paper, cellular wireless networks, where both BS locations and mobile
user (MU) locations are distributed as independent Poisson point processes are
considered, and each MU connects to its nearest BS. With ARQ, under the SINR
model, the effective downlink rate of packet transmission is the reciprocal of
the expected delay (number of retransmissions needed till success), which we
use as our network capacity definition after scaling it with the BS density.
Exact characterization of this natural capacity metric for cellular wireless
networks is derived. The capacity is shown to first increase polynomially with
the BS density in the low BS density regime and then scale inverse
exponentially with the increasing BS density. Two distinct upper bounds are
derived that are relevant for the low and the high BS density regimes. A single
power control strategy is shown to achieve the upper bounds in both the
regimes. This result is fundamentally different from the well known capacity
results for ad hoc networks, such as transport and transmission capacity that
scale as the square root of the (high) BS density. Our results show that the
strong temporal correlations of SINRs with PPP distributed BS locations is
limiting, and the realizable capacity in cellular wireless networks in high-BS
density regime is much smaller than previously thought. A byproduct of our
analysis shows that the capacity of the ALOHA strategy with retransmissions is
zero.Comment: A shorter version to appear in WiOpt 201
Distributed local broadcasting algorithms in the physical interference model
Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is to schedule all these requests in as few timeslots as possible. In this paper, assuming the more realistic physical interference model and no knowledge of the topology, we present three distributed local broadcasting algorithms where the first one is for the asynchronized model and the other two are for the synchronized model. Under the asynchronized model, nodes may join the execution of the protocol at any time and do not have access to a global clock, for which we give a distributed randomized algorithm with approximation ratio O(log n).published_or_final_versionThe 2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS), Barcelona, Spain, 27-29 June 2011. In Proceedings of DCOSS, 2011, p. 1-
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection
This paper develops upper bounds on the end-to-end transmission capacity of
multi-hop wireless networks. Potential source-destination paths are dynamically
selected from a pool of randomly located relays, from which a closed-form lower
bound on the outage probability is derived in terms of the expected number of
potential paths. This is in turn used to provide an upper bound on the number
of successful transmissions that can occur per unit area, which is known as the
transmission capacity. The upper bound results from assuming independence among
the potential paths, and can be viewed as the maximum diversity case. A useful
aspect of the upper bound is its simple form for an arbitrary-sized network,
which allows insights into how the number of hops and other network parameters
affect spatial throughput in the non-asymptotic regime. The outage probability
analysis is then extended to account for retransmissions with a maximum number
of allowed attempts. In contrast to prevailing wisdom, we show that
predetermined routing (such as nearest-neighbor) is suboptimal, since more hops
are not useful once the network is interference-limited. Our results also make
clear that randomness in the location of relay sets and dynamically varying
channel states is helpful in obtaining higher aggregate throughput, and that
dynamic route selection should be used to exploit path diversity.Comment: 14 pages, 5 figures, accepted to IEEE Transactions on Information
Theory, 201
Time diversity solutions to cope with lost packets
A dissertation submitted to Departamento de Engenharia Electrotécnica of Faculdade de Ciências e Tecnologia of Universidade Nova de Lisboa in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engenharia Electrotécnica e de ComputadoresModern broadband wireless systems require high throughputs and can also have very high
Quality-of-Service (QoS) requirements, namely small error rates and short delays. A high spectral efficiency is needed to meet these requirements. Lost packets, either due to errors or collisions, are usually discarded and need to be retransmitted, leading to performance degradation.
An alternative to simple retransmission that can improve both power and spectral
efficiency is to combine the signals associated to different transmission attempts.
This thesis analyses two time diversity approaches to cope with lost packets that are
relatively similar at physical layer but handle different packet loss causes. The first is a lowcomplexity Diversity-Combining (DC) Automatic Repeat reQuest (ARQ) scheme employed in a Time Division Multiple Access (TDMA) architecture, adapted for channels dedicated to a single user. The second is a Network-assisted Diversity Multiple Access (NDMA) scheme, which is a multi-packet detection approach able to separate multiple mobile terminals transmitting simultaneously in one slot using temporal diversity. This thesis combines these techniques with Single Carrier with Frequency Division Equalizer (SC-FDE) systems, which are widely recognized as the best candidates for the uplink of future broadband wireless systems.
It proposes a new NDMA scheme capable of handling more Mobile Terminals (MTs)
than the user separation capacity of the receiver. This thesis also proposes a set of analytical tools that can be used to analyse and optimize the use of these two systems. These tools are then employed to compare both approaches in terms of error rate, throughput and delay performances, and taking the implementation complexity into consideration.
Finally, it is shown that both approaches represent viable solutions for future broadband wireless communications complementing each other.Fundação para a Ciência e Tecnologia - PhD grant(SFRH/BD/41515/2007); CTS multi-annual funding project PEst-OE/EEI/UI0066/2011, IT
pluri-annual funding project PEst-OE/EEI/LA0008/2011, U-BOAT project PTDC/EEATEL/
67066/2006, MPSat project PTDC/EEA-TEL/099074/2008 and OPPORTUNISTICCR
project PTDC/EEA-TEL/115981/200
- …