Sciweavers

279 search results - page 53 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
TWC
2008
201views more  TWC 2008»
13 years 7 months ago
A Novel Algorithm for Multipath Fingerprinting in Indoor WLAN Environments
Abstract--Positioning in indoor wireless environments is growing rapidly in importance and gains commercial interests in context-awareness applications. The essential challenge in ...
Shih-Hau Fang, Tsung-Nan Lin, Kun-Chou Lee
EWSN
2009
Springer
14 years 8 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
LATIN
2004
Springer
14 years 1 months ago
Global Synchronization in Sensornets
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource con...
Jeremy Elson, Richard M. Karp, Christos H. Papadim...
SUTC
2008
IEEE
14 years 2 months ago
Hovering Information - Self-Organising Information that Finds Its Own Storage
A piece of Hovering Information is a geo-localized information residing in a highly dynamic environment such as a mobile ad hoc network. This information is attached to a geograph...
Alfredo A. Villalba Castro, Giovanna Di Marzo Seru...