Cognitive Radio Ad Hoc Networks

Project Description

 

Cognitive Radio Ad Hoc Networks

CR Mesh and Sensor Networks

 


Architecture for Cognitive Radio Ad Hoc Networks

The components of the cognitive radio ad hoc network (CRAHN) architecture, as shown in Figure 1. The components of the CRAHN architecture can be classified in two groups as the primary network and the CR network components. The CR component may itself be composed of different types of networks, such as, wireless sensor networks, mesh networks and mobile ad hoc networks. Moreover, they may exist in overlapped areas, without the presence of a centralized controller or an established network infrastructure.



Figure 1. Cognitive radio ad hoc network architecture.


As shown in Figure 1, the chief components of the CRAHN architecture are described next:
  • Primary Network: This is referred to as an existing network, where the primary users (PUs) have a license to operate in a certain spectrum band. If primary networks have an infrastructure support, the operations of the PUs are controlled through primary base stations. Due to their priority in spectrum access, the PUs should not be affected by unlicensed users.

  • CR network (or secondary network): This does not have a license to operate in a desired band. Hence, additional functionality is required for CR users (or secondary user) to share the licensed spectrum band. Also, CR users are mobile, and can communicate with each other in a multi-hop manner on both licensed and unlicensed spectrum bands. However, they do not have direct communication channels with the primary networks and rely on their local observations during their operation.
Unique to CRAHNs, different types of networks may have different considerations. As an example, for mesh networks, the protocol design must support high volume traffic, while for sensor networks, the focus is on energy conservation and preventing packet drops. Mobility conditions must be inferred, often relying on local estimation, and the end-to-end protocol operation needs to be adapted accordingly.

Related work:
  • I. F. Akyildiz, W. Y. Lee, and K. R. Chowdhury, "CRAHNs: Cognitive Radio Ad Hoc Networks," Ad Hoc Networks (Elsevier) Journal, Vol. 7, No. 5, pp. 810-836, July 2009.
  • I. F. Akyildiz, W. Y. Lee, and K. R. Chowdhury, "Spectrum Management in Cognitive Radio Ad Hoc Networks," IEEE Network, July/August 2009.
  • P. Zhou and I. F. Akyildiz, ``Capacity and Delay Scaling in Cognitive Radio Ad Hoc Networks: Impact of Primary User Activity," submitted for publication, Jul. 2009.


Spectrum Sensing in CRAHNs

The components of the cognitive radio ad hoc network (CRAHN) architecture, as shown in Figure 1. The components of the CRAHN architecture can be classified in two groups as the primary network and the CR network components. The CR component may itself be composed of different types of networks, such as, wireless sensor networks, mesh networks and mobile ad hoc networks. Moreover, they may exist in overlapped areas, without the presence of a centralized controller or an established network infrastructure.



Figure 2. Spectrum Sensing Framework.


As collaboration among the CR users is a key enabling factor during spectrum sensing, we specifically focus on the following directions in this project:
  • Cooperation Optimization: In a CR ad-hoc network, CR users send their sensing information over the channel through multiple access techniques, and thus, their individual traffic adds to the probability of packet collisions. By requesting the sensing information from several CR users, the user that initiates the cooperative sensing improves the accuracy but also increases the network traffic. However, this also results in higher latency in collecting this information due to channel contention and packet re-transmissions.

  • Common Control Channel (CCC): The CCC facilitates neighbor discovery, helps in control message exchange between CR users, and also supports the spectrum sensing coordination. A key challenge is the design of such a CCC that is "always on" and is not affected by the PU activity. The CCC may have limited scope, reaching the set of nodes over a region where mutually common PU channels are affected. It may also change over time, adapting to the dynamic spectrum environment. In this project, we shall devise a CCC based on OFDM that allows flexible sub-carrier allocation to meet the above design goals.


Related work:
  • K. R. Chowdhury and I. F. Akyildiz, "OFDM based Common Control Channel Design for Cognitive Radio Networks," submitted for journal publication, May 2009.
  • B. F. Lo and I. F. Akyildiz, ``Efficient Recovery Control Channel Design in Cognitive Radio Ad Hoc Networks," Submitted for journal publication, May. 2009.


