Sciweavers

866 search results - page 76 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
CISS
2008
IEEE
16 years 25 days ago
Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view
— As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due...
Junshan Zhang
ICDCSW
2006
IEEE
16 years 12 days ago
Multi-radio channel allocation in competitive wireless networks
Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic ...
Márk Félegyházi, Mario Cagalj...
SIGMETRICS
2004
ACM
107views Hardware» more  SIGMETRICS 2004»
15 years 11 months ago
On zone-balancing of peer-to-peer networks: analysis of random node join
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
Xiaoming Wang, Yueping Zhang, Xiafeng Li, Dmitri L...
PODC
2010
ACM
15 years 8 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
CHI
2010
ACM
16 years 1 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon