遗传算法在容延迟和容中断网络中任播路由优化中的应用

Éderson Rosa Da Silva, P. R. Guardieiro
{"title":"遗传算法在容延迟和容中断网络中任播路由优化中的应用","authors":"Éderson Rosa Da Silva, P. R. Guardieiro","doi":"10.4018/978-1-61350-092-7.CH011","DOIUrl":null,"url":null,"abstract":"Delay and disruption tolerant networks (DTNs) have the capacity of providing data communication to remote and rural areas where current networking technology does not work well. In such challenging areas characterized by long duration partition, routing is a common problem. Anycast routing can be used for many applications in DTNs, and it is useful when nodes wish to send messages to at least one, and preferably only one, of the members in an anycast destination group. In this chapter, an anycast routing algorithm for DTNs based on genetic algorithms (GAs) is presented and analyzed. The GA is applied to find the appropriate combination of each path to comply with the delivery needs of the group of anycast sessions simultaneously. The routing algorithm based on GAs under consideration uses the concept of subpopulation to produce the next generation of the population, a limited number of solutions to be evaluated, and yields minimum delay in achieving a specified rate of delivery. Simulation results show that the studied GA-based anycast routing algorithm can produce good results.","PeriodicalId":222328,"journal":{"name":"Biologically Inspired Networking and Sensing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Application of Genetic Algorithms for Optimization of Anycast Routing in Delay and Disruption Tolerant Networks\",\"authors\":\"Éderson Rosa Da Silva, P. R. Guardieiro\",\"doi\":\"10.4018/978-1-61350-092-7.CH011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Delay and disruption tolerant networks (DTNs) have the capacity of providing data communication to remote and rural areas where current networking technology does not work well. In such challenging areas characterized by long duration partition, routing is a common problem. Anycast routing can be used for many applications in DTNs, and it is useful when nodes wish to send messages to at least one, and preferably only one, of the members in an anycast destination group. In this chapter, an anycast routing algorithm for DTNs based on genetic algorithms (GAs) is presented and analyzed. The GA is applied to find the appropriate combination of each path to comply with the delivery needs of the group of anycast sessions simultaneously. The routing algorithm based on GAs under consideration uses the concept of subpopulation to produce the next generation of the population, a limited number of solutions to be evaluated, and yields minimum delay in achieving a specified rate of delivery. Simulation results show that the studied GA-based anycast routing algorithm can produce good results.\",\"PeriodicalId\":222328,\"journal\":{\"name\":\"Biologically Inspired Networking and Sensing\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Biologically Inspired Networking and Sensing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/978-1-61350-092-7.CH011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biologically Inspired Networking and Sensing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/978-1-61350-092-7.CH011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

延迟和中断容忍网络(dtn)具有向当前网络技术不能很好地工作的偏远和农村地区提供数据通信的能力。在以长时间分区为特征的具有挑战性的区域中,路由是一个常见的问题。任意播路由可用于dtn中的许多应用程序,当节点希望向任意播目标组中的至少一个(最好只有一个)成员发送消息时,它非常有用。在本章中,提出并分析了一种基于遗传算法(GAs)的DTNs任播路由算法。应用遗传算法找到每条路径的适当组合,以同时满足任意播会话组的交付需求。所考虑的基于GAs的路由算法使用子种群的概念来产生下一代种群,需要评估的解的数量有限,并且在达到指定的交付率时产生最小的延迟。仿真结果表明,所研究的基于遗传算法的任播路由算法能够取得良好的路由效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Application of Genetic Algorithms for Optimization of Anycast Routing in Delay and Disruption Tolerant Networks
Delay and disruption tolerant networks (DTNs) have the capacity of providing data communication to remote and rural areas where current networking technology does not work well. In such challenging areas characterized by long duration partition, routing is a common problem. Anycast routing can be used for many applications in DTNs, and it is useful when nodes wish to send messages to at least one, and preferably only one, of the members in an anycast destination group. In this chapter, an anycast routing algorithm for DTNs based on genetic algorithms (GAs) is presented and analyzed. The GA is applied to find the appropriate combination of each path to comply with the delivery needs of the group of anycast sessions simultaneously. The routing algorithm based on GAs under consideration uses the concept of subpopulation to produce the next generation of the population, a limited number of solutions to be evaluated, and yields minimum delay in achieving a specified rate of delivery. Simulation results show that the studied GA-based anycast routing algorithm can produce good results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Dendritic Cell Algorithm for Intrusion Detection Autonomously Evolving Communication Protocols Network Energy Driven Wireless Sensor Networks Scented Node Protocol for MANET Routing A Networking Paradigm Inspired by Cell Communication Mechanisms
×
引用
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