Providing a bidirectional abstraction for unidirectional ad hoc networks

Ramasubramanian, Venugopalan; Chandra, Ranveer; Mossé, Daniel

doi:10.1109/infcom.2002.1019376

Cited by 76 publications

(45 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [5], Ramasubramanian et al proposed sub routing layer (SRL).It is a framework for providing the reverse path for unidirectional links. Reverse Bellman Ford Algorithm is used to find the reverse path when unidirectional link is present.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Destination Sequenced Distance Vector for Mobility based Asymmetric Networks

Girdhar¹,

Khatri²,

Sharma³

2017

IJCA

View full text Add to dashboard Cite

The mobile ad hoc network technology is a wireless interconnection of mobile devices and has dynamic topology. It does not have any fixed network infrastructure and the disparity in the transmission range of different nodes can result into the unidirectional asymmetric links in the network. It has adverse impacts on the overall performance of most of the routing protocols which consider all the wireless links in the network as bidirectional. Hence, a new model is proposed in this paper. It uses the routing table to store the information about the outneighbours and in-neighbours for a node which helps to determine the shortest path to the destination node as well as the reverse path from the unidirectional out-neighbour to the node itself. The paper investigates the existing methods and concludes that the new U-DSDV works efficiently in unidirectional links.

show abstract

Section: Related Workmentioning

confidence: 99%

An Efficient Destination Sequenced Distance Vector for Mobility based Asymmetric Networks

Girdhar¹,

Khatri²,

Sharma³

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…Sub-Layer schemes have been proposed to abstract unidirectional links into bidirectional links [72].…”

Section: Directional Linksmentioning

confidence: 99%

Termite: A swarm intelligent routing algorithm for mobilewireless Ad-Hoc networks

Wicker

Roth

2006

Studies in Computational Intelligence

View full text Add to dashboard Cite

A biologically inspired algorithm is presented to route messages in mobile wireless ad-hoc networks. Such computer networks are primarily characterized by their quickly changing topologies due to frequent node mobility. The principles of swarm intelligence are used to define a probabilistic algorithm for which routing through paths of maximum utility is an emergent property. This adaptive algorithm, dubbed Termite, uses stigmergy to reduce the amount of control traffic needed to maintain performance. Strong routing robustness is achieved through the use of multiple paths; each packet is routed randomly and independently. Once the basic operation of Termite is verified, alternative metric estimation techniques are tested via simulation. Optimal system parameters are selected by testing over orders of magnitude. A simple analytical model is built in order to explain the simulation results. The model also used to propose two heuristics for determining the optimal pheromone decay rate. All of the enhancements to Termite, now known as ReTermite, are consolidated and tested against Ad-hoc On-demand Distance Vector (AODV), a leading ad-hoc routing algorithm. ReTermite is shown to be superior in many primary metrics and the reasons for this explained. Previous heuristic models are also compared to simulation results.

show abstract

“…There has been recent attention on routing in ad hoc networks with unidirectional links [2,24,27]. These schemes however, rely on proactive routing mechanisms where each node periodically exchanges link information for route maintenance.…”

Section: Related Workmentioning

confidence: 99%

Ad Hoc Routing with Early Unidirectionality Detection and Avoidance

Lee

2004

Personal Wireless Communications

View full text Add to dashboard Cite

Abstract. This paper is motivated by the observation that current research in ad hoc networks mostly assumes a physically flat network architecture with the nodes having homogeneous characteristics, roles, and networking-and processingcapabilities (e.g., network resources, computing power, and transmission power). In real-world ad hoc networks however, node heterogeneity is inherent. New mechanisms at the network layer are required for effective and efficient utilization of such heterogeneous networks. We discuss the issues and challenges for routing protocol design in heterogeneous ad hoc networks, and focus on the problem of quickly detecting and avoiding unidirectional links. We propose a routing framework called Early Unidirectionality Detection and Avoidance (EUDA) that utilizes geographical distance and path loss between the nodes for fast detection of asymmetric and unidirectional routes. We evaluate our scheme through ns-2 simulation and compare it with existing approaches. Our results demonstrate that our techniques work well in these realistic, heterogeneous ad hoc networking environments with unidirectional links.

show abstract

Providing a bidirectional abstraction for unidirectional ad hoc networks

Cited by 76 publications

References 9 publications

An Efficient Destination Sequenced Distance Vector for Mobility based Asymmetric Networks

An Efficient Destination Sequenced Distance Vector for Mobility based Asymmetric Networks

Termite: A swarm intelligent routing algorithm for mobilewireless Ad-Hoc networks

Ad Hoc Routing with Early Unidirectionality Detection and Avoidance

Contact Info

Product

Resources

About