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 条
  • [1] An efficient algorithm for dynamic shortest path tree update in network routing
    Xiao, Bin
    Cao, Hannong
    Shao, Zili
    Sha, Edwin H. -M.
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2007, 9 (04) : 499 - 510
  • [2] A shortest path routing algorithm in triplet-based network
    Wang, Zuo
    Shi, Feng
    Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 2009, 29 (05): : 410 - 414
  • [3] Shortest Path Routing Algorithm Based on Chaotic Neural Network
    Hu Shiyu & Xie Jianying Automation Research Institute
    Journal of Systems Engineering and Electronics, 2003, (04) : 1 - 6
  • [4] Load-balancing in MANET shortest-path routing protocols
    Souihli, Oussama
    Frikha, Mounir
    Ben Hamouda, Mahmoud
    AD HOC NETWORKS, 2009, 7 (02) : 431 - 442
  • [5] Dynamic shortest path problems: Hybrid routing policies considering network disruptions
    Sever, Derya
    Dellaert, Nico
    van Woensel, Tom
    de Kok, Ton
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (12) : 2852 - 2863
  • [6] Shortest Path Based Geographical Routing Algorithm in Wireless Sensor Network
    Banerjee, Indrajit
    Roy, Indrani
    Choudhury, Ahana Roy
    Das Sharma, Biswarup
    Samanta, Tuhina
    PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, DEVICES AND INTELLIGENT SYSTEMS (CODLS), 2012, : 262 - 265
  • [7] Dynamic shortest path routing in 2-circulants
    Dobravec, T
    Robic, B
    Vilfan, B
    PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON COMPUTER AND INFORMATION SCIENCES, 2003, : 332 - 336
  • [8] Finding a Trusted and Shortest Path Mechanism of Routing Protocol for Mobile Ad Hoc Network
    Shial, Rabindra Kumar
    Reddy, K. Hemant Kumar
    Gouda, Bhabani Sankar
    ICT AND CRITICAL INFRASTRUCTURE: PROCEEDINGS OF THE 48TH ANNUAL CONVENTION OF COMPUTER SOCIETY OF INDIA - VOL I, 2014, 248 : 311 - 320
  • [9] Dynamic near shortest path (DNSP) routing algorithm
    Ali, AD
    Dalal'ah, A
    ASMTA 2004: 11TH INTERNATIONAL CONFERENCE ON ANALYTICAL AND STOCHASTIC MODELLING TECHNIQUESAND APPLICATIONS, PROCEEDINGS, 2004, : 25 - 30
  • [10] A Hybrid routing algorithm for an efficient shortest path decision in network routing
    Cho, Taehwan
    Kim, Kyeongseob
    Yoon, Wanoh
    Choi, Sang Bang
    International Journal of Multimedia and Ubiquitous Engineering, 2013, 8 (04): : 127 - 136
12345