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.

Dynamic network evolution, with examples from AT&T's evolving dynamic network

Abstract: Dynamic network evolution achieves network performance improvement and cost reduction by taking advantage of new advanced technologies being introduced into the network to achieve greater network flexibility and efficiency. The author describes the evolution of dynamic networks, with examples drawn from the AT&T DNHR network deployed in the '80s and RTNR network deployed in the '90s. Dynamic traffic routing implements an integrated class-of-service routing feature for extending dynamic routing to emerging services, and provides a self-healing network capability to ensure a network-wide path selection and immediate adaptation to failure. Dynamic traffic routing brings benefits to customers in terms of new service flexibility and improved service quality and reliability, at reduced cost. >

Towards a logic for wide-area Internet routing

Abstract: Interdomain routing is a massive distributed computing task that propagates topological information for global reachability. Today's interdomain routing protocol, BGP4, is exceedingly complex because the wide variety of goals that it must meet---including fast convergence, failure resilience, scalability, policy expression, and global reachability---are accomplished by mechanisms that have complicated interactions and unintended side effects. The complexity of wide-area routing configuration and protocol dynamics requires mechanisms for expressing wide-area routing that adhere to a set of logical rules. We propose a set of rules, called the routing logic, which can be used to determine whether a routing protocol satisfies various properties. We demonstrate how this logic can aid in analyzing the behavior of BGP4 under various configurations. We also speculate on how the logic can be used to analyze existing configuration in real-world networks, synthesize network-wide router configuration from a high-level policy language, and assist protocol designers in reasoning about new routing protocols.

Delay-Minimized Routing in Mobile Cognitive Networks for Time-Critical Applications

Abstract: Cognitive radio significantly mitigates the spectrum scarcity for various applications built on wireless communication. Current techniques on mobile cognitive ad hoc networks (MCADNs), however, cannot be directly applied to time-critical applications due to channel interference, node mobility as well as unexpected primary user activities. In multichannel multiflow MCADNs, it becomes even worse because multiple links potentially interfere with each other. In this paper, we propose a delay-minimized routing (DMR) protocol for multichannel multiflow MCADNs. First, we formulate the DMR problem with the objective of delay minimization. Next, we propose a delay prediction model based on a conflict probability. Finally, we design the minimized path delay as a routing metric, and propose a heuristic joint routing and channel assignment algorithm to solve the DMR problem. Our DMR can find out the path with a minimal end-to-end (e2e) delay for time-critical data transmission. NS2-based simulation results demonstrate that our DMR protocol significantly outperforms related proposals in terms of average e2e delay, throughput, and packet loss rate.

Ant colony optimization based polymorphism-aware routing algorithm for ad hoc UAV network

Abstract: Ad hoc UAV network is characterized for its high node mobility, fast changing network topology, high frequency of interchanging data and complex application environment. The performance of traditional routing algorithms are so poor over aspects such as end to end delay, data packet delivery ratio and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. An ant colony optimization based polymorphism-aware routing algorithm--- APAR algorithm is proposed to solve the problems. This algorithm integrates ACO algorithm and dynamic source routing algorithm, the level of pheromone in routes which are gained in routing discovery process, is chosen as a standard to choose route and calculated by sensing the distance of a route, the congestion level of a route, and the stability of a route. A new volatilization mechanism of pheromone is also introduced to the algorithm. Meanwhile, the algorithm can make adjustment to the variance of UAV formation to prevent the compromise of the network performance. The simulation results show the APAR algorithm has superiority over traditional algorithms in data package delivery ratio, end to end delay, routing overhead and it is dependable in battlefield environment.

Tree-Based Routing Protocol for Cognitive Wireless Access Networks

Abstract: A cognitive wireless network is mostly deployed as wireless access network to optimize the utilization efficiency of radio resource by using multiple wireless systems. In such deployment, the network topology based on a tree structure can be efficiently and quickly constructed among the cognitive terminals (CT) by using the cognitive base station (CBS) as a root, to support the multihop communication. However, the original tree-based routing (TBR) protocol is designed to handle a single wireless system such as IEEE802.11a or lib, and thus can not be applied to the cognitive networks configured with multiple wireless systems, which may have the different bandwidths and transmission ranges. To solve this problem, we propose in this paper an efficient and practical protocol, called cognitive tree-based routing (CTBR) protocol, which extends and significantly enhances the ability of the known TBR protocol to enable it to support multiple wireless systems such as IEEE802.11g and IEEE802.11j. Simulation results reveal that our proposed CTBR protocol that utilizes the cognitive-aware link metric to select a route with the best end-to-end metric and an interface with the least local load for any source-destination pair, achieves much higher performance than the utilization of normal metric associated with the hop count.