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.

Simulation based Performance Comparison of AODV, FSR and ZRP Routing Protocols in MANET

Abstract: Mobile Ad hoc NETwork (MANET) is a collection of mobile nodes that are arbitrarily located so that the interconnections between nodes are dynamically changing. In MANET mobile nodes forms a temporary network without the use of any existing network infrastructure or centralized administration. A routing protocol is used to find routes between mobile nodes to facilitate communication within the network. The main goal of such an ad hoc network routing protocol is to establish correct and efficient route between a pair of mobile nodes so that messages delivered within the active route timeout interval. Route should be discovered and maintained with a minimum of overhead and bandwidth consumption. This paper presents performance evaluation of three different routing protocols i.e. Ad hoc OnDemand Distance Vector (AODV), Fisheye State Routing (FSR) and Zone Routing Protocol (ZRP) in variable pause times and variable number of nodes. We have used random waypoint mobility model to design the network and performed simulations by using QualNet version 5.0 Simulator [1] from Scalable Networks. Performance of AODV, FSR and ZRP is evaluated based on Average end-to-end delay, Packet delivery ratio, Throughput and Average Jitter.

A multipath energy-conserving routing protocol for wireless ad hoc networks lifetime improvement

Abstract: Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to the variability of network changes makes them difficult to use. Moreover, conserving energy is a critical concern in the design of routing protocols for ad hoc networks because most mobile nodes operate with limited battery capacity, and the energy depletion of a node affects not only the node itself but also the overall network lifetime. In all proposed single-path routing schemes, a new path-discovery process is required once a path failure is detected, and this process causes delay and wastage of node resources. A multipath routing scheme is an alternative to maximize the network lifetime. In this paper, we propose an energy-efficient multipath routing protocol, called ad hoc on-demand multipath routing with lifetime maximization (AOMR-LM), which preserves the residual energy of nodes and balances the consumed energy to increase the network lifetime. To achieve this goal, we used the residual energy of nodes for calculating the node energy level. The multipath selection mechanism uses this energy level to classify the paths. Two parameters are analyzed: the energy threshold β and the coefficient α. These parameters are required to classify the nodes and to ensure the preservation of node energy. Our protocol improves the performance of mobile ad hoc networks by prolonging the lifetime of the network. This novel protocol has been compared with other protocols: ad hoc on-demand multipath distance vector (AOMDV) and ZD-AOMDV. The protocol performance has been evaluated in terms of network lifetime, energy consumption, and end-to-end delay.

An energy efficient routing protocol for device-to-device based multihop smartphone networks

Abstract: Device-to-device (D2D) communication is the need of the hour in the domain of next generation wireless networking and in the rapidly evolving smartphone network world. D2D technology facilitates mobile users to communicate with each other directly, bypassing the cellular base stations. As a popular D2D technique, WiFi-Direct is also a budding new technology that has the ability to set up wireless communications between a group of smartphones. While single-hop D2D based networks have been promising and energy efficient, multi-hop D2D based networks, though demanded in some emerging applications, are not well studied. In this paper, we elaborate the concept of multihop smartphone networks based on WiFi-Direct and propose an energy efficient cluster-based routing protocol, QGRP, to address the energy issue of increasing importance due to high energy costs of smartphones. Simulations demonstrate that QGRP can save significant amounts of energy compared to the cases without QGRP.

Automatic configuration of an address allocation mechanism in a computer network

Abstract: The invention provides a method, computer program and system for automatic and dynamic configuration of an address allocation mechanism in a computer network. The invention provides for allocating network addresses to the devices in the computer network by obtaining routing protocol messages (301), the routing protocol messages being exchanged in the computer network for routing purposes. Then the invention obtains network prefix addresses that correspond to sub-networks (501), the network prefix addresses being obtained using the routing protocol messages. Thereafter, the invention determines a range of valid network addresses for the devices using the network prefix addresses (503).The current invention provides a method and system for automatic configuration of an address allocation mechanism. The method uses routing protocol messages in order to configure the address allocation mechanism with a range of valid IPv4 addresses. Routing protocol messages include information about network prefix addresses corresponding to the sub-network to which the routing protocol message belongs. The current invention extracts the network prefix addresses, and then uses it to determine range of valid IPv4 addresses for the hosts. These valid IPv4 network addresses can then be allocated to the hosts requiring IPv4 network addresses. The current invention also continuously monitors the routing protocol messages to dynamically adapt the address allocation mechanism with changes in the addressing configuration of the computer network.