Dynamic Connectivity of Cognitive Radio Ad-Hoc Networks with Time-Varying Spectral Activity

Wang, Pu; Akyildiz, Ian F.; Al-Dhelaan, Abdullah

doi:10.1109/glocom.2010.5684194

Cited by 10 publications

(9 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Peng et al [10] and W. Ren et al [11] proved that percolation of supercritical secondary network still exists if the density of primary users λP T is less than a critical number λ * P T . However, if λP T > λ * P T , although percolation phenomenon still exists topologically, the infinite connected component has broken into mutually disconnected finite clusters from the perspective of spectrum opportunities.…”

Section: Basic Properties Of γ(λS Ap )mentioning

confidence: 98%

“…In other words, the weaker version of overall connectivity may be still established in a subcritical network. 10 Note in our mobility model, the time it takes for a node to move to new position is not accounted. Thus, delay is independent on the mobility speed.…”

Section: Mobility Modelmentioning

confidence: 99%

“…In [9], L. Ding et al proposed a routing and spectrum allocation algorithm for CR networks to maximize the throughput. By using percolation theory, especially continuum percolation [1], W. Peng et al [10] and W. Ren et al [11] have studied the connectivity in CR networks in terms of density pairs of primary users and secondary users (λS, λP T ). They both show that the overall connectivity exits if and only if λS > λ * S and λP T < λ * P T , where λ * S and λ * P T are two critical density values.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Transmission delay in large scale ad hoc cognitive radio networks

Liu

Wang

Luan

et al. 2012

Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

There has been recent interest within the networking research area to understand the transmission delay in Cognitive Radio (CR) Networks with overlapping primary network and secondary network. In this paper, we investigate the scaling behavior of transmission delay in large scale ad hoc CR networks. We take different scenarios of CR networks into consideration and thus obtain a wind range of results. We first neglect propagation delay and study the ratio of transmission delay to distance, denoted by γ(λS, AP ), using the Poisson Boolean Model and Poisson Random Connection Model of continuum percolation theory. We show that γ(λS, AP ) is a constant and figure out its exact value in supercritical secondary network. In case of subcritical secondary network, we introduce a multi-cluster hop transmission process to get the lower bound of γ(λS, AP ). Then we take propagation delay into consideration to obtain further results. Finally, we use simulation results to verify our theoretical analysis. The results present the scaling behavior of transmission delay in CR networks and provide the design guidelines for large scale wireless networks.

show abstract

Section: Basic Properties Of γ(λS Ap )mentioning

confidence: 98%

Section: Mobility Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Transmission delay in large scale ad hoc cognitive radio networks

Liu

Wang

Luan

et al. 2012

Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

show abstract

“…Connectivity of heterogeneous wireless networks, specifically cognitive radio networks, has been recently developed in [7]- [9]. In [7], the connectivity of a secondary network is parameterized by the tuple (λ P T , λ SU ) under path loss channel model, where λ P T is the density of primary transmitters (PTs) and λ SU is the density of SUs.…”

Section: Introductionmentioning

confidence: 99%

“…Another parameterization of the secondary network (λ SU , r SU ) is developed in [8] under Rayleigh fading channel model, where r SU is the transmission range of an SU with an outage constraint. The temporal activity of a spectrum opportunity is further captured in [9]. In spite of above efforts, the connectivity of cooperative secondary network has not been investigated.…”

Section: Introductionmentioning

confidence: 99%

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

Chen

2011

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

View full text Add to dashboard Cite

In cognitive radio networking, the signal reception quality of a secondary user degrades due to the interference from multiple heterogeneous primary networks, and also the transmission activity of a secondary user is constrained by its interference to the primary networks. It is difficult to ensure the 1-connectivity of the secondary network, so we here characterize the connectivity of the secondary network from a percolationbased perspective. On the other hand, since there may exist multiple heterogeneous secondary networks with different radio access technologies, such secondary networks may be treated as one secondary network via proper cooperation. In this paper, we investigate the connectivity of such a cooperative secondary network, under which each secondary network's user may have other secondary networks' users acting as relays. The connectivity of this cooperative secondary network is characterized in terms of percolation threshold, from which the benefits of cooperation are justified. For example, while a noncooperative secondary network does not percolate, percolation may occur in the cooperative secondary network; or when a noncooperative secondary network percolates, less energy may be used to sustain the same level of connectivity in the cooperative secondary network.

show abstract

Percolation theory based connectivity and latency analysis of cognitive radio ad hoc networks

2010

Self Cite

View full text Add to dashboard Cite

This paper investigates the dynamic connectivity and transmission latency of cognitive radio ad-hoc networks (secondary networks) coexisting with licensed networks (primary networks) that experience time-varying on-off links. It is shown that there exists a critical density k s * such that if the density of secondary networks is larger than k s * , the secondary network percolates at all time t [ 0, i.e., there exists always an infinite connected component in the secondary network under the time-varying spectrum availability. Furthermore, the upper and lower bounds of k 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. Moreover, due to the dynamic behavior of the unoccupied spectrum, the secondary network can be disconnected at all times. 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. This delay is shown to be asymptotically linear in the Euclidean distance between the transmitter and receiver.

show abstract

Dynamic Connectivity of Cognitive Radio Ad-Hoc Networks with Time-Varying Spectral Activity

Cited by 10 publications

References 11 publications

Transmission delay in large scale ad hoc cognitive radio networks

Transmission delay in large scale ad hoc cognitive radio networks

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

Percolation theory based connectivity and latency analysis of cognitive radio ad hoc networks

Contact Info

Product

Resources

About