Spectrum sensing is one of the most challenging tasks required of a cognitive radio receiver. In this paper, we consider the first stage of spectrum sensing, where it is required to perform the sensing as fast as possible and with an acceptable performance under different channel conditions. The target signal to be sensed is a Long Term Evolution (LTE) signal. We first propose sensing the whole LTE signal bandwidth using the Fast Wavelet Transform (FWT) algorithm and then compare it to the Fast Fourier Transform (FFT)-based algorithm in terms of complexity and performance. A new algorithm is

This paper presents a radio optical network simulation tool (RONST) for modeling optical-wireless systems. For a typical optical and electrical chain environment, performance should be optimized concurrently before system implementation. As a result, simulating such systems turns out to be a multidisciplinary problem. The governing equations are incompatible with co-simulation in the traditional environments of existing software (SW) packages. The ultra-wideband (UWB) technology is an ideal candidate for providing high-speed short-range access for wireless services. The limited wireless reach

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

In this paper, we study a wireless powered cellular network (WPCN) supported with network coding capability. In particular, we consider a network consisting of k cellular users (CUs) served by a hybrid access point (HAP) that takes over energy transfer to the users on top of information transmission over both the uplink (UL) and downlink (DL). Each CU has k+1 states representing its communication behavior, and collectively are referred to as the user demand profile. Opportunistically, when the CUs have information to be exchanged through the HAP, it broadcasts this information in coded format

A game-theoretic framework is developed to design and analyze the resource allocation algorithms in fading multiple-access channels (MACs), where the users are assumed to be selfish, rational, and limited by average power constraints. The maximum sum-rate point on the boundary of the MAC capacity region is shown to be the unique Nash equilibrium of the corresponding water-filling game. This result sheds a new light on the opportunistic communication principle. The base station is then introduced as a player interested in maximizing a weighted sum of the individual rates. A Stackelberg

The layered architecture that guided the design of the Internet is deemed inadequate as a reference model for engineering protocols for NGN. Layered protocol suites impose a strict sequential order on protocol execution conflicting with the efficient engineering of end systems, as well as failing to express vertical functional integration, the separation of control and data planes, and the distributed nature of network functions. Furthermore, protocols developed according to the layered architecture are implemented as monolithic blocks with undefined or implicit dependencies lacking

This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is the novel noise-forwarding (NF) strategy, where the relay node sends codewords independent of the source message to confuse the eavesdropper. This strategy is used to illustrate the deaf helper

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and the eavesdropper. The secrecy capacity under this full CSI assumption serves as an upper bound for the secrecy capacity when only

In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and feedback signals share the same noisy channel in the present model. Quite interestingly, this noisy feedback model is shown to be more advantageous in the current setting. More specifically, the discrete memoryless modulo-additive channel with a full-duplex destination node is considered first, and it is shown that the judicious use of feedback increases the

This paper studies interference channels with security constraints. The existence of an external eavesdropper in a two-user interference channel is assumed, where the network users would like to secure their messages from the external eavesdropper. The cooperative binning and channel prefixing scheme is proposed for this system model which allows users to cooperatively add randomness to the channel in order to degrade the observations of the external eavesdropper. This scheme allows users to add randomness to the channel in two ways: 1) Users cooperate in their design of the binning codebooks