Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With our work, we provide a first step to analyzing robustness of a reputation system based on a deviation test. Using a mean-field approach to our stochastic process model, we show that liars have no impact unless their number exceeds a certain threshold (phase transition). We give precise formulae for the critical values and thus provide guidelines for an optimal choice of parameters.Comment: 17 pages, 6 figure

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Contributions to the security of cognitive radio networks

The increasing emergence of wireless applications along with the static spectrum allocation followed by regulatory bodies has led to a high inefficiency in spectrum usage, and the lack of spectrum for new services. In this context, Cognitive Radio (CR) technology has been proposed as a possible solution to reuse the spectrum being underutilized by licensed services. CRs are intelligent devices capable of sensing the medium and identifying those portions of the spectrum being unused. Based on their current perception of the environment and on that learned from past experiences, they can optimally tune themselves with regard to parameters such as frequency, coding and modulation, among others. Due to such properties, Cognitive Radio Networks (CRNs) can act as secondary users of the spectrum left unused by their legal owners or primary users, under the requirement of not interfering primary communications. The successful deployment of these networks relies on the proper design of mechanisms in order to efficiently detect spectrum holes, adapt to changing environment conditions and manage the available spectrum. Furthermore, the need for addressing security issues is evidenced by two facts. First, as for any other type of wireless network, the air is used as communications medium and can easily be accessed by attackers. On the other hand, the particular attributes of CRNs offer new opportunities to malicious users, ranging from providing wrong information on the radio environment to disrupting the cognitive mechanisms, which could severely undermine the operation of these networks. In this Ph.D thesis we have approached the challenge of securing Cognitive Radio Networks. Because CR technology is still evolving, to achieve this goal involves not only providing countermeasures for existing attacks but also to identify new potential threats and evaluate their impact on CRNs performance. The main contributions of this thesis can be summarized as follows. First, a critical study on the State of the Art in this area is presented. A qualitative analysis of those threats to CRNs already identified in the literature is provided, and the efficacy of existing countermeasures is discussed. Based on this work, a set of guidelines are designed in order to design a detection system for the main threats to CRNs. Besides, a high level description of the components of this system is provided, being it the second contribution of this thesis. The third contribution is the proposal of a new cross-layer attack to the Transmission Control Protocol (TCP) in CRNs. An analytical model of the impact of this attack on the throughput of TCP connections is derived, and a set of countermeasures in order to detect and mitigate the effect of such attack are proposed. One of the main threats to CRNs is the Primary User Emulation (PUE) attack. This attack prevents CRNs from using available portions of the spectrum and can even lead to a Denial of Service (DoS). In the fourth contribution of this the method is proposed in order to deal with such attack. The method relies on a set of time measures provided by the members of the network and allows estimating the position of an emitter. This estimation is then used to determine the legitimacy of a given transmission and detect PUE attacks. Cooperative methods are prone to be disrupted by malicious nodes reporting false data. This problem is addressed, in the context of cooperative location, in the fifth and last contribution of this thesis. A method based on Least Median Squares (LMS) fitting is proposed in order to detect forged measures and make the location process robust to them. The efficiency and accuracy of the proposed methodologies are demonstrated by means of simulation

Метод багатокритерійної кластеризації бездротової інформаційно-комунікаційної мережі

У статті проведено аналіз сучасних методів кластеризації інформаційно-комунікаційної мережі. Удосконалено метод багатокритерійної кластеризації бездротової інформаційно-комунікаційної мережі, який відрізняється методом багатокритерійної оптимізації за нелінійною схемою компромісів, що дає можливість зменшити час на передачу інформації. Зменшення часу на передачу інформації досягається за рахунок вибору в якості контролеру кластеру того вузла, який має найбільший запас живлення акумуляторної батареї, найвищу пропускну здатність та найменшу сумарну відстань до всіх вузлів кластеру

A Multidimensional Trust Evaluation Model for MANETs

Effective trust management can enhance nodes’ cooperation in selecting trustworthy and optimal paths between the source and destination nodes in mobile ad hoc networks (MANETs). It allows the wireless nodes (WNs) in a MANET environment to deal with uncertainty about the future actions of other participants. The main challenges in MANETs are time-varying network architecture due to the mobility of WNs, the presence of attack-prone nodes, and extreme resource limitations. In this paper, an energy-aware and social trust inspired multidimensional trust management model is proposed to achieve enhanced quality of service (QoS) parameters by overcoming these challenges. The trust management model calculates the trust value of the WNs through peer to peer and link evaluations. Energy and social trust are utilized for peer to peer evaluation, while an optimal routing path with a small number of intermediate nodes with minimum acceptable trust value is used for evaluation of the link. Empirical analysis reveals that the proposed trust model is robust and accurate in comparison to the state-of-the-art model for MANETs

Towards Trustworthy, Efficient and Scalable Distributed Wireless Systems

