1265 search results - page 35 / 253 » Randomized Algorithms and Probabilistic Analysis in Wireless... |
INFOCOM
2008
IEEE
14 years 2 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...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
COMCOM
2004
13 years 7 months ago
2004
The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the e...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...