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.

LEACH-HPR: An energy efficient routing algorithm for Heterogeneous WSN

Abstract: In wireless sensor network, there are many hurdles takes place in providing quality of service routing to a desired level. The majority of routing protocols in wireless sensor networks concentrates on energy efficiency as a prime factor. Developing an energy-efficient routing protocol has a significant impact on the overall lifetime and stability of the sensor network. In this paper, we have considered three types of sensor nodes. Some fraction of the sensor nodes are equipped with the additional energy resources than the other nodes. We have assumed that all the sensor nodes are uniformly distributed. In the Heterogeneous WSN, we proposed an energy efficient cluster head election protocol (LEACH-HPR) and using the minimum spanning tree algorithm to construct an inter-cluster routing. Simulation results show out method is more efficient to reduce and balance energy consumption and hence prolong the lifetime of WSN.

CORPL: A Routing Protocol for Cognitive Radio Enabled AMI Networks

Abstract: It is expected that the use of cognitive radio for smart grid communication will be indispensable in near future. Recently, IETF has standardized RPL (routing protocol for low power and lossy networks), which is expected to be the standard routing protocol for majority of applications including advanced metering infrastructure (AMI) networks. Our objective in this paper is to enhance RPL for cognitive radio enabled AMI networks. Our enhanced protocol provides novel modifications to RPL in order to address the routing challenges in cognitive radio environments along with protecting the primary users as well as meeting the utility requirements of secondary network. System level performance evaluation shows the effectiveness of proposed protocol as a viable solution for practical cognitive AMI networks.

Divide and conquer: Partitioning OSPF networks with SDN

Abstract: Software Defined Networking (SDN) is an emerging network control paradigm focused on logical centralization and programmability. At the same time, distributed routing protocols, most notably OSPF and IS-IS, are still prevalent in IP networks, as they provide shortest path routing, fast topological convergence after network failures, and, perhaps most importantly, the confidence based on decades of reliable operation. Therefore, a hybrid SDN/OSPF operation remains a desirable proposition. In this paper, we propose a new method of hybrid SDN/OSPF operation. Our method is different from other hybrid approaches, as it uses SDN nodes to partition an OSPF domain into sub-domains thereby achieving the traffic engineering capabilities comparable to full SDN operation. We place SDN-enabled routers as subdomain border nodes, while the operation of the OSPF protocol continues unaffected. In this way, the SDN controller can tune routing protocol updates for traffic engineering purposes before they are flooded into sub-domains. While local routing inside sub-domains remains stable at all times, inter-sub-domain routes can be optimized by determining the routes in each traversed sub-domain. As the majority of traffic in non-trivial topologies has to traverse multiple subdomains, our simulation results confirm that a few SDN nodes allow traffic engineering up to a degree that renders full SDN deployment unnecessary.

The clade vertebrata: spines and routing in ad hoc networks

Abstract: This work proposes a self-organizing, dynamic infrastructure called a spine for efficient routing in ad hoc networks. We present a scalable framework for routing that encompasses a range of knowledge at each spine node, and identify the trade-offs involved for routing at different points in this range. Our routing algorithm requires only partial topology information at each spine node, consisting of the spine structure, dependants of each spine node, propagation of long-lived links, and snooped routing information from ongoing flows. Through worst-case theoretical bounds and simulation of typical scenarios, we show that the spine-based routing with only partial topology information provides good routes at low overhead.

Routing improvement using directional antennas in mobile ad hoc networks

Abstract: In this paper, we present the initial design and evaluation of two techniques for routing improvement using directional antennas in mobile ad hoc networks. First, we use directional antennas to bridge permanent network partitions by adaptively transmitting selected packets over a longer distance, still transmitting most packets a shorter distance. Second, in a network without permanent partitions, we use directional antennas to repair routes in use, when an intermediate node moves out of wireless transmission range along the route; by using the capability of a directional antenna to transmit packets over a longer distance, we bridge the route breakage caused by the intermediate node's movement, thus reducing packet delivery latency. Through simulations, we demonstrate the effectiveness of our design in the context of the dynamic source routing protocol (DSR).