Sciweavers

373 search results - page 60 / 75
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
SASN
2003
ACM
14 years 1 months ago
SECTOR: secure tracking of node encounters in multi-hop wireless networks
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
Srdjan Capkun, Levente Buttyán, Jean-Pierre...
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 8 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
DCOSS
2005
Springer
14 years 1 months ago
Analysis of Gradient-Based Routing Protocols in Sensor Networks
Abstract. Every physical event results in a natural information gradient in the proximity of the phenomenon. Moreover, many physical phenomena follow the diffusion laws. This natu...
Jabed Faruque, Konstantinos Psounis, Ahmed Helmy
BSN
2009
IEEE
149views Sensor Networks» more  BSN 2009»
14 years 2 months ago
Optimizing Interval Training Protocols Using Data Mining Decision Trees
— Interval training consists of interl intensity exercises with rest periods. This training well known exercise protocol which helps stre improve one’s cardiovascular fitness. ...
Myung-kyung Suh, Mahsan Rofouei, Ani Nahapetian, W...
MOBIHOC
2006
ACM
14 years 7 months ago
Adaptive splitting protocols for RFID tag collision arbitration
Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless c...
Jihoon Myung, Wonjun Lee