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.

An evaluation of BMX6 for community wireless networks

Abstract: Nowadays, a growing number of communities of citizens build, operate and own open IP-based community wireless networks with thousands of low capacity nodes actively participating in routing the data traffic. This article focuses on one of their concerns, routing and its scalability, by presenting BatMan-eXperimental Version 6 (BMX6) and evaluating its performance. BMX6 is a low overhead and scalable mesh network routing protocol inspired by human networks. Its performance is evaluated in comparison with OLSR in terms of overhead and convergence time as networks grow in number of nodes and diameter. The results show that the convergence time and protocol overhead per node in BMX6 is not significantly affected by the addition of new nodes in contrast with OLSR, where both parameters can grow super-linearly. This confirms the excellent scalability of BMX6.

Method for channel assignment and routing for multi-radio wireless mesh networks

Abstract: A methodology for making joint channel and routing assignments in multi-radio wireless mesh networks that takes into account interference constraints, the number of channels in a network and the number of radio available at each mesh router, and maximizes bandwidth allocation subject to fairness constraints. In particular, the methodology provides for routing, channel assignment and link scheduling in multi-radio mesh wireless networks utilizing a constant factor approximation technique that models the interference and fairness constraints and is able to account for the number of radios at each of the wireless nodes of a wireless mesh network.

Multiple path routing in networks with inaccurate link state information

Abstract: We study a collection of K-shortest path routing schemes and investigate their performance under a diverse set of network topologies and traffic conditions. We subsequently demonstrate that K-shortest path routing offers a lower blocking probability and more balanced link utilisation than other routing methods. With the proposed approach, it is possible to reduce the frequency of link state exchange, and the incurred bandwidth overhead, without sacrificing the overall performance of the network.

An energy efficient and QoS aware multipath routing protocol for wireless sensor networks

Abstract: Enabling real time applications in Wireless Sensor Networks (WSNs) demands certain delay and bandwidth requirements which pose more challenges in the design of networking protocols. Therefore, enabling such applications in this type of networks requires energy and Quality of Service (QoS) awareness in different layers of the protocol stack. In many of these applications (such as multimedia applications, or real time and mission critical applications), the network traffic is mixed of delay sensitive and reliability demanding data. Hence, QoS routing becomes an important issue. In this paper, we propose an Energy Efficient and QoS aware multipath routing protocol (we name it shortly as EQSR) that maximizes the network lifetime through balancing energy consumption across multiple nodes, uses the concept of service differentiation to allow high important traffic (or delay sensitive traffic) to reach the sink node within an acceptable delay, reduces the end to end delay through spreading out the traffic across multiple paths, and increases the throughput through introducing data redundancy. EQSR uses the residual energy, node available buffer size, and Signal-to-Noise Ratio (SNR) to predict the best next hop through the paths construction phase. Based on the concept of service differentiation the EQSR protocol employs a queuing model to handle both real time and non-real time traffic. By means of computer simulations, we evaluated and studied the performance of our routing protocol and compared it with another protocol. Simulation results have shown that our protocol achieves lower average delay and higher packet delivery ratio than the other protocol.

Robust position-based routing for wireless ad hoc networks

Abstract: We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile hosts have been proposed in the literature. A typical assumption in these protocols is that all wireless nodes have uniform transmission regions modeled by unit disk centered at each wireless node. However, all these protocols are likely to fail if the transmission ranges of the mobile hosts vary due to natural or man-made obstacles or weather conditions. These protocols may fail because either some connections that are used by routing protocols do not exist, which effectively results in disconnecting the network, or the use of some connections causes livelocks. In this paper, we describe a robust routing protocol that tolerates up to roughly 40% of variation in the transmission ranges of the mobile hosts. More precisely, our protocol guarantees message delivery in a connected ad hoc network whenever the ratio of the maximum transmission range to the minimum transmission range is at most 2.