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.

Energy-Efficient Oriented Routing Algorithm in Wireless Sensor Networks

Abstract: The design and implementation of healthcare system using sensor network technology has been one of the most active research topics currently. The research on wireless sensor network mostly focuses on energy saving, such as duty cycle scheduling, and path routing, such as routing protocol for low power and lossy networks (RPL) which however only takes into account a single metric, reliability or energy, as routing decision. If RPL only considers the reliability metric, nodes will suffer from uneven energy. If it only considers the energy metric, nodes will suffer from the rise of packet loss ratio. In this paper, we propose an energy-oriented routing mechanism to improve RPL routing protocol by combining the expected transmission count (ETX) and remaining energy metrics. The simulation will be conducted to analyze the performance of the proposed mechanism.

Achieving privacy in mesh networks

Abstract: Mesh network is vulnerable to privacy attacks because of the open medium property of wireless channel, the fixed topology, and the limited network size. Traditional anonymous routing algorithm cannot be directly applied to Mesh network, because they do not defend global attackers. In this paper we design private routing algorithm that used "Onion", i.e., layered encryption, to hide routing information. In addition, we explore special ring topology that fits the investigated network scenario, to preserve a certain level of privacy against a global adversary.

Toward Practical and Intelligent Routing in Vehicular Ad Hoc Networks

Abstract: Apart from vehicle mobility, data rate (bit rate) and multihop data transmission efficiency (including route length) have a significant impact on the performance of a routing protocol for vehicular ad hoc networks (VANETs). Existing routing protocols do not seriously address all these issues and are not evaluated for a real VANET environment. Therefore, it is difficult for these protocols to attain a high performance and to work properly under various scenarios. In this paper, we first discuss the challenges of routing in VANETs based on the data acquired from real-world experiments and then propose a routing protocol that is able to learn the best transmission parameters by interacting with the environment. The protocol takes into account multiple metrics, specifically data transmission rate, vehicle movement, and route length. We use both real-world experiments and computer simulations to evaluate the proposed protocol.

Collaborative trust-based secure routing against colluding malicious nodes in multi-hop ad hoc networks

Abstract: The Trust-embedded AODV (T-AODV) routing protocol was designed by us to secure the ad hoc network from independent malicious nodes by finding a secure end-to-end route. In This work we have proposed an extension of T-AODV that can withstand attack by multiple malicious nodes acting in collusion to disrupt the network. It finds a secure end-to-end path free of malicious nodes and can effectively isolate a malicious entity trying to attack the network independently or in collusion with other malicious entities. In this respect, the solution is unique and, to the best of our knowledge, the first such solution proposed so far. We have shown the efficiency of our protocol by extensive simulation and also analyzed its security by evaluating different threat scenarios.

SACRP: A Spectrum Aggregation-Based Cooperative Routing Protocol for Cognitive Radio Ad-Hoc Networks

Abstract: Cooperative routing and spectrum aggregation are two promising techniques for Cognitive Radio Ad-Hoc Networks (CRAHNs). In this paper, we propose a spectrum aggregation-based cooperative routing protocol, termed as SACRP, for CRAHNs. To the best of our knowledge, this is the first contribution on spectrum aggregation-based cooperative routing for CRAHNs. The primary objective of SACRP is to provide higher energy efficiency, improve throughput, and reduce network delay for CRAHNs. In this regard, we design the MAC and Physical (PHY) layer, and proposed different spectrum aggregation algorithms for cognitive radio (CR) users. We propose two different classes of routing protocols; Class A for achieving higher energy efficiency and throughput, and Class B for reducing end-to-end latency. Based on stochastic geometry approach, we build a comprehensive analytical model for the proposed protocol. Besides, the proposed protocol is compared with the state of the art cooperative and non-cooperative routing algorithms with spectrum aggregation. Performance evaluation demonstrates the effectiveness of SACRP in terms of energy efficiency, throughput, and end-to-end delay.