# Connectivity of Heterogeneous Wireless Networks

@article{Ren2011ConnectivityOH, title={Connectivity of Heterogeneous Wireless Networks}, author={Wei Ren and Qing Zhao and Ananthram Swami}, journal={IEEE Transactions on Information Theory}, year={2011}, volume={57}, pages={4315-4332} }

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 communication link between two secondary users depends on not only the distance between them but also 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 secondary users and the density…

## Figures from this paper

## 72 Citations

Connectivity of cognitive radio networks: proximity vs. opportunity

- Computer ScienceCoRoNet '09
- 2009

The tradeoff between proximity (the number of neighbors) and the occurrence of spectrum opportunities is revealed by studying the impact of secondary users' transmission power on the connectivity region of thesecondary network, and the transmission power of the secondary users is designed to maximize their tolerance to the primary traffic load.

Connectivity of interference limited cognitive radio networks

- Computer Science2012 3rd IEEE International Conference on Network Infrastructure and Digital Content
- 2012

The connectivity of cognitive radio networks is considered, which is defined as the existence of an infinite connected component of secondary users, and it is found that the connectivity region without taking interference into consideration is a subset of the authors' connectivity region, which means interference will not adversely affect the connectivity of secondary network.

Connectivity and Transmission Delay in Large-Scale Cognitive Radio Ad Hoc Networks With Unreliable Secondary Links

- Computer ScienceIEEE Transactions on Wireless Communications
- 2015

This paper investigates connectivity and transmission delay of secondary users in large-scale wireless cognitive radio (CR) ad hoc networks from a percolation-based perspective and shows that transmission delay scales linearly and sub-linearly with distance in the long-term connectivity and instantaneous connectivity regions, respectively.

Local connectivity for heterogeneous overlaid wireless networks

- Computer ScienceAd Hoc Networks
- 2017

Percolation-Based Connectivity of Multiple Cooperative Cognitive Radio Ad Hoc Networks

- Computer Science2011 IEEE Global Telecommunications Conference - GLOBECOM 2011
- 2011

The connectivity of a cooperative secondary network, under which each secondary network's user may have other secondary networks' users acting as relays, is characterized in terms of percolation threshold, from which the benefits of cooperation are justified.

Connectivity of Clustered and Multi-type User CR Network: A Percolation Based Approach

- Computer ScienceIScIDE
- 2013

This work addresses the percolation-based connectivity problem, in which the existence of a communication link between two secondary users depends on not only the distance between them, the transmitting and receiving activities of nearby primary users, but also the neighboring user’s type.

Node density and connectivity of multi-channel ad hoc cognitive radio networks

- Computer Science2015 IEEE/CIC International Conference on Communications in China (ICCC)
- 2015

It is found that more accurate sensing carried by SUs does not necessarily bring better connectivity of the secondary network, and it is shown that more licensed channels can loosen the condition for SUs percolation.

Percolation in multi-channel secondary cognitive radio networks under the SINR model

- Computer Science2014 IEEE International Symposium on Dynamic Spectrum Access Networks (DYSPAN)
- 2014

This paper defines and characterize the connectivity of the secondary network in terms of the available number of channels, deployment density, number of transceivers per node and interference cancellation coefficient, both in the presence and absence of primaries, and shows how cooperation between primary and secondary networks can increase the connectivityof both.

Degree Distribution in Interference-Limited Heterogeneous Wireless Networks and Its Generalizations

- Computer Science2011 IEEE International Conference on Communications (ICC)
- 2011

Insight is given into fundamental limits of coexistence in interference-limited heterogeneous environment, advantages of different broadcasting schemes and cooperation among heterogeneous networks, using the analytical methods of complex network.

Local connectivity of cognitive radio Ad hoc networks

- Computer Science2014 IEEE Global Communications Conference
- 2014

Stochastic geometry and probability theory is used to derive the distribution of node degree, probability of available spectrum and probability of node isolation of the Secondary Users (SUs), andoretical analysis and simulation results indicate that the average node degree of SUs scales linearly for increases in the density of S Us with the slope determined by thedensity of Primary Users (PUs).

## References

SHOWING 1-10 OF 38 REFERENCES

Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links

- Computer ScienceIEEE INFOCOM 2008 - The 27th Conference on Computer Communications
- 2008

It is shown that due to the dynamic behavior of links, a delay is incurred for any transmission even when propagation delay is ignored, and the delay scales linearly with the Euclidean distance between the sender and the receiver when the network is in the subcritical phase.

On the minimum node degree and connectivity of a wireless multihop network

- Computer ScienceMobiHoc '02
- 2002

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

- Computer ScienceIEEE/ACM Transactions on Networking
- 2005

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.

Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

- Computer ScienceIEEE Transactions on Information Theory
- 2007

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that…

Connectivity, Percolation, and Information Dissemination in Large-Scale Wireless Networks with Dynamic Links

- Computer ScienceArXiv
- 2009

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.

On the Connectivity and Multihop Delay of Ad Hoc Cognitive Radio Networks

- Business2010 IEEE International Conference on Communications
- 2010

Using theories and techniques from continuum percolation and ergodicity, the scaling law of the minimum multihop delay with respect to the source-destination distance is established.

Percolation in the signal to interference ratio graph

- Computer ScienceJournal of Applied Probability
- 2006

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.

Critical Power for Asymptotic Connectivity in Wireless Networks

- Computer Science
- 1999

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 properties of a packet radio network model

- Computer ScienceIEEE Trans. Inf. Theory
- 1989

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.

Power control in cognitive radio networks: how to cross a multi-lane highway

- Computer ScienceIEEE Journal on Selected Areas in Communications
- 2009

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.