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
03 Jul 2006
TL;DR: A leader election protocol that works under frequent network changes and node mobility, based on electing a unique node that outperforms all the other nodes in a cluster identified by the protocol is presented.
Abstract: In this paper, we present a leader election protocol that works under frequent network changes and node mobility. Our proposed protocol, which operates well in ad hoc networks, is based on electing a unique node that outperforms all the other nodes in a cluster identified by our protocol. We discuss our protocol and present an illustrative example to show how our proposed scheme works in a mobile network. We also show how our algorithm succeeds in electing a unique leader in a mobile ad hoc network environment.
44 citations
01 Oct 2004
TL;DR: A secure routing protocol called JANUS is introduced, that focuses on the establishment of secure routes between the base station and mobile devices, and the secure routing of the data, and it is shown that the protocol is secure against the attacks described.
Abstract: In this paper we investigate and provide solutions for security threats in the context of hybrid networks consisting of a cellular base station and mobile devices equipped with dual cellular and ad-hoc (802.11b) cards. The cellular connection is used for receiving services (i.e. Internet access) from the base station, while the ad-hoc links are used to improve the quality of the connection. We provide detailed descriptions of several attacks that arbitrarily powerful adversaries, whether outsiders or insiders, can mount against well-behaved members of the network. We introduce a secure routing protocol called JANUS, that focuses on the establishment of secure routes between the base station and mobile devices, and the secure routing of the data. We show that our protocol is secure against the attacks described and experimentally compare the message overhead introduced by JANUS and UCAN.
44 citations
11 Dec 2009
TL;DR: The experimental results showed that HWMP has the lower average latency and the higher data transmission throughput compared with AODV.
Abstract: IEEE 802.11s defines a new mesh data frame format and an extensibility framework for routing. The default routing protocol Hybrid Wireless Mesh Protocol (HWMP) is described. HWMP is based on Ad hoc On-demand Distance Vector Routing (AODV) and has a configurable extension for proactive routing. It uses MAC address with layer 2 routing and uses Radio-Aware as routing metric. We implemented HWMP on OPNET and evaluated its performance. The experimental results showed that HWMP has the lower average latency and the higher data transmission throughput compared with AODV.
44 citations
17 Aug 2008
TL;DR: It is shown, via simulation, that XL significantly outperforms standard link-state and distance vector algorithms - in some cases reducing overhead by more than an order of magnitude - while having negligible impact on path length.
Abstract: In this paper, we present a new link-state routing algorithm called Approximate Link state (XL) aimed at increasing routing efficiency by suppressing updates from parts of the network. We prove that three simple criteria for update propagation are sufficient to guarantee soundness, completeness and bounded optimality for any such algorithm. We show, via simulation, that XL significantly outperforms standard link-state and distance vector algorithms - in some cases reducing overhead by more than an order of magnitude - while having negligible impact on path length. Finally, we argue that existing link-state protocols, such as OSPF, can incorporate XL routing in a backwards compatible and incrementally deployable fashion.
44 citations
13 Apr 2008
TL;DR: Simulations show ABVCap routing ensures moderate routing path length, as compared to virtual-coordinate-based routing, GLIDER, Hop ID, GLDR, and VCap, which guarantees packet delivery without the computation and storage of the global topological features.
Abstract: A wireless sensor network has unidirectional links because sensors can have different transmission ranges, sensors have unstable transmission ranges, and a hidden terminal problem exists. In this paper, we introduce a virtual coordinate assignment protocol (ABVCap_Uni) to assign virtual coordinates to nodes that have no geographic information in wireless sensor networks with unidirectional links, and we propose a routing protocol based on the ABVCap_Uni virtual coordinates. Our routing protocol guarantees packet delivery without computation and storage of global topology features in a discrete domain. Using simulation, we evaluate the performance of the proposed routing protocol (ABVCap_Uni routing), the greedy landmark- descent routing protocol (GLDR+VLM routing), and the greedy routing protocol based on physical coordinates (Euclidean routing). The simulations demonstrate that our routing protocol ensures moderate routing path length cost overhead.
44 citations