Using directionality in mobile routing (original) (raw)
Related papers
Rendezvous-based directional routing: A performance analysis
2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07), 2007
The increased usage of directional methods of communications to improve medium reuse, network capacity, and bandwidth has prompted research into leveraging directionality in every layer of the network stack. Recently, there has been work on bringing the apparent capacity gains on layer 2 using directional communications methods to layer 3 by using directionality to route packets scalably in unstructured, at networks. In their protocol, Orthogonal Rendezvous Routing Protocol, Cheng et al. [1] showed that by drawing two lines orthogonal to each other at each node, it is possible to provide over 98% connectivity while maintaining only O(N 3/2 ) evenly distributed states at a cost of only 1.2 path stretch. In this paper, we seek to provide more in-depth performance analysis by tuning additional factors such as the number of directions to transmit, the number of interfaces per node, among others, to understand its affect on varying network densities, topologies, connections, and traf c patterns. We show that by sending packets out in more directions, increased connectivity, smaller average path length, better goodput results only up to a point as compared to other routing protocols. The trade-off, however, is added state information maintained at each node and additional control packets received. We also show that the addition of more interfaces generally yields better packet delivery success, average path length, and goodput. 1 I. INTRODUCTION A recent trend in wireless communications has been the desire to leverage directional forms of communications (e.g. directional smart antennas [13], Free-Space-Optical transceivers [26], and sector antennas) for more ef cient medium reuse, increased scalability, enhanced security and potential for higher achievable bandwidth. Previous work in directional antennas focused heavily on measuring network capacity and medium reuse [13] [14]. In these works, it was shown that with proper tuning, capacity improvements using directional over omnidirectional antennas are dramatic -ranging from a factor of 2π √ αβ for planned networks to a factor of 4π 2 √ αβ for random networks 1 An extended abstract of this paper is to appear in LANMAN 2007 [2].
“Direction” Forward Routing for Highly Mobile Ad Hoc Networks
2006
Popular ad hoc routing protocols such as DSDV and AODV use "predecessor" based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the routing table entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward table problem, in this paper we propose a novel packet forwarding scheme called "direction" forwarding (DFR). When an update is received, a node records the "geographical direction" to where the update came from. When predecessor forwarding fails, the packet is forwarded to the "most promising" neighbor in the recorded direction. If the network is sufficiently dense and the routing algorithm includes periodic refresh from destination, direction forwarding will recover from most "predecessor" failures due to motion. We evaluate DFR in a LANMAR routing scenario where the direction to each Landmark is periodically refreshed. Through simulation we show that DFR considerately enhances LANMAR performance in large, mobile network scenarios.
An Efficient Directional Routing Protocol for Mobile Ad Hoc Network
2013
This report addresses the issue of routing in mobile ad hoc networks (MANETs) using directional antennas. Existing directional routing schemes either assume a complete network topology or simply use omni-directional routing schemes to forward packets in underlying directional environment. In this report a Directional Routing Protocol (DRP) for MANETs is proposed. DRP is an on-demand directional routing protocol which assumes a cross layer interaction between routing and MAC layer and is inspired by Dynamic Source Routing (DSR) protocol. The main features of DRP include an efficient route discovery mechanism, establishment and maintenance of directional routing and directional neighbor tables and novel directional route recovery mechanisms. Implementation of DRP on top of MDA, a MAC protocol for directional antennas and have compared its performance with the DSR protocol over both omni-directional and directional antenna models. DRP considerably improves the packet delivery ratio, de...
“Direction” Forwarding for Highly Mobile, Large Scale Ad Hoc Networks
IFIP International Federation for Information Processing, 2006
Popular ad hoc routing protocols such as DSDV and AODV use "predecessor" based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the routing table entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward table problem, in this paper we propose a novel packet forwarding scheme called "direction" forwarding (DFR). When an update is received, a node records the "geographical direction" to where the update came from. When predecessor forwarding fails, the packet is forwarded to the "most promising" neighbor in the recorded direction. If the network is sufficiently dense and the routing algorithm includes periodic refresh from destination, direction forwarding will recover from most "predecessor" failures due to motion. We evaluate DFR in a LANMAR routing scenario where the direction to each Landmark is periodically refreshed. Through simulation we show that DFR considerately enhances LANMAR performance in large, mobile network scenarios.
3D-RP: A DHT-Based Routing Protocol for MANETs
In the last few years, distributed hash table (DHT) has come forth as a useful addition to the design and specification of spontaneous, self-organizing networks. Researchers have exploited its advantages by implementing it at the network layer in order to design scalable routing protocols for mobile ad hoc networks. We identify two correlated issues that must be considered when designing DHT-based routing protocol, namely the mismatch problem and resilience of the logical network, which degrades the efficiency of the DHT-based routing protocols. To address these problems, we propose a DHT-based routing protocol that exploits a 3D logical space that takes into account the physical intra-neighbor relationships of a node and exploits a 3D structure to interpret that relationship. In the proposed scheme, each node runs a distributed algorithm to obtain a consecutive logical identifier that reflects its physical proximity in the 3D logical space. Moreover, the protocol utilizes the 3D-structure to maintain multi-paths to a destination node in order to address the scalability problem and gain resilience against a node/link failure. Simulation results show that the proposed approach outperforms the existing DHT-based routing protocol in terms routing overhead, end-to-end delay, path-stretch values and packet-delivery ratio.
Directional Routing over Orthogonal Lines: A Performance Evaluation Invited Paper
Routing in wireless ad-hoc networks have had to grapple with the twin requirements of connectivity and scalability. Recently, [1] has attempted to mitigate this issue by using directional communication methods to find intersections between source-rendezvous and rendezvous-destination paths, providing effective routing in unstructured, flat networks.
MORHE: A transparent multi-level routing scheme for ad hoc networks
2006
This paper presents a transparent multi-level routing scheme, named MORHE, that improves the scalability of the OLSR protocol by exploiting the heterogeneous nature of nodes in the network. While ad hoc networks have been an active research topic over the past few years, the majority of the studies have focused on the homogeneous nature of the network. In our work we try to take a different approach by focusing on scenarios where ad hoc technology can be applied, but where we also find nodes in the network with varying capacity. The MORHE protocol makes use of nodes which have a large capacity (e.g. more energy, larger transmission range) to build something that could best be described as an ad hoc infrastructure. Nodes are grouped in clusters that need to be interconnected by specific nodes. This implies that a node no longer needs to know the entire network topology as is the case of the OLSR protocol, but only needs to maintain routes to the nodes inside its own cluster and to the other clusters. Using this approach the signalling overhead -which is one of the main reasons why OLSR is not scalable -is greatly reduced. We also introduce a simple mobility management scheme to allow nodes to roam the different ad hoc clusters.
2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540)
Ad-Hoc Networks consist of peer-to-peer communicating nodes that are highly mobile. As such, an ad-hoc network lacks infrastructure and the topology of the network changes dynamically. The task of routing data from a source to a destination in such a network is challenging. Several routing protocols have been proposed for wireless ad-hoc networks. Most of these protocols, however, presuppose the presence of bi-directional links between the nodes in the network. In reality the ad-hoc network may consist of heterogeneous nodes with different power capabilities and hence, different transmission ranges. When this is the case, a given node might be able to receive the transmission of another given node but might not be able to successfully transmit to the latter. Thus, unidirectional links are formed. Most of the current routing protocols are unsuitable for deployment when such unidirectional links are present. We consider a routing protocol called the zone routing protocol (ZRP) that has been proposed for wireless ad-hoc networks with bi-directional links. The zone routing protocol employs a hybrid proactive (table driven) and reactive (ondemand) methodology to provide scalable routing in the ad-hoc network. However, in the presence of unidirectional links some routes remain undiscovered if ZRP is used. We propose extensions to ZRP to support its deployment when unidirectional links are present. In particular, we propose a query enhancement mechanism that recursively builds partial routes to a destination. Simulation results show that even at a high mobility of 20m/s, the queries resulting due to the enhancement mechanism result in the computation of valid routes more than 80% of the time. These results are valid even when a large number (40% of nodes have half the transmission range as that of the remaining nodes) of unidirectional links are present in the network.
Mobility and Direction Aware Ad-hoc on Demand Distance Vector Routing Protocol
Procedia Computer Science, 2016
Mobile Ad hoc Network (MANET) is a rapidly growing wireless technology with wide range of applications. MANET routing faces challenges due to their Ad hoc nature, and many routing algorithms have been proposed. Reactive routing protocols are preferred due to less control overhead and scalability, but they suffer from frequent link breakages due to the high-mobility of the nodes. To reduce the link breakages and get a stable route, a new reactive routing protocol is proposed that is tree-based mobilityaware. The proposed Mobility and Direction Aware Ad-hoc On Demand Distance Vector routing protocol (MDA-AODV) aims to handle the mobility and direction factors in ad-hoc networks. MDA-AODV guides the route discovery and route reply depending on the speed of the participating nodes and their directions. Qualnet simulator version 7.1, using two offered load simulations (packet-rate and CBR connections), was used to investigate the effect and the advantages of MDA-AODV over AODV protocol. The simulation results show that the proposed scheme decreases control overhead by (4.6 ÷ 5.2 %). It also accomplishes (37 ÷ 41 %) lower route losses compared to AODV. The delivery ratio is increased by (29 ÷ 47 %). The consumed energy and end-to-end delay of the proposed protocol is also compared to that of AODV.