This paper proposes a distributed resource allocation strategy for cognitive radio networks based on a swarming model that incorporates random link failures and quantized communications. The swarming mechanism is used to minimize the interference produced by the cognitive users, take advantage of cooperative sensing, avoid collisions among the users and limit the spread of resources in the time-frequency domain. The mechanism assumes only local exchange of data among nearby nodes. The communications among the nodes are assumed to be affected by noise and random fading. Packet drops are taken into account as inducing a random topology, where a link is on or off depending on the decision errors. Using classical results from stochastic approximation theory, we prove that the swarm always converges in probability to a final allocation even in the presence of non ideal communications among the nodes. Numerical results show how the convergence rate of the algorithm is affected by the probability of link failures. The proposed procedure is applied to a bi-dimensional allocation in the time-frequency plane where the primary users' activity is modeled as a set of continuous-time Markov processes.

Bio-inspired swarming models for decentralized radio access incorporating random links and quantized communications

Di Lorenzo, Paolo;
2011

Abstract

This paper proposes a distributed resource allocation strategy for cognitive radio networks based on a swarming model that incorporates random link failures and quantized communications. The swarming mechanism is used to minimize the interference produced by the cognitive users, take advantage of cooperative sensing, avoid collisions among the users and limit the spread of resources in the time-frequency domain. The mechanism assumes only local exchange of data among nearby nodes. The communications among the nodes are assumed to be affected by noise and random fading. Packet drops are taken into account as inducing a random topology, where a link is on or off depending on the decision errors. Using classical results from stochastic approximation theory, we prove that the swarm always converges in probability to a final allocation even in the presence of non ideal communications among the nodes. Numerical results show how the convergence rate of the algorithm is affected by the probability of link failures. The proposed procedure is applied to a bi-dimensional allocation in the time-frequency plane where the primary users' activity is modeled as a set of continuous-time Markov processes.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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: https://hdl.handle.net/11391/1356255
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 5
social impact