Organized topology based routing protocol in incompletely predictable ad-hoc networks

详细信息    查看全文

• 作者：Jian Shen^a ; ^b ; ^c ; ^{s_shenjian@126.com}Author Vitae ; Chen Wang^c ; ^{wangchennuist@126.com}Author Vitae ; Anxi Wang^c ; ^{Anxi_wang@126.com}Author Vitae ; Xingming Sun^a ; ^c ; ^{sunnudt@163.com}Author Vitae ; Sangman Moh^d ; ^{smmoh@chosun.ac.kr}Author Vitae ; Patrick C.K. Hung ; ^c ; ^e ; ^{patrick.hung@uoit.ca}Author Vitae
• 关键词：Organized topology ; Anti-pheromone ; Routing protocol ; Ad-hoc network
• 刊名：Computer Communications
• 出版年：2017
• 出版时间：1 February 2017
• 年：2017
• 卷：99
• 期：Complete
• 页码：107-118
• 全文大小：2558 K
• 卷排序：99

文摘

We define the incompletely predictable ad-hoc networks, which has no need for nodes to move or whose nodes move in a very limited area around the basic position that has been initially settled at. We construct Static Organized Topology (S-OT) Model and Dynamic Organized Topology (D-OT) Model for the incompletely predictable ad-hoc networks. Static Organized Topology Based Routing using Anti-Pheromone (APS-OTBR) is designed on the basis of “anti-pheromone”. Combined with greedy algorithm, Dynamic Organized Topology Based Routing using Greedy Algorithm (GrD-OTBR) is proposed to adapt the environment described by D-OT. Our simulation shows that APS-OTBR has a reasonable node utilization frequency, and GrD-OTBR has a stable performance when network size changes and performs better in a relatively small size of the network.