首页> 外文会议>2016 IEEE Region 10 Symposium >Tree-based protocol for ad hoc networks constructed with data transmission modems
【24h】

Tree-based protocol for ad hoc networks constructed with data transmission modems

机译:使用数据传输调制解调器构建的自组织网络的基于树的协议

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

摘要

This paper presents a communication protocol for an ad hoc network constructed with 429 MHz data transmission modems. It is expected that the signal attenuation caused by rainfall is smaller for the 429 MHz band than for the 2.4 or 5 GHz band, which is used in wireless LANs and ZigBee. Additionally, since the signal diffraction is greater for this frequency than for higher frequencies, the signal is less attenuated by obstacles. Hence, the 429 MHz modem is suitable for networks with long-distance wireless transmission. However, the modem does not support network functions such as packet collision avoidance and routing. Thus, the paper presents a new simple protocol that avoids packet collisions and performs routing. The proposed protocol is essentially a token passing method that utilizes a rooted tree structure in a mesh network. In this method, the order of token passing is determined by a depth-first search in the tree. With this scheme, it is possible for the protocol to avoid packet collisions. In addition, routing is performed with very limited information stored at each node. This paper details the proposed token-based protocol and describes how the token and data packets circulate in the network. It also presents a distributed algorithm that finds a rooted tree in a mesh network. The proposed method was implemented on a prototype network. The feasibility of the method was confirmed through an experiment. The characteristic of a tree obtained by the tree construction algorithm is also clarified.
机译:本文提出了一种使用429 MHz数据传输调制解调器构建的自组织网络的通信协议。可以预期,由降雨引起的信号衰减在429 MHz频段比在无线LAN和ZigBee中使用的2.4或5 GHz频段要小。另外,由于该频率的信号衍射大于较高频率的信号衍射,因此信号受障碍物的衰减较小。因此,429 MHz调制解调器适用于具有长距离无线传输的网络。但是,调制解调器不支持网络功能,例如避免数据包冲突和路由。因此,本文提出了一种避免分组冲突并执行路由的新的简单协议。所提出的协议本质上是一种令牌传递方法,其在网状网络中利用根树结构。在这种方法中,令牌传递的顺序由树中的深度优先搜索确定。使用此方案,协议可以避免数据包冲突。另外,使用存储在每个节点上的非常有限的信息来执行路由。本文详细介绍了基于令牌的协议,并描述了令牌和数据包如何在网络中循环。它还提出了一种分布式算法,该算法可在网状网络中找到根树。所提出的方法是在原型网络上实现的。通过实验证实了该方法的可行性。还阐明了通过树构造算法获得的树的特性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号