75 search results - page 2 / 15 » A Study of the Percolation Threshold for k-Collaborative Wir... |
DIALM
2008
ACM
13 years 7 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—We study the problem of scalable monitoring of operational 3G wireless networks. Threshold-based performance monitoring in large 3G networks is very challenging for two main fac...
TWC
2008
13 years 5 months ago
2008
This paper studies selective relaying schemes based on signal-to-noise-ratio (SNR) to minimize the end-to-end (e2e) bit error rate (BER) in cooperative digital relaying systems usi...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...