返回
Deterministic Collision-Resilient Channel Rendezvous: Theory and Algorithm
DOI:10.1109/TWC.2022.3171413.png)
摘要
En 中文
We formulate and investigate the problem of distributed channel rendezvous in collision-prone wireless networks. Existing researches on this topic are mainly devoted to designing channel hopping sequences, each pair of which can overlap on a common channel within bounded delay. However, this overlap-based canonical rendezvous design does not take into account channel collision, which may render existing rendezvous algorithms fail to achieve bounded delay in collision-prone environment. Motivated by this observation, we formulate and investigate the collision-aware channel rendezvous problem in a generic scenario, where a collision occurs if more than C packets overlap in time on a same channel. Our generic formulation allows to model both the baseline single packet reception model with C = 1 and the more sophisticated multiple packet reception model with C > 1. We further abstract the collision-aware rendezvous problem as the problem of constructing a robust rendezvous system. We establish the theoretical limit of the problem, guided by which we design a collision-resilient distributed rendezvous algorithm with truly bounded rendezvous delay. We then demonstrate the performance of our rendezvous algorithm both analytically and numerically.
Keyword:
Channel rendezvous
collision-prone wireless networks
multiple packet reception
sequence design
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
Role of Macromolecular Hydration in the Binding of theEscherichia coliCyclic AMP Receptor to DNA
Biochemistry
IF0
Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications永远不要没有邻居: 从移动传感应用的单通道到多通道邻居发现
The Agricultural Potential of Northwestern Canada and Alaska and the Impact of Climatic Change
ARCTIC
IF0

