Sciweavers

1511 search results - page 272 / 303
» Randomness, lowness and degrees
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Mobility-Driven Scheduling in Wireless Networks
—The design of scheduling policies for wireless data systems has been driven by a compromise between the objectives of high overall system throughput and the degree of fairness a...
Sem C. Borst, Nidhi Hegde, Alexandre Proutiere
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
15 years 6 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
ICASSP
2008
IEEE
15 years 6 months ago
Secure wireless communications: Secret keys through multipath
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
Akbar M. Sayeed, Adrian Perrig
FOCS
2006
IEEE
15 years 5 months ago
Towards Secure and Scalable Computation in Peer-to-Peer Networks
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
Valerie King, Jared Saia, Vishal Sanwalani, Erik V...
IEEECIT
2006
IEEE
15 years 5 months ago
Improving Resiliency of Network Topology with Enhanced Evolving Strategies
— Recent studies have shown that many real networks follow the power-law distribution of node degrees. Instead of random connectivity, however, power-law connectivity suffers fro...
Soo Kim, Heejo Lee, Wan Yeon Lee