3319 search results - page 438 / 664 » The topology of dark networks |
158
click to vote
ISCC
2005
IEEE
16 years 7 days ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
183
click to vote
MSN
2005
Springer
16 years 4 days ago
2005
Springer
The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of...
190
click to vote
DMSN
2004
ACM
16 years 2 days ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
168
click to vote
SIGCOMM
2004
ACM
16 years 2 days ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
200
click to vote
PPSN
2004
Springer
16 years 53 min ago
2004
Springer
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...