— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
In this paper, we propose a novel Geographic Multicast routing Protocol (GMP) for wireless sensor networks1 . The proposed protocol is fully distributed and stateless. Given a set...
A discretized version of a continuous optimization problem is considered for the case where data is obtained from a set of dispersed sensor nodes and the overall metric is a sum o...
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due t...
Matthias R. Brust, Adrian Andronache, Steffen Roth...