460 search results - page 85 / 92 » Bounding the locality of distributed routing algorithms |
JNCA
2011
13 years 2 months ago
2011
Built upon a shared wireless medium, wireless mesh network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of s...
IJRR
2008
13 years 7 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
IWQOS
2001
Springer
14 years 4 days ago
2001
Springer
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
SLIP
2003
ACM
14 years 28 days ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
CN
2008
13 years 7 months ago
2008
In this paper, we propose a low-complexity auction framework to distribute spectrum in real-time among a large number of wireless users with dynamic traffic. Our design consists o...