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: A new Interference-Load Aware routing metric, ILA, is proposed that finds paths with reduced inter-flow and intra-flow interference to route the traffic through congestion free areas and balance the load amongst the network nodes.
178 citations
29 May 2012
TL;DR: This paper proposes a revised cluster routing algorithm named E-LEACH to enhance the hierarchical routing protocol LEACH, which considers the remnant power of the sensor nodes in order to balance network loads and changes the round time depends on the optimal cluster size.
Abstract: In wireless sensor networks, sensor nodes always have a limited power resource. The energy consumed by transferring data from the sensor node to its destination raises as a critical issue in designing reasonable wireless sensor network routing protocols. In this paper we propose a revised cluster routing algorithm named E-LEACH to enhance the hierarchical routing protocol LEACH. In the E-LEACH algorithm, the original way of the selection of the cluster heads is random and the round time for the selection is fixed. In the E-LEACH algorithm, we consider the remnant power of the sensor nodes in order to balance network loads and changes the round time depends on the optimal cluster size. The simulation results show that our proposed protocol increases network lifetime at least by 40% when compared with the LEACH algorithm.
176 citations
21 Mar 2004
TL;DR: MobDHop can be used to provide an underlying hierarchical routing structure to address the scalability of routing protocol in large MANETs and form lesser clusters than Lowest-ID and MOBIC algorithm in the same scenario.
Abstract: This paper presents a mobility-based d-hop clustering algorithm (MobDHop), which forms variable-diameter clusters based on node mobility pattern in MANETs. We introduce a new metric to measure the variation of distance between nodes over time in order to estimate the relative mobility of two nodes. We also estimate the stability of clusters based on relative mobility of cluster members. Unlike other clustering algorithms, the diameter of clusters is not restricted to two hops. Instead, the diameter of clusters is flexible and determined by the stability of clusters. Nodes which have similar moving pattern are grouped into one cluster. The simulation results show that MobDHop has stable performance in randomly generated scenarios. It forms lesser clusters than Lowest-ID and MOBIC algorithm in the same scenario. In conclusion, MobDHop can be used to provide an underlying hierarchical routing structure to address the scalability of routing protocol in large MANETs.
176 citations
TL;DR: This proposed approach tries to account for link stability and for minimum drain rate energy consumption and a novel routing protocol called Link-stAbility and Energy aware Routing protocols (LAER) is proposed.
Abstract: Energy awareness for computation and protocol management is becoming a crucial factor in the design of protocols and algorithms. On the other hand, in order to support node mobility, scalable routing strategies have been designed and these protocols try to consider the path duration in order to respect some QoS constraints and to reduce the route discovery procedures. Often energy saving and path duration and stability can be two contrasting efforts and trying to satisfy both of them can be very difficult. In this paper, a novel routing strategy is proposed. This proposed approach tries to account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of the proposed solution a biobjective optimization formulation has been designed and a novel routing protocol called Link-stAbility and Energy aware Routing protocols (LAER) is proposed. This novel routing scheme has been compared with other three protocols: PERRA, GPSR, and E-GPSR. The protocol performance has been evaluated in terms of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average energy consumption.
175 citations
09 Jul 2003
TL;DR: Simulation results reveal that by using a five-packet data cache, CHAMP exhibits excellent improvement in packet delivery, outperforming AODV and DSR by at most 30% in stressful scenarios and end-to-end delay is significantly reduced while routing overhead is lower at high mobility rates.
Abstract: A mobile ad hoc network is an autonomous system of infrastructureless, multihop wireless mobile nodes. Reactive routing protocols perform well in such an environment due to their ability to cope quickly against topological changes. In this paper, we propose a new routing protocol called Caching and Multipath (CHAMP) Routing Protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route breakdowns. Simulation results reveal that by using a five-packet data cache, CHAMP exhibits excellent improvement in packet delivery, outperforming AODV and DSR by at most 30% in stressful scenarios. Furthermore, end-to-end delay is significantly reduced while routing overhead is lower at high mobility rates.
175 citations