A DYNAMIC SHORTEST PATH WEIGHTED ROUTING MECHANISM FOR MANET BASED ON COMPLEX NETWORK THEORY

被引：0

作者：

Wang Yinghe ^{[1
]}

Chang Lin ^{[2
]}

Yu Kai ^{[1
,3
]}

Tan Chong ^{[1
]}

Bu Zhiyong ^{[1
]}

机构：

[1] Chinese Acad Sci, Shanghai Inst Microsyst & Informat Technol, Shanghai 200050, Peoples R China

[2] China Acad Telecommun Res, MITT, TL Certificat Ctr, Beijing 100191, Peoples R China

[3] SIMIT, Nanjing Broad Hand Wireless Commun Res Ctr, Nanjing 211111, Jiangsu, Peoples R China

来源：

2014 4TH IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT (IEEE IC-NIDC) | 2014年

关键词：

MANET; weighted routing; shortest path; energy consumption; complex network;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a dynamic shortest path weighted routing mechanism applying to mobile ad hoc networks is proposed based on the complex network theory, This weight routing mechanism uses node energy and link distance which are the two most important factors affecting the performance of mobile ad hoc networks to structure the weights of edges. The routing process presented by this paper uses a mixed mode based on local search and global information. The simulation results shows that the routing mechanism not only can select the more energy nodes to transmit data effectively, but also can balance the relationship between the length of the path and the transmission cost, disperse transmit load of nodes and lengthen the running time of network.

引用

页码：17 / 21

页数：5

共 50 条

[41] Rate-based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN
Akin, Erdal
Korkmaz, Turgay
ICC 2019 - 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2019,
[42] PDX-PLUS: An SDN Controller with Dynamic Shortest Path Routing
Alshammari, Muteb
Rezgui, Abdelmounaam
2020 IEEE 9TH INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET), 2020,
[43] A network-decentralised strategy for shortest-path-flow routing
Blanchini, Franco
Casagrande, Daniele
Fabiani, Filippo
Giordano, Giulia
Pesenti, Raffaele
2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 1126 - 1131
[44] Design and analysis of improved Shortest Path Tree update for network routing
Xiao, B
Zhuge, QF
Shao, ZL
Sha, EHM
PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2003, : 82 - 87
[45] Shortest Path Routing Algorithm for Hierarchical Interconnection Network-on-Chip
Inam, Omair
Al Khanjari, Sharifa
Vanderbauwhede, Wim
10TH INTERNATIONAL CONFERENCE ON FUTURE NETWORKS AND COMMUNICATIONS (FNC 2015) / THE 12TH INTERNATIONAL CONFERENCE ON MOBILE SYSTEMS AND PERVASIVE COMPUTING (MOBISPC 2015) AFFILIATED WORKSHOPS, 2015, 56 : 409 - 414
[46] Position-based path optimization routing algorithm in MANET
Liu, H. (liuhw@hit.edu.cn), 2013, Editorial Board of Journal of Harbin Engineering (34):
[47] Design of Path-based Multicast Routing Protocol in MANET
Chen, Chang-Wu
Su, Ping-Jia
Chen, Yen-Wen
PM2HW2N'08: PROCEEDINGS OF THE THIRD ACM INTERNATIONAL WORKSHOP ON PERFORMANCE MONITORING, MEASUREMENT, AND EVALUATION OF HETEROGENEOUS WIRELESS AND WIRED NETWORKS, 2008, : 131 - 136
[48] DDRM-CapsNet: Capsule Network Based on Deep Dynamic Routing Mechanism for Complex Data
Liu, Jian-wei
Gao, Feng
Lu, Run-kun
Lian, Yuan-feng
Wang, Dian-zhong
Luo, Xiong-lin
Wang, Chu-ran
ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2019: THEORETICAL NEURAL COMPUTATION, PT I, 2019, 11727 : 178 - 189
[49] Exploring public bicycle network structure based on complex network theory and shortest path analysis: the public bicycle system in Yixing, China
Wei, Sheng
Xu, Jiangang
Ma, Haitao
TRANSPORTATION PLANNING AND TECHNOLOGY, 2019, 42 (03) : 293 - 307
[50] Study on congestion control for complex network based on weighted routing strategy
Department of Information Engineering, Jiangsu Open University, Nanjing
210017, China
不详
53201, United States
Xitong Gongcheng Lilum yu Shijian, 4 (1063-1068):

← 1 2 3 4 5 →