A concept for ant-routing with colored pheromones in wireless mesh networks

Martina Umlauft
{"title":"A concept for ant-routing with colored pheromones in wireless mesh networks","authors":"Martina Umlauft","doi":"10.1109/IS.2008.4670498","DOIUrl":null,"url":null,"abstract":"Different classes of traffic pose different requirements on the underlying network. For example, VoIP traffic has stricter requirements on delay and jitter than background traffic such as file downloads. Ant-routing algorithms store an amount of pheromone proportional to the measured ldquogoodnessrdquo of a link in the network. This approach assumes that a) links have only one dimension of ldquogoodnessrdquo and b) that ldquogoodnessrdquo is equal for all types of traffic. In reality, though, links can have several orthogonal dimensions of ldquogoodnessrdquo. In addition to bandwidth, delay, and jitter wireless links also experience changes of bandwidth over time and varying amounts of packet loss. Therefore, a route in a wireless mesh network may be suitable for one class of traffic but unsuitable for another. The proposed algorithm addresses this problem by introducing ldquocolored pheromonesrdquo which are matched to the traffic classes. Depending on the measurement of the different dimensions of ldquogoodnessrdquo and their match to the traffic classes an ant will deposit an apropriate amount of pheromones in the adequate ldquocolorrdquo in the routing tables. Traffic will then follow the appropriately colored paths.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th International IEEE Conference Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IS.2008.4670498","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Different classes of traffic pose different requirements on the underlying network. For example, VoIP traffic has stricter requirements on delay and jitter than background traffic such as file downloads. Ant-routing algorithms store an amount of pheromone proportional to the measured ldquogoodnessrdquo of a link in the network. This approach assumes that a) links have only one dimension of ldquogoodnessrdquo and b) that ldquogoodnessrdquo is equal for all types of traffic. In reality, though, links can have several orthogonal dimensions of ldquogoodnessrdquo. In addition to bandwidth, delay, and jitter wireless links also experience changes of bandwidth over time and varying amounts of packet loss. Therefore, a route in a wireless mesh network may be suitable for one class of traffic but unsuitable for another. The proposed algorithm addresses this problem by introducing ldquocolored pheromonesrdquo which are matched to the traffic classes. Depending on the measurement of the different dimensions of ldquogoodnessrdquo and their match to the traffic classes an ant will deposit an apropriate amount of pheromones in the adequate ldquocolorrdquo in the routing tables. Traffic will then follow the appropriately colored paths.
无线网状网络中有色信息素蚁路的概念
不同类型的流量对底层网络提出了不同的要求。例如,与文件下载等后台业务相比,VoIP业务对时延和抖动的要求更严格。反路由算法存储的信息素数量与网络中链路的测量值成正比。这种方法假设a)链接只有ldquogoodnessrdquo的一个维度,b) ldquogoodnessrdquo对于所有类型的流量都是相等的。然而,在现实中,链接可以有几个正交的维度。除了带宽,延迟和抖动无线链路也经历带宽随时间的变化和不同数量的丢包。因此,无线网状网络中的路由可能适用于一类业务,而不适用于另一类业务。该算法通过引入与流量类匹配的彩色信息素来解决这一问题。蚂蚁会根据对不同维度的ldquoodnrquo的测量以及它们与交通类别的匹配,在路由表中的足够ldquoorrrquo中存放适量的信息素。然后交通将遵循适当的彩色路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信