Efficient on-demand route establishment methods for dense ad-hoc networks

Yujin Noishiki, H. Yokota, A. Idoue
{"title":"Efficient on-demand route establishment methods for dense ad-hoc networks","authors":"Yujin Noishiki, H. Yokota, A. Idoue","doi":"10.1109/ISADS.2005.1452168","DOIUrl":null,"url":null,"abstract":"On-demand ad hoc routing protocols broadcast control packets to establish routes to destination nodes. In ad hoc networks that are joined by many mobile nodes, they generate a high number of broadcast packets, thereby causing contention, packet collisions and battery power wastage in the mobile nodes. We propose an efficient route establishment method to decrease the transmission of control packets adoptively according to the number of adjacent nodes and the number of routes that those nodes accommodate. Through simulation, we demonstrate that our proposed method is especially efficient in dense ad hoc networks. In our proposed method, the number of control packets is decreased without lowering the success ratio of path discoveries according to the number of adjacent nodes. Furthermore, our proposed method improves the performance of packet delivery, taking account of the path concentration.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2005.1452168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

On-demand ad hoc routing protocols broadcast control packets to establish routes to destination nodes. In ad hoc networks that are joined by many mobile nodes, they generate a high number of broadcast packets, thereby causing contention, packet collisions and battery power wastage in the mobile nodes. We propose an efficient route establishment method to decrease the transmission of control packets adoptively according to the number of adjacent nodes and the number of routes that those nodes accommodate. Through simulation, we demonstrate that our proposed method is especially efficient in dense ad hoc networks. In our proposed method, the number of control packets is decreased without lowering the success ratio of path discoveries according to the number of adjacent nodes. Furthermore, our proposed method improves the performance of packet delivery, taking account of the path concentration.
密集ad-hoc网络中高效的按需路由建立方法
按需自组织路由协议通过广播控制报文来建立到目的节点的路由。在由许多移动节点组成的自组织网络中,它们会产生大量的广播数据包,从而导致移动节点中的争用、数据包冲突和电池电量浪费。我们提出了一种有效的路由建立方法,根据相邻节点的数量和节点所容纳的路由数量,采用自适应的方式减少控制数据包的传输。通过仿真,我们证明了该方法在密集自组织网络中特别有效。在我们提出的方法中,根据相邻节点的数量,在不降低路径发现成功率的情况下减少控制数据包的数量。此外,我们提出的方法在考虑路径集中的情况下提高了数据包传输的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信