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
••
01 Oct 2007TL;DR: Simulation results and performance comparisons with existing protocols substantiate the effectiveness of the augmented tree-based routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability.
Abstract: In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as augmented tree-based routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performance comparisons with existing protocols substantiate the effectiveness of the ATR.
43 citations
••
TL;DR: A boundary diffusion method is presented for the rectilinear-monotone orthogonal convex fault model such as the rectangular fault model and minimal-connected-component (MCC) faulty model, whereby an adaptive fault-tolerant routing algorithm, called X-Y boundary routing algorithm (X-YBRA), is present for deadlock-free fault-Tolerant adaptive routing outside the fault blocks.
Abstract: We formalize the construction of fault blocks by a state transition model based on finite state automata. Based on the model, a boundary diffusion method is presented for the rectilinear-monotone orthogonal convex fault model such as the rectangular fault model and minimal-connected-component (MCC) faulty model, whereby an adaptive fault-tolerant routing algorithm, called X-Y boundary routing algorithm (X-YBRA), is presented for deadlock-free fault-tolerant adaptive routing outside the fault blocks. To improve the network resources utilization, we put forward a routing diffusion method in the fault block, which completely solves the routing problem in the fault block. The experiment result shows that the diffusion overhead of our method is far lower than that of the traditional routing algorithms such as distance vector and link state routing algorithms with the light loss in convergence time. For the occurrence and recovery of random faults, the expansion and shrinkage of the fault block are also discussed. Accordingly, the dynamic boundary and routing updating methods are put forward to respond to these cases. Based on these methods, we develop low earth orbit satellite networks into an adaptive fault-tolerant system in routing. Our works can be also applied to other 2D mesh networks such as the interconnect multiprocessor computer systems.
43 citations
••
01 Jul 2017TL;DR: Simulation results demonstrate that LEPR significantly outperforms two popular routing protocols, AODV and DSR, in terms of packet delivery ratio, delay and routing overhead, whether in a high or low mobility setting.
Abstract: Flying Ad Hoc Network (FANET) consisting of Unmanned Aerial Vehicles (UAVs) can undertake many tasks difficult for traditional Mobile Ad Hoc Networks (MANETs). However, the highly dynamic topology of FANET imposes difficulties for adopting existing MANET routing protocols. In this paper, we present the Link Stability Estimation-based Preemptive Routing (LEPR) protocol targeting FANET on the basis of AODV, an existing routing protocol for ad hoc networks. Taking advantage of GPS location information of UAVs, a new link stability metric is introduced for LEPR. This new metric uses the link quality, safety degree and mobility prediction factor to take into account the past, current and future statuses of link stability respectively. With this new metric, LEPR calculates multiple robust link-disjoint paths during the route discovery process. In addition, a semi-proactive route maintenance process is initiated when anticipating link breaks. This preemptive mechanism reduces the number of broken paths and packet latency by finding and switching to a more reliable path early. Simulation results demonstrate that LEPR significantly outperforms two popular routing protocols, AODV and DSR, in terms of packet delivery ratio, delay and routing overhead, whether in a high or low mobility setting.
43 citations
••
TL;DR: The ProHet protocol is proposed, a distributed probabilistic routing protocol for WHSNs that utilizes asymmetric links to reach assured delivery rate with low overhead and can achieve assured delivery rates if ρ is set within its upper-bound.
Abstract: Due to different requirements in applications, sensors with different capacities are deployed. How to design efficient, reliable and scalable routing protocols in such wireless heterogeneous sensor networks (WHSNs) with intermittent asymmetric links is a challenging task. In this paper, we propose ProHet: a distributed probabilistic routing protocol for WHSNs that utilizes asymmetric links to reach assured delivery rate with low overhead. The ProHet protocol first produces a bidirectional routing abstraction by finding a reverse path for every asymmetric link. Then, it uses a probabilistic strategy to choose forwarding nodes based on historical statistics using local information. Analysis shows that ProHet can achieve assured delivery rate ρ if ρ is set within its upper-bound. Extensive simulations are conducted to verify its efficiency.
43 citations
••
08 Jan 2011TL;DR: Theoretical analysis and simulation results show that compared with the traditional ACA algorithm for the routing of wireless sensor network, EAACA routing protocol balances the energy consumption of nodes in the network and extends the network lifetime.
Abstract: Based on the characteristics of routing protocol for wireless sensor networks, an energy aware ant colony algorithm (EAACA) for the routing of wireless sensor networks is proposed in this paper. When EAACA routing protocol chooses the next neighbor node, not only the distance of sink node, but also the residual energy of the next node and the path of the average energy are taken into account. Theoretical analysis and simulation results show that compared with the traditional ACA algorithm for the routing of wireless sensor network, EAACA routing protocol balances the energy consumption of nodes in the network and extends the network lifetime.
43 citations