Sciweavers

119 search results - page 6 / 24
» Geographic Gossip: Efficient Averaging for Sensor Networks
Sort
View
INFOCOM
2009
IEEE
14 years 1 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— 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...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
MOBIHOC
2010
ACM
13 years 4 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
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...
Anne-Marie Kermarrec, Guang Tan
ICDCS
2006
IEEE
14 years 24 days ago
GMP: Distributed Geographic Multicast Routing in Wireless Sensor Networks
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...
Shibo Wu, K. Selçuk Candan
ICASSP
2011
IEEE
12 years 10 months ago
Ordering for energy efficient estimation and optimization in sensor networks
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...
Rick S. Blum
COMSWARE
2007
IEEE
14 years 1 months ago
Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks
—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...