A Quaternary-Encoding-Based Channel Hopping Algorithm for Blind Rendezvous in Distributed IoTs

Zhang, Zengqi; Yang, Bo; Liu, Min; Li, Zhongcheng; Guo, Xiaojun

doi:10.1109/tcomm.2019.2931691

Cited by 12 publications

(11 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, for any node pair, the transmitter and the receiver should be matched to the same channel before data transmission. This matching process, referred to as rendezvous [11]- [13], may result in longer delay, especially when their schedules are not under centralized control. Therefore, the problem that whether using more channels is beneficial for decreasing delay compared with using a single channel is nontrivial.…”

Section: A Overall Scenariomentioning

confidence: 99%

See 1 more Smart Citation

Schedule Sequence Design for Broadcast in Multi-channel Ad Hoc Networks

Liu

Shum

Zhang

et al. 2020

Preprint

View full text Add to dashboard Cite

We consider a single-hop ad hoc network in which each node aims to broadcast packets to its neighboring nodes by using multiple slotted, TDD collision channels. There is no cooperation among the nodes. To ensure successful broadcast, we propose to pre-assign each node a periodic sequence to schedule transmissions and receptions at each time slot. These sequences are referred to as schedule sequences. Since each node starts its transmission schedule independently, there exist relative time offsets among the schedule sequences they use. Our objective is to design schedule sequences such that each node can transmit at least one packet to each of its neighbors successfully within a common period, no matter what the time offsets are. The sequence period should be designed as short as possible. In this paper, we analyze the lower bound on sequence period, and propose a sequence construction method by which the period can achieve the same order as the lower bound.We also consider the random scheme in which each node transmits or receives on a channel at each time slot with a pre-determined probability. The frame length and broadcast completion time under different schemes are compared by numerical studies.

show abstract

Section: A Overall Scenariomentioning

confidence: 99%

“…Based on (11), we define a recursive sequence (b j ) ∞ j=2 to make the analysis for a k ≥ 1 more tractable.…”

Section: Lower Bound On Period Lmentioning

confidence: 99%

Schedule Sequence Design for Broadcast in Multi-channel Ad Hoc Networks

Liu

Shum

Zhang

et al. 2020

Preprint

View full text Add to dashboard Cite

show abstract

“…To see this, we know from the Berstand-Chebyshev Theorem that there exists a prime p ′ with 2N < p ′ < 4N . Thus, for N ≥ 16, we have from (25) that…”

Section: Algorithmmentioning

confidence: 99%

“…Another approach is to construct CH sequences directly from the available channel sets of users. Such sequences are called local sequences, e.g., QR [37], Catalan [27], MTP [28], FMR [26], and QECH [25]. When the numbers of channels of the two users, n 1 and n 2 are O(N α ) for some 0 < α < 1, then the MTTR bounds from these local sequences are o(N 2 ) (see Table I) and thus better than those from global sequences.…”

Section: B From Orthogonal Mach Matrices To Asynchronous Ch Sequencesmentioning

confidence: 99%

On the Theoretical Gap of Channel Hopping Sequences with Maximum Rendezvous Diversity in the Multichannel Rendezvous Problem

Chang,

Sheu,

Lin

2019

Preprint

View full text Add to dashboard Cite

In the literature, there are several well-known periodic channel hopping (CH) sequences that can achieve maximum rendezvous diversity in a cognitive radio network (CRN). For a CRN with N channels, it is known that the period of such a CH sequence is at least N 2 . The asymptotic approximation ratio, defined as the ratio of the period of a CH sequence to the lower bound N 2 when N → ∞, is still 2.5 for the best known CH sequence in the literature. An open question in the multichannel rendezvous problem is whether it is possible to construct a periodic CH sequence that has the asymptotic approximation ratio 1. In this paper, we tighten the theoretical gap by proposing CH sequences, called IDEAL-CH, that have the asymptotic approximation ratio 2.For a weaker requirement that only needs the two users to rendezvous on one commonly available channel in a period, we propose channel hopping sequences, called ORTHO-CH, with period (2p + 1)p, where p is the smallest prime not less than N .

show abstract

“…A number of works have been conducted on how to design channel hopping (CH) sequences for this fundamental problem in CRNs [2]. Existing works can be categorized from different perspectives as follows: (1) According to whether users can adopt the same CH strategy, they are divided into Asymmetric role [3][4][5] and Symmetric role [6]; (2) According to the status of available channels, they can be divided into Homogeneous channels [7], Heterogeneous channels [8], Channel invariant [9], and Channel variable [10]; (3) According to whether users start CH at the same time, they can be divided into Asynchronous clock [11,12] and Synchronous clock [13]; (4) According to one or more users receiving information, they can be divided into Pairwise destination (Unicast) [14] and Multiple destination (Multicast) [15]. The ideal CH algorithms are expected to give good performance in terms of the maximum time-to-rendezvous (MTTR) (i.e.…”

mentioning

confidence: 99%

An efficient coprime integer sets based rendezvous algorithm for distributed cognitive radio networks

Wei,

Liu,

Lin

et al. 2023

Electronics Letters

View full text Add to dashboard Cite

Multichannel blind rendezvous problem is a fundamental problem in cognitive radio networks (CRNs). It refers to how to ensure that any two secondary users can meet on a common available channel at the same time. In this paper, an efficient channel hopping algorithm, called CISR (Coprime Integer Sets based Rendezvous), is designed for asymmetric role model (i.e. users can be divided into two types of roles, say, sender/leader and receiver/follower) in distributed CRNs. CISR can guarantee the rendezvous of the leader and follower and lowers the upper bound of both the maximum time to rendezvous and expected time to rendezvous by carefully constructing two coprime integer sets. The simulation results show that CISR has the near‐optimal performance.

show abstract

A Quaternary-Encoding-Based Channel Hopping Algorithm for Blind Rendezvous in Distributed IoTs

Cited by 12 publications

References 31 publications

Schedule Sequence Design for Broadcast in Multi-channel Ad Hoc Networks

Schedule Sequence Design for Broadcast in Multi-channel Ad Hoc Networks

On the Theoretical Gap of Channel Hopping Sequences with Maximum Rendezvous Diversity in the Multichannel Rendezvous Problem

An efficient coprime integer sets based rendezvous algorithm for distributed cognitive radio networks

Contact Info

Product

Resources

About