Similar node-disjoint multi-paths routing in wireless ad hoc networks

被引:0
|
作者
Xu, WP [1 ]
Yan, PL [1 ]
Xia, DL [1 ]
机构
[1] Wuhan Univ, Sch Elect Informat, Wuhan 430072, Hubei, Peoples R China
关键词
similarity; Node-Disjoint; Multipaths Routing; ad hoc networking; mobile networking;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
A Similar Node-Disjoint Multi-paths Routing (SNDMR) algorithm is proposed to overcome the shortcomings of on-demand Node-Disjoint Multi-path Routing (NDMR). SNDMR has two novel aspects compared to NDMR. Firstly, based on similarity principle, it eliminates long paths from candidate routes, and avoids the disadvantageous effect to the performance of networks. Secondly, it adopts proactive path maintenance. On the one hand, it can keep communication unblocked with any delay in mobile wireless networks. On the other hand, it can find better paths when the majority of active paths become unreachable or loading increases dramatically. Simulation results show that SNDMR achieves lower delay dithering as well as higher packet delivery ratio.
引用
收藏
页码:731 / 734
页数:4
相关论文
共 50 条
  • [1] QoS in Node-Disjoint Routing for Ad Hoc Networks
    Liu, Luo
    Cuthbert, Laurie
    [J]. PE-WASUN'07: PROCEEDINGS OF THE FOURTH ACM WORKSHOP ON PERFORMANCE EVALUATION OF WIRELESS AD HOC, SENSOR, AND UBIQUITOUS NETWORKS, 2007, : 92 - 95
  • [2] QoS Routing Protocol with Multiple Node-Disjoint Paths in Ad Hoc Networks
    Yi-Wen Su
    Show-Shiow Tzeng
    [J]. Wireless Personal Communications, 2015, 83 : 1867 - 1885
  • [3] QoS Routing Protocol with Multiple Node-Disjoint Paths in Ad Hoc Networks
    Su, Yi-Wen
    Tzeng, Show-Shiow
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2015, 83 (03) : 1867 - 1885
  • [4] QoS in Node-Disjoint Routing for Ad Hoc Networks
    Liu, Luo
    Cuthbert, Laurie
    [J]. 2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 1649 - 1652
  • [5] On-demand node-disjoint multipath routing in wireless ad hoc networks
    Li, XF
    Cuthbert, L
    [J]. LCN 2004: 29TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, 2004, : 419 - 420
  • [6] An Improved Node-Disjoint Multi-path Routing protocol in ad hoc networks
    Qin, Zhen
    Li, Lemin
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE INFORMATION COMPUTING AND AUTOMATION, VOLS 1-3, 2008, : 874 - 877
  • [7] Dual paths node-disjoint routing for data salvation in mobile ad hoc
    Jiang, Fuu-Cheng
    Lin, Chu-Hsing
    Huang, Der-Chen
    Yang, Chao-Tung
    [J]. JOURNAL OF SUPERCOMPUTING, 2012, 59 (01): : 268 - 296
  • [8] Dual paths node-disjoint routing for data salvation in mobile ad hoc
    Fuu-Cheng Jiang
    Chu-Hsing Lin
    Der-Chen Huang
    Chao-Tung Yang
    [J]. The Journal of Supercomputing, 2012, 59 : 268 - 296
  • [9] Route failure time of node-disjoint paths in mobile ad hoc networks
    Abbas, Ash Mohammad
    [J]. ICIT 2006: 9TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY, PROCEEDINGS, 2006, : 64 - +
  • [10] Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks
    Liu, Changwen
    Yarvis, Mark
    Conner, W. Steven
    Guo, Xingang
    [J]. COMPUTER COMMUNICATIONS, 2007, 30 (14-15) : 2917 - 2930