Spectrum Sharing in CRAHNs

The shared nature of the wireless channel necessitates coordination of transmission among the CR users. In the CRAHNs, the sensing schedules are determined and controlled by each user and are not synchronized by any central network entity. Thus, the CR ad hoc users independently perform sensing on an on-demand basis - i.e., when CR users want to transmit or are requested their spectrum availability by neighboring users. This closely couples the sensing functionality with spectrum sharing among the CR users, that is an integral part of the medium access control (MAC) layer coordination.





In Figure 3 (a), the block diagram for the CR MAC is shown, and the scheduling adaptation based on the duty cycle of the interferer is given in Figure 3 (b).


  • Sensing Coordination: Depending upon the nature of the sensing, a local or network-wide quiet period needs to be enforced. It is an open research issue to coordinate with the CR users on the entire network scale, especially if the network is divided into smaller, independent partitions.

  • Transmission Scheduling: While the suitable choice of the spectrum band and channel may help in reducing the probability of interference between the CR and the primary network, it does not solve the problem of co-existence completely. By intelligently choosing the transmission time and duration, CR users may be able to share spectrum that is currently being used by a PU, without affecting the performance of the latter. In Figure 3 (b), such a transmission adaptation is shown for CSMA based and constant duty cycled PUs.


Related work:

  • K. R. Chowdhury and I. F. Akyildiz, "Interferer Classification, Channel Selection and Transmission Adaptation for Wireless Sensor Networks," in Proc. of IEEE ICC 2009, Dresden, Germany, June 2009.
  • C. Cormio and K. R. Chowdhury, "A Survey on MAC Protocols for Cognitive Radio Networks," Ad Hoc Networks (Elsevier) Journal, vol. 7, no. 7, pp. 1315-1329, September 2009.

 


Spectrum Decision in CRAHNs

CRAHNs require capabilities to decide on the best spectrum band among the available bands according to the QoS requirements of the applications. This notion is called spectrum decision and constitutes a rather important but yet unexplored topic in CRAHNs. Here, spectrum decision needs to consider the end-to-end route consisting of multiple hops. Furthermore, available spectrum bands in CR networks may differ at each hop. As a result, the connectivity concept in CRAHNs is spectrum-dependent. Thus, spectrum decision should interact with routing protocols to find the best combination of route and spectrum bands, and new performance metrics are needed for choosing the routes.



Figure 4. Spectrum decision and routing in CRAHNs.


The decentralized nature of the mesh network makes channel coordination between nodes of the same route difficult. When mesh routers are of a hetergeneous nature with different spectrum access capabilities (say, two adjacent routers A and B can only tune their radios to 700 MHz and 5 GHz respectively apart from the ISM band) this becomes a critical concern. Based on primary user activity information and secondary user QoS requirements, a new cognitive route metric is devised, as shown in Figure 4. Also, the mesh network is partitioned into trees, each tree being on a different spectrum band. This addresses the issue of heterogenous mesh routers operating on different bands and simplifies route management in case of new primary user arrivals. By maintaining a list of tree nodes that overlap with the other spectral trees, the root can perform fast lookups and path re-assignments. The tree structure also provides a bounded performance on the routing functionality, once it is set up.


Related work:

  • G. M. Zhu, I. F. Akyildiz and G. S. Kuo, "STOD-RP: A Spectrum-Tree Based On-Demand Routing Protocol for Multi-Hop Cognitive Radio Networks," in Proc. of IEEE GLOBECOM, New Orleans, USA, November 2008.


Spectrum Mobility in CRAHNs

PU activity on the currently used spectrum may necessitate the CR user to choose a new operating spectrum band, which is referred to as spectrum mobility. Spectrum mobility is closely linked to the maintenance of the routing path, as the need to change the spectrum may not always result in a new feasible spectrum for the affected link that meets the user constraints. At this time, the affected link, with minimal or highly varying spectrum availability, may need to be circumvented altogether and a new route must be formed that can provide the spectrum resource for acceptable performance.

