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.

Ring routing: An energy-efficient routing protocol for wireless sensor networks with a mobile sink

Abstract: Mobile sinks are proposed for load-balancing and achieving uniform energy-consumption in wireless sensor networks. However, advertising the location of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose a new routing protocol, Ring Routing, which aims to minimize this overhead while preserving the advantages of mobile sinks. Simulation results show that the performance of Ring Routing is not very far from the lower bound in terms of delay and energy consumption.

Energy Aware Opportunistic Routing in Wireless Sensor Networks

Abstract: Wireless Sensor Networks (WSNs) have been increasingly considered an attractive solution for a plethora of applications, such as unattended event monitoring and tracking. Energy consumption is one of the looming challenges that threaten the successful deployment of these networks, especially when they are designed to operate unattended for long periods of time. In this paper, we are introducing an Energy-Aware Opportunistic Routing protocol (EAOR), for Wireless Sensor Networks, which keeps a balance between the Quality of Service (QoS) and the energy efficiency. The main objective is to maximize network lifespan without increasing the packet delay. We conduct experiments by simulations to evaluate the performance of the proposed protocol against existing ones, in terms of throughput and energy consumption. The experimental results demonstrated that the proposed protocol can deliver better energy distribution, extends the network lifetime up to 25% compared to simple opportunistic routing protocols and decreases the total energy consumption by 35% compared to traditional routing.

Spectrum-Aware Anypath Routing in Multi-Hop Cognitive Radio Networks

Abstract: Cognitive radio networks (CRNs) have been emerging as a promising technique to improve the spectrum efficiency of wireless and mobile networks, which form spectrum clouds to provide services for unlicensed users. As spectrum clouds, the performance of multi-hop CRNs heavily depends on the routing protocol. In this paper, taking the newly proposed Cognitive Capacity Harvesting network as an example, we study the routing problem in multi-hop CRNs and propose a spectrum-aware anypath routing (SAAR) scheme with consideration of both the salient spectrum uncertainty feature of CRNs and the unreliable transmission characteristics of wireless medium. A new cognitive anypath routing metric is designed based on channel and link statistics to accurately estimate and evaluate the quality of an anypath under uncertain spectrum availability. A polynomial-time routing algorithm is also developed to find the best channel and the associated optimal forwarding set and compute the least cost anypath. Extensive simulations show that the proposed protocol SAAR significantly increases packet delivery ratio and reduces end-to-end delay with low communication and computation overhead, which makes it suitable and scalable to be used in multi-hop CRNs.

Energy-aware on-demand routing protocols for wireless ad hoc networks

Abstract: Energy use is a crucial design concern in wireless ad hoc networks since wireless terminals are typically battery-operated. The design objectives of energy-aware routing are two folds: Selecting energy-efficient paths and minimizing the protocol overhead incurred for acquiring such paths. To achieve these goals simultaneously, we present the design of several on-demand energy-aware routing protocols. The key idea behind our design is to adaptively select the subset of nodes that are required to involve in a route-searching process in order to acquire a high residual-energy path and/or the degree to which nodes are required to participate in the process of searching for a low-power path in networks wherein nodes have transmission power adjusting capability. Analytical and simulation results are given to demonstrate the high performance of the designed protocols in energy-efficient utilization as well as in reducing the protocol overhead incurred in acquiring energy-efficient routes.