A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing

Park, V.D.; Corson, M. Scott

doi:10.1109/iscc.1998.702600

Cited by 80 publications

(37 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The relative performance of TORA was compared extensively with Ideal Link-State (ILS) routing and pure flooding via simulation using the Optimized Network Engineering Tool (OPNET) [PC98]. Only a cursory overview of the study and a summary of the results are presented herein.…”

Section: Performance Resultsmentioning

confidence: 99%

“…This behavior makes it highly adaptive and well-suited for a dynamic mobile network with limited bandwidth. In this section, we first present the design philosophy that shaped the development of TORA, followed by a conceptual description of the protocol and some highlights of recent simulation results [PC98]. Design Philosophy The design and development of a routing protocol that is better suited for operation in a MANET is a considerable challenge.…”

Section: The Temporally-ordered Routingmentioning

confidence: 99%

See 1 more Smart Citation

Applicability of the Temporally-Ordered Routing Algorithm for Use in Mobile Tactical Networks

Park¹,

Macker²,

Corson³

1998

View full text Add to dashboard Cite

In this paper we present a conceptual overview of the INTRODUCTIONInternet Protocol (IP) networking technology is primarily based on a hardwired infrastructure. Since the interconnections between the routers in a conventional IP network are hardwired, the physical topology of the network is relatively static. Thus, traditional IP routing protocols have been designed for operation in a quasi-static networking environment with hardwired links. These routing protocols are typically based on shortest-path algorithms and seek to provide least-cost paths with respect to a particular cost

show abstract

Section: Performance Resultsmentioning

confidence: 99%

Section: The Temporally-ordered Routingmentioning

confidence: 99%

Applicability of the Temporally-Ordered Routing Algorithm for Use in Mobile Tactical Networks

Park¹,

Macker²,

Corson³

1998

View full text Add to dashboard Cite

show abstract

“…In [2] Park et.al.compared ideal link-state routing protocol with TORA routing protocol. In their comparison, they proved that TORA outperforms ideal link-state.…”

Section: Related Workmentioning

confidence: 99%

Empirical Performance Evaluation of Reactive Routing Protocols for Wireless Ad hoc Networks in Adversarial Environment

Babu¹,

Nagaraju²,

Prasad³

2016

IJCNIS

View full text Add to dashboard Cite

Abstract-Researchers have already shown the way, how to improve and compare the existing MANET routing protocols that help us to understand the basic feature and functionality of the various routing protocols. However, while these routing protocols have been proposed from different research groups in the literature, which shows the existing routing protocols, are not consistent to common framework to evaluate its performance. Moreover, these protocols are vulnerable to many collaborative attacks, due to its cooperative nature of routing algorithms. Hence, it is difficult for one to choose a proper routing protocol for a given application; therefore, we initially study and review to compare the different existing routing protocols in adversarial environment with varying traffic and mobility simulation scenarios. This paper addresses the comparison of various reactive routing protocols in adversarial environment. To achieve this, we had investigated with widely used NS-2 simulators for fair comparisons of different routing protocols. Furthermore, we also develop a collaborative adversary model for these existing routing protocols that can interfere with communications to subvert the normal operation of the network. Specifically, Our extensive simulation results shows the relative quantitative analysis for comparing the performance of reactive routing protocols such as AODV, DSR under adversarial environments with varying traffic and mobility simulation scenarios. Moreover, the performance of these protocols is measured with the various metrics such as throughput, end-to-end delay, packet delivery ratio, and routing overhead.

show abstract

“…Various unicast routing algorithms have been proposed in different studies like in [4], [5], [6] and [7]. Because of its scalability and robustness many researchers like Lenders et al [8] and V. Park et al [9] presented the field based routing algorithms. Recently, Baumann et al [2] presented a field based routing algorithm for routing the packets from the mesh nodes to the gateway in anycast fashion.…”

Section: Related Workmentioning

confidence: 99%

Modeling and Analyzing Anycast and Geocast Routing in Wireless Mesh Networks

Hadi¹,

Ahmed²,

Minhas³

et al. 2016

ijacsa

View full text Add to dashboard Cite

Abstract-Wireless technology has become an essential part of this era's human life and has the capability of connecting virtually to any place within the universe. A mesh network is a self healing wireless network, built through a number of distributed and redundant nodes to support variety of applications and provide reliability. Similarly, anycasting is an important service that might be used for a variety of applications. In this paper we have studied anycast routing in the wireless mesh networks and the anycast traffic from the gateway to the mesh network having multiple anycast groups. We have also studied the geocast traffic in which the packets reach to the group head via unicast traffic and then are broadcasted inside the group. Moreover, we have studied the intergroup communication between different anycast groups. The review of the related literature shows that no one has considered anycasting and geocasting from gateway to the mesh network while considering the multiple anycast groups and intergroup communication. The network is modeled, simulated and analyzed for its various parameters using OMNET++ simulator.

show abstract

A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing

Cited by 80 publications

References 11 publications

Applicability of the Temporally-Ordered Routing Algorithm for Use in Mobile Tactical Networks

Applicability of the Temporally-Ordered Routing Algorithm for Use in Mobile Tactical Networks

Empirical Performance Evaluation of Reactive Routing Protocols for Wireless Ad hoc Networks in Adversarial Environment

Modeling and Analyzing Anycast and Geocast Routing in Wireless Mesh Networks

Contact Info

Product

Resources

About