The activity of the primary users (PUs) affects the channels of the licensed bands differently. This renders the channels unusable for the CR network to different geographical extents around the PU. In such a situation, the key decision is switching the channel in portions of the route, thus incurring a switching delay, or passing through entirely different regions altogether, thus increasing the latency. In addition, the frequently changing primary user (PU) activity and the mobility of the users make the problem of maintaining optimal routes in ad-hoc CR networks challenging. In this project, we develop a geographic forwarding based SpEctrum Aware Routing protocol for Cognitive Ad-hoc networks (SEARCH), that:

  • Jointly undertakes path and channel selection to avoid regions of PU activity when the spectrum conditions change.
  • Adapts to the newly discovered and lost spectrum opportunity during route operation.
  • Predicts node mobility and takes corrective measures to maintain end-to-end performance.


Figure 5. The interaction between route maintenance and spectrum mobility.


We consider a three-dimensional system, with the x-y plane representing the physical space where the CR network and the PUs are located. The z-axis shows the frequency scale and also the different channel bands. The shaded regions in the figure show that a single PU may affect several channels (frequencies) around its location. Moreover, the channels may be affected to different geographical extents, depending upon their frequency separation with the PU's transmission channel. SEARCH attempts to find paths which circumvent the PU coverage regions (Path 1 and 2) and link them together, whenever a performance benefit is seen.

The route maintenance and recovery procedure in SEARCH is as follows: SEARCH binds routes to regions found free of PU activity, rather than particular CR users. Thus even if nodes move away, the route is kept operational by choosing replacement nodes that are close to the original locations. Moreover, when new spectrum is detected or the channel becomes unusable owing to the appearance of a PU, the route is updated. During these update stages, the optimality of the route may be partially lost as the key consideration is prevention of performance degradation to the PU. SEARCH intelligently minimizes complete re-routing by undertaking local recovery actions.


Related work:

  • K. R. Chowdhury and M .D. Felice, "SEARCH: A Routing Protocol for Mobile Cognitive Radio Ad-hoc Networks," submitted for journal publication, December 2008.


Higher Layer Protocols

The dynamic nature of the underlying spectrum in cognitive radio networks is known to have adverse influences on the overall throughput of the transmission functions. It is important to seamless integrate the channel sensing and primary user (PU) detection techniques in the design of higher layer, end-to-end transport protocols. In this project, we devise a window-based transport protocol, TP-CRAHN, that that not only addresses the key concerns on classical wireless ad hoc networks, such as mobility, but also considers spectrum sensing, channel switching, PU activity and other issues that are commonly seen CR networks.



Figure 6. The state diagram for the TP-CRAHN protocol.


The finite state machine diagram of the transport layer protocol is shown in Figure. 7, with the state changes. These states are (i) Connection Establishment, (ii) Normal, (iii) Spectrum Sensing, (iv) Spectrum Change, (v) Mobility Predicted, and (vi) Route Failure. Each of these states addresses a particular CR network condition and we describe them as follows.

  • Connection Establishment State: In this state, a three-way handshake is used to setup the TCP connection. The spectrum sensing durations and start times of the intermediate nodes are also made known to the source. On successful handshake, the protocol enters into the Normal state.

  • Normal State: This state comes into play when there is no periodic sensing, spectrum switching or anticipated node mobility. The congestion window operates similar to the classical TCP newReno. The source collects the residual buffer capacity, link latency and the calculated link bandwidth at each node by piggybacking this information over the incoming ACK.

  • Spectrum Sensing State: As the source knows the exact start and stop times for sensing, it limits the congestion window so that the previous hop node along the path does not incur a buffer overflow for the duration of the sensing. Moreover, it decides on the optimal sensing time for each link by maintaining a history of the PU activity in the vicinity.

  • Spectrum Switching State: When a PU appears, the time taken to identify a new channel is not known in advance. At this time, the TCP state at the source is frozen. After the new spectrum is chosen, the bandwidth is estimated by link layer interaction and communicated to the source. This immediately changes the congestion window appropriately if the change in the bandwidth affects the earlier bottleneck bandwidth of the path.

  • Mobility Predicted State: TBased on Kalman Filtering, each node makes a prediction if the next hop node will be out of range in the next calculation epoch. If this is true, the source is signaled to limit the congestion window below the TCP threshold, thereby preventing large packet losses if the route failure actually occurs.

  • Route Failure State: This state can be inferred if there is no expected sensing, no detected PU but possibility of node mobility, as predicted by the above state. In this case, the source stops the transmission and awaits further notification from the network layer for new route establishment.


