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.

Multigate Communication Network for Smart Grid

Abstract: It is envisioned that one of the most important issues in smart grid will be to design a network architecture that is capable of providing secure and reliable two-way communication from meters to other Smart Grid domains. While networking technologies and systems have been greatly enhanced, in wireless communication environments the smart grid faces new challenges in terms of reliability and efficiency. In this paper we present a multigate mesh network architecture to handle real-time traffic for the last mile communication. The paper consists of three parts; multigate routing, real-time traffic scheduling, and multichannel (MC) aided wireless mesh routing. The multigate routing is based on a flexible mesh network architecture that expands on the hybrid tree routing of the IEEE 802.11s. The network is specifically designed to operate in a multi gateway structure in order to meet the smart grid requirements in terms of reliability, self-healing, and throughput performance. This includes developing a timer-based multiple-path diversity scheme that takes advantage of the multi gateway network structure. With respect to packet scheduling, we introduce a novel and efficient scheme that is capable of balancing the traffic load among multiple gateways. The proposed scheme, which is based on the backpressure concept due to its simplicity, is suitable for practical implementation. We also present an MC aided wireless mesh routing protocol which is specifically designed for multigate smart grid networks. The results indicate that a combination of multipath routing and the backpressure-based packet-scheduling scheme can show a significant improvement in the network reliability, latency, and throughput performance. We also show an improvement in the order of magnitude can be achieved via the proposed multichannel aided routing protocol.

Efficient and scalable query routing for unstructured peer-to-peer networks

Abstract: Searching for content in peer-to-peer networks is an interesting and challenging problem. Queries in Gnutella-like unstructured systems that use flooding or random walk to search must visit O(n) nodes in a network of size n, thus consuming significant amounts of bandwidth. In this paper, we propose a query routing protocol that allows low bandwidth consumption during query forwarding using a low cost mechanism to create and maintain information about nearby objects. To achieve this, our protocol maintains a lightweight probabilistic routing table at each node that suggests the location of each object in the network. Following the corresponding routing table entries, a query can reach the destination in a small number of hops with high probability. However, maintaining routing tables in a large and highly dynamic network requires non-traditional mechanisms. We design a novel data structure called an exponentially decaying bloom filter (EDBF) that encodes such probabilistic routing tables in a highly compressed manner, and allows for efficient aggregation and propagation. The search primitives provided by our system can be used to search for single keys or multiple keywords with equal ease. Analytical modeling of our design predicts significant improvements in search efficiency, verified through extensive simulations in which we observed an order of magnitude reduction in query path length over previous proposals.

Comparative Study of Routing Protocols for Mobile Ad-hoc NETworks

Abstract: In this paper, we describe the Optimized Link State Routing Protocol (OLSR), a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs). We evaluate its performance through exhaustive simulations using the Network Simulator 2 (ns2), and compare with other ad-hoc protocols, specifically the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and the Dynamic Source Routing (DSR) protocol. We study the protocols under varying conditions (node mobility, network density) and with varying traffic (TCP, UDP, different number of connections/streams) to provide a qualitative assessment of the applicability of the protocols in different scenarios.

Ad hoc networks beyond unit disk graphs

Abstract: In this paper, we study an algorithmic model for wireless ad hoc and sensor networks that aims to be sufficiently close to reality as to represent practical real-world networks while at the same time being concise enough to promote strong theoretical results The quasi unit disk graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1 We show that--in comparison to the cost known for unit disk graphs--the complexity results of geographic routing in this model contain the additional factor 1/d2 We prove that in quasi unit disk graphs flooding is an asymptotically message-optimal routing technique, we provide a geographic routing algorithm being most efficient in dense networks, and we show that classic geographic routing is possible with the same asymptotic performance guarantees as for unit disk graphs if d ≥ 1/√2

Secure traceroute to detect faulty or malicious routing

Abstract: Network routing is vulnerable to disruptions caused by malfunctioning or malicious routers that draw traffic towards themselves but fail to correctly forward the traffic. The existing approach to addressing this problem is to secure the routing protocol by having it validate routing updates, i.e., verify their authenticity, accuracy, and/or consistency. In this paper, we argue that it is also important to ensure the robustness of packet forwarding itself. To this end, we propose a different approach, the central idea of which is a secure traceroute protocol that enables end hosts or routers to detect and locate the source of (arbitrarily severe) routing misbehaviors, so that appropriate action can be taken.