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 条
  • [21] A loop-free shortest-path routing algorithm for dynamic networks
    D'Angelo, Gianlorenzo
    D'Emidio, Mattia
    Frigioni, Daniele
    THEORETICAL COMPUTER SCIENCE, 2014, 516 : 1 - 19
  • [22] A New Loop-Free Proactive Source Routing Scheme for Opportunistic Data Forwarding in Wireless Networks
    Wang, Zehua
    Chen, Yuanzhu
    Li, Cheng
    IEEE COMMUNICATIONS LETTERS, 2011, 15 (11) : 1184 - 1186
  • [23] Loop-free multipath routing using generalized diffusing computations
    Zaumen, WT
    Garcia-Luna-Aceves, JJ
    IEEE INFOCOM '98 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS. 1-3: GATEWAY TO THE 21ST CENTURY, 1998, : 1408 - 1417
  • [24] Making on-demand routing protocols based on destination sequence numbers robust
    Rangarajan, H
    Garcia-Luna-Aceves, JJ
    ICC 2005: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, 2005, : 3068 - 3072
  • [25] Fast loop-free transition of routing protocols
    Bekono, Nina Pelagie
    El Rachkidy, Nancy
    Guitton, Alexandre
    2016 IEEE 84TH VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), 2016,
  • [26] MINIMAL ORDER LOOP-FREE ROUTING STRATEGY
    SHIN, KG
    CHEN, MS
    IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (07) : 870 - 881
  • [27] MPATH: a loop-free multipath routing algorithm
    Vutukury, S
    Garcia-Luna-Aceves, JJ
    MICROPROCESSORS AND MICROSYSTEMS, 2000, 24 (06) : 319 - 327
  • [28] A protocol for scalable loop-free multicast routing
    Parsa, M
    GarciaLunaAceves, JJ
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1997, 15 (03) : 316 - 331
  • [29] Loop-Free Integrated Forwarding and Routing with Gradients
    Garcia-Luna-Aceves, J. J.
    Mathewson, James
    Ramanathan, Ram
    Thapa, Bishal
    2018 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM 2018), 2018, : 255 - 260
  • [30] Loop-free link-state routing
    Fransson, Pierre
    Carr-Motyckova, Lenka
    PROCEEDINGS - 16TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, VOLS 1-3, 2007, : 905 - 911