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.

Minimum weight routing based on a common link control radio for cognitive wireless ad hoc networks

Abstract: Cognitive wireless ad hoc is highly focused as a promising future wireless technology. However, cognitive wireless ad hoc networks have some difficulties of neighbor discovery and routing. For helping neighbor discovery and routing in the cognitive wireless ad hoc networks, we introduce a common link control radio (CLCR) that is a common active wireless system of cognitive terminals. In addition, we propose a novel cognitive ad hoc routing protocol based on a common link control radio (CLCR) called a minimum weight routing protocol. We show that the proposed routing protocol can greatly reduce communication overhead in cognitive wireless ad hoc networks.

Throughput-Aware Routing for Industrial Sensor Networks: Application to ISA100.11a

Abstract: This paper proposes a routing algorithm that enhances throughput and decreases end-to-end delay in industrial cognitive radio sensor networks (ICRSNs) based on ISA100.11a. In ICRSNs, the throughput is downgraded by interference from primary networks. The proposed routing algorithm is targeted at large-scale networks where data are forwarded through different clusters on their way to the sink. By estimating the maximum throughput for each path, the data can be forwarded through the most optimal path. Simulation results show that our scheme can enhance throughput and decrease end-to-end delay.

Authenticated ad hoc routing at the link layer for mobile systems

Abstract: We have designed an authenticated link-level ad hoc routing protocol and integrated it with the Portland State University implementation of Mobile-IP. The routing protocol addresses link security issues. In our protocol, mobile nodes, as well as agents, broadcast ICMP router discovery packets. The router discovery packets are authenticated and bind the sender's MAC and IP addresses. Problems caused by tying IP subnet schemes to routing on radio links are eliminated. Security problems associated with ARP spoofing are also reduced. This link-level protocol is integrated with Mobile-IP on links where increased security is needed. The protocol replaces ARP, and may be integrated with higher-level multi-hop ad hoc routing protocols.

Load-aware on-demand routing (LAOR) protocol for mobile ad hoc networks

Abstract: Most current routing protocols for mobile ad hoc networks consider the shortest path with minimum hop counts at the optimal route. However, the minimum end-to-end delay from source to destination may not always be achieved through this shortest path. In this paper, we propose an efficient delay-based load-aware on-demand routing (D-LAOR) protocol, which determines the optimal path based on the estimated total path delay and the hop count. We demonstrate the effectiveness of D-LAOR by integrating it with the ad hoc on-demand distance vector (AODV) routing protocol. Simulation results obtained suing the ns-2 network simulation platform, show that D-LAOR scheme increases packet delivery fraction and decreases end-to-end delay by more than 10% in a moderate network scenario when compared with the original AODV ad the other LAOR protocols.

A Distributed Routing Design for a Broadcast Environment

Abstract: In this paper, we will present the need for distributed network control in a packet radio environment, the criteria used for its evaluation, and an overview of the network algorithms chosen to maintain routing information and to route user traffic The routing algorithm, known as tiered rings, functions by building a distributed tree of shortest path routes to each packet radio in the network The information kept by each node grows only linearly as the network expands The design uses the radio channel efficiently by providing shortest path routing and by taking advantage of the information available in a broadcast environment