An Efficient Network Coding based Retransmission Algorithm for Wireless Multicasts

Retransmission based on packet acknowledgement (ACK/NAK) is a fundamental error control technique employed in IEEE 802.11-2007 unicast network. However the 802.11-2007 standard falls short of proposing a reliable MAC-level recovery protocol for multicast frames. In this paper we propose a latency and bandwidth efficient coding algorithm based on the principles of network coding for retransmitting lost packets in a singlehop wireless multicast network and demonstrate its effectiveness over previously proposed network coding based retransmission algorithms.Comment: 5 pages, 5 figure

Collision Codes: Decoding Superimposed BPSK Modulated Wireless Transmissions

The introduction of physical layer network coding gives rise to the concept of turning a collision of transmissions on a wireless channel useful. In the idea of physical layer network coding, two synchronized simultaneous packet transmissions are carefully encoded such that the superimposed transmission can be decoded to produce a packet which is identical to the bitwise binary sum of the two transmitted packets. This paper explores the decoding of superimposed transmission resulted by multiple synchronized simultaneous transmissions. We devise a coding scheme that achieves the identification of individual transmission from the synchronized superimposed transmission. A mathematical proof for the existence of such a coding scheme is given

Maximum Multipath Routing Throughput in Multirate Wireless Mesh Networks

In this paper, we consider the problem of finding the maximum routing throughput between any pair of nodes in an arbitrary multirate wireless mesh network (WMN) using multiple paths. Multipath routing is an efficient technique to maximize routing throughput in WMN, however maximizing multipath routing throughput is a NP-complete problem due to the shared medium for electromagnetic wave transmission in wireless channel, inducing collision-free scheduling as part of the optimization problem. In this work, we first provide problem formulation that incorporates collision-free schedule, and then based on this formulation we design an algorithm with search pruning that jointly optimizes paths and transmission schedule. Though suboptimal, compared to the known optimal single path flow, we demonstrate that an efficient multipath routing scheme can increase the routing throughput by up to 100% for simple WMNs.Comment: This paper has been accepted for publication in IEEE 80th Vehicular Technology Conference, VTC-Fall 201

Cooperative Retransmissions Through Collisions

Interference in wireless networks is one of the key capacity-limiting factors. Recently developed interference-embracing techniques show promising performance on turning collisions into useful transmissions. However, the interference-embracing techniques are hard to apply in practical applications due to their strict requirements. In this paper, we consider utilising the interference-embracing techniques in a common scenario of two interfering sender-receiver pairs. By employing opportunistic listening and analog network coding (ANC), we show that compared to traditional ARQ retransmission, a higher retransmission throughput can be achieved by allowing two interfering senders to cooperatively retransmit selected lost packets at the same time. This simultaneous retransmission is facilitated by a simple handshaking procedure without introducing additional overhead. Simulation results demonstrate the superior performance of the proposed cooperative retransmission.Comment: IEEE ICC 2011, Kyoto, Japan. 5 pages, 5 figures, 2 tables. Analog Network Coding, Retransmission, Access Point, WLAN, interference, collision, capacity, packet los

Redshift-space distortions around voids

We have derived estimators for the linear growth rate of density fluctuations using the cross-correlation function of voids and haloes in redshift space, both directly and in Fourier form. In linear theory, this cross-correlation contains only monopole and quadrupole terms. At scales greater than the void radius, linear theory is a good match to voids traced out by haloes in N-body simulations; small-scale random velocities are unimportant at these radii, only tending to cause small and often negligible elongation of the redshift-space cross-correlation function near its origin. By extracting the monopole and quadrupole from the cross-correlation function, we measure the linear growth rate without prior knowledge of the void profile or velocity dispersion. We recover the linear growth parameter $\beta$ to 9% precision from an effective volume of 3(Gpc/h)^3 using voids with radius greater than 25Mpc/h. Smaller voids are predominantly sub-voids, which may be more sensitive to the random velocity dispersion; they introduce noise and do not help to improve the measurement. Adding velocity dispersion as a free parameter allows us to use information at radii as small as half of the void radius. The precision on $\beta$ is reduced to approximately 5%. Contrary to the simple redshift-space distortion pattern in overdensities, voids show diverse shapes in redshift space, and can appear either elongated or flattened along the line of sight. This can be explained by the competing amplitudes of the local density contrast, plus the radial velocity profile and its gradient, with the latter two factors being determined by the cumulative density profile of voids. The distortion pattern is therefore determined solely by the void profile and is different for void-in-cloud and void-in-void. This diversity of redshift-space void morphology complicates measurements of the Alcock-Paczynski effect using voids.Comment: 14 pages, 6 figures, minor changes to match the published version in MNRA