Spectrum Map and its Application in Cognitive Radio Networks

Recent measurements on radio spectrum usage have revealed the abundance of underutilized bands of spectrum that belong to licensed users. This necessitated the paradigm shift from static to dynamic spectrum access. Cognitive radio based secondary networks that utilize such unused spectrum holes in the licensed band, have been proposed as a possible solution to the spectrum crisis. The idea is to detect times when a particular licensed band is unused and use it for transmission without causing interference to the licensed user. We argue that prior knowledge about occupancy of such bands and the corresponding achievable performance metrics can potentially help secondary networks to devise effective strategies to improve utilization. In this work, we use Shepard\u27s method of interpolation to create a spectrum map that provides a spatial distribution of spectrum usage over a region of interest. It is achieved by intelligently fusing the spectrum usage reports shared by the secondary nodes at various locations. The obtained spectrum map is a continuous and differentiable 2-dimension distribution function in space. With the spectrum usage distribution known, we show how different radio spectrum and network performance metrics like channel capacity, secondary network throughput, spectral efficiency, and bit error rate can be estimated. We show the applicability of the spectrum map in solving the intra-cell channel allocation problem in centralized cognitive radio networks, such as IEEE 802.22. We propose a channel allocation scheme where the base station allocates interference free channels to the consumer premise equipments (CPE) using the spectrum map that it creates by fusing the spectrum usage information shared by some CPEs. The most suitable CPEs for information sharing are chosen on a dynamic basis using an iterative clustering algorithm. Next, we present a contention based media access control (MAC) protocol for distributed cognitive radio network. The unlicensed secondary users contend among themselves over a common control channel. Winners of the contention get to access the available channels ensuring high utilization and minimum collision with primary incumbent. Last, we propose a multi-channel, multi-hop routing protocol with secondary transmission power control. The spectrum map, created and maintained by a set of sensors, acts as the basis of finding the best route for every source destination pair. The proposed routing protocol ensures primary receiver protection and maximizes achievable link capacity. Through simulation experiments we show the correctness of the prediction model and how it can be used by secondary networks for strategic positioning of secondary transmitter-receiver pairs and selecting the best candidate channels. The simulation model mimics realistic distribution of TV stations for urban and non-urban areas. Results validate the nature and accuracy of estimation, prediction of performance metrics, and efficiency of the allocation process in an IEEE 802.22 network. Results for the proposed MAC protocol show high channel utilization with primary quality of service degradation within a tolerable limit. Performance evaluation of the proposed routing scheme reveals that it ensures primary receiver protection through secondary power control and maximizes route capacity

Physical layer network coding based communication systems in frequency selective channels

PhD ThesisThe demand for wireless communications is growing every day which requiresmore speed and bandwidth. In two way relay networks (TWRN), physical layer network coding (PLNC) was proposed to double the bandwidth. A TWRN is a system where two end users exchange data through a middle node called the relay. The two signals are allowed to be physically added before being broadcasted back to the end users. This system can work smoothly in flat fading channels, but can not be applied straightforward in frequency selective channels. In a multipath multi-tap FIR channel, the inter-symbol interference (ISI) spreads through several symbols. In this case, the symbols at the relay are not just an addition of the sent symbols but also some of the previous symbols from both sides. This not only causes a traditional PLNC to fail but also a simple one equalizer system will not solve the problem. Three main methods have been proposed by other researchers. The OFDM based PLNC is the simplest in terms of implementation and complexity but suffers from the disadvantages of the OFDMlike cyclic prefix overhead and frequency offset. The main disadvantage, however is the relatively low BER performance because it is restricted to linear equalizers in the PLNC system. Another approach is pre-filtering or pre-equalization. This method also has some disadvantages like complexity, sensitivity to channel variation and the need of a feedback channel for both end nodes. Finally, the maximum likelihood sequence detector was also proposed but is restricted to BPSK modulation and exponentially rising complexity are major drawbacks. The philosophy in this work is to avoid these disadvantages by using a time domain based system. The DFE is the equalizer of choice here because it provides a non-trivial BER performance improvement with very little increase in complexity. In this thesis, the problem of frequency selective channels in PLNC systems can be solved by properly adjusting the design of the system including the DFE. The other option is to redesign the equalizer to meet that goal. An AF DFE system is proposed in this work that provides very low complexity especially at the relay with little sensitivity to channel changes. A multi-antenna DNF DFE system is also proposed here with an improved performance. Finally, a new equalizer is designed for very low complexity and cost DNF approach with little sacrifice of BER performance. Matlab was used for the simulations with Monte Carlo method to verify the findings of this work through finding the BER performance of each system. This thesis opens the door for future improvement on the PLNC system. More research needs to be done like testing the proposed systems in real practical implementation and also the effect of adding channel coding to these systems.Iraqi Government, Ministry of Higher Educatio

Change blindness: eradication of gestalt strategies

Arrays of eight, texture-defined rectangles were used as stimuli in a one-shot change blindness (CB) task where there was a 50% chance that one rectangle would change orientation between two successive presentations separated by an interval. CB was eliminated by cueing the target rectangle in the first stimulus, reduced by cueing in the interval and unaffected by cueing in the second presentation. This supports the idea that a representation was formed that persisted through the interval before being 'overwritten' by the second presentation (Landman et al, 2003 Vision Research 43149–164]. Another possibility is that participants used some kind of grouping or Gestalt strategy. To test this we changed the spatial position of the rectangles in the second presentation by shifting them along imaginary spokes (by ±1 degree) emanating from the central fixation point. There was no significant difference seen in performance between this and the standard task [F(1,4)=2.565, p=0.185]. This may suggest two things: (i) Gestalt grouping is not used as a strategy in these tasks, and (ii) it gives further weight to the argument that objects may be stored and retrieved from a pre-attentional store during this task

Formulation, implementation considerations, and first performance evaluation of algorithmic solutions - D4.1

Deliverable D4.1 del projecte Europeu OneFIT (ICT-2009-257385)This deliverable contains a first version of the algorithmic solutions for enabling opportunistic networks. The presented algorithms cover the full range of identified management tasks: suitability, creation, QoS control, reconfiguration and forced terminations. Preliminary evaluations complement the proposed algorithms. Implementation considerations towards the practicality of the considered algorithms are also included.Preprin