Sciweavers

1414 search results - page 66 / 283
» Performance Bounds in Communication Networks with Variable-R...
Sort
View
ESAS
2004
Springer
14 years 1 months ago
Pseudonym Generation Scheme for Ad-Hoc Group Communication Based on IDH
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
Mark Manulis, Jörg Schwenk
ICC
2009
IEEE
165views Communications» more  ICC 2009»
13 years 5 months ago
Coding-Aware Scheduling for Reliable Many-to-One Flows
We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance o...
Osameh M. Al-Kofahi, Ahmed E. Kamal
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 9 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
INFOCOM
2003
IEEE
14 years 1 months ago
Load optimal MPLS routing with N+M labels
Abstract— MPLS is becoming an important protocol for intradomain routing. MPLS routers are offered by the major vendors and many ISPs are deploying MPLS in their IP backbones, as...
David Applegate, Mikkel Thorup
MOBIHOC
2005
ACM
14 years 7 months ago
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Recently, several studies have analyzed the statistical properties of low power wireless links in real environments, clearly demonstrating the differences between experimentally o...
Alberto Cerpa, Jennifer L. Wong, Miodrag Potkonjak...