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
TL;DR: An emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications that adapts to handle dynamic emergency scenarios and works well with the routing hole problem.
Abstract: Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.
56 citations
07 Jun 1998
TL;DR: A routing algorithm called probabilistic routing protocol (PRP) is introduced that reduces the number of re-routing attempts due to the dynamic topology of the network and the performance of the algorithm is investigated using simulation experiments.
Abstract: Low Earth orbit (LEO) satellite networks have dynamic, yet deterministic, topologies. The time-varying connectivity pattern would result in the re-routing of all connections passing through a link that is turned off as a result of the topology change. A routing algorithm called probabilistic routing protocol (PRP) is introduced. The PRP reduces the number of re-routing attempts due to the dynamic topology of the network. During the routing phase of a newly arriving call, the PRP eliminates the links that will be turned off before the call releases the link due to call termination or connection handover. Since the algorithm has no knowledge of the call duration or exact terminal location, route usage time is only known probabilistically. The probability distribution function of the route usage time of the call is determined to realize the algorithm. Since the routing algorithm works in parallel with a handover re-routing algorithm, the application to the footprint handover re-routing protocol (FHRP) is also demonstrated. The performance of the algorithm is investigated using simulation experiments.
56 citations
01 Oct 1994
TL;DR: A state-dependent routing scheme that builds on any base state-independent routing scheme, by routing flows which are blocked on their primary paths on alternate paths in a manner that is guaranteed—under certain Poisson assumptions— to improve on the performance of the basestate-independent scheme.
Abstract: High-speed packet networks will begin to support services that need Quality-of-Service (QoS) guarantees. Guaranteeing QoS typically translates to reserving resources for the duration of a call. We propose a state-dependent routing scheme that builds on any base state-independent routing scheme, by routing flows which are blocked on their primary paths (as selected by the state-independent scheme) onto alternate paths in a manner that is guaranteed—under certain Poisson assumptions— to improve on the performance of the base state-independent scheme. Our scheme only requires each node to have state information of those links that are incident on it. Such a scheme is of value when either the base state-independent scheme is already in place and a complete overhaul of the routing algorithm is undesirable, or when the state (reserved flows) of a link changes fast enough that the timely update of state information is infeasible to all possible call-originators. The performance improvements due to our controlled alternate routing scheme are borne out from simulations conducted on a fully-connected 4-node network, as well as on a sparsely-connected 12-node network modeled on the NSFNet T3 Backbone.
56 citations
TL;DR: This paper simulates protocols that represent various routing strategies in ad hoc networks using PARSEC, and relative strengths, weaknesses, and applicability to various situations of each routing protocol are studied and discussed.
56 citations
06 Jun 1994
TL;DR: A bucket algorithm is proposed for zero-skew routing with linear time complexity on the average for segments on Manhattan distance which is much simpler and more efficient than the best known algorithm which uses Delaunay triangulations.
Abstract: A bucket algorithm is proposed for zero-skew routing with linear time complexity on the average. Our algorithm is much simpler and more efficient than the best known algorithm which uses Delaunay triangulations for segments on Manhattan distance. Experimental results show that the linearity of our algorithm is accomplished. Our algorithm generates a zero-skew routing for 3000-pin benchmark data within 5 seconds on a 90MIPS RISC workstation.
56 citations