Related work:

  • K. R. Chowdhury, M .D. Felice, and and I. F. Akyildiz, "TP-CRAHN: A Transport Protocol for Cognitive Radio Ad-hoc Networks," in Proc. of IEEE Infocom 2009, Rio de Janeiro, Brazil, April 2009.

 


Cognitive Mesh Networks

The Wireless Mesh Network (WMN) paradigm is envisaged to be a key technology that allows ubiquitous connectivity to the end user. A typical WMN consists of mesh routers (MRs) forming the backbone of the network, interconnected in an ad-hoc fashion. Each MR can be considered as an access point serving a number of users or mesh clients (MCs) under it. The MCs could be mobile users, stationary workstations or laptops that exchange data over the Internet. Our proposed COgnitive Mesh NETwork (COMNET) architecture, takes the first step in leveraging the benefits of cognitive radio technology in the area of WMNs.

Figure 9. Cognitive mesh network architecture.

This project aims to address the following key challenges in a cognitive radio enabled mesh scenario:

 

  • Enabling MCs to monitor the primary channel while continuing normal operation in the 2.4 GHz ISM band.
  • Devising a theoretical framework for identifying primary transmitter frequencies through time domain sampling.
  • Proposing theoretical models for estimating power injected in the primary band channels due to the presence of secondary users.
  • Allowing a decentralized computation framework at each MR for load sharing between the primary and secondary bands, based on the above models.

Related work:

  • K. R. Chowdhury and I. F. Akyildiz, "Cognitive Wireless Mesh Networks for Dynamic Spectrum Access," IEEE Journal of Selected Areas in Communications (JSAC), Vol. 26, No. 1, pp. 168-181, January 2008.

 


Cognitive Sensor Networks: Interferer Classification and Transmission Adaptation

Wireless sensor networks (WSNs) are being increasingly deployed for a variety of environment monitoring, commercial utility metering, military and surveillance applications. These applications necessitate reliable data delivery with minimum packet loss due to external interference. When these sensors form a CR network, some of the transmission channels may be affected by the PU. In a noisy environment with multiple interferer types, such as wireless LANs and commercial microwave ovens, distinguishing between them becomes a key challenge. By identifying the presence of a specific type of an interferer, the sensors can choose their transmission channel, and also adapt their packet scheduling at the MAC layer to avoid packet losses due to interference.

The problem of detecting the above interferer characteristics is addressed in this project by:

 

  • Experimentally profiling the spectral characteristics specific to wireless LANs based on the IEEE 802.11b and commercial microwave ovens
  • Devising a scheme for identifying interferer type based on matching the observed and the previously obtained spectral data.
  • A channel selection scheme is proposed, where the sensors choose the channels not occupied by WLAN transmissions and not affected by the radiation caused by microwave ovens.
  • Proposing a transmission adaptation scheme at the MAC layer, in which, the sensor packets are scheduled between two WLAN transmissions, and during the off times of the duty cycled microwave ovens.

Figure 10. Identifying the interferer type and location.

We first conduct experiments to derive how the channels used by the sensors are affected due to specific interferers. For our experimental study, we use the WLAN and commercial microwave ovens. The measured received power in each channel is used to create a reference vector (Figure 10 (a)) in an n-dimensional space, where n is the total number of channels affected. This reference vector is then compared with an observed channel power vector during the network operation to identify the type of the interferer based on the channels that are affected. Finally, using clustering methods, the sensors that sense a common interferer are grouped together. The PU or interferer location can then be approximated as the cluster center (Figure 10 (b)). This process allows sensors to identify the PU characteristics by delegating the computational complexity to the sink node.

Related work:

  • K. R. Chowdhury and I. F. Akyildiz, "Interferer Classification, Channel Selection and Transmission Adaptation for Wireless Sensor Networks," in Proc. of IEEE ICC 2009, Dresden, Germany, June 2009.

 


You are visitor:

since 06/30/2006