Sciweavers

373 search results - page 67 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
SENSYS
2010
ACM
13 years 5 months ago
A case against routing-integrated time synchronization
To achieve more accurate global time synchronization, this paper argues for decoupling the clock distribution network from the routing tree in a multihop wireless network. We find...
Thomas Schmid, Zainul Charbiwala, Zafeiria Anagnos...
IPSN
2010
Springer
14 years 2 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...
PERCOM
2007
ACM
14 years 7 months ago
A Context Middleware Based on Sensor and RFID Information
Pervasive computing environments have traditionally used distributed sensors to gather user context. EPC (Electronic Product Code) information extracted from RFID tags could addit...
Daeyoung Kim, Tomás Sánchez Ló...
TISSEC
2008
235views more  TISSEC 2008»
13 years 7 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...