Connectivity of cognitive radio networks: proximity vs. opportunity

@inproceedings{Ren2009ConnectivityOC,
  title={Connectivity of cognitive radio networks: proximity vs. opportunity},
  author={Wei Ren and Qing Zhao and Ananthram Swami},
  booktitle={CoRoNet '09},
  year={2009}
}
We address the connectivity of large-scale ad hoc cognitive radio networks, where secondary users exploit channels temporarily and locally unused by primary users and the existence of a communication link between two secondary users depends not only on the distance between them but also on the transmitting and receiving activities of nearby primary users. We introduce the concept of connectivity region defined as the set of density pairs -- the density of the secondary users and the density of… 

Figures from this paper

Connectivity of large-scale Cognitive Radio Ad Hoc Networks
TLDR
It is proved that secondary users can form the percolated network when the density of primary users is below the critical density, and the upper bound of the criticaldensity of the primary users in the perColated CRAHNs is derived.
Temporal Traffic Dynamics Improve the Connectivity of Ad Hoc Cognitive Radio Networks
TLDR
It is shown that the scaling behavior of the multihop delay depends critically on whether or not the secondary network is instantaneously connected, and the scaling law of the minimum multhop delay with respect to the source-destination distance when the propagation delay is negligible is established.
Percolation theory based connectivity and latency analysis of cognitive radio ad hoc networks
TLDR
It is proven that it is still possible for a SU to transfer its message to any destination with a certain delay with probability one and this delay is shown to be asymptotically linear in the Euclidean distance between the transmitter and receiver.
On the connectivity of large multi-channel cognitive radio networks
  • Lei Sun, Wenye Wang
  • Computer Science
    2012 IEEE International Conference on Communications (ICC)
  • 2012
TLDR
The sufficient and necessary condition to achieve full connectivity is λ = Θ(log n/πr2 Ps), where λ is the density, n is the number and r is the transmission range of secondary users respectively, and Ps is the probability that any two secondary users can communicate with each other without interfering with primary users.
Dynamic Connectivity of Cognitive Radio Ad-Hoc Networks with Time-Varying Spectral Activity
TLDR
The upper and lower bounds of λ_s^* are derived and it is shown that they do not depend on the random locations of primary and secondary users, but only on the network parameters, such as active/inactive probability of primary users, transmission range, and the user density.
Connectivity-Driven Routing for Cognitive Radio Ad-Hoc Networks
  • Anna Abbagnale, F. Cuomo
  • Computer Science
    2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)
  • 2010
TLDR
A routing scheme is designed which, by modeling a path with a graph and its Laplacian, captures the connectivity characteristics of the path itself and suitably selects the best route in a uncertain and high variable connectivity scenarios.
Power control in cognitive radio networks: how to cross a multi-lane highway
TLDR
The difference between detecting primary signals and detecting spectrum opportunities is revealed, and the complex relationship between physical layer spectrum sensing and MAC layer throughput is demonstrated, and it is revealed that reliable opportunity detection is achieved in the two extreme regimes.
On the complexity of connectivity in cognitive radio networks through spectrum assignment
TLDR
This paper begins the first systematic study on the algorithmic complexity of the connectivity problem in CRNs through spectrum assignments and proves that it is NP-complete to determine whether the network is connectable even if there are only two channels.
Distributed Algorithm for Robust and Interference Free Topology in Cognitive Radio Networks
TLDR
This paper proposes a distributed topology control algorithm with message complexity O(n2), which aims to connect the largest subset of SUs with robustness constraint and ensures conflict free transmissions among SUs, where n is the number of S Units.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Connectivity of Heterogeneous Wireless Networks
We address the percolation-based connectivity of large-scale ad hoc heterogeneous wireless networks, where secondary users exploit channels temporarily unused by primary users and the existence of a
Power control in cognitive radio networks: how to cross a multi-lane highway
TLDR
The difference between detecting primary signals and detecting spectrum opportunities is revealed, and the complex relationship between physical layer spectrum sensing and MAC layer throughput is demonstrated, and it is revealed that reliable opportunity detection is achieved in the two extreme regimes.
On the minimum node degree and connectivity of a wireless multihop network
TLDR
This paper derives an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network and investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity.
Impact of interferences on connectivity in ad hoc networks
TLDR
It is proved that if /spl gamma/ is nonzero but small enough, there exist node spatial densities for which the network contains a large (theoretically infinite) cluster of nodes, enabling distant nodes to communicate in multiple hops.
Critical Power for Asymptotic Connectivity in Wireless Networks
In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In
Connectivity, Percolation, and Information Dissemination in Large-Scale Wireless Networks with Dynamic Links
TLDR
In the pres ence of a non-negligible propagation delay, the delay for information dissemination scales linearly with the Euclidean distance in both the subcritical and supercritical regimes, with the rates for the linear scaling being differe nt in the two regimes.
Connectivity properties of a packet radio network model
TLDR
A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined and it is shown that pi R/sup 2/D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network.
Percolation in the signal to interference ratio graph
TLDR
This paper considers a variation of Poisson percolation models in which a connection between two points depends not only on their Euclidean distance, but also on the positions of all other points of the point process.
Providing a bidirectional abstraction for unidirectional ad hoc networks
TLDR
This work introduces a sub-layer called sub routing layer, SRL, between the network and the MAC layer to provide a bidirectional abstraction of the unidirectional network to the routing protocols, and simulates AODV (ad hoc on demand distance vector) that uses SRL to route packets in a uniddirectional network.
Connectivity properties of a random radio network
TLDR
The 'magic number' of average neighbours of each station from connectivity point of view is obtained by theoretical analyses and computer simulation of random radio networks.
...
...