CNR Institute for Informatics and Telematics

Cosenza, Italy

CNR Institute for Informatics and Telematics

Cosenza, Italy
Time filter
Source Type

Conti M.,CNR Institute for Informatics and Telematics | Giordano S.,University of Applied Sciences and Arts Southern Switzerland | May M.,Thomson Research Laboratory | Passarella A.,CNR Institute for Informatics and Telematics
IEEE Communications Magazine | Year: 2010

Personal computing devices, such as smartphones and PDAs, are commonplace, bundle several wireless network interfaces, can support compute intensive tasks, and are equipped with powerful means to produce multimedia content. Thus, they provide the resources for what we envision as a human pervasive network: a network formed by user devices, suitable to convey to users rich multimedia content and services according to their interests and needs. Similar to opportunistic networks, where the communication is built on connectivity opportunities, we envisage a network above these resources that joins together features of traditional pervasive networks and opportunistic networks fostering a new computing paradigm: opportunistic computing. In this article we discuss the evolution from opportunistic networking to opportunistic computing; we survey key recent achievements in opportunistic networking, and describe the main concepts and challenges of opportunistic computing. We finally envision further possible scenarios and functionalities to make opportunistic computing a key player in the next-generation Internet. © 2006 IEEE.

Santi P.,CNR Institute for Informatics and Telematics
IEEE Journal on Selected Areas in Communications | Year: 2010

In this paper, we investigate the fundamental properties of data gathering in wireless sensor networks, in terms of both capacity and latency. We consider a scenario in which s(n) out of n total network nodes have to deliver data to a set of d(n) sink nodes at a constant rate λ (n, s(n), d(n)). The goal is to characterize the maximum achievable rate, and the latency in data delivery. We present a simple data gathering scheme that achieves asymptotically optimal data gathering capacity and latency with arbitrary network deployments when d(n) = 1, and for most scaling regimes of s(n) and d(n) when d(n) > 1 in case of square grid and random node deployments. Differently from most previous work, our results and the presented data gathering scheme do not sacrifice energy efficiency to the need of maximizing capacity and minimizing latency. Finally, we consider the effects of a simple form of data aggregation on data gathering performance, and show that capacity can be increased by a factor f(n) with respect to the case of no data aggregation, where f(n) is the node density. To the best of our knowledge, the ones presented in this paper are the first results showing that asymptotically optimal data gathering capacity and latency can be achieved in arbitrary networks in an energy efficient way. © 2010 IEEE.

Borgia E.,CNR Institute for Informatics and Telematics
Computer Communications | Year: 2014

The Internet of Things (IoT) is a new paradigm that combines aspects and technologies coming from different approaches. Ubiquitous computing, pervasive computing, Internet Protocol, sensing technologies, communication technologies, and embedded devices are merged together in order to form a system where the real and digital worlds meet and are continuously in symbiotic interaction. The smart object is the building block of the IoT vision. By putting intelligence into everyday objects, they are turned into smart objects able not only to collect information from the environment and interact/control the physical world, but also to be interconnected, to each other, through Internet to exchange data and information. The expected huge number of interconnected devices and the significant amount of available data open new opportunities to create services that will bring tangible benefits to the society, environment, economy and individual citizens. In this paper we present the key features and the driver technologies of IoT. In addition to identifying the application scenarios and the correspondent potential applications, we focus on research challenges and open issues to be faced for the IoT realization in the real world. © 2014 Elsevier B.V.

Passarella A.,CNR Institute for Informatics and Telematics
Computer Communications | Year: 2012

One of the most striking properties of the Internet is its flexibility to accommodate features it was not conceived for. Among the most significant examples, in this survey we consider the transition of the Internet from a reliable fault-tolerant network for host-to-host communication to a content-centric network, i.e. a network mostly devoted to support efficient generation, sharing and access to content. We survey this research area according to a top-down approach. We present a conceptual framework that encompasses the key building blocks required to support content-centric networking in the Internet. Then we describe in detail the two most important types of content-centric Internet technologies, i.e., Content-Delivery Networks (CDNs) and P2P systems. For each of them, we show how they cover the key building blocks. We then identify the functional components of CDN and P2P content management solutions, and discuss the main solutions proposed in the literature for each of them. We consider different types of content (both real time and non real time), and different networking environments (fixed, mobile, ⋯). Finally, we also discuss the main recent research trends focused on how to design the Future Internet as a native content-centric network. © 2011 Elsevier B.V. All rights reserved.

