In this paper, we develop novel Automatic Repeat reQuest (ARQ) key sharing protocols for correlated fading channels. In particular, a novel role of "dumb antennas" in overcoming the negative impact of spatial correlation, on the achievable secrecy rates , is unveiled. We further develop an adaptive rate allocation policy which achieves higher secrecy rates by exploiting the channel temporal correlation. The performance gains offered by the proposed schemes are demonstrated by a comprehensive set of numerical results.

Inspired by our earlier work on Automatic Repeat reQuest (ARQ) secrecy, we propose a simple, yet efficient, security overlay protocol to existing 802.11 networks. Our work targets networks secured by theWired Equivalent Privacy (WEP) protocol because of its widespread use and vulnerability to a multitude of security threats. By exploiting the existing ARQ protocol in the 802.11 standard, our proposed opportunistic secrecy scheme is shown to defend against all known passive WEP attacks. Moreover, our implementation on the madwifi-ng driver is used to establish the achievability of a vanishing

Filter bank multi-carrier (FBMC) is considered a promising alternative to the Orthogonal Frequency Division Multiplexing (OFDM) scheme. It improves spectral efficiency by eliminating the need for cyclic prefix while attenuating interference due to the robustness of the out-of-band emission. In this work, we present a framework, and the performance evaluation of FBMC is a multi-carrier modulation scheme for the direct detection of optical communications. As the proposed model has higher spectral efficiency than the classical ACO-OFDM, as removing the guard interval enhances the spectral

An authentication counterpart of Wyner's study of the wiretap channel is developed in this work. More specifically, message authentication over noisy channels is studied while impersonation and substitution attacks are investigated for both single- and multiple-message scenarios. For each scenario, information-theoretic lower and upper bounds on the opponent's success, or cheating, probability are derived. Remarkably, in both scenarios, the lower and upper bounds are shown to match, and hence, the fundamental limits on message authentication over noisy channels are fully characterized. The

The surge in demand for Internet of Things (IoT) systems and applications has motivated a paradigm shift in the development of viable radio frequency identification technology (RFID)-based solutions for ubiquitous real-Time monitoring and tracking. Bit tracking-based anti-collision algorithms have attracted considerable attention, recently, due to its positive impact on decreasing the identification time. We aim to extend bit tracking to work effectively over erroneous channels and scalable multi RFID readers systems. Towards this objective, we extend the bit tracking technique along two

In this paper, we propose a new optimization-based access strategy of multi-packet reception (MPR) channel for multiple secondary users (SUs) accessing the primary user (PU) spectrum. We devise an analytical model that realizes the multi-packet access strategy of the SUs. All the network receiving nodes have MPR capability. We aim at maximizing the throughput of the individual SUs subject to the PU's queue stability. Moreover, we are interested in providing an energy-efficient cognitive scheme. Therefore, we include energy constraints on the PU and SU average transmitted energy to the

Indoor localization has recently attended an increase in interest due to the potential for a wide range of services. In this paper, indoor high-precision positioning and motion prediction algorithms are proposed by using light fidelity (LI-FI) system with angular diversity receiver (ADR). The positioning algorithm uses to estimate the location of an object in the room. Furthermore, the prediction algorithm applies to predict the motion of that object. The simulation results show that the average root mean squares error of the positioning algorithm is about 0.6 cm, and the standard deviation

We investigate the performance of caching in relay networks where an intermediate relay station (RS) caches content for future demand by end users. With uncertain user demand over multiple data items and dynamically changing wireless links, we characterize the optimal transmission time for serving data items, cached data portion allocation of relay station and optimal service portion, which represents a part from the cached portion, to minimize the total average transmission energy. We argue that under several settings fully caching the higher popular items is the optimal caching policy which

Harnessing information about the user mobility pattern and daily demand can enhance the network capability to improve the quality of experience (QoE) at Vehicular Ad- Hoc Networks (VANETs). Proactive caching, as one of the key features offered by 5G networks, has lately received much interest. However, more research is still needed to convey large-sized multimedia content including video, audio and pictures to the high speed moving vehicles. In this paper, we study the gains achieved by proactive caching in Roadside Units (RSUs) where we take into consideration the effect of the vehicle

The gaining sharing knowledge based optimization algorithm (GSK) is recently developed metaheuristic algorithm, which is based on how humans acquire and share knowledge during their life-time. This paper investigates a modified version of the GSK algorithm to find the best feature subsets. Firstly, it represents a binary variant of GSK algorithm by employing a probability estimation operator (Bi-GSK) on the two main pillars of GSK algorithm. And then, the chaotic maps are used to enhance the performance of the proposed algorithm. Ten different types of chaotic maps are considered to adapt the