Sciweavers

207 search results - page 17 / 42
» Random Asynchronous Wakeup Protocol for Sensor Networks
Sort
View
TMC
2010
152views more  TMC 2010»
13 years 5 months ago
On Multihop Distances in Wireless Sensor Networks with Random Node Locations
—Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance info...
Serdar Vural, Eylem Ekici
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 27 days ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
TSP
2008
118views more  TSP 2008»
13 years 7 months ago
Channel-Aware Random Access Control for Distributed Estimation in Sensor Networks
A cross-layered slotted ALOHA protocol is proposed and analyzed for distributed estimation in sensor networks. Suppose that the sensors in the network record local measurements of ...
Y.-W. P. Hong, Keng-U Lei, Chong-Yung Chi
OPODIS
2007
13 years 8 months ago
Deterministic Communication in the Weak Sensor Model
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
14 years 26 days ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...