使用GA的多点中继选择

Hassan Chizari, Majid Hosseini, Shukor Abd Razak
{"title":"使用GA的多点中继选择","authors":"Hassan Chizari, Majid Hosseini, Shukor Abd Razak","doi":"10.1109/ISIEA.2009.5356301","DOIUrl":null,"url":null,"abstract":"Multi-Point Relay (MPR) mechanism is a selection algorithm to reduce the number of control packets in ad-hoc network routing protocols. This study presents a new MPR selection method using genetic algorithm (GA) while the MPR sets follow the maximal independent concept. Although original greedy algorithm works well in sparse networks, as MPR selection is an NP-hard problem, the proposed method can improve MPR selection phase in the presence of large number of nodes. The simulation shows that our method obtains up to 35% more independent sets when node density is high and incurs less memory usage, less power-consumption, and less retransmissions due to interferences.","PeriodicalId":6447,"journal":{"name":"2009 IEEE Symposium on Industrial Electronics & Applications","volume":"71 1","pages":"957-962"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"MultiPoint Relay selection using GA\",\"authors\":\"Hassan Chizari, Majid Hosseini, Shukor Abd Razak\",\"doi\":\"10.1109/ISIEA.2009.5356301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-Point Relay (MPR) mechanism is a selection algorithm to reduce the number of control packets in ad-hoc network routing protocols. This study presents a new MPR selection method using genetic algorithm (GA) while the MPR sets follow the maximal independent concept. Although original greedy algorithm works well in sparse networks, as MPR selection is an NP-hard problem, the proposed method can improve MPR selection phase in the presence of large number of nodes. The simulation shows that our method obtains up to 35% more independent sets when node density is high and incurs less memory usage, less power-consumption, and less retransmissions due to interferences.\",\"PeriodicalId\":6447,\"journal\":{\"name\":\"2009 IEEE Symposium on Industrial Electronics & Applications\",\"volume\":\"71 1\",\"pages\":\"957-962\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Symposium on Industrial Electronics & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIEA.2009.5356301\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Symposium on Industrial Electronics & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIEA.2009.5356301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

多点中继(Multi-Point Relay, MPR)机制是自组织网络路由协议中减少控制报文数量的一种选择算法。提出了一种基于遗传算法的MPR选择方法,同时MPR集遵循最大独立概念。虽然原有的贪心算法在稀疏网络中效果良好,但由于MPR选择是np困难问题,本文提出的方法可以在节点数量较多的情况下改善MPR选择阶段。仿真结果表明,在节点密度较高的情况下,该方法可获得多达35%的独立集,并且减少了由于干扰而产生的内存占用、功耗和重传。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MultiPoint Relay selection using GA
Multi-Point Relay (MPR) mechanism is a selection algorithm to reduce the number of control packets in ad-hoc network routing protocols. This study presents a new MPR selection method using genetic algorithm (GA) while the MPR sets follow the maximal independent concept. Although original greedy algorithm works well in sparse networks, as MPR selection is an NP-hard problem, the proposed method can improve MPR selection phase in the presence of large number of nodes. The simulation shows that our method obtains up to 35% more independent sets when node density is high and incurs less memory usage, less power-consumption, and less retransmissions due to interferences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信