Cognitive Radio Networks (CRNs) are composed of frequency-agile radio devices that allow licensed (primary) and unlicensed (secondary) users to coexist, where secondary users opportunistically access channels without interfering with the operation of primary ones. From the perspective of secondary users, spectrum availability is a time varying network resource over which multi-hop end-to-end connections must be maintained. In this work, a theoretical outlook on the problem of routing secondary user flows in a CRN is provided. The investigation aims to characterize optimal sequences of routes over which a secondary flow is maintained. The optimality is defined according to a novel metric that considers the maintenance cost of a route as channels and/or links must be switched due to the primary user activity. Different from the traditional notion of route stability, the proposed approach considers subsequent path selections, as well. The problem is formulated as an integer programming optimization model and shown to be of polynomial time complexity in case of full knowledge of primary user activity. Properties of the problem are also formally introduced and leveraged to design a heuristic algorithm to solve the minimum maintenance cost routing problem when information on primary user activity is not complete. Numerical results are presented to assess the optimality gap of the heuristic routing algorithm.

Minimum maintenance cost routing in Cognitive Radio Networks

FILIPPINI, ILARIO;CESANA, MATTEO
2009

Abstract

Cognitive Radio Networks (CRNs) are composed of frequency-agile radio devices that allow licensed (primary) and unlicensed (secondary) users to coexist, where secondary users opportunistically access channels without interfering with the operation of primary ones. From the perspective of secondary users, spectrum availability is a time varying network resource over which multi-hop end-to-end connections must be maintained. In this work, a theoretical outlook on the problem of routing secondary user flows in a CRN is provided. The investigation aims to characterize optimal sequences of routes over which a secondary flow is maintained. The optimality is defined according to a novel metric that considers the maintenance cost of a route as channels and/or links must be switched due to the primary user activity. Different from the traditional notion of route stability, the proposed approach considers subsequent path selections, as well. The problem is formulated as an integer programming optimization model and shown to be of polynomial time complexity in case of full knowledge of primary user activity. Properties of the problem are also formally introduced and leveraged to design a heuristic algorithm to solve the minimum maintenance cost routing problem when information on primary user activity is not complete. Numerical results are presented to assess the optimality gap of the heuristic routing algorithm.
proc. of IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, 2009. MASS '09.
9781424451135
File in questo prodotto:
File Dimensione Formato  
mass2009.pdf

Accesso riservato

: Altro materiale allegato
Dimensione 3.3 MB
Formato Adobe PDF
3.3 MB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11311/561189
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 56
  • ???jsp.display-item.citation.isi??? 1
social impact