A Robust Carrier Frequency Offset Estimation Algorithm in Burst Mode Multicarrier CDMA based Ad Hoc Networks

The future wireless communication systems demand very high data rates, anti-jamming ability and multiuser support. People want large amount of data to be continuously accessible in their personal devices. Direct Sequence (DS) spread spectrum based techniques such as Code Division Multiple Access (CDMA) fulfil these requirements but, at the same time, suffer from the Intersymbol Interference (ISI). Multicarrier CDMA (MC-CDMA) is an emerging technology to be used in mobile devices operating in an ad hoc setting due to its immunity towards ISI and having all the advantages of spread spectrum communication. One of the major problems with MC-CDMA is the high sensitivity towards carrier frequency offsets caused due to the inherent inaccuracy of crystal oscillators. This carrier frequency offset destroys the orthogonality of the subcarriers resulting in Intercarrier Interference (ICI). In this paper, we propose a computationally efficient algorithm based on Fast Fourier Transform (FFT) and biquadratic Lagrange interpolation. The FFT is based on the use of overlapping windows for each frame of the data instead of non-overlapping windows. This gives a coarse estimate of the frequency offset which is refined by the successive application of Lagrange quadratic interpolation to the samples in the vicinity of FFT peak. The proposed algorithm has been applied to the multiuser ad hoc network and simulated in Stanford University Interim (SUI) channels. It has been shown by simulations that the proposed algorithm provides better performance of almost 1~2 dB as compared to the well-known algorithms

Cache-Enabled in Cooperative Cognitive Radio Networks for Transmission Performance

The proliferation of mobile devices that support the acceleration of data services (especially smartphones) has resulted in a dramatic increase in mobile traffic. Mobile data also increased exponentially, already exceeding the throughput of the backhaul. To improve spectrum utilization and increase mobile network traffic, in combination with content caching, we study the cooperation between primary and secondary networks via content caching. We consider that the secondary base station assists the primary user by pre-caching some popular primary contents. Thus, the secondary base station can obtain more licensed bandwidth to serve its own user. We mainly focus on the time delay from the backhaul link to the secondary base station. First, in terms of the content caching and the transmission strategies, we provide a cooperation scheme to maximize the secondary user’s effective data transmission rates under the constraint of the primary users target rate. Then, we investigate the impact of the caching allocation and prove that the formulated problem is a concave problem with regard to the caching capacity allocation for any given power allocation. Furthermore, we obtain the joint caching and power allocation by an effective bisection search algorithm. Finally, our results show that the content caching cooperation scheme can achieve significant performance gain for the primary and secondary systems over the traditional two-hop relay cooperation without caching

Quality and Availability of spectrum based routing for Cognitive radio enabled IoT networks

With the recent emergence and its wide spread applicability Internet of Things (IoT) is putting pressure on network resources and most importantly on availability of spectrum. Spectrum scarcity is the issue to be addressed in networking within IoT. Cognitive radio is the technology which addresses the problem of spectrum scarcity in an efficient way. Equipping the IoT devices with cognitive radio capability will lead to a new dimension called cognitive radio enabled IoT devices. To achieve ON-demand IoT solutions and interference free communications cognitive radio enabled IoT devices will become an effective platform for many applications. As there is high dynamicity in availability of spectrum it is challenging for designing an efficient routing protocol for secondary users in cognitive device networks. In this work we are going to estimate spectrum quality and spectrum availability based on two parameters called global information about spectrum usage and instant spectrum status information. Enhanced energy detector is used at each and every node for better probability of detection. For estimating spectrum quality and availability we are introducing novel routing metrics. To have restriction on the number of reroutings and to increase the performance of routing in our proposed routing metric only one retransmission is allowed. Then, two algorithms for routing are designed for evaluating the performance of routing and we find that the bit error rates of proposed algorithms (nodes are dynamic) have decreased a lot when compared to conventional methods (Nodes are static) and throughput of proposed algorithm also improved a lot

Quality and Availability of spectrum based routing for Cognitive radio enabled IoT networks

With the recent emergence and its wide spread applicability Internet of Things (IoT) is putting pressure on network resources and most importantly on availability of spectrum. Spectrum scarcity is the issue to be addressed in networking within IoT. Cognitive radio is the technology which addresses the problem of spectrum scarcity in an efficient way. Equipping the IoT devices with cognitive radio capability will lead to a new dimension called cognitive radio enabled IoT devices. To achieve ON-demand IoT solutions and interference free communications cognitive radio enabled IoT devices will become an effective platform for many applications. As there is high dynamicity in availability of spectrum it is challenging for designing an efficient routing protocol for secondary users in cognitive device networks. In this work we are going to estimate spectrum quality and spectrum availability based on two parameters called global information about spectrum usage and instant spectrum status information. Enhanced energy detector is used at each and every node for better probability of detection. For estimating spectrum quality and availability we are introducing novel routing metrics. To have restriction on the number of reroutings and to increase the performance of routing in our proposed routing metric only one retransmission is allowed. Then, two algorithms for routing are designed for evaluating the performance of routing and we find that the bit error rates of proposed algorithms (nodes are dynamic) have decreased a lot when compared to conventional methods (Nodes are static) and throughput of proposed algorithm also improved a lot

Distributed and asynchronous data collection in cognitive radio networks with fairness consideration

Abstract-As a promising communication paradigm, Cognitive Radio Networks (CRNs) have paved a road for Secondary Users (SUs) to opportunistically exploit unused licensed spectrum without causing unacceptable interference to Primary Users (PUs). In this paper, we study the distributed data collection problem for asynchronous CRNs, which has not been addressed before. We study the Proper Carrier-sensing Range (PCR) for SUs. By working with this PCR, an SU can successfully conduct data transmission without disturbing the activities of PUs and other SUs. Subsequently, based on the PCR, we propose an Asynchronous Distributed Data Collection (ADDC) algorithm with fairness consideration for CRNs. ADDC collects a snapshot of data to the base station in a distributed manner without the time synchronization requirement. The algorithm is scalable and more practical compared with centralized and synchronized algorithms. Through comprehensive theoretical analysis, we show that ADDC is order-optimal in terms of delay and capacity, as long as an SU has a positive probability to access the spectrum. Furthermore, we extend ADDC to deal with the continuous data collection issue, and analyze the delay and capacity performances of ADDC for continuous data collection, which are also proven to be order-optimal. Finally, extensive simulation results indicate that ADDC can effectively accomplish a data collection task and significantly reduce data collection delay