Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
— A control frame can be piggybacked in a data frame to increase the channel efficiency in a wireless communication such as IEEE 802.11 WLAN. However, the piggyback scheme may c...