The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
Pilu Crescenzi, Carlo Nocentini, Andrea Pietracapr...