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.

On Optimising Route Discovery in Absence of Previous Route Information in MANETs

Abstract: This paper present a new routing protocol for Ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing such as AODV with an efficient route discovery algorithm called Tree-based Optimized Flooding (TOF) to improve scalability of Ad hoc networks when there is no previous knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimized by selectively flooding the network through a limited set of nodes, referred to as branching-nodes. The theoretical analysis and simulation results showed that OTRP outperforms AODV, DYMO, and OLSR and it reduces overheads as number of nodes and traffic increase.

Robust Routing and Scheduling in Wireless Mesh Networks under Dynamic Traffic Conditions

Abstract: Joint routing-and-scheduling has been considered in wireless mesh networks for its significant performance improvement. While existing work assumes it, accurate traffic information is usually not available due to traffic dynamics, as well as inaccuracy and delay in its measurement and dissemination. In addition, the joint routing and scheduling usually requires a centralized controller to calculate the optimal routing and scheduling and distribute such policies to all the nodes. Thus, even if the accurate traffic information is always available, the central controller has to compute the routing and scheduling repeatedly because the traffic demands change continuously. This leads to prohibitive computation and distribution overhead. Therefore, in this paper, we propose a joint routing-scheduling scheme that achieves robust performance under traffic information uncertainty. In particular, it achieves worst-case optimal performance under a range of traffic conditions. This unique feature validates the use of centralized routing and scheduling in wireless mesh networks. As long as the traffic variation is within the estimation range, the routing and scheduling do not need to be recomputed and redistributed. Through extensive simulations, we show that our proposed scheme meets the objective (i.e., optimizes the worst-case performance). Moreover, although it only guarantees the worst-case performance in theory, its average performance is also good. For example, our proposed scheme can perform better than a fixed optimal routing and scheduling scheme in more than 80 percent of 500 random traffic instances. Our scheme provides insights on the desired properties of multipath routing, namely, spatial reuse and load balancing.

Using Repeated Games to Design Incentive-Based Routing Systems

Abstract: Incorporating pricing information in routing systems has been explored in various contexts and fashions. In this paper we examine certain fundamental properties important in the design of such a routing protocol. The importance of these properties is derived from the underlying economic factors governing the behavior of the autonomous players. We view the exchange of pricing information at an interconnect as a repeated game between the relevant players. For example, multiple ISPs competing for the business of a CDN. With this model, we see that various protocol parameters—such as protocol period, minimum bid size, and unit of measure— have a significant and important impact on the equilibrium outcome. We show how these parameters can be used to address the problem of the repeated dynamic and further that these conclusions are robust to a variety of practical assumptions including asynchronous play and heterogeneous networks. These often surprising results enable protocol designers to appreciate and leverage these seemingly benign parameters, a result that has direct practical importance.

A link-quality and congestion-aware cross layer metric for multi-hop wireless routing

Abstract: Wireless networks suffer from random variations in channel and network condition. This leads to poor performance in multi-hop wireless networks specially with a conventional non-flexible routing. To cope with instability of wireless links, a cross-layer routing that supports adaptivity and optimization across lower layers of protocol stack is needed. Cross layer routing intends to play an essential role in improving the performance of wireless networks but requires a careful attention on the choice of the metric. In this paper we propose a new link-quality and congestion aware metric for multi-hop wireless routing which is obtained from MAC layer. We show that still having a path with reasonable length our proposed metric improves the performance of routing in terms of end-to-end delay and throughput in comparison to minimum-hop count metric