Sciweavers

4 search results - page 1 / 1
» Quantifying maximal loss of anonymity in protocols
Sort
View
CCS
2009
ACM
14 years 5 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria
MOBIHOC
2006
ACM
14 years 4 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
CORR
2008
Springer
212views Education» more  CORR 2008»
13 years 4 months ago
Joint Adaptive Modulation-Coding and Cooperative ARQ for Wireless Relay Networks
This paper presents a cross-layer approach to jointly design adaptive modulation and coding (AMC) at the physical layer and cooperative truncated automatic repeat request (ARQ) pro...
Morteza Mardani, Jalil S. Harsini, Farshad Lahouti...
JSAC
2008
116views more  JSAC 2008»
13 years 4 months ago
Stability and Efficiency of Unstructured File Sharing Networks
We propose two unstructured file sharing games, unilateral and bilateral unstructured file sharing games, to study the interaction among self-interested players (users) of unstruct...
Honggang Zhang, Giovanni Neglia, Donald F. Towsley...