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
Proceedings ArticleDOI
01 Jul 2013
TL;DR: A routing metric which minimizes the delay towards the DAG root, assuming that nodes run with very low duty cycles at the MAC layer is proposed and compared with that of the Expected Transmission Count (ETX) metric.
Abstract: The Routing Protocol for Low power and Lossy Networks (RPL) is the IETF standard for IPv6 routing in low-power wireless sensor networks It is a distance vector routing protocol that builds a Destination Oriented Directed Acyclic Graph (DODAG) rooted towards one sink (the DAG root), using an objective function and a set of metrics/constraints to compute the best path In this paper, we propose a routing metric which minimizes the delay towards the DAG root, assuming that nodes run with very low duty cycles (eg, under 1%) at the MAC layer We evaluate the proposed routing metric with the Contiki operating system and compare its performance with that of the Expected Transmission Count (ETX) metric Moreover, we propose some extensions to the ContikiMAC radio duty cycling protocol to support different sleeping periods of the nodes

61 citations

Proceedings ArticleDOI
06 Nov 2002
TL;DR: SADSR (security-aware adaptive DSR), a secure routing protocol for mobile ad hoc networks, which authenticates the routing protocol messages using digital signatures based on asymmetric cryptography outperforms DSR in packet delivery ratio with an acceptable network load.
Abstract: We present SADSR (security-aware adaptive DSR), a secure routing protocol for mobile ad hoc networks. SADSR authenticates the routing protocol messages using digital signatures based on asymmetric cryptography. The basic idea behind SADSR is to have multiple routes to each destination and store a local trust value for each node in the network. A trust value is assigned to each path based on trust values of the nodes which occur on that path. The paths with higher trust values are preferred for routing. We implemented our approach in ns2 simulator and compared the performance of SADSR and DSR. Our results show that in the presence of malicious nodes SADSR outperforms DSR in packet delivery ratio with an acceptable network load.

61 citations

Proceedings Article
01 Jun 2002
TL;DR: A topology approximation (TA) mechanism is proposed to address the problem of mobility and simulations of a typical routing protocol called Ad Hoc On-Demand Distance Vector Routing (AODV) show that the proposed TA mechanism can indeed mimic the dynamically changing graph (mobility) of a MANET.
Abstract: In a mobile ad hoc network (MANET), mobile nodes directly send messages to each other via wireless transmission. A node can send a message to a destination node beyond its transmission range by using other nodes as relay points, and thus a node can function as a router. Typical applications of MANETs include defense systems such as battlefield survivability, and disaster recovery. The research on MANETs originates from part of the Advanced Research Projects Agency (ARPA) project in the 1970s. With the explosive growth of the Internet and mobile communication networks, challenging requirements have been introduced into MANETs and designing routing protocols has become more complex. For a successful application of MANETs, it is very important to ensure that a routing protocol is unambiguous, complete and functionally correct. One approach to ensuring correctness of an existing routing protocol is to create a formal model for the protocol, and analyze the model to determine if indeed the protocol provides the defined service correctly. Colored Petri Nets (CPNs) are a suitable modeling language for this purpose, as it can conveniently express non-determinism, concurrency and different levels of abstraction that are inherent in routing protocols. However, it is not easy to build a CPN model of a MANET because a node can move in and out of its transmission range and thus the MANET's topology (graph) dynamically changes. In this paper, we proposes a topology approximation (TA) mechanism to address this problem of mobility and perform simulations of a typical routing protocol called Ad Hoc On-Demand Distance Vector Routing (AODV). Our simulation results show that our proposed TA mechanism can indeed mimic the dynamically changing graph (mobility) of a MANET.

61 citations

Proceedings ArticleDOI
06 Jun 2011
TL;DR: It is proved that the ERP2R protocol performs better than a representative protocol (i.e. DBR) in terms of energy efficiency, end-to-end delay and network lifetime.
Abstract: In Underwater Wireless Sensor Networks (UWSNs), developing an energy efficient routing protocol is a challenge due to the peculiar characteristics of UWSNs. In this paper, we therefore propose an energy-efficient routing protocol, called ERP2R (Energy-efficient Routing Protocol based on Physical distance and Residual energy). ERP2R is based on a novel idea of utilizing the physical distances of the sensor nodes towards the sink node. ERP2R also takes into account the residual energy of the sensor nodes in order to extend the network life-time. Sensor nodes make a local decision of packet forwarding according to their physical distance and the residual energy information. Using the ns-2 simulator, we proved that the ERP2R protocol performs better than a representative protocol (i.e. DBR) in terms of energy efficiency, end-to-end delay and network lifetime.

61 citations

Journal ArticleDOI
TL;DR: The protocol is augmented by an optimization scheme, adapted from the one proposed for the optimized link state routing protocol (OLSR) in which only selected neighbor nodes propagate control packets to reduce the amount of control overhead.
Abstract: We propose in this paper an optimized, polymorphic, hybrid multicast routing protocol for MANET. This new polymorphic protocol attempts to benefit from the high efficiency of proactive behavior (in terms of quicker response to transmission requests) and the limited network traffic overhead of the reactive behavior, while being power, mobility, and vicinity-density (in terms of number of neighbor nodes per specified area around a mobile node) aware. The proposed protocol is based on the principle of adaptability and multibehavioral modes of operations. It is able to change behavior in different situations in order to improve certain metrics like maximizing battery life, reducing communication delays, improving deliverability, etc. The protocol is augmented by an optimization scheme, adapted from the one proposed for the optimized link state routing protocol (OLSR) in which only selected neighbor nodes propagate control packets to reduce the amount of control overhead. Extensive simulations and comparison to peer protocols demonstrated the effectiveness of the proposed protocol in improving performance and in extending battery power longevity

61 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