CliqueStream: an efficient and fault-resilient live streaming network on a clustered peer-to-peer overlay

Several overlay-based live multimedia streaming platforms have been proposed in the recent peer-to-peer streaming literature. In most of the cases, the overlay neighbors are chosen randomly for robustness of the overlay. However, this causes nodes that are distant in terms of proximity in the underlying physical network to become neighbors, and thus data travels unnecessary distances before reaching the destination. For efficiency of bulk data transmission like multimedia streaming, the overlay neighborhood should resemble the proximity in the underlying network. In this paper, we exploit the proximity and redundancy properties of a recently proposed clique-based clustered overlay network, named eQuus, to build efficient as well as robust overlays for multimedia stream dissemination. To combine the efficiency of content pushing over tree structured overlays and the robustness of data-driven mesh overlays, higher capacity stable nodes are organized in tree structure to carry the long haul traffic and less stable nodes with intermittent presence are organized in localized meshes. The overlay construction and fault-recovery procedures are explained in details. Simulation study demonstrates the good locality properties of the platform. The outage time and control overhead induced by the failure recovery mechanism are minimal as demonstrated by the analysis.Comment: 10 page

Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward

In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest DF rate. We first construct an algorithm that provably finds optimal DF routes. As the algorithm runs in factorial time in the worst case, we propose a polynomial time heuristic algorithm that finds an optimal route with high probability. We demonstrate that that the optimal (and near optimal) DF routes are good in practice by simulating a distributed DF coding scheme using low density parity check codes with puncturing and incremental redundancy.Comment: Accepted and to be presented at the 2007 IEEE International Symposium on Information Theory (ISIT 2007), Acropolis Congress and Exhibition Center, Nice, France, June 24-29 200

On Capacity and Delay of Multi-channel Wireless Networks with Infrastructure Support

In this paper, we propose a novel multi-channel network with infrastructure support, called an MC-IS network, which has not been studied in the literature. To the best of our knowledge, we are the first to study such an MC-IS network. Our proposed MC-IS network has a number of advantages over three existing conventional networks, namely a single-channel wireless ad hoc network (called an SC-AH network), a multi-channel wireless ad hoc network (called an MC-AH network) and a single-channel network with infrastructure support (called an SC-IS network). In particular, the network capacity of our proposed MC-IS network is $\sqrt{n \log n}$ times higher than that of an SC-AH network and an MC-AH network and the same as that of an SC-IS network, where $n$ is the number of nodes in the network. The average delay of our MC-IS network is $\sqrt{\log n/n}$ times lower than that of an SC-AH network and an MC-AH network, and $\min\{C_I,m\}$ times lower than the average delay of an SC-IS network, where $C_I$ and $m$ denote the number of channels dedicated for infrastructure communications and the number of interfaces mounted at each infrastructure node, respectively. Our analysis on an MC-IS network equipped with omni-directional antennas only has been extended to an MC-IS network equipped with directional antennas only, which are named as an MC-IS-DA network. We show that an MC-IS-DA network has an even lower delay of $\frac{c}{\lfloor \frac{2\pi}{\theta}\rfloor \cdot C_I}$ compared with an SC-IS network and our MC-IS network. For example, when $C_I=12$ and $\theta=\frac{\pi}{12}$, an MC-IS-DA network can further reduce the delay by 24 times lower that of an MC-IS network and reduce the delay by 288 times lower than that of an SC-IS network.Comment: accepted, IEEE Transactions on Vehicular Technology, 201

Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-mfading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics

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