Sciweavers

38 search results - page 7 / 8
» Toward Optimal Utilization of Shared Random Access Channels
Sort
View
TIT
2011
128views more  TIT 2011»
13 years 1 months ago
Secure Network Coding on a Wiretap Network
—In the paradigm of network coding, the nodes in a network are allowed to encode the information received from the input links. With network coding, the full capacity of the netw...
Ning Cai, Raymond W. Yeung
TIT
2008
187views more  TIT 2008»
13 years 6 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
PIMRC
2008
IEEE
14 years 1 months ago
Understanding the Performance of 802.11 Networks
Abstract—In this paper, we review the most important performance characteristics of the 802.11 DCF wireless networks, point out some false common knowledge, and report on recent ...
Andrzej Duda
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 2 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
INFOCOM
2011
IEEE
12 years 10 months ago
Incentive provision using intervention
Abstract—Overcoming the inefficiency of non-cooperative outcomes poses an important challenge for network managers in achieving efficient utilization of network resources. This...
Jaeok Park, Mihaela van der Schaar