1 May 2014 in IEEE Communications Magazine
Device-to-device communication is currently a hot research topic within 3GPP. Even though D2D communication has been part of previous ad hoc, meshed and sensor networks proposals, the main contribution by 3GPP is that the direct communication among two devices is carried out over a dynamically assigned, licensed spectrum; thus, it is under full control of the cellular network. D2D communication creates a market potential for new services, new approaches to efficient spectrum use, and security concepts. This is especially true if D2D communication is extended to larger communication groups organized in meshed clusters. In this article, we discuss the potential and shortcomings of D2D communication as proposed today, advocating for the use of network coding as an enabling technology for enhanced security and communication efficiency using the PlayNCool and CORE protocols as key examples to deliver smarter D2D systems.
21 April 2011 in IEEE Journal on Selected Areas in Communications
A fundamental understanding of the delay behavior of network coding is key towards its successful application in real-time applications with strict message deadlines. Previous contributions focused mostly on the average decoding delay, which although useful in various scenarios of interest is not sufficient for providing worst-case delay guarantees. To overcome this challenge, we investigate the entire delay distribution of random linear network coding for any field size and arbitrary number of encoded symbols (or generation size). By introducing a Markov chain model we are able to obtain a complete solution for the erasure broadcast channel with two receivers. A comparison with Automatic Repeat reQuest (ARQ) with perfect feedback, round robin scheduling and a class of fountain codes reveals that network coding on GF(24) offers the best delay performance for two receivers. We also conclude that GF(2) induces a heavy tail in the delay distribution, which implies that network coding based on XOR operations although simple to implement bears a relevant cost in terms of worst-case delay. For the case of three receivers, which is mathematically challenging, we propose a brute-force methodology that gives the delay distribution of network coding for small generations and field size up to GF(24).
15 March 2012 in IEEE Transactions on Information Theory
In networks with large latency, feedback about received packets may lag considerably the transmission of the original packets, limiting the feedback's usefulness. Moreover, time duplex constraints may entail that receiving feedback may be costly. In this work, we consider tailoring feedback and coding jointly in such settings to reduce the expected delay for successful in order reception of packets. We find that, in certain applications, judicious choices provide results that are close to those that would be obtained with a full-duplex system. We study two cases of data transmission: one-to-all broadcast and all-to-all broadcast. We also analyze important practical considerations weighing the trade off between performance and complexity in applications that rely on random linear network coding. Finally, we study the problem of transmission of information under the large latency and time duplexing constraints in the presence of random packet arrivals. In particular, we analyze the problem of using a batch by batch approach and an online network coding approach with Poisson arrivals. We present numerical results to illustrate the performance under a variety of scenarios and show the benefits of the proposed schemes as compared to typical ARQ and scheduling schemes.