2084 search results - page 238 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise a...
119
click to vote
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
—We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooper...
111
click to vote
ECCC
2011
14 years 4 months ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...