Neighborhood aware source routing

Spohn, Marco Aurélio; Garcia-Luna-Aceves, J.J.

doi:10.1145/501416.501419

Cited by 37 publications

(19 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Neighborhood-aware Source Routing (NSR) protocol [32], each node has a partial topology that covers in addition to the 2-hop neighborhood, the links in requested paths to destinations. Link state information is maintained by broadcasting periodic HELLO messages.…”

Section: Related Workmentioning

confidence: 99%

Probabilistic Routing Using Queuing Theory for Manets

Khandelwal¹,

Prasanna²,

Hota

2011

IJWMN

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Probabilistic Routing Using Queuing Theory for Manets

Khandelwal¹,

Prasanna²,

Hota

2011

IJWMN

View full text Add to dashboard Cite

show abstract

“…Periodic "Hello" messages, which contain a list of one-hop neighbors and destinations for which it is active are broadcasted by all nodes in the network and this is used to provide two-hop neighborhood information as in the Neighborhood Aware Source Routing (NSR) [16]. Also, once a node finds the destination once it uses the past location information to guide future searches.…”

Section: Learningmentioning

confidence: 99%

OWL: Towards scalable routing in MANETs using depth-first search on demand

Dabideen

Garcia-Luna-Aceves

2009

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems

View full text Add to dashboard Cite

Abstract-Most routing protocols designed for MANETs to date employ breadth-first search (BFS), usually in the form of flooding of route requests or updates, to establish and maintain routes between source-destination pairs. This usually incurs significant overhead, which degrades the performance of the network. In this paper we present a new paradigm for routing protocols operating in MANETs, such that flooding is not required and paths from sources to destinations can be established on demand with time complexity comparable to that of flooding but with significantly less overhead. We introduce the concept of ordered walk as a depth-first based search (DFS) that does not rely on geographical or virtual coordinate information and is more efficient than mere random walks. Using the Ordered Walk Search Algorithm (OSA), we demonstrate the potential of using DFS as the building block of the signaling of MANET routing protocols. We introduce the OWL protocol (ordered walk with learning) as an example of efficient DFS-based routing in MANETs, and use simulation experiments to compare its performance against that of three well-known MANET routing protocols based on BFS (OLSR, DSR and AODV). The results show that OWL can achieve comparable these protocols while incurring up to ten times less overhead than AODV.

show abstract

“…Neighborhood Aware Source Routing (NSR) [8] is proposed to improve the capability of backup routing in DSR. In NSR, both the nodes in the primary route and their 1-hop neighbors should broadcast their 1-hop link-state information.…”

Section: Related Workmentioning

confidence: 99%

“…Data packets are delivered along the primary route rather than distributed them among the backup routes. In general, mobile nodes in the primary route should exchange the routing information with their neighbor nodes [8], [9]. Therefore, the scope of backup path is limited to the vicinity and the length of back path is also restricted.…”

Section: Introductionmentioning

confidence: 99%

Dynamic AODV Backup Routing in Dense Mobile Ad-Hoc Networks

Chen

Lee

2004

Wireless on-Demand Network Systems

View full text Add to dashboard Cite

Abstract. The frequent change of network topology in mobile ad-hoc network leads to the stability and reliability problems of routing. Many routing schemes such as multi-path routing and backup path routing are proposed to increase the link reliability. Multi-path routing protocols usually concentrate on load balancing or disjoint routing. However, the problem of packet loss caused by re-routing from the source to the destination is ignored. In this paper, we propose the Dynamic AODV Backup Routing Protocol (DABR) to enhance the Ad hoc on-Demand Distance Vector (AODV) routing in dense mobile ad-hoc networks. The DABR follows the route discovery mechanism of AODV and dynamically calculates the backup routes. Upon the failure of primary route, data packets can be salvaged by redirecting them to the backup routes. The simulation results show that the link reliability of DABR is higher than the conventional AODV while the overhead is controlled.

show abstract

Neighborhood aware source routing

Cited by 37 publications

References 0 publications

Probabilistic Routing Using Queuing Theory for Manets

Probabilistic Routing Using Queuing Theory for Manets

OWL: Towards scalable routing in MANETs using depth-first search on demand

Dynamic AODV Backup Routing in Dense Mobile Ad-Hoc Networks

Contact Info

Product

Resources

About