Searcharxiv⌕ Search

arXiv subjects

Marco Conti

Publications and source records attributed to Marco Conti.

At least 73 records · Page 4Linked to original sources

The Internet of People (IoP): A New Wave in Pervasive Mobile Computing

Cyber-Physical convergence, the fast expansion of the Internet at its edge, and tighter interactions between human users and their personal mobile devices push towards an Internet where the human user becomes more central than ever, and where their personal devices become their proxies in the cyber world, in addition to acting as a fundamental tool to sense the physical world. The current Internet paradigm, which is infrastructure-centric, is not the right one to cope with such emerging scenario with a wider range of applications. This calls for a radically new Internet paradigm, that we name the Internet of People (IoP), where the humans and their personal devices are not seen merely as end users of applications, but become active elements of the Internet. Note that IoP is not a replacement of the current Internet infrastructure, but it exploits legacy Internet services as (reliable) primitives to achieve end-to-end connectivity on a global-scale. In this visionary paper, we first discuss the key features of the IoP paradigm along with the underlying research issues and challenges. Then we present emerging networking and computing paradigms that are anticipating IoP

cs.NI↗

Service Composition in Opportunistic Networks: A Load and Mobility Aware Solution

Pervasive networks formed by users' mobile devices have the potential to exploit a rich set of distributed service components that can be composed to provide each user with a multitude of application level services. However, in many challenging scenarios, opportunistic networking techniques are required to enable communication as devices suffer from intermittent connectivity, disconnections and partitions. This poses novel challenges to service composition techniques. While several works have discussed middleware and architectures for service composition in well-connected wired networks and in stable MANET environments, the underlying mechanism for selecting and forwarding service requests in the significantly challenging networking environment of opportunistic networks has not been entirely addressed. The problem comprises three stages: i) selecting an appropriate service sequence set out of available services to obtain the required application level service; ii) routing results of a previous stage in the composition to the next one through a multi-hop opportunistic path; and iii) routing final service outcomes back to the requester. The proposed algorithm derives efficiency and effectiveness by taking into account the estimated load at service providers and expected time to opportunistically route information between devices. Based on this information the algorithm estimates the best composition to obtain a required service. It is shown that using only local knowledge collected in a distributed manner, performance close to a real-time centralized system can be achieved. Applicability and performance guarantee of the service composition algorithm in a range of mobility characteristics are established through extensive simulations on real/synthetic traces.

cs.NI↗

Service Provisioning in Mobile Environments through Opportunistic Computing

Opportunistic computing is a paradigm for completely self-organised pervasive networks. Instead of relying only on fixed infrastructures as the cloud, users' devices act as service providers for each other. They use pairwise contacts to collect information about services provided and amount of time to provide them by the encountered nodes. At each node, upon generation of a service request, this information is used to choose the most efficient service, or composition of services, that satisfy that request, based on local knowledge. Opportunistic computing can be exploited in several scenarios, including mobile social networks, IoT and Internet 4.0. In this paper we propose an opportunistic computing algorithm based on an analytical model, which ranks the available (composition of) services, based on their expected completion time. Through the model, a service requesters picks the one that is expected to be the best. Experiments show that the algorithm is accurate in ranking services, thus providing an effective service-selection policy. Such a policy achieves significantly lower service provisioning times compared to other reference policies. Its performance is tested in a wide range of scenarios varying the nodes mobility, the size of input/output parameters, the level of resource congestion, the computational complexity of service executions.

cs.NI↗

Heterogeneity-aware P2P Wireless Energy Transfer for Balanced Energy Distribution

