—Consider a wireless multi-hop network formed by distributing a total of n nodes randomly and uniformly in the unit cube [0, 1]d (d = 1, 2, 3) and connecting any two distinct nod...
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Decentralized activation in wireless sensor networks is investigated for energy-efficient monitoring using the theory of global games. Given a large number of sensors which can ope...
: 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 ...