3319 search results - page 224 / 664 » The topology of dark networks |
115
Voted
WIOPT
2010
IEEE
15 years 6 days ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
149
click to vote
ICCAD
2009
IEEE
14 years 11 months ago
2009
IEEE
Wireless sensor networks hold the potential to open new domains to distributed data acquisition. However, such networks are prone to premature failure because some nodes deplete t...
104
click to vote
CN
2011
14 years 8 months ago
2011
Vulnerability of networks against one-shot decapitation attacks has been addressed several times in the literature. A first study on how a network can best defend itself by reple...
139
Voted
MOBICOM
2003
ACM
15 years 7 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
119
Voted
SIGMETRICS
2008
ACM
15 years 1 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...