Multi-interface rendezvous in self-organizing cognitive radio networks

Paul, Rajib; Jembre, Yalew Zelalem; Choi, Young‐June

doi:10.1109/dyspan.2014.6817836

Cited by 17 publications

(16 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is confirmed that the TTR performance is improved with multiple interfaces. In [13], the type of interface is not considered, which is different from the proposed work. In summary, the proposed method concentrates on a multi-interface rendezvous framework that has two types of interfaces and furthermore, proposes a cooperative rendezvous scheme for self-organizing D2D networks that have a vertical traffic pattern and resource priority based on ranks.…”

Section: Fig 1 An Example Of the Js Algorithmmentioning

confidence: 65%

“…Using multiple interfaces can improve the TTR performance compared to using a single interface because multiple interfaces result in a higher probability of success compared to a single interface.The rendezvous issue for multiple interfaces is addressed in [13] where channel quality generates an adaptive jump-and-stay pattern. It is confirmed that the TTR performance is improved with multiple interfaces.…”

Section: Fig 1 An Example Of the Js Algorithmmentioning

confidence: 99%

“…Conversely, a node may exploit both interface types when it is equipped with multiple interfaces. Furthermore, TTR performance is improved when there are multiple interfaces for each node [13] because the probability of rendezvous increases with the number of interfaces.…”

Section: Introductionmentioning

confidence: 97%

See 2 more Smart Citations

Cooperative device discovery for multi-interface self-organizing networks

Kim

Choi

2015

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

For device-to-device communications, a device must locate neighbor devices on a certain channel within a short period to establish a communication link. When the channel information is not provided, a rendezvous technique can be adapted to resolve the issue of device discovery. Unlike existing approaches that have considered the rendezvous problem for a flat network and a single interface, the proposed approach considers a hierarchical network where nodes have different ranks and multiple interfaces. We extend the jump-and-stay rendezvous algorithm for multiple interfaces and divide the interfaces into two types: standby and scan interfaces. Scan interfaces follow the extended pattern of the jump-and-stay algorithm. Standby interfaces remain on a selected channel for a round of slots until rendezvous with other nodes. To determine the interface type of each node, we consider the rank of a node such that a higher-ranked node is assigned more standby interfaces. Based on this framework, we propose a cooperative rendezvous algorithm where a node rebroadcasts the channel information of a higher-ranked node together with its rendezvous message. Our simulation results confirm that the proposed rendezvous algorithm achieves superior performance compared to conventional methods.

show abstract

Section: Fig 1 An Example Of the Js Algorithmmentioning

confidence: 65%

Section: Fig 1 An Example Of the Js Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Cooperative device discovery for multi-interface self-organizing networks

Kim

Choi

2015

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

show abstract

“…To the best of our knowledge, there are three existing algorithms [21][22][23] that address the rendezvous problem using multiple radios. In our previous work [21], we proposed an algorithm, called Role-based Parallel Sequence (RPS), which exploits multiple radios for fast rendezvous.…”

Section: Introductionmentioning

confidence: 99%

Adjustable Rendezvous in Multi-Radio Cognitive Radio Networks

Liu

Leung

et al. 2014

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Rendezvous is a fundamental operation for cognitive users to establish communication links so as to realize data communications and network management. Most of existing rendezvous algorithms implicitly assume that each cognitive user is equipped with one radio, i.e., one wireless transceiver. As the cost of wireless transceivers is dropping, it becomes economically feasible to utilize multiple radios to significantly improve the rendezvous performance. In this paper, we propose an Adjustable Multi-Radio Rendezvous (AMRR) algorithm which exploits multiple radios for fast rendezvous based on available channels only. Suppose that a cognitive user is equipped with m radios. Our basic idea is to partition the radios into two groups: k stay radios and (m − k) hopping radios. The user stays on specific channels in the stay radios while hops on its available channels parallelly in the hopping radios. We prove that the maximum time-to-rendezvous (MTTR) of AMRR is upper-bounded by, where |C1| and |C2| are the numbers of available channels of two users and m 1 and m2 are the numbers of radios of the two users. This bound meets the lower bound of MTTR of any deterministic rendezvous algorithm when two users are equipped with the same number of radios (i.e., m1 = m2). AMRR is adjustable in giving its best performance on either MTTR or E(TTR) by adjusting value of k. Simulation results show that AMRR performs better than the state-of-the-art.Index Terms-cognitive radio, multiple radios, blind rendezvous, channel hopping.

show abstract

“…Then, the rendezvous can be expected between the dedicated and general radios. The EAR algorithm [30] is also extended from the JS algorithm. Channels are sorted according to their qualities, and better channels are accessed more often.…”

Section: B Pairwise Multiradio Rendezvous Algorithmsmentioning

confidence: 99%

Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks

Yang

Liang

Zheng

et al. 2016

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-Channel rendezvous is a vital step to form a cognitive radio network (CRN). It is intractable to guarantee rendezvous for secondary users (SUs) within a short finite time in asynchronous, heterogeneous, and anonymous CRNs. However, most previous heterogeneous algorithms rely on explicit SUs' identifiers (IDs) to guide rendezvous, which is not fully distributed. In this paper, we exploit the mathematical construction of sunflower sets to develop a single-radio sunflower set (SSS)-based pairwise rendezvous algorithm. We propose an approximation algorithm to construct disjoint sunflower sets. Then, the SSS leverages the variant permutations of elements in sunflower sets to adjust the order of accessing channels instead of SUs' IDs, which is more favorable for anonymous SUs in distributed environments. We also propose a multiradio-sunflower-set-based pairwise rendezvous algorithm to bring additional rendezvous diversity and accelerate the rendezvous process. Moreover, for the case with more than two SUs, we propose a multiuser collaborative scheme in which SUs cooperatively exchange and update their channel-hopping sequences until rendezvous. We derive the theoretical upper and lower bounds of rendezvous latency of the proposed algorithms. Extensive simulation comparisons with the state-of-the-art blind-rendezvous algorithms are conducted, incorporating the metrics of maximum and expected time-to-rendezvous. The simulation results show that our algorithms can achieve rendezvous faster than previous works.

show abstract

Multi-interface rendezvous in self-organizing cognitive radio networks

Cited by 17 publications

References 16 publications

Cooperative device discovery for multi-interface self-organizing networks

Cooperative device discovery for multi-interface self-organizing networks

Adjustable Rendezvous in Multi-Radio Cognitive Radio Networks

Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks

Contact Info

Product

Resources

About