Sciweavers

424 search results - page 69 / 85
» Sensor Networks for Everyday Use: The BL-Live Experience
Sort
View
SENSYS
2003
ACM
14 years 1 months ago
Matching data dissemination algorithms to application requirements
A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This approach is encouraged by device...
John S. Heidemann, Fabio Silva, Deborah Estrin
MOBIHOC
2005
ACM
14 years 8 months ago
Sextant: a unified node and event localization framework using non-convex constraints
Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, en...
Emin Gün Sirer, Rohan Murty, Saikat Guha
SOCIALCOM
2010
13 years 6 months ago
Detecting Social Situations from Interaction Geometry
A novel method for quantitatively measuring social interactions on small temporal and spatial scales on the basis of interaction geometry (reduced to the parameters interpersonal d...
Georg Groh, Alexander Lehmann, Jonas Reimers, Marc...
MOBIHOC
2006
ACM
14 years 8 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
EWSN
2008
Springer
14 years 8 months ago
Characterizing Mote Performance: A Vector-Based Methodology
Sensors networks instrument the physical space using motes that run network embedded programs thus acquiring, processing, storing and transmitting sensor data. The motes commercial...
Martin Leopold, Marcus Chang, Philippe Bonnet