A routing defense mechanism using evolutionary game theory for Delay Tolerant Networks

Delay Tolerant Networks (DTNs) often suffer from intermittent disruption due to factors such as mobility and energy. Though lots of routing algorithms in DTNs have been proposed in the last few years, the routing security problems have not attracted enough attention. DTNs are still facing the threats from different kinds of routing attacks. In this paper, a general purpose defense mechanism is proposed against various routing attacks on DTNs. The defense mechanism is based on the routing path information acquired from the forwarded messages and the acknowledgment (ACK), and it is suitable for different routing schemes. Evolutionary game theory is applied with the defense mechanism to analyze and facilitate the strategy changes of the nodes in the networks. Simulation results show that the proposed evolutionary game theory based defense scheme can achieve high average delivery ratio, low network overhead and low average transmission delay in various routing attack scenarios. By introducing the game theory, the networks can avoid being attacked and provide normal transmission service. The networks can reach evolutionary strategy stable (ESS) under special conditions after evolution. The initial parameters will affect the convergence speed and the final ESS, but the initial ratio of the nodes choosing different strategies can only affect the game process

Improved Intrusion Detection System using Quantal Response Equilibrium-based Game Model and Rule-based Classification

Wireless sensor network has large number of low-cost tiny nodes with sensing capability.  These provide low cost solutions to many real world problems such as such as defence, Internet of things, healthcare, environment monitoring and so on. The sensor nodes of these networks are placed in vulnerable environment. Hence, the security of these networks is very important. Intrusion Detection System (IDS) plays an important role in providing a security to such type of networks. The sensor nodes of the network have limited power and, traditional security mechanisms such as key-management, encryption decryption and authentication techniques cannot be installed on the nodes. Hence, there is a need of special security mechanism to handle the intrusions. In this paper, intrusion detection system is designed and implemented using game theory and machine learning to identify multiple attacks. Game theory is designed and used to apply the IDS optimally in WSN. The game model is designed by defining the players and the corresponding strategies. Quantal Response Equilibrium (QRE) concept of game theory is used to select the strategies in optimal way for the intrusion’s detection. Further, these intrusions are classified as denial of service attack, rank attack or selective forwarding attacks using supervised machine learning technique based on different parameters and rules. Results show that all the attacks are detected with good detection rate and the proposed approach provides optimal usage of IDS

Trust Management for Secure Routing Forwarding Data Using Delay Tolerant Networks

Delay Tolerant Networks (DTNs) have established the connection to source and destination. For example this often faces disconnection and unreliable wireless connections. A delay tolerant network (DTNs) provides a network imposes disruption or delay. The delay tolerant networks operate in limited resources such as memory size, central processing unit. Trust management protocol uses a dynamic threshold updating which overcomes the problems .The dynamic threshold update reduces the false detection probability of the malicious nodes. The system proposes a secure routing management schemes to adopt information security principles successfully. It analyzes the basic security principles and operations for trust authentication which is applicable in delay tolerant networks (DTNs).For security the proposed system identifies the store and forward approach in network communications and analyzes the routing in cases like selfish contact and collaboration contact methods. The proposed method identifies ZRP protocol scheme and it enhances the scheme using methods namely distributed operation, mobility, delay analysis, security association and trust modules. This security scheme analyzes the performance analysis and proposed algorithm based on parameter time, authentication, security, and secure routing. From this analysis, this research work identifies the issues in DTNs secure routing and enhances ZRP (Zone Routing Protocol) by suggesting an authentication principle as a noted security principle for extremely information security concepts

Cooperative Internet access using heterogeneous wireless networks

Ph.DDOCTOR OF PHILOSOPH

Erkennung und Vermeidung von Fehlverhalten in fahrzeugbasierten DTNs

