3319 search results - page 275 / 664 » The topology of dark networks |
218
click to vote
SPAA
1999
ACM
15 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
191
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
146
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
179
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false nega...
198
click to vote
EWSN
2004
Springer
16 years 6 months ago
2004
Springer
This paper describes a novel routing mechanism for a network of highly mobile sensor nodes that routes data over dynamically changing topologies, using only information from neares...