Delmastro F.,CNR Institute for Informatics and Telematics
Computer Communications | Year: 2012

The evolution of wireless communication technologies opened the way to the definition of innovative eHealth systems aimed at providing a continuous and remote support to patients and new instruments to improve the workflow of the medical personnel. This paper presents a survey of wireless communication technologies currently applied in eHealth systems, deeply analysing communication standards, protocols and performance results achieved in this field. The analysis of advantages and drawbacks of current technologies introduces also the definition of new research issues and possible solutions for future eHealth systems. © 2012 Elsevier B.V. All rights reserved.

Resta G.,CNR Institute for Informatics and Telematics | Santi P.,CNR Institute for Informatics and Telematics
IEEE Transactions on Parallel and Distributed Systems | Year: 2012

In this paper, we present a framework for analyzing routing performance in delay tolerant networks (DTNs). Differently from previous work, our framework is aimed at characterizing the exact distribution of relevant performance metrics, which is a substantial improvement over existing studies characterizing either the expected value of the metric, or an asymptotic approximation of the actual distribution. In particular, the considered performance metrics are packet delivery delay, and communication cost, expressed as number of copies of a packet circulating in the network at the time of delivery. Our proposed framework is based on a characterization of the routing process as a stochastic coloring process and can be applied to model performance of most stateless delay tolerant routing protocols, such as epidemic, two-hops, and spray and wait. After introducing the framework, we present examples of its application to derive the packet delivery delay and communication cost distribution of two such protocols, namely epidemic and two-hops routing. Characterizing packet delivery delay and communication cost distribution is important to investigate fundamental properties of delay tolerant networks. As an example, we show how packet delivery delay distribution can be used to estimate how epidemic routing performance changes in presence of different degrees of node cooperation within the network. More specifically, we consider fully cooperative, noncooperative, and probabilistic cooperative scenarios, and derive nearly exact expressions of the packet delivery rate (PDR) under these scenarios based on our proposed framework. The comparison of the obtained packet delivery rate estimation in the various cooperation scenarios suggests that even a modest level of node cooperation (probabilistic cooperation with a low probability of cooperation) is sufficient to achieve 2-fold performance improvement with respect to the most pessimistic scenario in which all potential forwarders drop packets. © 2006 IEEE.

Passarella A.,CNR Institute for Informatics and Telematics | Conti M.,CNR Institute for Informatics and Telematics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

A pioneering body of work in the area of mobile opportunistic networks has shown that characterising inter-contact times between pairs of nodes is crucial. In particular, when inter-contact times follow a power-law distribution, the expected delay of a large family of forwarding protocols may be infinite. The most common approach adopted in the literature to study inter-contact times consists in looking at the distribution of the inter-contact times aggregated over all nodes pairs, assuming it correctly represents the distributions of individual pairs. In this paper we challenge this assumption. We present an analytical model that describes the dependence between the individual pairs and the aggregate distributions. By using the model we show that in heterogeneous networks - when not all pairs contact patterns are the same - most of the time the aggregate distribution is not representative of the individual pairs distributions, and that looking at the aggregate can lead to completely wrong conclusions on the key properties of the network. For example, we show that aggregate power-law inter-contact times (suggesting infinite expected delays) can frequently emerge in networks where individual pairs inter-contact times are exponentially distributed (meaning that the expected delay is finite). From a complementary standpoint, our results show that heterogeneity of individual pairs contact patterns plays a crucial role in determining the aggregate inter-contact times statistics, and that focusing on the latter only can be misleading. © 2011 IFIP International Federation for Information Processing.

La Polla M.,CNR Institute for Informatics and Telematics | Martinelli F.,CNR Institute for Informatics and Telematics | Sgandurra D.,CNR Institute for Informatics and Telematics
IEEE Communications Surveys and Tutorials | Year: 2013

