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.

Secure link state routing for mobile ad hoc networks

Abstract: Secure operation of the routing protocol is one of the major challenges to be met for the proliferation of the mobile ad hoc networking (MANET) paradigm. Nevertheless, security enhancements have been proposed mostly for reactive MANET protocols. The proposed secure link state routing protocol (SLSP) provides secure proactive topology discovery, which can be beneficial to network operation in a number of ways. SLSP can be employed as a stand-alone protocol, or fit naturally into a hybrid routing framework, when combined with a reactive protocol. SLSP is robust against individual attackers, is capable of adjusting its scope between local and network-wide topology discovery, and is capable of operating in networks of frequently changing topology and membership.

A cluster-based approach for routing in dynamic networks

Abstract: The design and analysis of routing protocols is an important issue in dynamic networks such as packet radio and ad-hoc wireless networks Most conventional protocols exhibit their least desirable behavior for highly dynamic interconnection topologies We propose a new methodology for routing and topology information maintenance in dynamic networks The basic idea behind the protocol is to divide the graph into a number of overlapping clusters A change in the network topology corresponds to a change in cluster membership We present algorithms for creation of clusters, as well as algorithms to maintain them in the presence of various network events Compared to existing and conventional routing protocols, the proposed cluster-based approach incurs lower overhead during topology updates and also has quicker reconvergence The effectiveness of this approach also lies in the fact that existing routing protocols can be directly applied to the network --- replacing the nodes by clusters

Global state routing: a new routing scheme for ad-hoc wireless networks

Abstract: In an ad-hoc environment with no wired communication infrastructure, it is necessary that mobile hosts operate as routers in order to maintain the information about connectivity. However with the presence of high mobility and low signal/interference ratio (SIR), traditional routing schemes for wired networks are not appropriate, as they either lack the ability to quickly reflect the changing topology, or may cause excessive overhead, which degrades network performance. Considering these restrictions, we propose a new scheme especially designed for routing in an ad-hoc wireless environments. We call this scheme "global state routing" (GSR), where nodes exchange vectors of link states among their neighbors during routing information exchange. Based on the link state vectors, nodes maintain a global knowledge of the network topology and optimize their routing decisions locally. The performance of the algorithm, studied in this paper through a series of simulations, reveals that this scheme provides a better solution than existing approaches in a truly mobile, ad-hoc environment.

Designing routing metrics for mesh networks

Abstract: Designing routing metrics is critical for performance in wireless mesh networks. The unique characteristics of mesh networks, such as static nodes and the shared nature of the wireless medium, invalidate existing solutions from both wired and wireless networks and impose unique requirements on designing routing metrics for mesh networks. In this paper, we focus on identifying these requirements. We first analyze the possible types of routing protocols that can be used and show that proactive hop-by-hop routing protocols are the most appropriate for mesh networks. Then, we examine the requirements for designing routing metrics according to the characteristics of mesh networks and the type of routing protocols used. Finally, we study several existing routing metrics, including hop count, ETX, ETT, WCETT and MIC in terms of their ability to satisfy these requirements. Our simulation results of the performance of these metrics confirm our analysis of these metrics.

Planar-adaptive routing: low-cost adaptive networks for multiprocessors

Abstract: Network throughput can be increased by allowing multipath, adaptive routing. Adaptive routing allows more freedom in the paths taken by messages, spreading load over physical channels more evenly. The flexibility of adaptive routing introduces new possibilities of deadlock. Previous deadlock avoidance schemes in k-ary n-cubes require an exponential number of virtual channels, independent of network size and dimension. Planar adaptive routing algorithms reduce the complexity of deadlock prevention by reducing the number of choices at each routing step. In the fault-free case, planar-adaptive networks are guaranteed to be deadlock-free. In the presence of network faults, the planar-adaptive router can be extended with misrouting to produce a working network which remains provably deadlock free and is provably livelock free. In addition, planar adaptive networks can simultaneously support both in-order and adaptive, out-of-order packet delivery.Planar-adaptive routing is of practical significance. It provides the simplest known support for deadlock-free adaptive routing in k-ary n-cubes of more than two dimensions (with k > 2). Restricting adaptivity reduces the hardware complexity, improving router speed or allowing additional performance-enhancing network features. The structure of planar-adaptive routers is amenable to efficient implementation.