The recent advances in wireless energy transfer (WET) provide an alternate and reliable option for replenishing the battery of pervasive and portable devices, such as smartphones. The peer-to-peer (P2P) mode of WET brings improved flexibility to the charging process among the devices as they can maintain their mobility while replenishing their battery. Few existing works in P2P-WET unrealistically assume the nodes to be exchanging energy at every opportunity with any other node. Also, energy exchange between the nodes is not bounded by the energy transfer limit in that inter-node meeting duration. In this regard, the parametric heterogeneity (in terms of device's battery capacity and WET hardware) among the nodes also affects the energy transfer bound in each P2P interaction, and thus, may lead to unbalanced network energy distributions. This inherent heterogeneity aspect has not been adequately covered in the P2P-WET literature so far, especially from the point of view of maintaining a balanced energy distribution in the networked population. In this work, we present a Heterogeneity-aware Wireless Energy Transfer (HetWET) method. In contrast to the existing literature, we devise a fine-grained model of wireless energy transfer while considering the parametric heterogeneity of the participating devices. Thereafter, we enable the nodes to explore and dynamically decide the peers for energy exchange. The performance of HetWET is evaluated using extensive simulations with varying heterogeneity settings. The evaluation results demonstrate that HetWET can maintain lower energy losses and achieve more balanced energy variation distance compared to three different state-of-the-art methods.

cs.NI↗

Modeling Human Behavior Part II -- Cognitive approaches and Uncertainty

As we discussed in Part I of this topic, there is a clear desire to model and comprehend human behavior. Given the popular presupposition of human reasoning as the standard for learning and decision-making, there have been significant efforts and a growing trend in research to replicate these innate human abilities in artificial systems. In Part I, we discussed learning methods which generate a model of behavior from exploration of the system and feedback based on the exhibited behavior as well as topics relating to the use of or accounting for beliefs with respect to applicable skills or mental states of others. In this work, we will continue the discussion from the perspective of methods which focus on the assumed cognitive abilities, limitations, and biases demonstrated in human reasoning. We will arrange these topics as follows (i) methods such as cognitive architectures, cognitive heuristics, and related which demonstrate assumptions of limitations on cognitive resources and how that impacts decisions and (ii) methods which generate and utilize representations of bias or uncertainty to model human decision-making or the future outcomes of decisions.

cs.AI↗

Modeling Human Behavior Part I -- Learning and Belief Approaches

There is a clear desire to model and comprehend human behavior. Trends in research covering this topic show a clear assumption that many view human reasoning as the presupposed standard in artificial reasoning. As such, topics such as game theory, theory of mind, machine learning, etc. all integrate concepts which are assumed components of human reasoning. These serve as techniques to attempt to both replicate and understand the behaviors of humans. In addition, next generation autonomous and adaptive systems will largely include AI agents and humans working together as teams. To make this possible, autonomous agents will require the ability to embed practical models of human behavior, which allow them not only to replicate human models as a technique to "learn", but to to understand the actions of users and anticipate their behavior, so as to truly operate in symbiosis with them. The main objective of this paper it to provide a succinct yet systematic review of the most important approaches in two areas dealing with quantitative models of human behaviors. Specifically, we focus on (i) techniques which learn a model or policy of behavior through exploration and feedback, such as Reinforcement Learning, and (ii) directly model mechanisms of human reasoning, such as beliefs and bias, without going necessarily learning via trial-and-error.

cs.AI↗

Stateless or stateful FaaS? I'll take both!

Serverless computing has emerged as a very popular cloud technology, together with its companion Function-as-a-Service (FaaS) programming model enabling invocations of stateless functions from clients. An evolution of serverless is now taking place, shifting it towards the edge of the network and broadening its scope to stateful functions, as well. In this paper we argue that stateless vs. stateful is not a dichotomy of the application per se, but rather a time-varying property of most (if not all) applications, as confirmed by the analysis of real traces collected in a production environment. Based on this observation, we propose a mathematical formulation of a resource allocation problem that jointly encompasses both operation modes, dubbed lambda vs. mu, which can be solved efficiently at run-time by an edge orchestrator. We evaluate the proposed solution via simulation experiments in realistic network and workload conditions, which leads the way to the practical realization of a system where applications can freely adapt their current operation mode and optimize their performance at a minimum cost of operation from the network's perspective.

cs.NI↗

Wireless Crowd Charging with Battery Aging Mitigation

Battery aging is one of the major concerns for the pervasive devices such as smartphones, wearables and laptops. Current battery aging mitigation approaches only partially leverage the available options to prolong battery lifetime. In this regard, we claim that wireless crowd charging via network-wide smart charging protocols can provide a useful setting for applying battery aging mitigation. In this paper, for the first time in the state-of-the-art, we couple the two concepts and we design a fine-grained battery aging model in the context of wireless crowd charging, and two network-wide protocols to mitigate battery aging. Our approach directly challenges the related contemporary research paradigms by (i) taking into account important characteristic phenomena in the algorithmic modeling process related to fine-grained battery aging properties, (ii) deploying ubiquitous computing and network-wide protocols for battery aging mitigation, and (iii) fulfilling the user QoE expectations with respect to the enjoyment of a longer battery lifetime. Simulation-based results indicate that the proposed protocols are able to mitigate battery aging quickly in terms of nearly 46.74-60.87% less reduction of battery capacity among the crowd, and partially outperform state-of-the-art protocols in terms of energy balance quality.

cs.NI↗

Resource Allocation in Quantum Networks for Distributed Quantum Computing

The evolution of quantum computing technologies has been advancing at a steady pace in the recent years, and the current trend suggests that it will become available at scale for commercial purposes in the near future. The acceleration can be boosted by pooling compute infrastructures to either parallelize algorithm execution or solve bigger instances that are not feasible on a single quantum computer, which requires an underlying Quantum Internet: the interconnection of quantum computers by quantum links and repeaters to exchange entangled quantum bits. However, Quantum Internet research so far has been focused on provisioning point-to-point flows only, which is suitable for (e.g.) quantum sensing and metrology, but not for distributed quantum computing. In this paper, after a primer on quantum computing and networking, we investigate the requirements and objectives of smart computing on distributed nodes from the perspective of quantum network provisioning. We then design a resource allocation strategy that is evaluated through a comprehensive simulation campaign, whose results highlight the key features and performance issues, and lead the way to further investigation in this direction.

quant-ph↗

Balanced Wireless Crowd Charging with Mobility Prediction and Social Awareness

The advancements in peer-to-peer wireless power transfer (P2P-WPT) have empowered the portable and mobile devices to wirelessly replenish their battery by directly interacting with other nearby devices. The existing works unrealistically assume the users to exchange energy with any of the users and at every such opportunity. However, due to the users' mobility, the inter-node meetings in such opportunistic mobile networks vary, and P2P energy exchange in such scenarios remains uncertain. Additionally, the social interests and interactions of the users influence their mobility as well as the energy exchange between them. The existing P2P-WPT methods did not consider the joint problem for energy exchange due to user's inevitable mobility, and the influence of sociality on the latter. As a result of computing with imprecise information, the energy balance achieved by these works at a slower rate as well as impaired by energy loss for the crowd. Motivated by this problem scenario, in this work, we present a wireless crowd charging method, namely MoSaBa, which leverages mobility prediction and social information for improved energy balancing. MoSaBa incorporates two dimensions of social information, namely social context and social relationships, as additional features for predicting contact opportunities. In this method, we explore the different pairs of peers such that the energy balancing is achieved at a faster rate as well as the energy balance quality improves in terms of maintaining low energy loss for the crowd. We justify the peer selection method in MoSaBa by detailed performance evaluation. Compared to the existing state-of-the-art, the proposed method achieves better performance trade-offs between energy-efficiency, energy balance quality and convergence time.

cs.NI↗

People-centric computing and communications in Smart Cities

The extreme pervasive nature of mobile technologies, together with the users need to continuously interact with her personal devices and to be always connected, strengthen the user-centric approach to design and develop new communication and computing solutions. Nowadays users not only represent the final utilizers of the technology, but they actively contribute to its evolution by assuming different roles: they act as humans, by sharing contents and experiences through social networks, and as virtual sensors, by moving freely in the environment with their sensing devices. Smart cities represent an important reference scenario for the active participation of users through mobile technologies. It involves multiple application domains and defines different levels of user engagement. Participatory sensing, opportunistic sensing and Mobile Social Networks currently represent some of the most promising people-centric paradigms. In addition, their integration can further improve the user involvement through new services and applications. In this paper we present SmartCitizen app, a MSN application designed in the framework of a smart city project to stimulate the active participation of citizens in generating and sharing useful contents related to the quality of life in their city. The app has been developed on top of a context- and social-aware middleware platform (CAMEO) able to integrate the main features of people-centric computing paradigms, lightening the app developer effort. Existing middleware platforms generally focus on one single people-centric paradigm, exporting a limited set of features to mobile applications. CAMEO overcomes these limitations. Experimental results shown in this paper can also represent the technical guidelines for the development of heterogeneous people-centric mobile applications, embracing different application domains.

cs.NI↗

Stateful Function-as-a-Service at the Edge

In FaaS, users invoke remote functions, which encapsulate service(s). These functions typically need to remotely access a persistent state via external services: this makes the paradigm less attractive in edge systems, especially for IoT applications, due to the increased delay and outbound traffic. We propose to generalize the FaaS paradigm by allowing functions to alternate between remote-state and local-state phases, depending on internal and external conditions, and dedicating a container with persistent memory to functions when in a local-state phase. We present initial results showing that this simple yet powerful pattern allows to better utilize the available resources, which are scarce on edge nodes, while significantly reducing tail latencies, which is key to enable many new applications based on real-time ML, e.g., in smart vehicles and smart factory scenarios

cs.NI↗

A Decentralized Framework for Serverless Edge Computing in the Internet of Things

Serverless computing is becoming widely adopted among cloud providers, thus making increasingly popular the Function-as-a-Service (FaaS) programming model, where the developers realize services by packaging sequences of stateless function calls. The current technologies are very well suited to data centers, but cannot provide equally good performance in decentralized environments, such as edge computing systems, which are expected to be typical for Internet of Things (IoT) applications. In this paper, we fill this gap by proposing a framework for efficient dispatching of stateless tasks to in-network executors so as to minimize the response times while exhibiting short- and long-term fairness, also leveraging information from a virtualized network infrastructure when available. Our solution is shown to be simple enough to be installed on devices with limited computational capabilities, such as IoT gateways, especially when using a hierarchical forwarding extension. We evaluate the proposed platform by means of extensive emulation experiments with a prototype implementation in realistic conditions. The results show that it is able to smoothly adapt to the mobility of clients and to the variations of their service request patterns, while coping promptly with network congestion.

cs.NI↗

Structural invariants in individuals language use: the "ego network" of words

The cognitive constraints that humans exhibit in their social interactions have been extensively studied by anthropologists, who have highlighted their regularities across different types of social networks. We postulate that similar regularities can be found in other cognitive processes, such as those involving language production. In order to provide preliminary evidence for this claim, we analyse a dataset containing tweets of a heterogeneous group of Twitter users (regular users and professional writers). Leveraging a methodology similar to the one used to uncover the well-established social cognitive constraints, we find that a concentric layered structure (which we call ego network of words, in analogy to the ego network of social relationships) very well captures how individuals organise the words they use. The size of the layers in this structure regularly grows (approximately 2-3 times with respect to the previous one) when moving outwards, and the two penultimate external layers consistently account for approximately 60% and 30% of the used words (the outermost layer contains 100% of the words), irrespective of the number of the total number of layers of the user.

cs.SI↗

Dynamics of scientific collaboration networks due to academic migrations

Academic migration is the change of host institution by a researcher, typically aimed at achieving a stronger research profile. Scientific features such as the number of collaborations, the productivity and its research impact tend to be directly affected by such movements. In this paper, we analyse the dynamics of the collaboration network of researchers as they move from an institution to the next one. We specifically highlight cases where they increase and when they shrink, and quantify the dependency between the collaboration networks before and after such a movement. Finally, we drill down the analysis by dividing movements depending on the career stage of the researchers. The analysis shows a remarkable dynamism of collaboration networks across migrations. Interestingly, not always movements result in larger collaboration networks, while the overall similarity between networks across movements is quite limited on average. Qualitatively, the same effects can be found at all career stages, while, clearly, the magnitude of them might vary. These results are based on a dataset extracted from Scopus, containing detailed scientific information for the publications of 84,141 researchers.

cs.DL↗

A Social Cognitive Heuristic for Adaptive Data Dissemination in Mobile Opportunistic Networks

It is commonly agreed that data will be one of the cornerstones of Future Internet systems. In this context, mobile Opportunistic Networks (ONs) are one of the key paradigms to support, in a self-organising and decentralised manner, the growth of data generated by localized interactions between users mobile devices, and between them and nearby devices such as IoT nodes. In ONs, the spontaneous collaboration among mobile devices is exploited to disseminate data toward interested users. However, the limited resources and knowledge available at each node, and the vast amount of data available, make it difficult to devise efficient schemes to accomplish this task. Recent solutions propose to equip each device with data filtering methods derived from human data processing schemes, known as Cognitive Heuristics, i.e. very effective methods used by the brain to quickly drop useless information, while keeping the most relevant one. These solutions can become less effective when facing dynamic scenarios or situations where nodes cannot fully collaborate. One of the reasons is that the solutions proposed so far do not take take into account the social structure of the environment where the nodes move in. To be more effective, the selection of information performed by each node should take into consideration this dimension of the environment. In this paper we propose a social-based data dissemination scheme, based on the cognitive Social Circle Heuristic. This evaluation method exploits the structure of the social environment to make inferences about the relevance of discovered information. We show how the Social Circle Heuristic, coupled with a cognitive-based community detection scheme, can be exploited to design an effective data dissemination algorithm for ONs. We provide a detailed analysis of the performance of the proposed solution via simulation.

cs.NI↗

Human-centric Data Dissemination in the IoP: Large-scale Modeling and Evaluation

Data management using Device-to-Device (D2D) communications and opportunistic networks (ONs) is one of the main focuses of human-centric pervasive Internet services. In the recently proposed "Internet of People" paradigm, accessing relevant data dynamically generated in the environment nearby is one of the key services. Moreover, personal mobile devices become proxies of their human users while exchanging data in the cyber world and, thus, largely use ONs and D2D communications for exchanging data directly. Recently, researchers have successfully demonstrated the viability of embedding human cognitive schemes in data dissemination algorithms for ONs. In this paper, we consider one such scheme based on the recognition heuristic, a human decision-making scheme used to efficiently assess the relevance of data. While initial evidence about its effectiveness is available, the evaluation of its behaviour in large-scale settings is still unsatisfactory. To overcome these limitations, we have developed a novel hybrid modelling methodology, which combines an analytical model of data dissemination within small-scale communities of mobile users, with detailed simulations of interactions between different communities. This methodology allows us to evaluate the algorithm in large-scale city- and country-wide scenarios. Results confirm the effectiveness of cognitive data dissemination schemes, even when content popularity is very heterogenous.

cs.NI↗

A communication efficient distributed learning framework for smart environments

Due to the pervasive diffusion of personal mobile and IoT devices, many ``smart environments'' (e.g., smart cities and smart factories) will be, among others, generators of huge amounts of data. Currently, this is typically achieved through centralised cloud-based data analytics services. However, according to many studies, this approach may present significant issues from the standpoint of data ownership, and even wireless network capacity. One possibility to cope with these shortcomings is to move data analytics closer to where data is generated. In this paper, we tackle this issue by proposing and analyzing a distributed learning framework, whereby data analytics are performed at the edge of the network, i.e., on locations very close to where data is generated. Specifically, in our framework, partial data analytics are performed directly on the nodes that generate the data, or on nodes close by (e.g., some of the data generators can take this role on behalf of subsets of other nodes nearby). Then, nodes exchange partial models and refine them accordingly. Our framework is general enough to host different analytics services. In the specific case analysed in the paper, we focus on a learning task, considering two distributed learning algorithms. Using an activity recognition and a pattern recognition task, both on reference datasets, we compare the two learning algorithms between each other and with a central cloud solution (i.e., one that has access to the complete datasets). Our results show that using distributed machine learning techniques, it is possible to drastically reduce the network overhead, while obtaining performance comparable to the cloud solution in terms of learning accuracy. The analysis also shows when each distributed learning approach is preferable, based on the specific distribution of the data on the nodes.

cs.DC↗