Sciweavers

461 search results - page 60 / 93
» p-Percent Coverage Schedule in Wireless Sensor Networks
Sort
View
MOBIHOC
2006
ACM
16 years 1 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
IPPS
2007
IEEE
15 years 8 months ago
Using Coroutines for RPC in Sensor Networks
This paper proposes a concurrency model which integrates the asynchronous and event-driven nature of wireless etworks with higher-level abstractions that provide a more familiar p...
Marcelo Cohen, Thiago Ponte, Silvana Rossetto, Noe...
SENSYS
2010
ACM
14 years 11 months ago
Enix: a lightweight dynamic operating system for tightly constrained wireless sensor platforms
Enix is a lightweight dynamic operating system for tightly constrained platforms for wireless sensor networks (WSN). Enix provides a cooperative threading model, which is applicab...
Yu-Ting Chen, Ting-Chou Chien, Pai H. Chou
MOBIHOC
2009
ACM
15 years 8 months ago
Low-connectivity and full-coverage three dimensional wireless sensor networks
Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint ...
Xiaole Bai, Chuanlin Zhang, Dong Xuan, Jin Teng, W...
EURONGI
2006
Springer
15 years 5 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer