Sciweavers

704 search results - page 40 / 141
» Novel Algorithms for the Network Lifetime Problem in Wireles...
Sort
View
MOBIHOC
2006
ACM
14 years 3 months ago
Wakeup scheduling in wireless sensor networks
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
Abtin Keshavarzian, Huang Lee, Lakshmi Venkatraman
ICWN
2007
13 years 10 months ago
PBR: Priority Based Routing in Multi-Sink Sensor Networks
- Wireless sensor networks have been widely used in many fields with the developments of the related techniques. But there are many problems in traditional single sink sensor netwo...
Min Meng, Hui Xu, Xiaoling Wu, Brian J. d'Auriol, ...
DC
2010
13 years 9 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
ADHOC
2007
139views more  ADHOC 2007»
13 years 9 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...
INFOCOM
2006
IEEE
14 years 3 months ago
The Complexity of Connectivity in Wireless Networks
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
Thomas Moscibroda, Roger Wattenhofer