A novel dead end and packet loss avoidance scheme for geographic forwarding in manets

Abstract

Routing has always been one of the key challenges in mobile ad hoc networks. Ad hoc networks prefer reactive routing over proactive routing due to the rapid changes in nodes position. Geographic position based routing is a convenient method to route a packet from a source to a destination based on the local information alone. Geographic forwarding implements a greedy routing technique that selects a forwarding node that is closer to the destination than itself. If this fails the packet is trapped in a dead end caused by holes and/or obstacles. In this paper, we present a routing scheme, which avoid dead ends and also packet loss. This scheme finds an efficient forwarding node which is a reliable non concave node with high residual energy levels to forward an incoming packet. Through simulation experiments it is proved that our scheme solves the dead end problem and also packet loss.

SD-IoV: SDN enabled routing for internet of vehicles in road-aware approach

“…Some of the protocols takes the shortest path to forward the data packet, however, selection of the shortest path is not always feasible due to swift vehicle topology changes with short link lifetime. Morover, a number of protocols follows greedy forward approach which may results in dead end (Bazzi et al 2017;Muralidhar and Geethanjali 2013). Current routing protocols of VANETs can be classified into following different categories based on the type of information needed: Positions based protocols, geographical based protocols, map based protocols, road based protocols and topology based protocols.…”