Delay- and Disruption-Tolerant Networks (DTNs) are a suitable technology for many applications when the network suffers from intermittent connections and significant delays. In current vehicular networks, due to the high mobility of vehicles, the connectivity in vehicular networks can be highly unstable, links may change or break soon after they have been established and the network topology varies significantly depending on time and location. When the density of networked vehicles is low, connectivity is intermittent and with only a few transmission opportunities. This makes forwarding packets very difficult. For the next years, until a high penetration of networked vehicles is realized, delay-tolerant methods are a necessity in vehicular networks, leading to Vehicular DTNs (VDTNs). By implementing a store-carry-forward paradigm, VDTNs can make sure that even under difficult conditions, the network can be used by applications. However, we cannot assume that all vehicles are altruistic in VDTNs. Attackers can penetrate the communication systems of vehicles trying their best to destroy the network. Especially if multiple attackers collude to disrupt the network, the characteristics of VDTNs, without continuous connectivity, make most traditional strategies of detecting attackers infeasible. Additionally, selfish nodes may be reluctant to cooperate considering their profit, and due to hard- or software errors some vehicles cannot send or forward data. Hence, efficient mechanisms to detect malicious nodes in VDTNs are imperative. In this thesis, two classes of Misbehavior Detection Systems (MDSs) are proposed to defend VDTNs against malicious nodes. Both MDSs use encounter records (ERs) as proof to document nodes' behavior during previous contacts. By collecting and securely exchanging ERs, depending on different strategies in different classes of MDSs, a reputation system is built in order to punish bad behavior while encouraging cooperative behavior in the network. With independently operating nodes and asynchronous exchange of observations through ERs, both systems are very well suited for VDTNs, where there will be no continuous, ubiquitous network in the foreseeable future. By evaluating our methods through extensive simulations using different DTN routing protocols and different realistic scenarios, we find that both MDS classes are able to efficiently protect the system with low overhead and prevent malicious nodes from further disrupting the network.In Netzwerken mit zeitweisen Unterbrechungen oder langen Verzögerungen sind Delay- and Disruption-Tolerant Networks (DTNs) eine geeignete Technologie für viele Anwendungen. Die Konnektivität in Fahrzeugnetzen ist bedingt durch die hohe Mobilität und die geringe Verbreitung von netzwerkfähigen Fahrzeugen oft instabil. Bis zur flächendeckenden Verbreitung von netzwerkfähigen Fahrzeugen ist es daher zwingend notwendig auf Methoden des Delay Tolerant Networking zurückzugreifen um die bestmögliche Kommunikation zu gewährleisten. In diesem Zusammenhang wird von Vehicular Delay Tolerant Networks (VDTNs) gesprochen. Durch das Store-Carry-Forward-Prinzip kann ein VDTN Kommunikation für Anwendungen ermöglichen. Allerdings ist davon auszugehen, dass sich nicht alle Fahrzeuge altruistisch verhalten: Angreifer können Fahrzeuge übernehmen und das Netzwerk attackieren oder Knoten sind aus egoistischen Motiven oder auf Grund von Defekten unkooperativ. Verfahren, die Fehlverhalten in stabilen Netzen durch direkte Beobachtung erkennen können, sind in VDTNs nicht anwendbar. Daher sind Methoden, die Fehlverhalten in VDTNs nachweisen können, zwingend erforderlich. In dieser Arbeit werden zwei Klassen von Misbehavior Detection Systems (MDSs) vorgestellt. Beide Systeme basieren auf Encounter Records (ERs): Nach einem Kontakt tauschen zwei Knoten kryptografisch signierte Meta-Informationen zu den erfolgten Datentransfers aus. Diese ERs dienen bei darauffolgenden Kontakten mit anderen Netzwerkteilnehmern als vertrauenswürdiger Nachweis für das Verhalten eines Knotens in der Vergangenheit. Basierend auf der Auswertung gesammelter ERs wird ein Reputationssystem entwickelt, das kooperatives Verhalten belohnt und unkooperatives Verhalten bestraft. Dauerhaft unkooperative Knoten werden aus dem Netzwerk ausgeschlossen. Durch den asynchronen Austausch von Informationen kann jeder Knoten das Verhalten seiner Nachbarn selbstständig und unabhängig evaluieren. Dadurch sind die vorgestellten MDS-Varianten sehr gut für den Einsatz in einem VDTN geeignet. Durch umfangreiche Evaluationen wird gezeigt, dass sich die entwickelten MDS-Verfahren für verschiedene Routingprotokolle und in unterschiedlichen Szenarien anwenden lassen. In allen Fällen ist das MDS in der Lage das System mit geringem Overhead gegen Angreifer zu verteidigen und eine hohe Servicequalität im Netzwerk zu gewährleisten

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

Performance evaluation of cooperation strategies for m-health services and applications

Health telematics are becoming a major improvement for patients’ lives, especially for disabled, elderly, and chronically ill people. Information and communication technologies have rapidly grown along with the mobile Internet concept of anywhere and anytime connection. In this context, Mobile Health (m-Health) proposes healthcare services delivering, overcoming geographical, temporal and even organizational barriers. Pervasive and m-Health services aim to respond several emerging problems in health services, including the increasing number of chronic diseases related to lifestyle, high costs in existing national health services, the need to empower patients and families to self-care and manage their own healthcare, and the need to provide direct access to health services, regardless the time and place. Mobile Health (m- Health) systems include the use of mobile devices and applications that interact with patients and caretakers. However, mobile devices have several constraints (such as, processor, energy, and storage resource limitations), affecting the quality of service and user experience. Architectures based on mobile devices and wireless communications presents several challenged issues and constraints, such as, battery and storage capacity, broadcast constraints, interferences, disconnections, noises, limited bandwidths, and network delays. In this sense, cooperation-based approaches are presented as a solution to solve such limitations, focusing on increasing network connectivity, communication rates, and reliability. Cooperation is an important research topic that has been growing in recent years. With the advent of wireless networks, several recent studies present cooperation mechanisms and algorithms as a solution to improve wireless networks performance. In the absence of a stable network infrastructure, mobile nodes cooperate with each other performing all networking functionalities. For example, it can support intermediate nodes forwarding packets between two distant nodes. This Thesis proposes a novel cooperation strategy for m-Health services and applications. This reputation-based scheme uses a Web-service to handle all the nodes reputation and networking permissions. Its main goal is to provide Internet services to mobile devices without network connectivity through cooperation with neighbor devices. Therefore resolving the above mentioned network problems and resulting in a major improvement for m-Health network architectures performances. A performance evaluation of this proposal through a real network scenario demonstrating and validating this cooperative scheme using a real m-Health application is presented. A cryptography solution for m-Health applications under cooperative environments, called DE4MHA, is also proposed and evaluated using the same real network scenario and the same m-Health application. Finally, this work proposes, a generalized cooperative application framework, called MobiCoop, that extends the incentive-based cooperative scheme for m-Health applications for all mobile applications. Its performance evaluation is also presented through a real network scenario demonstrating and validating MobiCoop using different mobile applications