Lifetime optimization and security are two conflicting design issues for multi-hop wireless
sensor networks (WSNs) with non-replenishable energy resources. In this paper, we first …

The usability of wireless sensor networks in modern applications requires the fulfillment of
dynamic Quality of Service (QoS) requirements that can only be met in a reactive manner by …

Greedy Forward is a technique for data routing in Wireless Sensor Networks (WSNs) in
which data packets are forwarded to the node that is geographically closer to the destination …

This paper addresses the data search problem in large-scale highly mobile and dense
wireless networks. Current wireless network data search systems are not suitable for large …

The data collection problem is one of the most important issues in Wireless Sensor Networks
(WSNs). Constructing a tree from all sensor nodes to the sink node is the simplest way, but …

Nowadays the interest of research by the researchers is dominating in various areas of
wireless sensor networks (WSNs) domain. The task of reducing energy consumption and …

Geographic routing is a scalable routing scheme for wireless networks, where nodes make
local routing decisions using position information. Cooperative transmissions utilize spatial …

The latest generations of road vehicles have seen a tremendous development in onboard
electronic systems, which control increasingly large parts of the vehicle's functionality …

In this paper we present a novel combinatorial approach for geographic routing with delivery
guarantees. Proposed algorithm can be seen as a variant of GFG (Greedy Face Greedy of …

Geographic routing is an appealing routing strategy that uses the location information of the
nodes to route the data. This technique uses only local information of the communication …