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.

PlayNCool: Opportunistic network coding for local optimization of routing in wireless mesh networks

Abstract: This paper introduces PlayNCool, an opportunistic protocol with local optimization based on network coding to increase the throughput of a wireless mesh network (WMN). PlayNCool aims to enhance current routing protocols by (i) allowing random linear network coding transmissions end-to-end, (ii) recoding at intermediate nodes, and more importantly (iii) the identification and selection of helpers for each individual link. PlayNCool is easy to implement, compatible with existing routing protocols, and relies on simple intuition and closed-form, local optimization techniques. The intuition behind our protocol is that each helper to a link in a multi-hop path reinforces that link by listening to coded packets transmitted in the link and by judiciously choosing when to start transmitting to make the data exchange faster and more efficient. This paper pays special attention to techniques to determine how much a helper should wait before springing into action based on channel conditions for the optimization of a single link, i.e., the helper will play it cool by only speaking after it has heard enough to be truly useful. These techniques constitute a key feature of PlayNCool and are applicable in large scale mesh networks. We show that PlayNCool can provide gains of more than 3x in individual links, which translates into a large end-to-end throughput improvement, and that it provides higher gains when more nodes in the network contend for the channel at the MAC layer, making it particularly relevant for dense mesh networks.

NovaCube: A low latency Torus-based network architecture for data centers

Abstract: This paper presents the design, analysis, and implementation of a novel data center network architecture, named NovaCube. Based on regular Torus topology, NovaCube is constructed by adding a number of most beneficial jump-over links, which offers many distinct advantages and practical benefits. Moreover, in order to enable NovaCube to achieve its maximum theoretical performance, a probabilistic oblivious routing algorithm PORA is carefully designed. PORA is a both deadlock and livelock free routing algorithm, which achieves near-optimal performance in terms of average routing path length with better load balancing thus leading to higher throughput. Theoretical derivation and mathematical analysis further prove the good performance of NovaCube and PORA.

Analytical Evaluation of Directional-Location Aided Routing Protocol for VANETs

Abstract: Vehicular Ad-hoc Networks (VANETs) are now considered as a way to realize active safety, by providing the position information of each other or the possible danger warning by wireless vehicular communications. Multi-hop data delivery in VANETs is a challenging task, since it encounters rapid changes in network topology and frequent fragmentation in the network. Because of these characteristics, routing algorithms based on greedy forwarding are known to be very suitable for VANETs. The design and implementation of efficient and scalable routing protocols for VANETs is a challenging task due to high dynamics and mobility constraints. In this paper, we have worked on a routing protocol over VANETs to efficiently broadcast the information for the sake of active safety applications, such as the positions and the directions of the vehicles. Therefore, we have explained a position-based routing protocol called directional-location aided routing (D-LAR) with (1) location-aided routing utilizes location information using GPS to limit the area for discovering a new route to a smaller request zone and (2) directional routing having direction closest to the line drawn between source and destination. D-LAR protocol is a greedy based approach to forward packet to the node present in request zone part of sender's transmission range as a most suitable next-hop node. Further, we have justified the feasibility of D-LAR routing protocol for VANETs. Through analytical analysis we have also given the relationship among the average number of hop counts, link lifetime, and path throughput metrics for the protocol. Finally, simulation results show that the proposed formulation can be used to evaluate path throughput accurately in the network.

AODVCS, a new bio-inspired routing protocol based on cuckoo search algorithm for mobile ad hoc networks

Abstract: Mobile ad hoc networks (MANETs) are becoming an emerging technology that offer several advantages to users in terms of cost and ease of use. A MANET is a collection of mobile nodes connected by wireless links that form a temporary network topology that operates without a base station and centralized administration. Routing is a method through which information is forwarded from a transmitter to a specific recipient. Routing is a strategy that guarantees, at any time, the connection between any two nodes in a network. In this work, we propose a novel routing protocol inspired by the cuckoo search method. Our routing protocol is implemented using Network simulator 2. We chose Random WayPoint model as our mobility model. To validate our work, we opted for the comparison with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters: packet delivery ratio and end-to-end delay (E2ED).

Robust Ad Hoc Routing for Lossy Wireless Environment

Abstract: Random loss in wireless ad hoc networks derives from two main causes: lossy wireless links and node mobility. Packet loss and link breakage can dramatically degrade the performance of any network protocol thus making routing in mobile ad hoc networks extremely challenging. In this study we focus on applications that exhibit mobility and random packet loss. Possible scenarios include search and rescue, urban homeland defense, small unit battlefield operations, and car to car network gaming. We explore the robustness of the routing solutions in regards to speed (up to vehicular ranges), random packet loss, and traffic load. Traditional routing protocol candidates are proactive, reactive and location-assisted (i.e., geographic) such as OLSR, AODV and GPSR. However, the performances of each protocol varies significantly with mobility and random loss shown in the paper. In our approach we seek to a hybrid solution AODV-DFR (AODV with Directional Forward Routing) that combines the positive aspects of previously proposed schemes. AODV-DFR utilizes the positive features of both proactive and reactive routing schemes, in addition, it borrows the greedy forwarding concept found in geo-routing. This allows for AODV-DFR to automatically find good candidates for packet forwarding in case of route breakage. Greedy forwarding here takes the form of "directional forwarding". Each node keeps a gradient direction toward the destination. This direction is dynamically refreshed based on periodic, proactive updates issued by the destination. Simulation studies show that AODV-DFR outperforms conventional protocols and previous hybrid routing solutions across a wide range of network characteristics.