Beyond the smart things: Towards the definition and the performance assessment of a secure architecture for the Internet of Nano-Things

During the last years, the interest in nano-technologies and nanoscale communications significantly growth in several application domains, such as healthcare, bio-medicine, agro-food, industry, and military/defense. Nano-scale devices are able to interact with each others, with existing communication networks and, ultimately, with the Internet. As a result, the well-known Internet of Things paradigm is extending its functionalities at the nano-scale, thus paving the way for the revolutionary Internet of Nano-Things concept, which goes beyond the already diffused \u201csmart things\u201d towards real application of \u2018smart nano-things\u2018\u201d. In this context, many research initiatives are addressing the definition of efficient, secure, scalable, and reliable network architectures at the nano-scale. In order to provide a valuable step ahead of the current state of the art, the work presented herein investigates a novel methodology through which securing an Internet of Nano-Things architecture, by jointly offering the reliability of connected devices and the protection of transmitted data. From the communication perspective, the proposed approach leverages both molecular diffusion and electromagnetic-based communication schema. In such a hybrid approach, parameter settings and message exchange is properly devised to effectively achieve the aforementioned security services. Finally, the impact that security functionalities have on the performance of a reference Internet of Nano-Things scenario (i.e., expressed in terms of packet loss ratio, communication latencies, and message processing overhead) is evaluated through Nano-Sim and N3Sim tools

Sulla filosofia della scienza di Evandro Agazzi. Dalla probabilit\ue0 e la logica matematica all'epistemologia realista

studio analitico e complessivo sulla filosofia della scienza di Evandro Agazzi nel contesto del dibattito epistemologico contemporane

Binary Reachability Analysis of Discrete Pushdown Timed Automata

. We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A configuration of a discrete pushdown timed automaton includes a control state, finitely many clock values and a stack word. Using a pure automata-theoretic approach, we show that the binary reachability (i.e., the set of all pairs of configurations (ff; fi), encoded as strings, such that ff can reach fi through 0 or more transitions) can be accepted by a nondeterministic pushdown machine augmented with reversal-bounded counters (NPCM). Since discrete timed automata with integer-valued clocks can be treated as discrete pushdown timed automata without the pushdown stack, we can show that the binary reachability of a discrete timed automaton can be accepted by a nondeterministic reversal-bounded multicounter machine. Thus, the binary reachability is Presburger. By using the known fact that the emptiness problem is decidable for reversalbounded ..