利用贪婪三跳信息降低Ad-hoc网络能耗

P. Phoummavong, S. Kanthavong, H. Ishii
{"title":"利用贪婪三跳信息降低Ad-hoc网络能耗","authors":"P. Phoummavong, S. Kanthavong, H. Ishii","doi":"10.1109/ICEAST.2019.8802597","DOIUrl":null,"url":null,"abstract":"Recently, Ad-hoc Network is a decentralized network which is used to commute information with each other node without a centralized system such as IoT, wireless sensor devices. The mechanism of the Ad-hoc network is a routing protocol which is used to find the best routing path. However, the traditional approaches probably are taken the high energy consumption. For this purpose, this research addresses the problem of routing protocol when a source sends information to a destination with high energy consumption. The idea of this proposal is improving routing method based on greedy forwarding protocol with three-hop. In detail, the proposed approach defines the appropriate path by setting switching nodes to get the routing path and relay information with low energy consumption. To show more details, in this paper will demonstrate the performance of proposed approach compared with other methods such as Nearest with Forwarding Selection, Random Forwarding Selection and Most Forward with Radius and greedy forwarding base on two-hop by using simulation.","PeriodicalId":188498,"journal":{"name":"2019 5th International Conference on Engineering, Applied Sciences and Technology (ICEAST)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reducing Energy Consumption by using Greedy Three-hop Information over Ad-hoc Network\",\"authors\":\"P. Phoummavong, S. Kanthavong, H. Ishii\",\"doi\":\"10.1109/ICEAST.2019.8802597\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, Ad-hoc Network is a decentralized network which is used to commute information with each other node without a centralized system such as IoT, wireless sensor devices. The mechanism of the Ad-hoc network is a routing protocol which is used to find the best routing path. However, the traditional approaches probably are taken the high energy consumption. For this purpose, this research addresses the problem of routing protocol when a source sends information to a destination with high energy consumption. The idea of this proposal is improving routing method based on greedy forwarding protocol with three-hop. In detail, the proposed approach defines the appropriate path by setting switching nodes to get the routing path and relay information with low energy consumption. To show more details, in this paper will demonstrate the performance of proposed approach compared with other methods such as Nearest with Forwarding Selection, Random Forwarding Selection and Most Forward with Radius and greedy forwarding base on two-hop by using simulation.\",\"PeriodicalId\":188498,\"journal\":{\"name\":\"2019 5th International Conference on Engineering, Applied Sciences and Technology (ICEAST)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 5th International Conference on Engineering, Applied Sciences and Technology (ICEAST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEAST.2019.8802597\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 5th International Conference on Engineering, Applied Sciences and Technology (ICEAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEAST.2019.8802597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最近,Ad-hoc网络是一种分散的网络,用于在没有物联网、无线传感器设备等集中系统的情况下与其他节点交换信息。Ad-hoc网络的机制是一种用于寻找最佳路由路径的路由协议。然而,传统的方法可能是高能耗的。为此,本研究解决了一个源向高能耗目的地发送信息时的路由协议问题。该方案的思想是对基于三跳贪婪转发协议的路由方法进行改进。具体而言,该方法通过设置交换节点来定义合适的路径,从而以低能耗获取路由路径和中继信息。为了展示更多的细节,本文将通过仿真来证明所提出的方法与其他方法如最近的转发选择、随机转发选择、最半径转发和基于两跳的贪婪转发的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reducing Energy Consumption by using Greedy Three-hop Information over Ad-hoc Network
Recently, Ad-hoc Network is a decentralized network which is used to commute information with each other node without a centralized system such as IoT, wireless sensor devices. The mechanism of the Ad-hoc network is a routing protocol which is used to find the best routing path. However, the traditional approaches probably are taken the high energy consumption. For this purpose, this research addresses the problem of routing protocol when a source sends information to a destination with high energy consumption. The idea of this proposal is improving routing method based on greedy forwarding protocol with three-hop. In detail, the proposed approach defines the appropriate path by setting switching nodes to get the routing path and relay information with low energy consumption. To show more details, in this paper will demonstrate the performance of proposed approach compared with other methods such as Nearest with Forwarding Selection, Random Forwarding Selection and Most Forward with Radius and greedy forwarding base on two-hop by using simulation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Formal Verification of the Accounting Information Interfaces Using Colored Petri Net Multi-Channel Surface Electromyograph for Monitoring Intradialytic Cramp Narrowband-Internet of Things (NB-IoT) System for Elderly Healthcare Services Municipal Solid Waste Segregation with CNN Measuring Icon Recognization Mapping with Automated Decision Making System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1