This work develops new achievable rate regions for the two way wiretap channel. In our setup, Alice and Bob wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, our achievability argument relies on allowing the two users to jointly optimize their channel prefixing distributions, such that the new channel conditions are favorable compared to that of Eve. Random binning and private key sharing over the channel are then used to exploit the secrecy advantage available in the equivalent cascade channel and to distribute the available secrecy

We consider a wireless communication scenario with K source-destination pairs communicating through several half-duplex amplify-and-forward relays. We design the relay beamforming matrices by minimizing the total power transmitted from all the relays subject to quality of service constraints on the received signal to interference-plus-noise ratio at each destination node. We propose a novel method for solving the resulting nonconvex optimization problem in which the problem is decomposed into a group of second-order cone programs (SOCPs) parameterized by K real parameters. Grid search or

Cognitive radio technology would enable a set of secondary users (SU) to opportunistically use the spectrum licensed to a primary user (PU). On the appearance of this PU on a specific frequency band, any SU occupying this band should free it for PUs. Typically, SUs may collaborate to reduce the impact of cognitive users on the primary network and to improve the performance of the SUs. In this paper, we propose and analyze the performance of virtual reservation in collaborative cognitive networks. Virtual reservation is a novel link maintenance strategy that aims to maximize the throughput of

We consider a class of wireless powered devices employing hybrid automatic repeat request to ensure reliable end-to-end communications over a two-state time-varying channel. A receiver, with no power source, relies on the energy transferred by a simultaneous wireless information and power transfer enabled transmitter to receive and decode information. Under the two-state channel model, information is received at two different rates while it is only possible to harvest energy in one of the states. The receiver aims to decode its messages with minimum expected number of re-transmissions. Dynamic

Sensor Actor NETworks (SANET) represent a major component of ubiquitous service environments promising interesting solutions to a wide range of problems. Despite the obvious increase in the research activities proposing architectures and protocols for SANETs, we are still no where near the production of industrial-grade SANET software that can be relied upon for mission critical applications. The cost of programming, deploying and maintaining SANET environments is still highly prohibitive due to the lack of industrial tools capable of realizing adaptive SANET software in a cost effective way

In this paper, we completely characterize the deterministic capacity region of a four-node relay network with no direct links between the nodes, where each node communicates with the three other nodes via a relay. Towards this end, we develop an upper bound on the deterministic capacity region, based on the notion of a one-sided genie. To establish achievability, we use the detour schemes that achieve the upper bound by routing specific bits via indirect paths instead of sending them directly. © 2013 IEEE.

We consider a cognitive radio scenario with an energy harvesting secondary user (SU) attempting to access a primary channel randomly. We assume multipacket reception (MPR) capability and investigate a system in which the SU may or may not exploit the primary feedback messages. The access probabilities are obtained to maximize the secondary throughput under the constraints of primary queue stability and such that the primary queueing delay is kept below a specified value in order to guarantee a certain quality of service (QoS) for the primary user (PU). We investigate the impact of the energy

We consider a secondary user with energy harvesting capability. We design access schemes for the secondary user which incorporate random spectrum sensing and random access, and which make use of the primary automatic repeat request (ARQ) feedback. The sensing and access probabilities are obtained such that the secondary throughput is maximized under the constraints that both the primary and secondary queues are stable and that the primary queueing delay is kept lower than a specified value needed to guarantee a certain quality of service (QoS) for the primary user. We consider spectrum sensing

In this paper, we introduce a novel geographic routing with cooperation scheme for 5G Device-to-Device ad hoc networks. The prime focus of our scheme (coined Cooperative Routing for Reliable Paths (CRRP)) is to enhance the routing performance in cooperative communication networks in terms of the path length and reliability. In particular, it introduces novel algorithms for cooperative relay and forwarder selections, which strike the best balance between path length and achieved symbol error rate, compared to prior work in the literature. Moreover, it exhibits the flexibility of deciding

Recently, emerging vehicular applications are increasing the demand of vehicles which form significant burdens on network backhaul and represents a cause to the quality of experience (QoE) decay of the vehicular users. Proactive caching is a promising technique to mitigate the load on core networks by caching some of the expected data items. This work proposes a hierarchical proactive caching scheme which jointly considers caching in vehicles and roadside units (RSUs). Minimization of the vehicle communication latency is the main objective of our study. The optimization problem is formulated