Making link-state routing scale for ad hoc networks

@inproceedings{Santivanez2001MakingLR,
  title={Making link-state routing scale for ad hoc networks},
  author={Cesar A. Santivanez and Ram Ramanathan and Ioannis Stavrakakis},
  booktitle={MobiHoc '01},
  year={2001}
}
In this paper, we introduce a class of approaches that attempt to scale link-state routing by limiting the scope of link state update dissemination in space and over time. We present the first fundamental analysis of this generic class, which we call "Fuzzy Sighted Link State routing". Using a novel perspective on the "overhead"of a protocol that includes not only the overhead due to control messages but also due to route sub-optimality, we formulate an analytical model whose solution… 

A performance study of the HSLS routing algorithm for ad hoc networks

TLDR
This work proposes a scheme that augments the already good characteristics of the hazy sighted link state (HSLS) protocol, a special case of the FSLS protocol family, with a significant reduction of routing packets transmitted.

Efficient Topology Discovery for Multihop Wireless Sensor Networks

TLDR
A new topology discovery protocol based on the link state approach that uses node clustering and exploits bi-directional links in order to reduce this overhead of periodic routing updates in proactive routing protocols.

Analysis and overview of flooding attack in optimized link state routing protocol

TLDR
This study first goal is to improve the performance of topology information flooding in OLSR by introducing network coding techniques, which leads to a decrease of signaling overhead.

Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation

  • Di WangA. Abouzeid
  • Computer Science
    IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
  • 2008
TLDR
An information-theoretic formulation is used for characterizing the minimum overhead of maintaining link state information across a mobile ad hoc network, and it is shown that no link state routing protocol can achieve a delivery error ratio smaller than this threshold.

Routing Overhead Minimization in Large-Scale Wireless Mesh Networks

TLDR
Both theoretical analysis and simulation demonstrate that THU-OLSR effectively reduces the routing overhead and gains a better performance than other routing protocols in large-scale WMNs with hybrid mobility.

Performance Evaluation of Switching between Routing Protocols in Mobile Ad Hoc Networks

TLDR
It seems unlikely that there will ever be a ‘one-size-fits-all’ solution to the ad-hoc routing problem, and numerous variants and hybrids of these existing protocols continue to be reported in literature.

On the scalability of ad hoc routing protocols

TLDR
HSLS is an scalable, easy-to-implement, alternative to hierarchical approaches for large ad hoc networks, and provides deeper understanding of the limits and trade-offs inherent in mobile ad hoc network routing.

Scalable Landmark Routing and Address Lookup for Multi-hop Wireless Networks

TLDR
A set of modifications to the Landmark address lookup service to make it more scalable is proposed and a simulation evaluation of the resulting system, L, shows that the per-node bandwidth requirement of L grows very slowly as the number of nodes in the network increases.

Analysis of Packet Dropping Algorithm in Optimized Link State Routing Protocol (OLSR) in MANET

TLDR
This concentrate first objective is to enhance the execution of topology data flooding in OLSR by presenting system coding methods, which prompts a reduction of flagging overhead.

Scalability features of the WNaN routing protocol

  • David Wiggins
  • Computer Science
    2011 - MILCOM 2011 Military Communications Conference
  • 2011
TLDR
This paper addresses scalability of the network from the routing control traffic point of view by starting from a basic version of an existing mobile ad-hoc network (MANET) proactive link-state routing protocol.
...

References

SHOWING 1-10 OF 25 REFERENCES

Source-tree routing in wireless networks

TLDR
Simulation results show that STAR is an order of magnitude more efficient than any topology-broadcast protocol, and four times moreefficient than ALP, which was the most efficient table-driven routing protocol based on partial link-state information reported to date.

Ad-hoc on-demand distance vector routing

  • C. PerkinsE. Belding-Royer
  • Computer Science
    Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
  • 1999
TLDR
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.

A distance routing effect algorithm for mobility (DREAM)

TLDR
A new routing protocol for ad hoc networks built around two novel observations, one of triggering the sending of location updates by the moving nodes autonomously, based on a node's mobility rate, and the other of minting the overhead used for maintaining routes using the two new principlw of update message frequency and distance.

Dynamic Source Routing in Ad Hoc Wireless Networks

TLDR
This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.

A mobility-based framework for adaptive clustering in wireless ad hoc networks

TLDR
A novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded is presented, which supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when Mobility rates are high.

Scalable routing strategies for ad hoc wireless networks

TLDR
A large population of mobile stations that are interconnected by a multihop wireless network is considered, with the need to support multimedia communications, with low latency requirements for interactive traffic and quality-of-service (QoS) support for real-time streams (voice/video).

The performance of query control schemes for the zone routing protocol

TLDR
This paper studies the performance of route query control mechanisms for the recently proposed Zone Routing Protocol (ZRP) for ad-hoc networks and demonstrates how certain combinations of these techniques can be applied to single channel or multiple channel ad-Hoc networks to improve both the delay and control traffic performance of the ZRP.

Overhead in Mobile Ad-hoc Network Protocols

TLDR
A survey of protocol overheads in mobile ad-hoc networks is proposed and an analysis and simulations are proposed to estimate overhead due to non-optimality of the routes constructed by some protocols.

Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks

TLDR
The authors propose a computationally simple approximate expression to provide a unified metric to represent the effective bandwidth used by connections and the corresponding effective load of network links, which can then be used for efficient bandwidth management, routing, and call control procedures aimed at optimizing network usage.

Hierarchically‐organized, multihop mobile wireless networks for quality‐of‐service support

TLDR
This paper describes three key components of the MMWN system: the clustering procedures for defining a virtual, hierarchical control structure superimposed on a large network of mobile switches and endpoints; the location management procedures for determining the current locations of mobile endpoints relative to the hierarchicalcontrol structure; and the virtual circuit management Procedures for setting up and repairing virtual circuits as switches andendpoints move.