Sciweavers

191 search results - page 8 / 39
» Time Efficient Gossiping in Known Radio Networks
Sort
View
SUTC
2006
IEEE
14 years 3 months ago
Energy Efficient Sleep Schedule for Achieving Minimum Latency in Query based Sensor Networks
Energy management in sensor networks is crucial to prolong the network lifetime. Though existing sleep scheduling algorithms save energy, they lead to a large increase in end-to-e...
N. A. Vasanthi, S. Annadurai
PODC
2005
ACM
14 years 2 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
ICASSP
2010
IEEE
13 years 9 months ago
Distributed learning in cognitive radio networks: Multi-armed bandit with distributed multiple players
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...
Keqin Liu, Qing Zhao
WD
2010
13 years 6 months ago
Self-organized aggregation in irregular wireless networks
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
Joanna Geibig, Dirk Bradler
TIT
2008
103views more  TIT 2008»
13 years 8 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah