Sciweavers

20 search results - page 1 / 4
» Information-theoretic Capacity of Clustered Random Networks
Sort
View
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
13 years 11 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 4 months ago
An Information-Theoretical View of Network-Aware Malware Attacks
This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulne...
Zesheng Chen, Chuanyi Ji
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 4 months ago
Asymptotic Sum-Capacity of Random Gaussian Interference Networks Using Interference Alignment
We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on ...
Matthew Aldridge, Oliver Johnson, Robert J. Piecho...
IEEEMSP
2002
IEEE
137views Multimedia» more  IEEEMSP 2002»
13 years 9 months ago
On the capacity of the reachback channel in wireless sensor networks
Abstract— We consider the problem of reachback communication in wireless sensor networks: multiple sensors are deployed on a field, and they collect local measurements of some r...
João Barros, Sergio D. Servetto
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 4 months ago
Information-theoretic Capacity of Clustered Random Networks
Abstract-We analyze the capacity scaling laws of clustered ad hoc networks in which nodes are distributed according to a doubly stochastic shotnoise Cox process. We identify five d...
Michele Garetto, Alessandro Nordio, Carla-Fabiana ...