Random numbers play an essential role in guaranteeing secrecy in most cryptographic systems. A chaotic optical signal is exploited to achieve high-speed random numbers. It could be generated by using one or more semiconductor lasers with external optical feedback. However, this system faces two major issues, high peak to average power ratio (PAPR) and parameter variations. These issues highly affected the randomness of the generated bitstreams. In this paper, we use a non-linear compression technique to compand the generated signal before it is quantized to avoid the effects of the PAPR. Also

Quantum cryptography is a promising technology that achieves unconditional security, which is essential to a wide range of sensitive applications. In contrast to optical fiber, the free-space optical (FSO) link is efficiently used as a quantum channel without affecting the polarization of transmitted photons. However, the FSO link has several impairments, such as atmospheric turbulence and pointing errors, which affect the performance of the quantum channel. This paper proposes a quantum key distribution (QKD) scheme that uses a time-bin entanglement protocol over the FSO channel that suffers

Wireless video sensor networks (WVSNs) are opening the door for many applications, such as industrial surveillance, environmental tracking, border security, and infrastructure health monitoring. In WVSN, energy conservation is very essential because: 1) sensors are usually battery-operated and 2) each sensor node needs to compress the video prior to transmission, which consumes more power than conventional wireless sensor networks. In this paper, we study the problem of minimizing the total power consumption in a cluster-based WVSN, leveraging cross-layer design to optimize the encoding power

This paper presents an energy efficient relay deployment algorithm that determines the optimal location and number of relays for future wireless networks, including Long Term Evolution (LTE)-Advanced heterogeneous networks. We formulate an energy minimization problem for macro-relay heterogeneous networks as a Mixed Integer Linear Programming (MILP) problem. The proposed algorithm not only optimally connects users to either relays or eNodeBs (eNBs), but also allows eNBs to switch into inactive mode. This is possible by enabling relay-to-relay communication which forms the basis for relays to

In this paper we investigate admission control and power allocation for cognitive radios in an underlay network. We consider the problem of maximizing the number of supported secondary links under their minimum QoS requirements without violating the maximum tolerable interference on primary receivers in a cellular network. An optimal solution to our problem is shown in previous works to be NP-hard. We propose an efficient distributed algorithm with reasonable complexity that provides results close to the optimum solution without requiring neither a large amount of signaling nor a wide range of

In this paper, the degrees of freedom (DoF) of the two-user single input single output (SISO) X channel are investigated. Three cases are considered for the availability of channel state information at the transmitters (CSIT); perfect, delayed, and no-CSIT. A new achievable scheme is proposed to elucidate the potency of interference creation-resurrection (IRC) when the available CSIT alternates between these three cases. For some patterns of alternating CSIT, the proposed scheme achieves 4/3 DoF, and hence, coincides with the information theoretic upper bound on the DoF of the X channel with

In this paper, a two-hop cellular relay network consisting of two source-destination pairs equipped with M antennas is considered where each source is assisted by two decode-and-forward relays operating in half-duplex mode and the relays are equipped with N antennas. The DoF of the system is investigated for both simultaneous and alternate relaying configurations. For each relay configuration, an outer bound on the degrees of freedom (DoF) is developed. A new achievable scheme is proposed that meets the upper bound on the maximum DoF for all values of M andN except for M

We consider a multiple access primary network with N transmitters. A secondary link of one transmitter and a corresponding receiver causes interference to the primary network. An achievable rate region for the primary network and the secondary link is obtained given the following mode of operation. The secondary transmitter employs rate-splitting so that the primary receiver can decode part of the secondary's signal and cancel it. The secondary receiver, on the other hand, treats primary interference as noise. Given a Gaussian channel model, we investigate the effect of rate-splitting on the

In this paper, a cellular relaying network consisting of two source-destination pairs, and four decode-and-forward relays operating in half-duplex mode is considered. Each source is assisted by two relays and all nodes are equipped with N antennas. In order to compensate for the loss of capacity by a factor of half due to the half-duplex mode, an alternate transmission protocol among the two relays is proposed. An outer bound on the degrees of freedom (DoF) of this system is developed. A constructive proof of achievability based on two different schemes is provided. Aligning the inter-relay

Information extraction and reasoning from massive high-dimensional data at dynamic contexts, is very demanding and yet is very hard to obtain in real-time basis. However, such process capability and efficiency might be affected and limited by the available computational resources and the consequent power consumption. Conventional search mechanisms are often incapable of real-time fetching a predefined content from data source, without concerning the increased number of connected devices that contribute to the same source. In this work, we propose and present a concept for an efficient approach