Sciweavers

13214 search results - page 295 / 2643
» Pseudorandomness for network algorithms
Sort
View
CISS
2007
IEEE
16 years 1 months ago
Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks
—We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. We address sensor scheduling in each data collection und...
Tong Zhao, Qing Zhao
PEWASUN
2006
ACM
16 years 20 days ago
Coordinated data aggregation in wireless sensor networks using the Omega failure detector
We present an algorithm implementing the failure detector class omega (Ω) in the crash-recovery model to coordinate data aggregation in wireless sensor networks. In order to mini...
Mikel Larrea, Cristian Martín, José ...
CSE
2008
IEEE
15 years 8 months ago
Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
Subhas Kumar Ghosh
NETWORKS
2011
15 years 1 months ago
Earliest arrival flows on series-parallel graphs
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
Stefan Ruzika, Heike Sperber, Mechthild Steiner
222
Voted
CISS
2008
IEEE
16 years 1 months ago
Distributed power control in wireless ad hoc networks using message passing: Throughput optimality and network utility maximizat
— This paper presents an algorithm for distributed power control and scheduling over wireless ad hoc-networks, where the data rate on each link depends on the transmission power ...
Aneesh Reddy, Sanjay Shakkottai, Lei Ying