8 search results - page 2 / 2 » On the maximum stable throughput problem in random networks ... |
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...