2 P2P or Not 2 P2P?

In the hope of stimulating discussion, we present a heuristic decision tree that designers can use to judge the likely suitability of a P2P architecture for their applications. It is based on the characteristics of a wide range of P2P systems from the literature, both proposed and deployed.Comment: 6 pages, 1 figur

Performance assessment of security mechanisms for cooperative mobile health applications

Mobile health (m-Health) applications aim to deliver healthcare services through mobile applications regardless of time and place. An mHealth application makes use of wireless communications to sustain its health services and often providing a patient-doctor interaction. Therefore, m-Health applications present several challenging issues and constraints, such as, mobile devices battery and storage capacity, broadcast constraints, interferences, disconnections, noises, limited bandwidths, network delays, and of most importance, privacy and security concerns. In a typical m-Health system, information transmitted through wireless channels may contain sensitive information such as patient’s clinic history, patient’s personal diseases information (e.g. infectious disease as HIV - human immunodeficiency virus). Carrying such type of information presents many issues related to its privacy and protection. In this work, a cryptographic solution for m-Health applications under a cooperative environment is proposed in order to approach two common drawbacks in mobile health systems: the data privacy and protection. Two different approaches were proposed: i) DE4MHA that aims to guarantee the best confidentiality, integrity, and authenticity of mhealth systems users data and ii) eC4MHA that also focuses on assuring and guarantying the m-Health application data confidentiality, integrity, and authenticity, although with a different paradigm. While DE4MHA considers a peer-to-peer node message forward, with encryption/decryption tasks on each node, eC4MHA focuses on simply encrypting data at the requester node and decrypting it when it reaches the Web service. It relays information through cooperative mobile nodes, giving them the only strictly required information, in order to be able to forward a request, until it reaches the Web service responsible to manage the request, and possibly answer to that same request. In this sense, the referred solutions aim any mobile health application with cooperation mechanism embedded. For test purposes a specific mobile health application, namely SapoFit, was used. Cryptographic mechanisms were created and integrated in SapoFit application with built in cooperation mechanisms. A performance evaluation of both approaches in a real scenario with different mobile devices is performed and presented in this work. A comparison with the performance evaluations of both solutions is also presented.Fundação para a Ciência e a Tecnologia (FCT)European Community Fund FEDER through COMPETE – Programa Operacional Factores de Competitividad

Reputation and credit based incentive mechanism for data-centric message delivery in delay tolerant networks

In a Data-centric Delay Tolerant Networks (DTNs), it is essential for nodes to cooperate in message forwarding in order to enable successful delivery of a message in an opportunistic fashion with nodes having their social interests defined. In the data-centric dissemination protocol proposed here, a source annotates messages (images) with keywords, and then intermediate nodes are presented with an option of adding keyword-based annotations in order to create higher content strength messages on path toward the destination. Hence, contents like images get enriched as there is situation evolution or learned by these intermediate nodes, such as in a battlefield, or in a disaster situation. Nodes might turn selfish and not participate in relaying messages due to relative scarcity of battery and storage capacity in mobile devices. Therefore, in addition to content enrichment, an incentive mechanism is proposed in this thesis which considers factors like message quality, battery usage, level of interests, etc. for the calculation of incentives. Moreover, with the goal of preventing the nodes from turning malicious by adding inappropriate message tags in the quest of acquiring more incentive, a distributed reputation model (DRM) is developed and consolidated with the proposed incentive scheme. DRM takes into account inputs from multiple users like ratings for the relevance of annotations in the message, message quality, etc. The proposed scheme safeguards the network from congestion due to uncooperative or selfish nodes in the system. The performance evaluation shows that our approach delivers more high priority and high quality messages while reducing traffic at a slightly lower message delivery ratio compared to ChitChat --Abstract, page iv

Game theory for collaboration in future networks

Cooperative strategies have the great potential of improving network performance and spectrum utilization in future networking environments. This new paradigm in terms of network management, however, requires a novel design and analysis framework targeting a highly flexible networking solution with a distributed architecture. Game Theory is very suitable for this task, since it is a comprehensive mathematical tool for modeling the highly complex interactions among distributed and intelligent decision makers. In this way, the more convenient management policies for the diverse players (e.g. content providers, cloud providers, home providers, brokers, network providers or users) should be found to optimize the performance of the overall network infrastructure. The authors discuss in this chapter several Game Theory models/concepts that are highly relevant for enabling collaboration among the diverse players, using different ways to incentivize it, namely through pricing or reputation. In addition, the authors highlight several related open problems, such as the lack of proper models for dynamic and incomplete information games in this area.info:eu-repo/semantics/acceptedVersio

Repeated games and networks

The chapter provides an overview of recent results on infinitely repeated games in which monitoring and interactions are local. The chapter surveys Folk Theorems for games with local monitoring, and results characterizing optimal punishments in separable local public goods games. The relationship between the monitoring structure and the equilibrium correspondence is a key topic of enquiry. Results clarify the roles played by contagion, ostracism, and communication in shaping equilibrium outcomes. Understanding how network measures of social cohesion and of information diffusion can affect trust in communities is the main applied aim of the literature.</p

