Sciweavers

373 search results - page 30 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
COMCOM
2006
114views more  COMCOM 2006»
13 years 8 months ago
A comparison of epidemic algorithms in wireless sensor networks
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is nece...
Mert Akdere, Cemal Çagatay Bilgin, Ozan Ger...
TC
2011
13 years 2 months ago
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
Xiang-Yang Li, Yajun Wang, Yu Wang
DCOSS
2005
Springer
14 years 1 months ago
Macro-programming Wireless Sensor Networks Using Kairos
The literature on programming sensor networks has focused so far on g higher-level abstractions for expressing local node behavior. Kairos is a natural next step in sensor network ...
Ramakrishna Gummadi, Omprakash Gnawali, Ramesh Gov...
ISPDC
2010
IEEE
13 years 5 months ago
A Distributed Wakening Based Target Tracking Protocol for Wireless Sensor Networks
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
Aysegul Alaybeyoglu, Orhan Dagdeviren, Aylin Kanta...
GLOBECOM
2010
IEEE
13 years 6 months ago
Compact Wakeup Scheduling in Wireless Sensor Networks
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state...
Junchao Ma, Wei Lou