366 search results - page 69 / 74 » Communication Complexity with Synchronized Clocks |
CISS
2007
IEEE
15 years 3 months ago
2007
IEEE
— We consider a sensor network in which the sensors communicate at will when they have something to report, without prior coordination with other sensors or with data collection ...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
PADS
2003
ACM
15 years 2 months ago
2003
ACM
Wireless networks’ models differ from wired ones at least in the innovative dynamic effects of host-mobility and open-broadcast nature of the wireless medium. Topology changes d...
OOPSLA
2010
Springer
14 years 8 months ago
2010
Springer
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
108
click to vote
PODC
2011
ACM
14 years 10 days ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...