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

S. Ohta
{"title":"基于树的协议,用于使用数据传输调制解调器构建的自组织网络","authors":"S. Ohta","doi":"10.1109/TENCONSPRING.2016.7519376","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":166275,"journal":{"name":"2016 IEEE Region 10 Symposium (TENSYMP)","volume":"9 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tree-based protocol for ad hoc networks constructed with data transmission modems\",\"authors\":\"S. Ohta\",\"doi\":\"10.1109/TENCONSPRING.2016.7519376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":166275,\"journal\":{\"name\":\"2016 IEEE Region 10 Symposium (TENSYMP)\",\"volume\":\"9 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Region 10 Symposium (TENSYMP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCONSPRING.2016.7519376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Region 10 Symposium (TENSYMP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCONSPRING.2016.7519376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种由429mhz数据传输调制解调器组成的自组网通信协议。预计,与无线局域网和ZigBee使用的2.4 GHz或5ghz频段相比,429mhz频段因降雨引起的信号衰减会更小。此外,由于这个频率的信号衍射比更高频率的信号衍射更大,因此信号受障碍物的衰减更小。因此,429mhz调制解调器适用于远距离无线传输的网络。但不支持报文避免冲突、路由等网络功能。因此,本文提出了一种新的简单协议,可以避免分组冲突并执行路由。所提出的协议本质上是一种利用网状网络中的根树结构的令牌传递方法。在这种方法中,令牌传递的顺序由树中的深度优先搜索决定。有了这个方案,协议就有可能避免包冲突。此外,执行路由时,每个节点上存储的信息非常有限。本文详细介绍了所提出的基于令牌的协议,并描述了令牌和数据包如何在网络中循环。提出了一种在网状网络中寻找根树的分布式算法。在一个原型网络上实现了该方法。通过实验验证了该方法的可行性。阐明了构造树算法得到的树的特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信