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.

Routing Strategies in Multihop Cooperative Networks

Abstract: The fading characteristics and broadcast nature of wireless channels are usually not fully considered in the design of routing protocols for wireless networks. In this paper, we address the routing issue from a link layer point of view. We focus on a multihop network with multiple relays at each hop and three routing strategies are designed to achieve the full diversity gain provided by the cooperation among relays. In particular, an optimal routing strategy is proposed to minimize the end-to-end outage, which requires the channel information of all the links and serves as a performance bound. An ad-hoc routing strategy is then proposed based on a hop-by-hop relay selection, which can be easily implemented in a distributed way. The outage analysis shows that the performance gap between these two routing strategies increases with the number of hops. To achieve a good complexity-performance tradeoff, a N-hop routing strategy is further proposed, where a joint optimization is performed every N hops. Simulation results are presented which verify the analysis.

Dominating Set and Network Coding-Based Routing in Wireless Mesh Networks

Abstract: Wireless mesh networks are widely applied in many fields such as industrial controlling, environmental monitoring, and military operations. Network coding is promising technology that can improve the performance of wireless mesh networks. In particular, network coding is suitable for wireless mesh networks as the fixed backbone of wireless mesh is usually unlimited energy. However, coding collision is a severe problem affecting network performance. To avoid this, routing should be effectively designed with an optimum combination of coding opportunity and coding validity. In this paper, we propose a Connected Dominating Set (CDS)-based and Flow-oriented Coding-aware Routing (CFCR) mechanism to actively increase potential coding opportunities. Our work provides two major contributions. First, it effectively deals with the coding collision problem of flows by introducing the information conformation process, which effectively decreases the failure rate of decoding. Secondly, our routing process considers the benefit of CDS and flow coding simultaneously. Through formalized analysis of the routing parameters, CFCR can choose optimized routing with reliable transmission and small cost. Our evaluation shows CFCR has a lower packet loss ratio and higher throughput than existing methods, such as Adaptive Control of Packet Overhead in XOR Network Coding (ACPO), or Distributed Coding-Aware Routing (DCAR).

A General Interference-Aware Framework for Joint Routing and Link Scheduling in Wireless Mesh Networks

Abstract: Joint design and optimization of traditionally independent problems such as routing and link scheduling have recently become one of the leading research trends in wireless mesh networks. Although technically challenging, cross-layering is, in fact, expected to bring significant benefits from the network resource exploitation standpoint to achieve high system utilization. In this article we propose a versatile framework for joint design of routing and link scheduling, introducing the notion of link activation constraints, which are related to the transceiver capability and the broadcast nature of the wireless medium. To this end, we introduce a taxonomy of wireless interference models to harmonize existing approaches presented in the literature. Finally, we evaluate the impact on network capacity of the various interference models when optimal joint routing and link scheduling are employed.

HEAT: Scalable Routing in Wireless Mesh Networks Using Temperature Fields

Abstract: Existing unicast routing protocols are not suited well for wireless mesh networks as in such networks, most traffic flows between a large number of mobile nodes and a few access points with Internet connectivity. In this paper, we propose HEAT, an anycast routing protocol for this type of communication that is designed to scale to the network size and to be robust to node mobility. HEAT relies on a temperature field to route data packets towards the Internet gateways, as follows. Every node is assigned a temperature value, and packets are routed along increasing temperature values until they reach any of the Internet gateways, which are modeled as heat sources. Our major contribution is a distributed protocol to establish such temperature fields. The distinguishing feature of our protocol is that it does not require flooding of control messages. Rather, every node in the network determines its temperature considering only the temperature of its direct neighbors, which renders our protocol particularly scalable to the network size. We analyze our approach and compare its performance with OLSR through simulations with Glomosim. We use realistic mobility patterns extracted from geographical data of large Swiss cities. Our results clearly show the benefit of HEAT versus OLSR in terms of scalability to the number of nodes and robustness to node mobility. The packet delivery ratio with HEAT is more than two times higher than OLSR in large mobile scenarios and we conclude that HEAT is a suitable routing protocol for city-wide wireless mesh networks.