A Vehicular Ad hoc Network (VANET) is a most popular application of Mobile Ad hoc Networks (MANETs). A lot of research work around the world is being conducted to design an efficient routing protocol for VANETs. In this paper, we examine the significance of Greedy Forwarding with Border Node based approach for VANETs. We propose a position based routing protocol to forward packet to the border ...

Recent vehicular routing proposals use real-time road traffic density estimates to dynamically select forwarding paths. Estimating the traffic density in vehicular ad hoc networks requires the transmission of additional dedicated messages increasing the communications load. These proposals are generally based on unicast sender-based forwarding schemes. The greedy nature of sender-based forwardi...

Applications that cater to the needs of disaster incident response generate large amount of data and demand large computational resource access. Such datasets are usually collected in the real-time at the incident scenes using different Internet of Things (IoT) devices. Hierarchical clouds, i.e., core and edge clouds, can help these applications’ real-time data orchestration challenges as well ...

In this paper, we propose an efficient Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm for WMSNs. TPGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs. It finds one shortest (near-shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near-shortest) node-disjoint routin...

Evolutionary Location Intelligence on implementing a position based routing, that make forwarding decision based on the geographical position of a packet's destination is concentrated in this paper. One distinct advantage of this model is not necessary to maintain explicit routes. Position based routing does scale well even if the network is highly dynamic. We use greedy forwarding approach wit...

In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose ...

Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In t...

We present a location-aware routing protocol called MGPSR (Modified Greedy Perimeter Stateless Routing) for Mobile Ad Hoc Networks. MGPSR offers the crucial correctness guarantee of the well known Greedy Perimeter Stateless Routing (GPSR) protocol; moreover, it possesses two additional attractive properties: (1) the modified Greedy forwarding scheme balances between the transmission power consu...

In this paper, we propose a novel routing algebra system to investigate greedy routing in geographic routing. Four important algebraic properties, respectively named mutex, transition, source independence and strict preference, are defined in this algebra system. Based on these algebraic properties, the necessary and sufficient conditions for the loop-free and consistent compatibilities of gree...

The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour ...