The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Resolving an issue open since Fenner, Fortnow, and Kurtz raised it in [FFK94], we prove that LWPP is not uniformly gap-definable and that WPP is not uniformly gap-definable. We do...
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...
Jan Bouda, Jan Krhovjak, Vashek Matyas, Petr Svend...