scholarly journals Minimizing The Number of Channel Switches of Mobile Users in Cognitive Radio Ad-Hoc Networks

2020 ◽  
Vol 9 (2) ◽  
pp. 23 ◽  
Author(s):  
Rajorshi Biswas ◽  
Jie Wu

Cognitive radio (CR) technology is envisioned to use wireless spectrum opportunistically when the primary user (PU) is not using it. In cognitive radio ad-hoc networks (CRAHNs), the mobile users form a distributed multi-hop network using the unused spectrum. The qualities of the channels are different in different locations. When a user moves from one place to another, it needs to switch the channel to maintain the quality-of-service (QoS) required by different applications. The QoS of a channel depends on the amount of usage. A user can select the channels that meet the QoS requirement during its movement. In this paper, we study the mobility patterns of users, predict their next locations and probabilities to move there based on its history. We extract the mobility patterns from each user’s location history and match the recent trajectory with the patterns to find future locations. We construct a spectrum database using Wi-Fi access point location data and the free space path loss formula. We propose a machine learning-based mechanism to predict spectrum status of some missing locations in the spectrum database. We formulate a problem to select the current channel in order to minimize the total number of channel switches during a certain number of next moves of a user. We conduct an extensive simulation combining real and synthetic datasets to support our model.

2008 ◽  
Vol 09 (03) ◽  
pp. 277-297 ◽  
Author(s):  
GREGOIRE DANOY ◽  
ENRIQUE ALBA ◽  
PASCAL BOUVRY

Multi-hop ad hoc networks allow establishing local groups of communicating devices in a self-organizing way. However, when considering realistic mobility patterns, such networks most often get divided in a set of disjoint partitions. This presence of partitions is an obstacle to communication within these networks. Ad hoc networks are generally composed of devices capable of communicating in a geographical neighborhood for free (e.g. using Wi-Fi or Bluetooth). In most cases a communication infrastructure is available. It can be a set of access point as well as a GSM/UMTS network. The use of such an infrastructure is billed, but it permits to interconnect distant nodes, through what we call “bypass links”. The objective of our work is to optimize the placement of these long-range links. To this end we rely on small-world network properties, which consist in a high clustering coefficient and a low characteristic path length. In this article we investigate the use of three genetic algorithms (generational, steady-state, and cooperative coevolutionary) to optimize three instances of this topology control problem and present initial evidence of their capacity to solve it.


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Shereen Omar ◽  
Osama El Ghandour ◽  
Ahmed M. Abd El-Haleem

Cognitive radio networks improve spectrum utilization by ‎sharing licensed spectrum with cognitive radio devices. In ‎cognitive radio ad hoc networks the routing protocol is one ‎of the most challenging tasks due to the changes in ‎frequency spectrum and the interrupted connectivity ‎caused by the primary user activity. In this paper, a multi‎path activity based routing protocol for cognitive radio ‎network (MACNRP) is proposed. The protocol utilizes ‎channel availability and creates multiple node-disjoint ‎routes between the source and destination nodes. The ‎proposed protocol is compared with D2CARP and FTCRP ‎protocols. The performance evaluation is conducted ‎through mathematical analysis and using OPNET ‎simulation. The performance of the proposed protocol ‎achieves an increase in network throughput; besides it ‎decreases the probability of route failure due to node ‎mobility and primary user activity. We have found that the ‎MACNRP scheme results in 50% to 75% reduction in ‎blocking probability and 33% to 78% improvement in ‎network throughput, with a reasonable additional routing ‎overhead and average packet delay. Due to the successful ‎reduction of collision between primary users and ‎cognitive users, the MACNRP scheme results in decreasing ‎the path failure rate by 50% to 87%.‎


2014 ◽  
Vol 36 (7) ◽  
pp. 1337-1348 ◽  
Author(s):  
Tao LUO ◽  
Ming ZHAO ◽  
Jing-Ye LI ◽  
Guang-Xin YUE ◽  
Xiao-Jun WANG

Sign in / Sign up

Export Citation Format

Share Document