首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Energy-efficient initialization protocols for single-hop radio networks with no collision detection
【24h】

Energy-efficient initialization protocols for single-hop radio networks with no collision detection

机译:无冲突检测的单跳无线网络的节能初始化协议

获取原文
获取原文并翻译 | 示例

摘要

A radio network (RN, for short) is a distributed system consisting of n radio stations. We assume that the stations are small, bulk-produced, hand-held devices running on batteries and cannot be distinguished by serial or manufacturing number. Since recharging batteries may not be possible while on mission, we are interested in designing protocols that are highly energy-efficient. The initialization problem is to assign each of the n stations in the RN a unique ID. The initialization problem is nontrivial since the stations are assumed to be indistinguishable. The problem is fundamental, since practically all communication protocols for RNs proceed under the assumption that the RN has been initialized in advance. The main contribution of this work is to propose energy-efficient randomized initialization protocols for single-hop RNs lacking collision detection capabilities. First, we show that if the number n of stations is known beforehand, the single-channel RN can be initialized by a protocol that terminates, with probability exceeding 1-/sup 1///sub n/ in O(n) time slots, with no station being awake for more than O(log log n) time slots. We then go on to address the multichannel case and show that if k, (k/spl ges/1), channels are available, an n-station RN can be initialized, with probability exceeding 1-/sup 1///sub n/, in O(/sup n///sub k/+log n) time slots, with no station being awake for more than O(log log n) time slots.
机译:无线电网络(简称RN)是由n个无线电站组成的分布式系统。我们假设这些工作站是小型的,批量生产的手持设备,依靠电池运行,无法通过序列号或制造号来区分。由于在执行任务时可能无法为电池充电,因此我们对设计高效节能的协议感兴趣。初始化问题是给RN中的n个站中的每一个分配唯一的ID。初始化问题并非无关紧要,因为假定站点是无法区分的。该问题是根本的,因为几乎所有用于RN的通信协议都是在假设RN已经预先初始化的情况下进行的。这项工作的主要贡献是为缺乏冲突检测功能的单跳RN提出了节能的随机初始化协议。首先,我们表明,如果事先知道站的数量n,则可以通过终止协议来初始化单信道RN,在O(n)时隙中概率超过1- / sup 1 /// sub n / ,并且没有哪个电台的醒来时间超过O(log log n)个时隙。然后,我们继续解决多通道情况,并表明如果k((k / spl ges / 1))个通道可用,则可以初始化n站RN,其概率超过1- / sup 1 /// sub n /,在O(/ sup n /// sub k / + log n)个时隙中,没有站醒来超过O(log log n)个时隙。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号