Hazy Sighted Link State Routing Protocol

About: Hazy Sighted Link State Routing Protocol is a research topic. Over the lifetime, 6936 publications have been published within this topic receiving 169377 citations. The topic is also known as: HSLS.

Location information services in mobile ad hoc networks

Abstract: In previous years, many location based routing protocols have been developed for ad hoc networks. Some of these protocols assume a location service exists which provides location information on all the mobile nodes in the network. We evaluate three location service alternatives. One is a reactive protocol; the other two are proactive protocols. Of the proactive protocols, one sends location tables to neighbors and the other sends location information to all nodes. In our evaluation, one proactive protocol proved to have the best performance overall. Thus, we also evaluate the main input parameter associated with this protocol for optimal performance.

SDAR: a secure distributed anonymous routing protocol for wireless and mobile ad hoc networks

Abstract: Providing security and privacy in mobile ad hoc networks has been a major issue over the last few years. Most research work has so far focused on providing security for routing and data content, but nothing has been done in regard to providing privacy and anonymity over these networks. We propose a novel distributed routing protocol which guarantees security, anonymity and high reliability of the established route in a hostile environment, such as an ad hoc wireless network, by encrypting the routing packet header and abstaining from using unreliable intermediate nodes. The major objective of our protocol is to allow trustworthy intermediate nodes to participate in the path construction protocol without jeopardizing the anonymity of the communicating nodes. We describe our protocol, SDAR (secure distributed anonymous routing), and provide its proof of correctness.

Mobile agents based routing protocol for mobile ad hoc networks

Abstract: A novel routing scheme for mobile ad hoc networks (MANETs), which combines the on-demand routing capability of Ad Hoc On-Demand Distance Vector (AODV) routing protocol with a distributed topology discovery mechanism using ant-like mobile agents is proposed in this paper. The proposed hybrid protocol reduces route discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the one side the proactive routing protocols in MANETs like Destination Sequenced Distance Vector (DSDV) require to know, the topology of the entire network. Hence they are not suitable for highly dynamic networks such as MANETs, since the topology update information needs to be propagated frequently throughout the network. These frequent broadcasts limit the available network capacity for actual data communication. On the other hand, on-demand, reactive routing schemes like AODV and Dynamic Source Routing (DSR), require the actual transmission of the data to be delayed until the route is discovered. Due to this long delay a pure reactive routing protocol may not be applicable for real-time data and multimedia communication. Through extensive simulations in this paper it is proved that the proposed Ant-AODV hybrid routing technique, is able to achieve reduced end-to-end delay compared to conventional ant-based and AODV routing protocols.

A heterogeneous routing protocol based on a new stable clustering scheme

Abstract: A mobile ad hoc network (MANET) is usually assumed to be homogeneous, where each mobile node shares the same radio capacity. However, a homogeneous ad hoc network suffers from poor scalability. Research has demonstrated its performance bottleneck both theoretically and through simulation experiments. Building a physically hierarchical ad hoc network is a very promising way to achieve scalability. Routing is critical to operate such a hierarchical structure efficiently. Previous research has been solely focusing on extending popular routing schemes developed for the homogeneous ad hoc network. We propose a new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network. We also present a new active clustering scheme to help build a stable hierarchical structure, which is fundamental to heterogeneous routing protocols. Simulation results using GloMoSim show that our routing and clustering scheme gives good performance. The results also provide some insight into new possible designs of routing protocols and mobile network architectures for MANETs when large scale is desired.

Adaptive routing method for a dynamic network

Abstract: A routing system and method utilizes a highly-adaptive, loop-free, distributed routing algorithm for dynamic networks. The basic, underlying method is neither a distance-vector nor a link-state method; the invention employs an algorithm which is one of a family of algorithms which are called “link reversal” algorithms. The protocol's reaction is structured as a sequence of diffusing computations, each computation consisting of a sequence of directed link reversals. This behavior is achieved, in part, through the use of a “physical or logical clock” to establish the temporal order of topological change events. A key concept in the protocol's design; is an attempt to decouple (to the greatest extent possible) the generation of far-reaching control message propagation from the dynamics of the network topology. These design characteristics make the protocol highly-adaptive, efficient and scalable-being best-suited for use in large, dynamic, bandwidth-constrained networks. In such networks, the protocol's reaction to link failures typically involves only a single pass of the distributed algorithm. The results of a simulation study indicate that for a given available bandwidth, as either the size of the network or the rate of topological changes increases, the performance the invention eventually exceeds that of ILS.