Topic
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.
Papers published on a yearly basis
Papers
More filters
••
07 Jan 2002TL;DR: A multipath extension to the dynamic source routing (DSR) protocol proposed by D.A. Maltz (1996), an on-demand routing protocol, for ad hoc wireless networks is considered, which keeps two node disjoint paths between the source and the destination of a routing process without introducing extra overhead.
Abstract: We consider a multipath extension to the dynamic source routing (DSR) protocol proposed by D.B. Johnson and D.A. Maltz (1996), an on-demand routing protocol, for ad hoc wireless networks. This extension keeps two node disjoint paths between the source and the destination of a routing process without introducing extra overhead. Several optimization options are also considered. Simulation is conducted on the success rate of finding node disjoint paths.
48 citations
••
08 Oct 2007TL;DR: This paper implemented TARP (Trust-Aware Routing Protocol) in a TinyOS-based SANET and conducted several experiments to evaluate its performance, confirming that TARP achieves substantial improvements in terms of energy consumption and scalability.
Abstract: Most routing protocols for sensor-actuator networks (SANETs) are built under the assumption that nodes normally cooperate in forwarding each other's messages. In practice, this assumption is not realistic; SANETs are environments where nodes may or may not cooperate. For several reasons, a node may fail to operate as planned at deployment time. As a result, when actually deployed, protocols and applications may not be as efficient as expected. In this paper, we present TARP (Trust-Aware Routing Protocol), a routing protocol for sensor-actuator networks that exploits past nodes' routing behavior and links' quality to determine efficient paths. We implemented TARP in a TinyOS-based SANET and conducted several experiments to evaluate its performance. The obtained results confirmed that TARP achieves substantial improvements in terms of energy consumption and scalability.
48 citations
••
19 May 2008TL;DR: The results show that, under typical network configurations and neglect overhead, the average progress per transmission of opportunistic routing in lognormal shadowing (Rayleigh fading) environment is about 3 (1.5) times higher than that of traditional unicast routing.
Abstract: Recently, the idea of opportunistic routing has been widely explored to improve the performance of multi-hop wireless mesh networks. Most of the previous studies use simulations or empirical measurements to evaluate the performance gain of opportunistic routing and therefore are limited to relatively few types of scenarios. In this paper, we take an analytical approach to study the potential gain of opportunistic routing in multi- hop wireless networks. Unlike other analytical studies which use a deterministic channel model, our approach captures the key characteristics of opportunistic routing, i.e. its ability to take advantage of the numerous, yet unreliable wireless links in the network in a probabilistic manner and study the effectiveness of opportunistic routing under diverse radio propagation environment using lognormal shadowing and Rayleigh fading models. Our results show that, under typical network configurations and neglect overhead, the average progress per transmission of opportunistic routing in lognormal shadowing (Rayleigh fading) environment is about 3 (1.5) times higher than that of traditional unicast routing. Finally, we also demonstrate the potential benefits of using different forwarding regions and directional antennas in opportunistic routing.
48 citations
••
TL;DR: This work has implemented several active ad hoc routing protocols that configure the forwarding behavior of mobile nodes, allowing data packets to be efficiently routed between any two nodes of the wireless network.
Abstract: Ad hoc networks are wireless multihop networks whose highly volatile topology makes the design and operation of a standard routing protocol hard. With an active networking approach, one can define and deploy routing logic at runtime in order to adapt to special circumstances and requirements. We have implemented several active ad hoc routing protocols that configure the forwarding behavior of mobile nodes, allowing data packets to be efficiently routed between any two nodes of the wireless network. Isolating a simple forwarding layer in terms of both implementation and performance enables us to stream delay-sensitive audio data over the ad hoc network. In the control plane, active packets permanently monitor the connectivity and setup, and modify the routing state.
47 citations
•
15 Jun 2006
TL;DR: In this paper, the authors describe a system and methods for exchanging and determining routes in packet-switched mesh networks, where nodes in the mesh networks may be coupled via wireless and fixed-wire links.
Abstract: Systems and methods are described for exchanging and determining routes in packet-switched mesh networks. Nodes in the mesh networks may be coupled via wireless and fixed-wire links. Routing protocols used to determine routes include link state protocols and hybrids of link state and path vector protocols. Type-Length-Value formats are provided to facilitate state information for nodes in the packet switched network, allowing paths to be re-routed through the mesh networks in real-time.
47 citations