Random linear network coding based physical layer security for relay-aided device-to-device communication

We investigate physical layer security design, which employs random linear network coding with opportunistic relaying and jamming to exploit the secrecy benefit of both source and relay transmissions. The proposed scheme requires the source to transmit artificial noise along with a confidential message. Moreover, in order to further improve the dynamical behaviour of the network against an eavesdropping attack, aggregated power controlled transmissions with optimal power allocation strategy is considered. The network security is accurately characterised by the probability that the eavesdropper will manage to intercept a sufficient number of coded packets to partially or fully recover the confidential message

A Two-Level Game Theory Approach for Joint Relay Selection and Resource Allocation in Network Coding Assisted D2D Communications

Device-to-device (D2D) communication, which enables direct transmissions between mobile devices to improve spectrum efficiency, is one of the preferable candidate technologies for the next generation cellular network. Network coding, on the other hand, is widely used to improve throughput in ad hoc networks. Thus, the performance of D2D communications in cellular networks can potentially benefit from network coding. Aiming to improve the achievable capacity of D2D communications, we propose a system with inter-session network coding enabled to assist D2D transmissions. We formulate the joint problem of relay selection and resource allocation in network coding assisted D2D communications, and obtain the overall capacity of the network under complex interference conditions as a function of the relay selection and resource allocation. To solve the formulated problem, we propose a two-level decentralized approach termed NC-D2D, which solves the relay selection and resource allocation problems alternatively to obtain stable solutions for these two problems. Specifically, a coalition formation game associates relays with D2D pairs to enable network coding aided transmissions, and a greedy algorithm based game allocates limited cellular resources to D2D pairs and relays in NC-D2D, respectively. The performances of the proposed scheme is evaluated through extensive simulations to prove its superiority

Seeing the Unobservable: Channel Learning for Wireless Communication Networks

Wireless communication networks rely heavily on channel state information (CSI) to make informed decision for signal processing and network operations. However, the traditional CSI acquisition methods is facing many difficulties: pilot-aided channel training consumes a great deal of channel resources and reduces the opportunities for energy saving, while location-aided channel estimation suffers from inaccurate and insufficient location information. In this paper, we propose a novel channel learning framework, which can tackle these difficulties by inferring unobservable CSI from the observable one. We formulate this framework theoretically and illustrate a special case in which the learnability of the unobservable CSI can be guaranteed. Possible applications of channel learning are then described, including cell selection in multi-tier networks, device discovery for device-to-device (D2D) communications, as well as end-to-end user association for load balancing. We also propose a neuron-network-based algorithm for the cell selection problem in multi-tier networks. The performance of this algorithm is evaluated using geometry-based stochastic channel model (GSCM). In settings with 5 small cells, the average cell-selection accuracy is 73% - only a 3.9% loss compared with a location-aided algorithm which requires genuine location information.Comment: 6 pages, 4 figures, accepted by GlobeCom'1

How Much Can D2D Communication Reduce Content Delivery Latency in Fog Networks with Edge Caching?

A Fog-Radio Access Network (F-RAN) is studied in which cache-enabled Edge Nodes (ENs) with dedicated fronthaul connections to the cloud aim at delivering contents to mobile users. Using an information-theoretic approach, this work tackles the problem of quantifying the potential latency reduction that can be obtained by enabling Device-to-Device (D2D) communication over out-of-band broadcast links. Following prior work, the Normalized Delivery Time (NDT) --- a metric that captures the high signal-to-noise ratio worst-case latency --- is adopted as the performance criterion of interest. Joint edge caching, downlink transmission, and D2D communication policies based on compress-and-forward are proposed that are shown to be information-theoretically optimal to within a constant multiplicative factor of two for all values of the problem parameters, and to achieve the minimum NDT for a number of special cases. The analysis provides insights on the role of D2D cooperation in improving the delivery latency.Comment: Submitted to the IEEE Transactions on Communication

The Degrees-of-Freedom of Multi-way Device-to-Device Communications is Limited by 2

A 3-user device-to-device (D2D) communications scenario is studied where each user wants to send and receive a message from each other user. This scenario resembles a 3-way communication channel. The capacity of this channel is unknown in general. In this paper, a sum-capacity upper bound that characterizes the degrees-of-freedom of the channel is derived by using genie-aided arguments. It is further shown that the derived upper bound is achievable within a gap of 2 bits, thus leading to an approximate sum-capacity characterization for the 3-way channel. As a by-product, interesting analogies between multi-way communications and multi-way relay communications are concluded.Comment: 5 pages, ISIT 201