Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)

Ogier, Richard G.; Templin, Fred; Lewis, Mark

doi:10.17487/rfc3684

Cited by 426 publications

(235 citation statements)

References 16 publications

Supporting

Mentioning

230

Contrasting

Unclassified

Order By: Relevance

“…However, due to the random and continuous mobility of the network's nodes, such a protocol must periodically perform inspection process using control packets, which presses a continuous overhead on the network bandwidth [7][8][9]. We can easily notice that any sudden increase in the nodes-mobility can cause more frequent need of network topology inspection and thus an extensive amount of overhead [10][11][12]. This problem becomes even worse with the increase of the network size (i.e., nodes-density and network coverage area size), since a huge amount of information will need to be constantly and frequently inspected.…”

Section: Related Workmentioning

confidence: 99%

“…Deterministic protocols require instant network topology information to construct and maintain the routes [4][5][6]. Due to the dynamic changes of network topology in MANETs, however, such a protocol must constantly acquire new information to exactly reflect the network topology up to date, which will trigger a high overhead (especially in presence of high mobility and large number of nodes) and significantly limit its practicability [7][8][9][10][11][12]. Therefore, the available deterministic protocols can carry out the routing process only under a group of restricted constraints on the network coverage area size, nodes-density or mobility.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Probabilistic proactive routing with active route trace-back for MANETs

et al. 2010

View full text Add to dashboard Cite

a b s t r a c tMobile Ad Hoc network (MANET) is a very attractive networking technology for providing flexible communication in an anytime and anywhere fashion. However, MANET is infrastructure-less and highly dynamic, so the design of an efficient routing strategy for reliable end-to-end communication in such a network has been a challenging issue. The available routing protocols and their embedded information retrieval methods for MAMETs work well only for networks with certain limited assumptions of number of nodes, density of nodes and mobility. With the continuous expansion of the MANETs in real applications, it is now imperative to develop a new routing protocol for MAMETs that is more scalable and topology independent. In this paper, we introduce such a routing scheme for MANETs, which works well under a wide range of network topologies, nodes-density, coverage area size and nodes-mobility. The proposed scheme is based on a novel enhancement of the hint-based probabilistic protocol. Instead of broadcasting extensive control packets for network topology information retrieval as that of conventional routing schemes, the proposed scheme carefully reuses the feedback information carried in unicast packets for this purpose without introducing any extra overhead. The efficiency of the proposed scheme is demonstrated through both mathematical analysis and an extensive simulations study.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Probabilistic proactive routing with active route trace-back for MANETs

et al. 2010

View full text Add to dashboard Cite

show abstract

“…Several major features of OLIVE address many important shortcomings of the on-demand routing protocols (DSR [1], AODV [2]) and proactive routing protocols (TBRPF [7], OLSR [8]) that have been proposed for standardization in the IETF working group on mobile ad hoc networks (MANET). Here, we describe some of those features and try to explain whether we can achieve those with the existing routing protocols.…”

Section: G Critique Of Olive With Respect To Other Routing Protocolsmentioning

confidence: 99%

“…We have compared the performance of OLIVE with the on-demand routing protocols (DSR [1], AODV [2]) and proactive routing protocols (TBRPF [7], OLSR [8]) that have been proposed for standardization in the IETF working group on mobile ad hoc networks (MANET). The performance evaluation has been done in the ns2 simulation platform [9], using the code of DSR, AODV, and TBRPF provided with the simulator.…”

Section: Performance Comparisonmentioning

confidence: 99%

See 1 more Smart Citation

On-demand loop-free routing with link vectors

Garcia-Luna-Aceves

Roy

2005

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad hoc networks based on linkstate information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively for each destination in the form of complete paths, and each node creates a labeled source graph based on the paths advertised by its neighbors. A node originates a broadcast route request (RREQ) to obtain a route for a destination for which a complete path does not exist in its source graph. When the original path breaks, a node can select an alternative path based on information reported by neighbors, and a node can send a unicast RREQ to verify that the route is still active. A node that cannot find any alternate path to a destination sends route errors reliably to those neighbors that were using it as next hop to the destination. Using simulation experiments in ns2, OLIVE is shown to outperform dynamic source routing, ad hoc on-demand distance vector, optimized link-state routing protocol, and topology broadcast based on reverse-path forwarding, in terms of control overhead, throughput, and average network delay, while maintaining loop-free routing with no need for source routes.Index Terms-Ad hoc networks, on-demand, link-state routing, loop-freedom.

show abstract

Ad Hoc and Sensor Networks

Kumar

Wang

2009

Wiley Encyclopedia of Computer Science and Engineering

View full text Add to dashboard Cite

Although the Internet has penetrated virtually every aspect of our lives, many scenarios exist where an existing network infrastructure is not available. For example, a hurricane may destroy buildings where the critical networking equipment is housed or may cut the power supply to the equipment. In such scenarios, it is extremely important for people living in the disaster area, as well as relief workers, to communicate with each other using whatever networking devices they have, without relying on any existing infrastructure. Such an infrastructureless network is called an ad hoc network , more specifically, “a network that is setup, literally, for a specific purpose, to meet a quickly appearing communication need” (1). In addition to supporting human communication, an ad hoc network may be used for other purposes, such as monitoring the physical environment and detecting events (as we will explain later). An ad hoc network can be wired or wireless, but more research effort has been focused on wireless ad hoc networks as they are easier to establish and do not restrict the mobility of users. Major research issues in wireless ad hoc networks include, but are not limited to, how to ensure connectivity among nodes in the face of unplanned deployment, controlled or uncontrolled mobility, and nodes leaving/joining the network (potentially as a result of failures/repairs); how to access efficiently the shared wireless medium in a distributed fashion; how to route packets to their destinations in the presence of topology dynamics (because of mobility and failures) and sometimes intermittent connectivity; and how to meet the quality of service (QoS) requirements with distributed resource management. These issues are made even more challenging by the limited resource availability that is typical of a wireless ad hoc network.

show abstract

Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)

Abstract: Status of this Memo This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited.

Cited by 426 publications

References 16 publications

Probabilistic proactive routing with active route trace-back for MANETs

Probabilistic proactive routing with active route trace-back for MANETs

On-demand loop-free routing with link vectors

Ad Hoc and Sensor Networks

Contact Info

Product

Resources

About