With cached greedy geocast, we propose an enhanced forwarding scheme for geocast especially in highly mobile ad hoc networks. We will show, that a cache for presently unforwardable messages during what we call the line forwarding, can significantly improve the geocast delivery success ratio, especially in sparse peopled networks with high node velocities. Therefore, we introduce and examine two...

The authors propose three variants of distributed and stateless forwarding strategies for wireless sensor networks, namely greedy minimum energy consumption forwarding protocol (GMFP), lifetime maximising GMFP (LM-GMFP) and variance minimising GMFP (VAR-GMFP), which aim at maximising the network lifetime while achieving a high forwarding success rate. GMFP selects a forwarding node that minimis...

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

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

In recent years, the general interest in routing for vehicular ad hoc networks (VANETs) has increased notably. Many proposals have been presented to improve the behavior of the routing decisions in these very changeable networks. In this paper, we propose a new routing protocol for VANETs that uses four different metrics. which are the distance to destination, the vehicles' density, the vehicle...

The problem of the capacity of a massively dense wireless multihop network can be broken down into separate problems at macroscopic and microscopic levels. At the microscopic level, from the local perspective, the network appears like an infinite plane with traffic that is uniform but flowing in many directions. Previous studies have assumed that it is sufficient to find the maximum sustainable...

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

A wireless sensor network needs a suitable multihop routing protocol to facilitate the communication between arbitrary sensor nodes. Position-based routing protocols are attractive for large-scale sensor networks due to their location awareness and scalability. A large number of position-based routing protocols use the greedy forwarding strategy. This paper presents an efficient implementation ...

We present Obstacle-aware Virtual Circuit geographic Routing (OVCR), a novel routing mechanism for obstacle-aware wireless sensor networks that uses the obstacle-free path computed by the sink to make the greedy forwarding of geographic routing dependable. OVCR discovers obstacle-free paths by the powerful sink as obstacles are detected. To bypass obstacles, the information of obstacle-free pat...