4,448 research outputs found
An Analytical Model of Packet Collisions in IEEE 802.15.4 Wireless Networks
Numerous studies showed that concurrent transmissions can boost wireless
network performance despite collisions. While these works provide empirical
evidence that concurrent transmissions may be received reliably, existing
signal capture models only partially explain the root causes of this
phenomenon. We present a comprehensive mathematical model that reveals the
reasons and provides insights on the key parameters affecting the performance
of MSK-modulated transmissions. A major contribution is a closed-form
derivation of the receiver bit decision variable for arbitrary numbers of
colliding signals and constellations of power ratios, timing offsets, and
carrier phase offsets. We systematically explore the root causes for successful
packet delivery under concurrent transmissions across the whole parameter space
of the model. We confirm the capture threshold behavior observed in previous
studies but also reveal new insights relevant for the design of optimal
protocols: We identify capture zones depending not only on the signal power
ratio but also on time and phase offsets.Comment: Accepted for publication in the IEEE Transactions on Wireless
Communications under the title "On the Reception of Concurrent Transmissions
in Wireless Sensor Networks.
Wireless Video Transmission with Over-the-Air Packet Mixing
In this paper, we propose a system for wireless video transmission with a
wireless physical layer (PHY) that supports cooperative forwarding of
interfered/superimposed packets. Our system model considers multiple and
independent unicast transmissions between network nodes while a number of them
serve as relays of the interfered/superimposed signals. For this new PHY the
average transmission rate that each node can achieve is estimated first. Next,
we formulate a utility optimization framework for the video transmission
problem and we show that it can be simplified due to the features of the new
PHY. Simulation results reveal the system operating regions for which
superimposing wireless packets is a better choice than a typical cooperative
PHY.Comment: 2012 Packet Video Worksho
Fundamental Limits of Caching in Wireless D2D Networks
We consider a wireless Device-to-Device (D2D) network where communication is
restricted to be single-hop. Users make arbitrary requests from a finite
library of files and have pre-cached information on their devices, subject to a
per-node storage capacity constraint. A similar problem has already been
considered in an ``infrastructure'' setting, where all users receive a common
multicast (coded) message from a single omniscient server (e.g., a base station
having all the files in the library) through a shared bottleneck link. In this
work, we consider a D2D ``infrastructure-less'' version of the problem. We
propose a caching strategy based on deterministic assignment of subpackets of
the library files, and a coded delivery strategy where the users send linearly
coded messages to each other in order to collectively satisfy their demands. We
also consider a random caching strategy, which is more suitable to a fully
decentralized implementation. Under certain conditions, both approaches can
achieve the information theoretic outer bound within a constant multiplicative
factor. In our previous work, we showed that a caching D2D wireless network
with one-hop communication, random caching, and uncoded delivery, achieves the
same throughput scaling law of the infrastructure-based coded multicasting
scheme, in the regime of large number of users and files in the library. This
shows that the spatial reuse gain of the D2D network is order-equivalent to the
coded multicasting gain of single base station transmission. It is therefore
natural to ask whether these two gains are cumulative, i.e.,if a D2D network
with both local communication (spatial reuse) and coded multicasting can
provide an improved scaling law. Somewhat counterintuitively, we show that
these gains do not cumulate (in terms of throughput scaling law).Comment: 45 pages, 5 figures, Submitted to IEEE Transactions on Information
Theory, This is the extended version of the conference (ITW) paper
arXiv:1304.585
- …