论文标题
安排在多渠道临时网络中广播的序列设计
Schedule Sequence Design for Broadcast in Multi-channel Ad Hoc Networks
论文作者
论文摘要
我们考虑了一个单跳的临时网络，每个节点旨在通过使用多个插入的TDD碰撞频道将数据包广播到其相邻节点。节点之间没有合作。为了确保成功的广播，我们建议在每个节点上预分配每个节点一个周期序列，以安排每个时间插槽的传输和接收。这些序列称为计划序列。由于每个节点独立启动传输时间表，因此它们使用的时间表序列之间存在相对时间偏移。我们的目标是设计时间表序列，以便每个节点在公共时期内成功地将至少一个数据包传输到每个邻居的邻居，无论偏移时间如何。序列周期应尽可能短。在本文中，我们分析了序列时期的下限，并提出了一种序列构造方法，该方法可以通过该方法达到与下限相同的顺序。 我们还考虑了每个节点在每个时间插槽上以预定的概率在通道上传输或接收的随机方案。数值研究比较了不同方案下的框架长度和广播完成时间。
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.
