可持续MANET运行的分层路由算法

P. Koleva, Plamen T. Semov, V. Poulkov, Oleg Asenov
{"title":"可持续MANET运行的分层路由算法","authors":"P. Koleva, Plamen T. Semov, V. Poulkov, Oleg Asenov","doi":"10.1109/TSP.2016.7760842","DOIUrl":null,"url":null,"abstract":"In this paper a routing algorithm for MANETs is presented, based on the formation of servicing zones and determination of nodes in these zones as default gateways. The idea behind this approach is to gain power efficiency and sustainability of the network. The proposed approach reduces the overall number of broadcasts in the network and ensures a reliable and energy efficient connection, by balancing the load among the nodes. The algorithm could be considered as a hybrid type of routing mechanism, incorporating multipath hop-by-hop distributed routing. We apply a time slot based self-organizing and self-routing approach by the application of a network model with universal basic node properties. For each node we define two functional and one generic property. The algorithm has the logic of non-cooperative routing based on the evaluation of the defined basic properties of the nodes. The major advantages of the algorithm are related to the complexity and the reduced overall routing cost, especially in higher density networks.","PeriodicalId":159773,"journal":{"name":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Layered routing algorithm for sustainable MANET operation\",\"authors\":\"P. Koleva, Plamen T. Semov, V. Poulkov, Oleg Asenov\",\"doi\":\"10.1109/TSP.2016.7760842\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a routing algorithm for MANETs is presented, based on the formation of servicing zones and determination of nodes in these zones as default gateways. The idea behind this approach is to gain power efficiency and sustainability of the network. The proposed approach reduces the overall number of broadcasts in the network and ensures a reliable and energy efficient connection, by balancing the load among the nodes. The algorithm could be considered as a hybrid type of routing mechanism, incorporating multipath hop-by-hop distributed routing. We apply a time slot based self-organizing and self-routing approach by the application of a network model with universal basic node properties. For each node we define two functional and one generic property. The algorithm has the logic of non-cooperative routing based on the evaluation of the defined basic properties of the nodes. The major advantages of the algorithm are related to the complexity and the reduced overall routing cost, especially in higher density networks.\",\"PeriodicalId\":159773,\"journal\":{\"name\":\"2016 39th International Conference on Telecommunications and Signal Processing (TSP)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 39th International Conference on Telecommunications and Signal Processing (TSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSP.2016.7760842\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 39th International Conference on Telecommunications and Signal Processing (TSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSP.2016.7760842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种基于服务区域的路由算法,并在此基础上确定服务区域中的节点作为默认网关。这种方法背后的想法是获得电力效率和网络的可持续性。该方法通过平衡节点间的负载,减少了网络中广播的总数,保证了可靠和节能的连接。该算法可以看作是一种混合型路由机制,采用多路径逐跳分布式路由。通过应用具有通用基本节点属性的网络模型,实现了一种基于时隙的自组织自路由方法。对于每个节点,我们定义两个函数属性和一个泛型属性。该算法具有基于节点定义的基本属性评估的非合作路由逻辑。该算法的主要优点在于复杂度和总体路由成本的降低,特别是在高密度网络中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Layered routing algorithm for sustainable MANET operation
In this paper a routing algorithm for MANETs is presented, based on the formation of servicing zones and determination of nodes in these zones as default gateways. The idea behind this approach is to gain power efficiency and sustainability of the network. The proposed approach reduces the overall number of broadcasts in the network and ensures a reliable and energy efficient connection, by balancing the load among the nodes. The algorithm could be considered as a hybrid type of routing mechanism, incorporating multipath hop-by-hop distributed routing. We apply a time slot based self-organizing and self-routing approach by the application of a network model with universal basic node properties. For each node we define two functional and one generic property. The algorithm has the logic of non-cooperative routing based on the evaluation of the defined basic properties of the nodes. The major advantages of the algorithm are related to the complexity and the reduced overall routing cost, especially in higher density networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信