Game theory for cooperation in multi-access edge computing

Cooperative strategies amongst network players can improve network performance and spectrum utilization in future networking environments. Game Theory is very suitable for these emerging scenarios, since it models high-complex interactions among distributed decision makers. It also finds the more convenient management policies for the diverse players (e.g., content providers, cloud providers, edge providers, brokers, network providers, or users). These management policies optimize the performance of the overall network infrastructure with a fair utilization of their resources. This chapter discusses relevant theoretical models that enable cooperation amongst the players in distinct ways through, namely, pricing or reputation. In addition, the authors highlight open problems, such as the lack of proper models for dynamic and incomplete information scenarios. These upcoming scenarios are associated to computing and storage at the network edge, as well as, the deployment of large-scale IoT systems. The chapter finalizes by discussing a business model for future networks.info:eu-repo/semantics/acceptedVersio

SocialLink: a Social Network Based Trust System for P2P File Sharing Systems

In peer-to-peer (P2P) file sharing systems, many autonomous peers without preexisting trust relationships share files with each other. Due to their open environment and distributed structure, these systems are vulnerable to the significant impact from selfish and misbehaving nodes. Free-riding, whitewash, collusion and Sybil attacks are common and serious threats, which severely harm non-malicious users and degrade the system performance. Many trust systems were proposed for P2P file sharing systems to encourage cooperative behaviors and punish non-cooperative behaviors. However, querying reputation values usually generates latency and overhead for every user. To address this problem, a social network based trust system (i.e., SocialTrust) was proposed that enables nodes to first request files from friends without reputation value querying since social friends are trustable, and then use trust systems upon friend querying failure when a node\u27s friends do not have its queried file. However, trust systems and SocialTrust cannot effectively deal with free-riding, whitewash, collusion and Sybil attacks. To handle these problems, in this thesis, we introduce a novel trust system, called SocialLink, for P2P file sharing systems. By enabling nodes to maintain personal social network with trustworthy friends, SocialLink encourages nodes to directly share files between friends without querying reputations and hence reduces reputation querying cost. To guarantee the quality of service (QoS) of file provisions from non-friends, SocialLink establishes directionally weighted links from the server to the client with successful file transaction history to constitute a weighted transaction network , in which the link weight is the size of the transferred file. In this way, SocialLink prevents potential fraudulent transactions (i.e., low-QoS file provision) and encourages nodes to contribute files to non-friends. By constraining the connections between malicious nodes and non-malicious nodes in the weighted transaction network, SocialLink mitigates the adverse effect from whitewash, collusion and Sybil attacks. By simulating experiments, we demonstrate that SocialLink efficiently saves querying cost, reduces free-riding, and prevents damage from whitewash, collusion and Sybil attacks

Evaluating a sensor of skin conductance to assess dental anxiety

Tese de mestrado, Bioinformática e Biologia Computacional (Bioinformática), Universidade de Lisboa, Faculdade de Ciências, 2015The anxiety related problems that adult population experience, are a common issue in Dental Practice. To overcome these problems it would be helpful to have an objective measure of the current anxiety of the patient. With this information, it should be possible to link the measured anxiety to an automated system that could distract the patient by altering the surrounding environment, i.e. Ambient Intelligence. This project consisted in measuring the skin conductance signal and correlating the responses related with documented dental stressful procedures. This was executed in a real clinical environment. Dental anxiety was assessed in over 70 patients with a 3 question survey using the Likert scale. Each answer was registered together with the level of skin conductance measured with a sensor placed in the patient fingers. The results showed a significant association between the dental anxiety score on two of the questions and the quantified skin electrodermal response. These findings aim to help design a future system based on ambient intelligence to distract and reduce dental anxiety during treatment.Uma parte significativa da população adulta tem problemas provocados pela ansiedade originada com a ida à consulta de Medicina Dentária. Seria vantajoso existir uma avaliação objetiva do nível de ansiedade do paciente durante a consulta para se ultrapassar estes problemas. Com esta informação seria possível alterar o ambiente envolvente através da ligação a um sistema automatizado inteligente para a distração do paciente durante a consulta. Este projeto consistiu na medição do sinal de condutividade da pele e correlação desta com as respostas a um questionário relacionado com atos dentários reconhecidos como causadores de grande ansiedade dentária. A ansiedade dentária foi avaliada em cerca de setenta pacientes por um questionário de três perguntas utilizando uma escala de Likert. Simultaneamente foi medida a condutividade da pele por um sensor colocado nos dedos da mão. Os resultados mostram uma associação significativa entre o nível de ansiedade obtido em duas das questões e a alteração da condutividade da pele. Estes resultados visam fornecer uma base para desenhar um futuro sistema de Ambiente Inteligente para distração da ansiedade dentária