scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: Two hierarchical clustering protocols that improve the scalability of ad hoc routing protocols are presented, which create a one-level clustered hierarchy across an ad hoc network, and a multi-level hierarchy which is able to dynamically adjust the depth of the hierarchy in response to the changing network topology.
Abstract: Ad hoc networks have the notable capability of enabling spontaneous networks. These networks are self-initializing, self-configuring, and self-maintaining, even though the underlying topology is often continually changing. Because research has only begun to scratch the surface of the potential applications of this technology, it is important to prepare for the widespread use of these networks. In anticipation of their ubiquity, the protocols designed for these networks must be scalable. This includes scaling to both networks with many nodes, and networks with rapidly changing topologies. This paper presents two hierarchical clustering protocols that improve the scalability of ad hoc routing protocols. The Adaptive Routing using Clusters (ARC) protocol creates a one-level clustered hierarchy across an ad hoc network, while the Adaptive Routing using Clustered Hierarchies (ARCH) protocol creates a multi-level hierarchy which is able to dynamically adjust the depth of the hierarchy in response to the changing network topology. It is experimentally shown that these protocols, when coupled with an ad hoc routing protocol, produce throughput improvements of up to 80% over the ad hoc routing protocol alone.

111 citations

Journal ArticleDOI
01 Jul 2012
TL;DR: A reactive routing protocol for mobile cognitive radio ad hoc networks able to achieve three goals to avoid interferences to primary users during both route formation and data forwarding and to take advantage of the availability of multiple channels to improve the overall performance.
Abstract: Although more than a decade has passed from the proposal of the Cognitive Radio paradigm, in these years the research has mainly focused on physical and medium access issues, and few recent works focused on the problem of routing in cognitive networks. This paper addresses such a problem by evaluating the feasibility of reactive routing for mobile cognitive radio ad hoc networks. More specifically, we design a reactive routing protocol for the considered scenario able to achieve three goals: (i) to avoid interferences to primary users during both route formation and data forwarding; (ii) to perform a joint path and channel selection at each forwarder; (iii) to take advantage of the availability of multiple channels to improve the overall performance. Two different versions of the same protocol, referred to as Cognitive Ad-hoc On-demand Distance Vector (CAODV), are presented. The first version exploits inter-route spectrum diversity, while the second one exploits intra-route spectrum diversity. An exhaustive performance analysis of both the versions of the proposed protocol in different environments and network conditions has been carried out via numerical simulations. The results state the suitability of the proposed protocol for small mobile cognitive radio ad hoc networks.

110 citations

Proceedings ArticleDOI
Kun Tan1, Qian Zhang1, Wenwu Zhu1
01 Dec 2003
TL;DR: This work proposes a novel routing framework named shortest expected path routing (SEPR), which builds up a stochastic model of the ad hoc network and maintains it in a distributed way and proposes a new routing metric, called expected path length.
Abstract: Ad hoc communication among wireless enabled smart devices is increasingly playing an important role in coordinating distributed applications. Existing ad hoc routing algorithms usually assume the existence of end-to-end path connecting communication nodes. However, due to the power limitation, radio coverage and geography distribution of cooperating nodes, in some scenarios this assumption is unlikely to be valid. We address the issue of data routing in partially connected ad hoc networks. In this situation, data propagation is achieved via mainly pair-wise communication between any two nodes when they are in vicinity. We propose a novel routing framework named shortest expected path routing (SEPR). Instead of blindly flooding messages in the network, SEPR builds up a stochastic model of the ad hoc network and maintains it in a distributed way. A new routing metric, called expected path length, is proposed. By guiding messages flow to shortest expected path nodes, our approach dramatically reduces the number of unnecessary message copies as well as increases the message delivering rate. With a simulation, we evaluate the effectiveness and the efficiency of our approach.

110 citations

Journal ArticleDOI
01 Mar 2007
TL;DR: This work proposes a multipath on-demand routing protocol (SMORT), which reduces the routing overhead incurred in recovering from route breaks, by using secondary paths, and computes fail-safe multiple paths.
Abstract: Increasing popularity and availability of portable wireless devices, which constitute mobile ad hoc networks, calls for scalable ad hoc routing protocols. On-demand routing protocols adapt well with dynamic topologies of ad hoc networks, because of their lower control overhead and quick response to route breaks. But, as the size of the network increases, these protocols cease to perform due to large routing overhead generated while repairing route breaks. We propose a multipath on-demand routing protocol (SMORT), which reduces the routing overhead incurred in recovering from route breaks, by using secondary paths. SMORT computes fail-safe multiple paths, which provide all the intermediate nodes on the primary path with multiple routes (if exists) to destination. Exhaustive simulations using GloMoSim with large networks (2000 nodes) confirm that SMORT is scalable, and performs better even at higher mobility and traffic loads, when compared to the disjoint multipath routing protocol (DMRP) and ad hoc on-demand distance vector (AODV) routing protocol.

110 citations

Journal ArticleDOI
TL;DR: This work utilizes prior routing histories to localize the query flood to a limited region of the network, which contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.
Abstract: Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. We propose a technique that can reduce the routing overhead even further. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Our technique utilizes prior routing histories to localize the query flood to a limited region of the network. Simulation results demonstrate excellent reduction of routing overheads with this mechanism. This also contributes to a reduced level of network congestion and better end-to-end delay performance of data packets.

110 citations

Network Information
Related Topics (5)
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Wireless ad hoc network
49K papers, 1.1M citations
93% related
Network packet
159.7K papers, 2.2M citations
92% related
Wireless sensor network
142K papers, 2.4M citations
92% related
Wireless network
122.5K papers, 2.1M citations
92% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20236
202210
20211
20193
201822
2017264