A new approach to on-demand loop-free multipath routing

Raju, J.; Garcia-Luna-Aceves, J.J.

doi:10.1109/icccn.1999.805568

Cited by 85 publications

(61 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The ROAM [29] routing protocol uses internodal coordination along directed acyclic subgraphs, which is derived from the routers' distance to destination. This operation is referred to as a "diffusing computation".…”

Section: Routing On-demand Acyclic Multi-path (Roam)mentioning

confidence: 99%

A review of routing protocols for mobile ad hoc networks

Abolhasan

Wysocki

Dutkiewicz³

2004

Ad Hoc Networks

989

589

View full text Add to dashboard Cite

The 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the dynamic nature of these networks demands new set of networking strategies to be implemented in order to provide efficient end-to-end communication. This, along with the diverse application of these networks in many different scenarios such as battlefield and disaster recovery, have seen MANETs being researched by many different organisations and institutes. MANETs employ the traditional TCP/IP structure to provide end-to-end communication between nodes. However, due to their mobility and the limited resource in wireless networks, each layer in the TCP/IP model require redefinition or modifications to function efficiently in MANETs. One interesting research area in MANET is routing. Routing in the MANETs is a challenging task and has received a tremendous amount of attention from researches. This has led to development of many different routing protocols for MANETs, and each author of each proposed protocol argues that the strategy proposed provides an improvement over a number of different strategies considered in the literature for a given network scenario. Therefore, it is quite difficult to determine which protocols may perform best under a number of different network scenarios, such as increasing node density and traffic. In this paper, we provide an overview of a wide range of routing protocols proposed in the literature. We also provide a performance comparison of all routing protocols and suggest which protocols may perform best in large networks. AbstractThe 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the

show abstract

Section: Routing On-demand Acyclic Multi-path (Roam)mentioning

confidence: 99%

A review of routing protocols for mobile ad hoc networks

Abolhasan

Wysocki

Dutkiewicz³

2004

Ad Hoc Networks

989

589

View full text Add to dashboard Cite

show abstract

“…Data throughput usually drops significantly when a connection has to go through more than three wireless hops. According to [7] Deployed into multi-hop wireless networks, and high throughput data rate should be achievable for multi-hop TCP connections. TCP transport protocols can perform poorly because of complex interference among neighboring nodes.…”

Section: Protocol For Multi-hop Wireless Ad Hoc Networkmentioning

confidence: 99%

Performance Evaluation of Routing Protocol and Congestion Control Protocol in Wireless Multi-hop Networks

Narain¹,

Patle²,

Kumar³

2010

IJCA

View full text Add to dashboard Cite

Computer networks have long suffered from congestion. Congestion occurs when an increase in the offered load results in a decrease in the effective throughput of the network. The basic cause is that the short term packet arrival rate at some gateway exceeds its service rate. Existing congestion control schemes treat congestion as an individual problem and propose ad hoc solution that are dissatisfied. Wireless multi-hop networks have many potential applications, e.g., a small stand-alone network for group of mobile users (Mobile Ad Hoc Networks), a cost efficient stubnetwork to connect to the Internet (Wireless Mesh Networks), or a self-organized community network connecting houses together (Wireless Community Networks). We approach the problem from a different perspective: In this paper, we selected WXCP, CALC, WCP, WCCP congestion control protocols and conceptual study of DSR, AOMDV routing protocols for multi-hop networks. Subsequently we relax some of the assumptions and generalize the solution in terms of throughput and number of hops.

show abstract

“…The Routing On-demand Acyclic Multi-path (ROAM) [18] protocol limits the effects of flooding by using directed acyclic subgraphs based upon distance between the source and destination for the propagation of a flood. This eliminates the propagation of a flood in a direction along a subgraph if the destination is not reachable along that subgraph.…”

Section: Routing In Ad Hoc Networkmentioning

confidence: 99%

Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks

Lipman

2005

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l

View full text Add to dashboard Cite

This paper presents a number of different route discovery strategies for on-demand routing protocols, which provide more control to each intermediate node make during the route discovery phase to make intelligent forwarding decisions. This is achieved through the idea of selfselection. In self-selecting route discovery each node independently makes Route Request (RREQ) forwarding decisions based upon a selection criterion or by satisfying certain conditions. The nodes which do not satisfy the selection criterion do not rebroadcast the routing packets. We implemented our self-selecting route discovery strategies over AODV using the GloMoSim network simulation package, and compared the performance with existing route discovery strategies used in AODV. Our simulation results show that a significant drop in the number of control packets can be achieved by giving each intermediate node more authority for self-selection during route discovery. Furthermore, a significant increase in throughput is achieved as the number nodes in the network is increased. Disciplines Physical Sciences and Mathematics Publication DetailsThis article was originally published as: Abolhasan, M and Lipman, J, Efficient and highly scalable route discovey for on-demand routing protocols in ad hoc networks, The IEEE Abstract-This paper presents a number of different route discovery strategies for on-demand routing protocols, which provide more control to each intermediate node make during the route discovery phase to make intelligent forwarding decisions. This is achieved through the idea of selfselection. In self-selecting route discovery each node independently makes Route Request (RREQ) forwarding decisions based upon a selection criterion or by satisfying certain conditions. The nodes which do not satisfy the selection criterion do not rebroadcast the routing packets. We implemented our self-selecting route discovery strategies over AODV using the GloMoSim network simulation package, and compared the performance with existing route discovery strategies used in AODV. Our simulation results show that a significant drop in the number of control packets can be achieved by giving each intermediate node more authority for self-selection during route discovery. Furthermore, a significant increase in throughput is achieved as the number nodes in the network is increased.

show abstract

A new approach to on-demand loop-free multipath routing

Cited by 85 publications

References 7 publications

A review of routing protocols for mobile ad hoc networks

A review of routing protocols for mobile ad hoc networks

Performance Evaluation of Routing Protocol and Congestion Control Protocol in Wireless Multi-hop Networks

Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks

Contact Info

Product

Resources

About