Nowadays, mobile devices are an important part of our everyday lives since they enable us to access a large variety of ubiquitous services. In recent years, the availability of these ubiquitous and mobile services has significantly increased due to the different form of connectivity provided by mobile devices, such as GSM, GPRS, Bluetooth and Wi-Fi. In the same trend, the number and typologies of vulnerabilities exploiting these services and communication channels have increased as well. Therefore, smartphones may now represent an ideal target for malware writers. As the number of vulnerabilities and, hence, of attacks increase, there has been a corresponding rise of security solutions proposed by researchers. Due to the fact that this research field is immature and still unexplored in depth, with this paper we aim to provide a structured and comprehensive overview of the research on security solutions for mobile devices. This paper surveys the state of the art on threats, vulnerabilities and security solutions over the period 2004-2011, by focusing on high-level attacks, such those to user applications. We group existing approaches aimed at protecting mobile devices against these classes of attacks into different categories, based upon the detection principles, architectures, collected data and operating systems, especially focusing on IDS-based models and tools. With this categorization we aim to provide an easy and concise view of the underlying model adopted by each approach. © 1998-2012 IEEE.

Passarella A.,CNR Institute for Informatics and Telematics | Conti M.,CNR Institute for Informatics and Telematics
IEEE Transactions on Mobile Computing | Year: 2013

Foundational work in the area of opportunistic networks has shown that the distribution of intercontact times between pairs of nodes has a key impact on the network properties, for example, in terms of convergence of forwarding protocols. Specifically, forwarding protocols may yield infinite expected delay if the intercontact time distributions present a particularly heavy tail. While these results hold for the distributions of intercontact times between individual pairs, most of the literature uses the aggregate distribution, i.e., the distribution obtained by considering the samples from all pairs together, to characterize the properties of opportunistic networks. In this paper, we provide an analytical framework that can be used to check when this approach is correct and when it is not, and we apply it to a number of relevant cases. We show that the aggregate distribution can be way different from the distributions of individual pair intercontact times. Therefore, using the former to characterize properties that depend on the latter is not correct in general, although this is correct in some cases. We substantiate this finding by analyzing the most representative distributions characterizing real opportunistic networks that can be obtained from reference traces. We review key cases for opportunistic networking, where the aggregate intercontact time distribution presents a heavy tail with or without exponential cutoff. We show that, when individual pairs follow Pareto distributions, the aggregate distribution consistently presents a heavy tail. However, heavy tail aggregate distributions can also emerge in networks where individual pair intercontact times are not heavy tailed, for example, exponential or Pareto with exponential cutoff distributions. We show that an exponential cutoff in the aggregate appears when the average intercontact times of individual pairs are finite. Finally, we discuss how to use our analytical model to know whether collecting aggregate information about intercontact times is sufficient or not, to decideâin practiceâwhich type of routing protocols to use. © 2013 IEEE.

Ancillotti E.,CNR Institute for Informatics and Telematics | Bruno R.,CNR Institute for Informatics and Telematics | Conti M.,CNR Institute for Informatics and Telematics
IEEE Communications Magazine | Year: 2013

Advanced communication/networking technologies should be integrated in next-generation power systems (a.k.a. smart grids) to improve their resilience, efficiency, adaptability, and sustainability. Many believe that the smart grid communication infrastructure will emerge from the interconnection of a large number of small-scale networks organized into a hierarchical architecture covering larger geographic areas. In this article, first we carry out a thorough analysis of the key components of the smart grid communication architecture, discussing the different network topologies and communication technologies that could be employed. Special emphasis is given to the advanced metering infrastructure, which will be used to interconnect the smart meters deployed at customersï¿ï¿ï¿ premises with data aggregators and control centers. The design of scalable, reliable, and efficient networking solutions for AMI systems is an important research problem because these networks are composed of thousands of resource-constrained embedded devices usually interconnected with communication technologies that can provide only low-bandwidth and unreliable links. The IPv6 Routing Protocol for Low Power and Lossy Networks was recently standardized by the IETF to specifically meet the requirements of typical AMI applications. In this article we present a thorough overview of the protocol, and we critically analyze its advantages and potential limits in AMI applications. We also conduct a performance evaluation of RPL using a Contiki-based prototype of the RPL standard and a network emulator. Our results indicate that although average performance may appear reasonable for AMI networks, a few RPL nodes may suffer from severe unreliability issues and experience high packet loss rates due to the selection of suboptimal paths with highly unreliable links. © 1979-2012 IEEE.

Loading CNR Institute for Informatics and Telematics collaborators
Loading CNR Institute for Informatics and Telematics collaborators