Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 2
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

This article investigates and evaluates a handover exchange scheme between two secondary users (SUs) moving in different directions across the handover region of neighboring cell in a cognitive radio network. More specifically, this investigation compares the performance of SUs in a cellular cognitive radio network with and without channel exchange scheme. The investigation shows reduced handover failure, blocking, forced and access probabilities respectively, for handover exchange scheme with buffer as compared to exchange scheme without buffer. It also shows transaction within two cognitive nodes within a network region. The system setup is evaluated through system simulation.

Go to article

Authors and Affiliations

Ebenezer Esenogho
Elie N. Mambou
Hendrik C. Ferreira
Download PDF Download RIS Download Bibtex

Abstract

Elastic optical networking is a potential candidate to support dynamic traffic with heterogeneous data rates and variable bandwidth requirements with the support of the optical orthogonal frequency division multiplexing technology (OOFDM). During the dynamic network operation, lightpath arrives and departs frequently and the network status updates accordingly. Fixed routing and alternate routing algorithms do not tune according to the current network status which are computed offline. Therefore, offline algorithms greedily use resources with an objective to compute shortest possible paths and results in high blocking probability during dynamic network operation. In this paper, adaptive routing algorithms are proposed for shortest path routing as well as alternate path routing which make routing decision based on the maximum idle frequency slots (FS) available on different paths. The proposed algorithms select an underutilized path between different choices with maximum idle FS and efficiently avoids utilizing a congested path. The proposed routing algorithms are compared with offline routing algorithms as well as an existing adaptive routing algorithm in different network scenarios. It has been shown that the proposed algorithms efficiently improve network performance in terms of FS utilization and blocking probability during dynamic network operation.

Go to article

Authors and Affiliations

Akhtar Nawaz Khan

This page uses 'cookies'. Learn more