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 energy-efficient multi-hop routing protocol based on grid clustering for wireless sensor networks

Abstract: Due to the limited energy of wireless sensor network nodes, it is necessary to reduce and balance the energy consumption of the nodes in order to extend the network lifetime. Clustering routing algorithm is a very effective solution to the problem. However, in existing clustering algorithms based on uniform and non-uniform clustering routing protocols, the heavy burden of cluster heads may lead to the rapid death of the nodes, and the location of functional nodes within clusters is not carefully considered during clustering. The unbalanced energy consumption of sensor nodes shortens the network lifetime. In this paper, we propose an energy-efficient multi-hop routing algorithm based on grid clustering to tackle the problems. In order to minimize the energy consumption, the algorithm optimizes the electoral process of functional nodes by combining various factors such as nodes' energy, nodes' location, and levels of the network area. Communication nodes are introduced to select cluster head nodes and transfer data between clusters via multi-hop routing, easing the burden of cluster heads. Simulation results show that the network lifetime of the proposed EEMRP protocol is extended by 17.5---25.2%, as compared to other algorithms. Specially, EEMRP has better performance of energy balance and efficiency in the larger network area.

Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN)

Abstract: Routing in Intermittently Connected Networks (ICN) is a challenging problem due to the time varying nature of network connectivity. In this work, we focus on a special class of ICN formed by mobile ad hoc users called ICMAN. A recent study of wireless users' mobility traces revealed that users usually move between a small set of socially significant places called "hubs" to form so-called "sociological orbits" [6]. To exploit the knowledge about such mobility profiles, we propose a hub-level routing method, and two versions of user-level routing methods. We compare these approaches with Epidemic routing [21] to highlight the advantages of sociological orbit aware routing within ICMAN in terms of achieving a higher throughput and a lower overhead.

Simulation and Performance Analysis of MP-OLSR for Mobile Ad Hoc Networks

Abstract: Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically exchange data without reliance on a fixed base station or a wired backbone network, which makes routing a crucial issue for the design of a ad hoc networks. In this paper we discussed a hybrid multipath routing protocol named MP-OLSR. It is based on the link state algorithm and employs periodic exchange of messages to maintain topology information of the networks. In the mean time, it updates the routing table in an on-demand scheme and forwards the packets in multiple paths which have been determined at the source. If a link failure is detected, the algorithm recovers the route automatically. Concerning the instability of the wireless networks, the redundancy coding is used to improve the delivery ratio. The simulation in NS2 shows that the new protocol can effectively improve the performance of the networks.

Routing Packets into Wireless Mesh Networks

Abstract: Wireless mesh networks are a promising way to provide Internet access to fixed and mobile wireless devices. In mesh networks, traffic between mesh nodes and the Internet is routed over mesh gateways. On the forward path, i.e., from mesh nodes to Internet nodes, for all mesh nodes only route information for one destination, the gateways, needs to be maintained. However, on the backward path from the Internet to mesh nodes, an individual route for every mesh node is required. In this paper we investigate protocols for backward path routing in wireless mesh networks. Using simulation experiments with realistic mobility patterns of pedestrians and cars in cities, we compare three protocols, each of which represents a routing protocol family: (i) AODV with an extension for mesh networks, a reactive routing protocol, (ii) FBR, a proactive routing protocol, and (iii) GSR, a source routing protocol. Our results indicate that FBR has the highest packet delivery ratio but is not scalable to the network size. The extended AODV seems to be neither scalable nor does it achieve a high packet delivery ratio. A good compromise is provided by GSR, which is the most scalable to the network size and still achieves a high packet delivery ratio.