Sciweavers

472 search results - page 74 / 95
» The Case for Informed Transport Protocols
Sort
View
MOBIHOC
2001
ACM
14 years 7 months ago
Implicit source routes for on-demand ad hoc network routing
In an ad hoc network, the use of source routing has many advantages, including simplicity, correctness, and flexibility. For example, all routing decisions for a packet are made b...
Yih-Chun Hu, David B. Johnson
SPAA
2009
ACM
14 years 2 months ago
Distributed algorithms for QoS load balancing
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...
ICASSP
2008
IEEE
14 years 2 months ago
Outage capacity of a cooperative scheme with binary input and a simple relay
Cooperative communications is a rapidly evolving research area. Most of the cooperative protocols that have appeared in the literature assume slow flat fading channels and Gaussi...
George N. Karystinos, Athanasios P. Liavas
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 1 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
DASFAA
2005
IEEE
106views Database» more  DASFAA 2005»
14 years 1 months ago
Real Datasets for File-Sharing Peer-to-Peer Systems
The fundamental drawback of unstructured peer-to-peer (P2P) networks is the flooding-based query processing protocol that seriously limits their scalability. As a result, a signi...
Shen-Tat Goh, Panos Kalnis, Spiridon Bakiras, Kian...