Research on Adaptive Routing Algorithm for Wireless Weak-connection Network

doi:10.16182/j.issn1004731x.joss.20-FZ0405

Abstract

Abstract: The wireless weak-connected network has the characteristics of long delay, high dynamic topology, and unstable links. With the lack of continuity from the source end to the destination end of network connection, in order to solve the problem of communication difficulty, the intelligence and adaptability of Physarum polycephalum are introduced, and the adaptive wireless weak-connected network routing algorithm is proposed. A wireless weak-connected network model is build and the mathematical relationships of link capacity is deduced. The next-hop selection strategy and optimal routing strategy is designed to achieve the best-effort delivery of data in wireless weak-connected network environmrnt. Simulation experiments show that the algorithm can achieve good data delivery and low average latency with low network overhead.

Key words: dynamic topology, wireless weak-connected network, Physarum polycephalum, best-effort delivery, routing

CLC Number:

TP393.1

Hua Xiang, Yao Hongjuan, Wang Hai, Wang Zhao, Zhang Jietao, Shu Lili. Research on Adaptive Routing Algorithm for Wireless Weak-connection Network[J]. Journal of System Simulation, 2020, 32(10): 2022-2033.

References 15

[1]	汪佩佩, 李涛, 王汝传. DTN中基于Epidemic路由的拥塞控制策略研究[J]. 计算机应用与软件, 2019, 36(6): 104-108.Wang Peipei, Li Tao, Wang Ruchuan.Congestion Control Strategy Based on Epidemic Routing in DTN[J]. Computer Applications and software, 2019, 36(6): 104-108.
[2]	Burgess J, Gallagher B, Jensen D, et al.MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks[C]// IEEE international conference computer and communications, Barcelona: IEEE, 2006: 1-11.
[3]	Jain S, Fall K, Patra R.Routing in a Delay Tolerant Network[J]. ACM Special Interest Group on Data Communication, 2004, 34(4): 145-158.
[4]	Hui P, Crowcroft J, Yoneki E.Bubble rap: Social-based Forwarding in Delay-tolerant Networks[J]. IEEE Transactions on Mobile Computing (S1536-1233), 2010, 10(11): 1576-1589.
[5]	Spyropoulos T, Psounis K, Raghavendra C S.Spray and Wait: an Efficient Routing Scheme for Intermittently Connected Mobile Networks[C]. Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. New York, USA: Association for Computing Machinery, 2005: 252-259.
[6]	Liu C, Wu J.Practical Routing in a Cyclic Mobispace[J]. IEEE/ACM Transactions on Networking (S1558-2566), 2011, 19(2): 369-382.
[7]	Musolesi M, Mascolo C.CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks[J]. IEEE Transactions on Mobile Computing (S1536-1233), 2009, 2(8): 246-260.
[8]	张明川, 许长桥, 关建峰, 等. 一种面向智慧协同网络的自适配路由策略研究[J]. 电子学报, 2015, 43(7): 1249-1256.Zhang Mingchuan, Xu Changqiao, Guan Jianfeng, et al.Adaptive Allocation Routing Scheme for Smart and Cooperative Networks[J]. Acta Electronica Sinica, 2015, 43(7): 1249-1256.
[9]	Liu Y X, Gao C, Zhang Z L.Simulating Transport Networks With a Physarum Foraging Model[J]. IEEE Access (S2169-3536), 2019, 7: 23725-23739.
[10]	Tero A, Takagi S, Saigusa T, et al.Rules for Biologically Inspired Adaptive Network Design[J]. Science (S0036-8075), 2010, 327(5964): 439-442.
[11]	刘玉欣. 基于生物启发的网络路径优化与溯源研究[D]. 重庆: 西南大学, 2018.Liu Yuxin.Bio-inspired Route Optimization and Source Identification[D]. Chongqing: Southwest University, 2018.
[12]	于云龙, 茹乐, 方堃, 等. 面向高动态移动自组织网络的生物启发分簇算法[J]. 电子学报, 2018, 46(4): 918-929.Yu Yunlong, Ru Le, Fang Kun, et al.Bio-Inspired Clustering Algorithm for Highly Dynamic Mobile Ad Hoc Networks[J]. Acta Electronica Sinica, 2018, 46(4): 918-929.
[13]	张和杰, 马维华. 基于贴近度等级的链路质量评估方法[J]. 计算机工程与科学, 2018, 40(11): 1991-1999.Zhang Hejie, Ma Weihua.A Link Quality Estimation Method Based on Closeness Grades[J]. Computer Engineering and Science, 2018, 40(11): 1991-1999.
[14]	胡立颖. 延迟容忍网络中机会路由算法研究[D]. 大连:大连海事大学, 2016.Hu Liying.Opportunistic Routing Algorithms in Delay Tolerant Networks[D]. Dalian: Dalian Maritime University, 2016.
[15]	Abdul B, Safi U K, Omair S.Application-based Forwarding in Delay-Tolerant Networks[J]. International Journal of Engineering Works (S2409-2770), 2020, 7(2): 143-148.