Mobile Wireless Sensor Networks (MWSNs) is one of the rising technologies for numerous areas of application, such as environmental monitoring, industrial sensing and diagnostics and battlefield awareness. Such wireless sensor nodes are often deployed in remote locations. Thus, energy efficient and reliable data forwarding is important because each node has limited resources. In this paper we pr...

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

In wireless sensor networks, an important issue of Geographic Routing is “local minimum” problem, which is caused by “hole” that blocks the greedy forwarding process. Existing geographic routing algorithms use perimeter routing strategies to find a long detour path when such a situation occurs. To avoid the long detour path, recent research focuses on detecting the hole in advance, then the nod...

The link is easy to break due to the high mobility of nodes and the constraint of road in a VANET. In this paper, we present an efficient traffic geographic routing (ETGR) with static node assistance. It includes road information collection, road weight information dissemination, the efficient traffic geographic routing and the duration estimation of the path. Each static node stores the inform...

One of the key challenges in geographic routing is how to deal with dead-ends, where greedy routing fails to find a neighbor node which is closer to the destination. Most existing geographic routing algorithms just switch to the deterministic face routing or limits its face searching range. In this paper, we demonstrate that we can improve routing performance by considering local connectivity s...

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