Improvement of OLSR Protocol Using the Hello Message Scheme Based on Neighbors Mobility

The main idea behind the routing protocols based on multi-hop is to find the required path from the source node to the destination. Since those protocols do not consider the node mobility in their mechanism, we propose to enhance the routing protocols benefiting from localization node and predict the time needed for neighbors to go out of range for a node to increase the robustness of the protocols with the mobility. Firstly, we propose an efficient scheme to predict the time needed for the node to quite the neighbor range. Secondly, we conduct a set of simulations to compare the performance of our proposal against OLSR standard.

Towards a Better Approach for Link Breaks Detection and Route Repairs Strategy in AODV Protocol

This paper describes a parameterized approach to the Ad Hoc On-Demand Distance Vector (AODV) routing protocol using a network-simulator 2 (ns2). By utilizing two AODV’s protocol functions, which are HELLO messages and local route repair, we explore the more flexible approach on these two important functions, rather than a fixed setting within the default AODV protocol. HELLO message is used to detect the broken link, while the local route repair in AODV is used to fix and discover alternative routes in the event of route failure. In this paper, two functions to optimize AODV performance have been utilized. The first is link break detection time (Llb), using the HELLO message to detect link failure, and the second is link break position parameter (Lbp) for AODV’s local route repair. The results show that the default AODV setting does not yield the best results for most defined network scenarios. In some cases, improvement compared to the default setting can be as high as 38%, for local route repair strategies. This paper presents a potential flexible and parameterized approach for dealing with link breaks and route repairing strategies for AODV protocol.

Adapting AODV with High-Throughput for AMI Smart Meter Networks

All routing protocols are focused on how to transfer data more efficiently from the source to the destination. But various circumstances have diverse requirements, so the method adopts to achieve this is different. In this paper, we introduce the situation of AODV running in the AMI smart-meter reallity environment and point out the bottleneck of throughput as the networks grow larger. Then, “expected transmission count” metric is presented, which has been proven in other classic routing protocol for high-throughput improvement. After analysing the applicability of ETX metric with AODV, we describe the new AODV with four major changes listed as follow: router table, hello message, neighbor-node table and something related RREQ, RREP, RERR messages. Finally, we compare the results with the traditional AODV. Simulation results in NS-2 show AODV-ETX has better throughput than the traditional one.