Sciweavers

933 search results - page 158 / 187
» Cluster-Swap: A Distributed K-median Algorithm for Sensor Ne...
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 7 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
INFOCOM
2007
IEEE
14 years 2 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
DEXAW
2005
IEEE
263views Database» more  DEXAW 2005»
14 years 1 months ago
Energy Aware Routing Protocol for Heterogeneous Wireless Sensor Networks
In this paper we present Energy Aware Random Asynchronous Wakeup (RAW-E), a novel crosslayer power management and routing protocol for heterogeneous wireless sensor and actor netw...
Vamsi Paruchuri, Arjan Durresi, Leonard Barolli
MOBIWAC
2009
ACM
14 years 13 days ago
Adaptive, direction-aware data dissemination for diverse sensor mobility
We consider sensor networks where the sensor nodes are attached on entities that move in a highly dynamic, heterogeneous manner. To capture this mobility diversity we introduce a ...
Azzedine Boukerche, Dionysios Efstathiou, Sotiris ...
SENSYS
2003
ACM
14 years 1 months ago
CODA: congestion detection and avoidance in sensor networks
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is l...
Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbe...