6506 search results - page 811 / 1302 » Algorithmic models for sensor networks |
236
click to vote
MSWIM
2006
ACM
16 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...
162
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper presents a linear time algorithm to reduce a large RC interconnect network into subnetworks which are approximated with lower order equivalent RC circuits. The number o...
170
click to vote
MOBIHOC
2010
ACM
15 years 5 months ago
2010
ACM
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...
218
click to vote
BROADNETS
2006
IEEE
16 years 1 months ago
2006
IEEE
— This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (1015 bit/s). Its...
252
click to vote
ICOIN
2003
Springer
16 years 11 days ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...