Sciweavers

449 search results - page 61 / 90
» A local average consensus algorithm for wireless sensor netw...
Sort
View
IPSN
2004
Springer
14 years 3 months ago
Flexible power scheduling for sensor networks
We propose a distributed on-demand power-management protocol for collecting data in sensor networks. The protocol aims to reduce power consumption while supporting fluctuating dem...
Barbara Hohlt, Lance Doherty, Eric A. Brewer
SIGCOMM
2006
ACM
14 years 4 months ago
Interference-aware fair rate control in wireless sensor networks
In a wireless sensor network of N nodes transmitting data to a single base station, possibly over multiple hops, what distributed mechanisms should be implemented in order to dyna...
Sumit Rangwala, Ramakrishna Gummadi, Ramesh Govind...
ADHOC
2007
108views more  ADHOC 2007»
13 years 10 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici
SRDS
2010
IEEE
13 years 8 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
MOBIHOC
2006
ACM
14 years 10 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