A new approach to on-demand loop-free routing in networks using sequence numbers

被引:7
|
作者
Garcia-Luna-Aceves, J. J. [1 ]
Mosko, Marc
Perkins, Charles E.
机构
[1] Univ Calif Santa Cruz, Jack Baskin Sch Engn, Santa Cruz, CA 95062 USA
[2] Nokia Res Ctr, Commun Syst Lab, Mountain View, CA 94043 USA
关键词
routing protocol; loop-free; algorithm analysis; ad hoc network;
D O I
10.1016/j.comnet.2005.09.022
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A new protocol is presented for on-demand, loop-free routing in ad hoc networks. The new protocol, called the labeled distance routing (LDR) protocol, uses a distance invariant to establish an ordering criterion and per-destination sequence numbers to reset the invariant resulting in loop-freedom at every instant. The distance invariant allows nodes to change their next hops or distances to destinations without creating routing-table loops. The destination sequence number, which only the destination may increment, permits nodes to reset the values of their distance invariants. The performance of LDR is compared against the performance of three other protocols that are representative of the state-of-the-art, namely AODV. DSR and OLSR; LDR's performance is shown to be far better than the other three protocols. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:1599 / 1615
页数:17
相关论文
共 50 条
  • [41] Link-traffic loop-free property in optimal routing for multi-class networks
    Kameda, H
    Li, J
    Altman, E
    2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, : 4217 - 4224
  • [42] Message-efficient dissemination for loop-free centralized routing
    Peterson, Haldane
    Sen, Soumya
    Chandrashekar, Jaideep
    Gao, Lixin
    Guerin, Roch
    Zhang, Zhi-Li
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (03) : 65 - 74
  • [43] Message-efficient dissemination for loop-free centralized routing
    University of Minnesota, United States
    不详
    不详
    不详
    Comput Commun Rev, 2008, 3 (63-74):
  • [44] Loop-free Forwarding in Hierarchical Location-based Routing
    Wei, ZhanZhen
    Wang, Feng
    Li, Zhaobin
    2017 INTERNATIONAL CONFERENCE ON CYBER-ENABLED DISTRIBUTED COMPUTING AND KNOWLEDGE DISCOVERY (CYBERC), 2017, : 433 - 436
  • [45] An Efficient On-Demand Routing Approach with Directional Flooding for Wireless Mesh Networks
    Kum, Dong-Won
    Le, Anh-Ngoc
    Cho, You-Ze
    Toh, Chai Keono
    Lee, In-Soo
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2010, 12 (01) : 67 - 73
  • [46] Loop-free Greedy Routing in-Ad Hoc or Sensor networks using Muti-Hop Geographic Information
    Yu, Kun
    Bu, Shanyue
    2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 3, 2009, : 328 - 332
  • [47] Self-adaptively randomized loop-free routing algorithm
    Hou, Yue-Xian
    He, Pi-Lian
    Sun, Xue-Jun
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2002, 39 (11):
  • [48] A loop-free routing protocol for large-scale internets using distance vectors
    Murthy, S
    Garcia-Luna-Aceves, JJ
    COMPUTER COMMUNICATIONS, 1998, 21 (02) : 147 - 161
  • [49] Efficient Flooding Using Relay Routing in On-Demand Routing Protocol for Mobile Adhoc Networks
    Shobha, K. R.
    Rajanikanth, K.
    2009 IEEE 9TH MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS (MICC), 2009, : 316 - 321
  • [50] On-demand QoS routing in multihop mobile networks
    Lin, CHR
    IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 1735 - 1744