• Non ci sono risultati.

The coordination problem in Cognitive Mesh Networks

N/A
N/A
Protected

Academic year: 2021

Condividi "The coordination problem in Cognitive Mesh Networks"

Copied!
2
0
0

Testo completo

(1)

Abstract

In recent years, many wireless applications and services have been de-veloped to operate in unlicensed spectrum bands, resulting in a need of a new band for each of them. But most of the licensed spectrum bands are under-utilized, especially the TV bands and those used by the wireless mi-crophones (these users are known as Primary Users -PUs). So the Federal Communications Commission (FCC) has allowed to the unlicensed spectrum bands devices (known as Secondary Users -SUs) to use the licensed spectrum. But the main constraint is that SUs cannot cause any harmful interference with PUs. This is done using cognitive techniques, that lead SUs to stop any transmission on a spectrum chunk that is contemporaneously used by a PU, and to look for another one. In this environment there is not a static channel that can be used by all SUs in the same network to exchange control informa-tion (Control Channel Problem). The objective of the thesis is to solve the Control Channel Problem adapting to the time and space variability of the channels and avoiding any synchronization complexity. The idea on which this work is based, is the clustering: a network is partitioned in groups of devices called clusters. In any of them a different control channel is used. The work consists in a cluster formation protocol with whom SUs meet other SUs, decide to form a cluster and decide which SUs will be the cluster-head of that cluster. The protocol allows also to exchange control information between neighbor clusters. The referential environment is a wireless mesh network using the IEEE 802.11 wireless standard, in which nodes are wire-less mesh routers. Our protocol has been tested based on several metrics and compared to an existent algorithm that uses an a priori synchronization between SUs. Our work, although does not use a synchronization between

(2)

SUs, has performances similar to the comparison algorithm in most of cases, and in many others has better performances.

Riferimenti

Documenti correlati

Figure 4 indicates that there is broad agreement about the marks given to Queen Rania (and Shakira) and a degree of discord about how good Kevin’s English is. Such a

As an application of this constructions, the holonomy radius of a riemannian manifold is defined by assigning to each point the holonomy radius at the origin of the holonomic

Tacelli: Elliptic operators with unbounded diffusion and drift coefficients in L p spaces, Advances in Differential Equations, 19 n. Spina, Scale invariant elliptic operators

Let f be a real linear functional strictly increasing on the space R n ; since f is continuous, for the Weierstrass theorem, it admits a point of maximum in the compact K; since f

The existence, uniqueness and asymptotic representation of its solutions are stated by the Tikhonov theorem [3], while terms of higher order of asymptotic approx- imation are shown

If the overlapping rate between fragments is adequate and these fragments are long enough to encompass multiple variant sites (as expected by sequence technology improvement), a

Differently from the latter, the alternative notion entails the cross-cultural nature of the analysed interactions, where different linguistic, social and cultural contexts

Natural User Interfaces and Gesture Recognition technologies foreshadow the imminent scenario, in the field of education, of the convergence between the centrality of the