In recent days, vehicles usage and speed are highly increased that leads to an increase in energy consumption, delay, overhead the network. this paper, a novel trajectory is introduced achieve maximum reliability namely trust mobility-based evaluation for intelligent collaborative (TMIC)-UAVs assisted VANETs. Reactive multipath greedy routing protocol (RMGR) hybrid it combination of ad hoc on-d...

This material is based upon work supported by the U. S. Army Research Office under grant number W911NF-05-1-0573. Abstract—Node mobility is generally regarded as a hazard for geographic routing, causing a degradation of performance or even persistent routing failures. In this paper we pursue an opposite view where it is possible to take advantage of mobility to enhance greedy forwarding in geog...

Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy algorithms to forward packet and try to find a route by the right-hand rule in perimeter mode when it encounters a local maximum. These protoco...

We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherits the best of the three well-known techniques for routing in ad-hoc networks, viz., greedy forwarding, reactive route discovery, and source routing. In OGPR protocol, source nodes utilize the geographic-topology inform...

1 — Because sensor nodes operate on power limited batteries, sensor functionalities have to be designed carefully. In particular, designing energy-efficient packet forwarding is important to maximize the lifetime of the network and to minimize the power usage at each node. This paper presents a Geographic Energy-Aware Multipath Stream-based (GEAMS) routing protocol for WMSNs. GEAMS routing deci...

Delay Tolerant Network(DTN) is a wireless network in which there will be no connectivity exists between source and destination in a given time. Due to the absence of fully connected path between the source and destination, there will be a problem to route a packet from one node to another in DTN .Similarity based techniques relying on contact patterns among nodes provide routing in DTN provides...

Routing in ad-hoc sensor networks is a complicated task because of many reasons. The nodes are low powered and they cannot maintain routing tables large enough for well-known routing protocols. Because of that, greedy forwarding at intermediate nodes is desirable in ad-hoc networks. Also, for traffic engineering, multipath capabilities are important. So, it is desirable to define routes at the ...

Geographic routing algorithms for ad-hoc networks exhibit better scalability compared to topology-based routing algorithms. However, geographic routing algorithms assume a cooperative network setting for ad-hoc networks. In this paper, we present TGF, a truthful geographic forwarding algorithm for ad-hoc networks that consist of selfish nodes. These selfish nodes forward data packets from other...

the ability to discover services in mobile ad hoc network (manet) is a major prerequisite. cluster basedcross layer intelligent service discovery for manet (cbisd) is cluster based architecture, caching ofsemantic details of services and intelligent forwarding using network layer mechanisms. the cluster basedarchitecture using semantic knowledge provides scalability and accuracy. also, the mini...

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...