Advances in wireless technologies have enabled distributed mobile devices to connect with each other to form distributed wireless systems. Due to the absence of infrastructure, distributed wireless systems require node cooperation in multi-hop routing. However, the openness and decentralized nature of distributed wireless systems where each node labors under a resource constraint introduces three challenges: (1) cooperation incentives that effectively encourage nodes to offer services and thwart the intentions of selfish and malicious nodes, (2) cooperation incentives that are efficient to deploy, use and maintain, and (3) routing to efficiently deliver messages with less overhead and lower delay. While most previous cooperation incentive mechanisms rely on either a reputation system or a price system, neither provides sufficiently effective cooperation incentives nor efficient resource consumption. Also, previous routing algorithms are not sufficiently efficient in terms of routing overhead or delay. In this research, we propose mechanisms to improve the trustworthiness, scalability, and efficiency of the distributed wireless systems. Regarding trustworthiness, we study previous cooperation incentives based on game theory models. We then propose an integrated system that combines a reputation system and a price system to leverage the advantages of both methods to provide trustworthy services. Analytical and simulation results show higher performance for the integrated system compared to the other two systems in terms of the effectiveness of the cooperation incentives and detection of selfish nodes. Regarding scalability in a large-scale system, we propose a hierarchical Account-aided Reputation Management system (ARM) to efficiently and effectively provide cooperation incentives with small overhead. To globally collect all node reputation information to accurately calculate node reputation information and detect abnormal reputation information with low overhead, ARM builds a hierarchical locality-aware Distributed Hash Table (DHT) infrastructure for the efficient and integrated operation of both reputation systems and price systems. Based on the DHT infrastructure, ARM can reduce the reputation management overhead in reputation and price systems. We also design a distributed reputation manager auditing protocol to detect a malicious reputation manager. The experimental results show that ARM can detect the uncooperative nodes that gain fraudulent benefits while still being considered as trustworthy in previous reputation and price systems. Also, it can effectively identify misreported, falsified, and conspiratorial information, providing accurate node reputations that truly reflect node behaviors. Regarding an efficient distributed system, we propose a social network and duration utility-based distributed multi-copy routing protocol for delay tolerant networks based on the ARM system. The routing protocol fully exploits node movement patterns in the social network to increase delivery throughput and decrease delivery delay while generating low overhead. The simulation results show that the proposed routing protocol outperforms the epidemic routing and spray and wait routing in terms of higher message delivery throughput, lower message delivery delay, lower message delivery overhead, and higher packet delivery success rate. The three components proposed in this dissertation research improve the trustworthiness, scalability, and efficiency of distributed wireless systems to meet the requirements of diversified distributed wireless applications

Towards privacy-aware identity management

The overall goal of the PRIME project (Privacy and Identity Management for Europe) is the development of a privacy-enhanced identity management system that allows users to control the release of their personal information. The PRIME architecture includes an Access Control component allowing the enforcement of protection requirements on personal identifiable information (PII). The overall goal of the PRIME project (Privacy and Identity Management for Europe) is the development of a privacy-enhanced identity management system that allows users to control the release of their personal information. The PRIME architecture includes an Access Control component allowing the enforcement of protection requirements on personal identifiable information (PII)

High Quality P2P Service Provisioning via Decentralized Trust Management

Trust management is essential to fostering cooperation and high quality service provisioning in several peer-to-peer (P2P) applications. Among those applications are customer-to-customer (C2C) trading sites and markets of services implemented on top of centralized infrastructures, P2P systems, or online social networks. Under these application contexts, existing work does not adequately address the heterogeneity of the problem settings in practice. This heterogeneity includes the different approaches employed by the participants to evaluate trustworthiness of their partners, the diversity in contextual factors that influence service provisioning quality, as well as the variety of possible behavioral patterns of the participants. This thesis presents the design and usage of appropriate computational trust models to enforce cooperation and ensure high quality P2P service provisioning, considering the above heterogeneity issues. In this thesis, first I will propose a graphical probabilistic framework for peers to model and evaluate trustworthiness of the others in a highly heterogeneous setting. The framework targets many important issues in trust research literature: the multi-dimensionality of trust, the reliability of different rating sources, and the personalized modeling and computation of trust in a participant based on the quality of services it provides. Next, an analysis on the effective usage of computational trust models in environments where participants exhibit various behaviors, e.g., honest, rational, and malicious, will be presented. I provide theoretical results showing the conditions under which cooperation emerges when using trust learning models with a given detecting accuracy and how cooperation can still be sustained while reducing the cost and accuracy of those models. As another contribution, I also design and implement a general prototyping and simulation framework for reputation-based trust systems. The developed simulator can be used for many purposes, such as to discover new trust-related phenomena or to evaluate performance of a trust learning algorithm in complex settings. Two potential applications of computational trust models are then discussed: (1) the selection and ranking of (Web) services based on quality ratings from reputable users, and (2) the use of a trust model to choose reliable delegates in a key recovery scenario in a distributed online social network. Finally, I will identify a number of various issues in building next-generation, open reputation-based trust management systems as well as propose several future research directions starting from the work in this thesis

Content Sharing in Mobile Networks with Infrastructure: Planning and Management

This thesis focuses on mobile ad-hoc networks (with pedestrian or vehicular mobility) having infrastructure support. We deal with the problems of design, deployment and management of such networks. A first issue to address concerns infrastructure itself: how pervasive should it be in order for the network to operate at the same time efficiently and in a cost-effective manner? How should the units composing it (e.g., access points) be placed? There are several approaches to such questions in literature, and this thesis studies and compares them. Furthermore, in order to effectively design the infrastructure, we need to understand how and how much it will be used. As an example, what is the relationship between infrastructure-to-node and node-to-node communication? How far away, in time and space, do data travel before its destination is reached? A common assumption made when dealing with such problems is that perfect knowledge about the current and future node mobility is available. In this thesis, we also deal with the problem of assessing the impact that an imperfect, limited knowledge has on network performance. As far as the management of the network is concerned, this thesis presents a variant of the paradigm known as publish-and-subscribe. With respect to the original paradigm, our goal was to ensure a high probability of finding the requested content, even in presence of selfish, uncooperative nodes, or even nodes whose precise goal is harming the system. Each node is allowed to get from the network an amount of content which corresponds to the amount of content provided to other nodes. Nodes with caching capabilities are assisted in using their cache in order to improve the amount of offered conten