Reliable machine-to-machine multicast services with multi-radio cooperative retransmissions

The final publication is available at Springer via http://dx.doi.org/10.1007/s11036-015-0575-6The 3GPP is working towards the definition of service requirements and technical solutions to provide support for energy-efficient Machine Type Communications (MTC) in the forthcoming generations of cellular networks. One of the envisioned solutions consists in applying group management policies to clusters of devices in order to reduce control signaling and improve upon energy efficiency, e.g., multicast Over-The-Air (OTA) firmware updates. In this paper, a Multi-Radio Cooperative Retransmission Scheme is proposed to efficiently carry out multicast transmissions in MTC networks, reducing both control signaling and improving energy-efficiency. The proposal can be executed in networks composed by devices equipped with multiple radio interfaces which enable them to connect to both a cellular access network, e.g., LTE, and a short-range MTC area network, e.g., Low-Power Wi-Fi or ZigBee, as foreseen by the MTC architecture defined by ETSI. The main idea is to carry out retransmissions over the M2M area network upon error in the main cellular link. This yields a reduction in both the traffic load over the cellular link and the energy consumption of the devices. Computer-based simulations with ns-3 have been conducted to analyze the performance of the proposed scheme in terms of energy consumption and assess its superior performance compared to non-cooperative retransmission schemes, thus validating its suitability for energy-constrained MTC applications.Peer ReviewedPostprint (author's final draft

The Three Node Wireless Network: Achievable Rates and Cooperation Strategies

We consider a wireless network composed of three nodes and limited by the half-duplex and total power constraints. This formulation encompasses many of the special cases studied in the literature and allows for capturing the common features shared by them. Here, we focus on three special cases, namely 1) Relay Channel, 2) Multicast Channel, and 3) Conference Channel. These special cases are judicially chosen to reflect varying degrees of complexity while highlighting the common ground shared by the different variants of the three node wireless network. For the relay channel, we propose a new cooperation scheme that exploits the wireless feedback gain. This scheme combines the benefits of decode-and-forward and compress-and-forward strategies and avoids the idealistic feedback assumption adopted in earlier works. Our analysis of the achievable rate of this scheme reveals the diminishing feedback gain at both the low and high signal-to-noise ratio regimes. Inspired by the proposed feedback strategy, we identify a greedy cooperation framework applicable to both the multicast and conference channels. Our performance analysis reveals several nice properties of the proposed greedy approach and the central role of cooperative source-channel coding in exploiting the receiver side information in the wireless network setting. Our proofs for the cooperative multicast with side-information rely on novel nested and independent binning encoders along with a list decoder.Comment: 52 page

Massive MIMO Multicasting in Noncooperative Cellular Networks

We study the massive multiple-input multiple-output (MIMO) multicast transmission in cellular networks where each base station (BS) is equipped with a large-scale antenna array and transmits a common message using a single beamformer to multiple mobile users. We first show that when each BS knows the perfect channel state information (CSI) of its own served users, the asymptotically optimal beamformer at each BS is a linear combination of the channel vectors of its multicast users. Moreover, the optimal combining coefficients are obtained in closed form. Then we consider the imperfect CSI scenario where the CSI is obtained through uplink channel estimation in timedivision duplex systems. We propose a new pilot scheme that estimates the composite channel which is a linear combination of the individual channels of multicast users in each cell. This scheme is able to completely eliminate pilot contamination. The pilot power control for optimizing the multicast beamformer at each BS is also derived. Numerical results show that the asymptotic performance of the proposed scheme is close to the ideal case with perfect CSI. Simulation also verifies the effectiveness of the proposed scheme with finite number of antennas at each BS.Comment: to appear in IEEE JSAC Special Issue on 5G Wireless Communication System

Algorithmic Aspects of Energy-Delay Tradeoff in Multihop Cooperative Wireless Networks

We consider the problem of energy-efficient transmission in delay constrained cooperative multihop wireless networks. The combinatorial nature of cooperative multihop schemes makes it difficult to design efficient polynomial-time algorithms for deciding which nodes should take part in cooperation, and when and with what power they should transmit. In this work, we tackle this problem in memoryless networks with or without delay constraints, i.e., quality of service guarantee. We analyze a wide class of setups, including unicast, multicast, and broadcast, and two main cooperative approaches, namely: energy accumulation (EA) and mutual information accumulation (MIA). We provide a generalized algorithmic formulation of the problem that encompasses all those cases. We investigate the similarities and differences of EA and MIA in our generalized formulation. We prove that the broadcast and multicast problems are, in general, not only NP hard but also o(log(n)) inapproximable. We break these problems into three parts: ordering, scheduling and power control, and propose a novel algorithm that, given an ordering, can optimally solve the joint power allocation and scheduling problems simultaneously in polynomial time. We further show empirically that this algorithm used in conjunction with an ordering derived heuristically using the Dijkstra's shortest path algorithm yields near-optimal performance in typical settings. For the unicast case, we prove that although the problem remains NP hard with MIA, it can be solved optimally and in polynomial time when EA is used. We further use our algorithm to study numerically the trade-off between delay and power-efficiency in cooperative broadcast and compare the performance of EA vs MIA as well as the performance of our cooperative algorithm with a smart noncooperative algorithm in a broadcast setting.Comment: 12 pages, 9 figure

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page