Multi-Channel Distributed Dsa Networks: Connectivity And Rendezvous Tradeoffs

Keywords

Dynamic Spectrum Access Networks; Multi-Channel; Network Connectivity; Percolation Theory; Wireless Networks

Abstract

In this paper, we investigate and characterize the effects of multi-channel and rendezvous protocols on the connectivity of dynamic spectrum access networks using percolation theory. In particular, we focus on the scenario where the secondary nodes have plenty of vacant channels to choose from a phenomenon which we define as channel abundance. To cope with the existence of multi-channel, we use two types of rendezvous protocols: naive ones which do not guarantee a common channel and advanced ones which do. We show that, with more channel abundance, even with the use of either type of rendezvous protocols, it becomes difficult for two nodes to agree on a common channel, thereby, potentially remaining invisible to each other. We model this invisibility as a Poisson thinning process and show that invisibility is even more pronounced with channel abundance. Following the disk graph model, we represent the multiple channels as parallel edges in a graph and build a multi-layered graph (MLG) in R 2 . In order to study the connectivity, we show how percolation occurs in the MLG by coupling it with a typical discrete percolation. Using a Boolean model and the MLG, we study both cases of primaries' absence and presence. For both cases, we define and characterize connectivity of the secondary network in terms of the available number of channels, deployment densities, number of simultaneous transmissions per node, and communication range. When primary users are absent, we derive the critical number of channels which maintains super-criticality of the secondary network. When primary users are present, we characterize and analyze the connectivity for all the regions: channel abundance, optimal, and channel deprivation. For each region we show the requirement and the outcome of using either type of rendezvous techniques. Moreover, we find the tradeoff between deployment-density versus rendezvous probability which results in a connected network. Our results can be used to decide on the goodness of any channel rendezvous algorithm by computing the expected resultant connectivity. They also provide a guideline for achieving connectivity using minimal resources.

Publication Date

3-1-2017

Publication Title

IEEE Transactions on Cognitive Communications and Networking

Volume

3

Issue

1

Number of Pages

67-81

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/TCCN.2016.2645564

Socpus ID

85065897753 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85065897753

This document is currently not available here.

Share

COinS