An Incentive Mechanism for Cooperative Data Replication in MANETs - a Game Theoretical Approach

Wireless ad hoc networks have seen a great deal of attention in the past years, especially in cases where no infrastructure is available. The main goal in these networks is to provide good data accessibility for participants. Because of the wireless nodes' continuous movement, network partitioning occurs very often. In order to subside the negative effects of this partitioning and improve data accessibility and reliability, data is replicated in nodes other than the original owner of data. This duplication costs in terms of nodes' storage space and energy. Hence, autonomous nodes may behave selfishly in this cooperative process and do not replicate data. This kind of phenomenon is referred to as a strategic situation and is best modeled and analyzed using the game theory concept. In order to address this problem we propose a game theory data replication scheme by using the repeated game concept and prove that it is in the nodes' best interest to cooperate fully in the replication process if our mechanism is used

An Incentive Mechanism for Cooperative Data Replication in MANETs - A Game Theoretical Approach

Wireless ad hoc networks have seen a great deal of attention in the past years, especially in cases where no infrastructure is available. The main goal in these networks is to provide good data accessibility for participants. Because of the wireless nodes’ continuous movement, network partitioning occurs very often. In order to subside the negative effects of this partitioning and improve data accessibility and reliability, data is replicated in nodes other than the original owner of data. This duplication costs in terms of nodes’ storage space and energy. Hence, autonomous nodes may behave selfishly in this cooperative process and do not replicate data. This kind of phenomenon is referred to as a strategic situation and is best modeled and analyzed using the game theory concept. In order to address this problem we propose a game theory data replication scheme by using the repeated game concept and prove that it is in the nodes’ best interest to cooperate fully in the replication process if our mechanism is used

Distributed Selfish Coaching

Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems through the exposition of one node's resources to others. We study such concerns by considering a group of independent, rational, self-aware nodes that cooperate using on-line caching algorithms, where the exposed resource is the storage at each node. Motivated by content networking applications -- including web caching, CDNs, and P2P -- this paper extends our previous work on the on-line version of the problem, which was conducted under a game-theoretic framework, and limited to object replication. We identify and investigate two causes of mistreatment: (1) cache state interactions (due to the cooperative servicing of requests) and (2) the adoption of a common scheme for cache management policies. Using analytic models, numerical solutions of these models, as well as simulation experiments, we show that on-line cooperation schemes using caching are fairly robust to mistreatment caused by state interactions. To appear in a substantial manner, the interaction through the exchange of miss-streams has to be very intense, making it feasible for the mistreated nodes to detect and react to exploitation. This robustness ceases to exist when nodes fetch and store objects in response to remote requests, i.e., when they operate as Level-2 caches (or proxies) for other nodes. Regarding mistreatment due to a common scheme, we show that this can easily take place when the "outlier" characteristics of some of the nodes get overlooked. This finding underscores the importance of allowing cooperative caching nodes the flexibility of choosing from a diverse set of schemes to fit the peculiarities of individual nodes. To that end, we outline an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes. Our framework utilizes a simple control-theoretic approach to dynamically parameterize the cache management scheme. We show performance evaluation results that quantify the benefits from instantiating such a framework, which could be substantial under skewed demand profiles.National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 0202067); EU IST (CASCADAS and E-NEXT); Marie Curie Outgoing International Fellowship of the EU (MOIF-CT-2005-007230

Improving the Performance of Mobile Ad Hoc Network Using a Combined Credit Risk and Collaborative Watchdog Method

In mobile ad hoc networks nodes can move freely and link node failures occur frequently This leads to frequent network partitions which may significantly degrade the performance of data access in ad hoc networks When the network partition occurs mobile nodes in one network are not able to access data hosted by nodes in other networks In mobile ad hoc network some nodes may selfishly decide only to cooperate partially or not at all with other nodes These selfish nodes could then reduce the overall data accessibility in the network In this work the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation is examined We term this selfish replica allocation A combined credit risk method collaborative watchdog is proposed to detect the selfish node and also apply the SCF tree based replica allocation method to handle the selfish replica allocation appropriately The proposed method improves the data accessibility reduces communication cost and average query delay and also to reduce the detection time and to improve the accuracy of watchdogs in the collaborative metho

Energy Efficient unauthorized Intrusion Detection in mobile Ad-Hoc Neworks

Mobile Ad hoc Networks (MANET) are self-configuring, infrastructure-less, dynamic wireless networks in which the nodes are resource constrained. Intrusion Detection Systems (IDS) are used in MANETs to monitor activities so as to detect any intrusion in the network. The proposed system present efficient scheme for analyzing and optimizing the time duration for which the intrusion detection systems need to remain active in a Mobile Ad Hoc Network. A probabilistic model is proposed that makes use of cooperation between IDSs among neighborhood nodes to reduce their individual active time. Usually, an IDS has to run all the time on every node to oversee the network behavior. This can turn out to be a costly overhead for a battery-powered mobile device in terms of power and computational resources. Hence, this project aim is to reduce the duration of active time of the IDSs without compromising on their effectiveness. To validate this proposed approach, it models the interactions between IDSs as a multi-player cooperative game in which the players have partially cooperative and partially conflicting goals

Energy Efficient Unauthorized Intrusion Detection in Mobile AD-HOC Networks

Mobile Ad hoc Networks (MANET) are self-configuring, infrastructure-less, dynamic wireless networks in which the nodes are resource constrained. Intrusion Detection Systems (IDS) are used in MANETs to monitor activities so as to detect any intrusion in the network. The proposed system present efficient scheme for analyzing and optimizing the time duration for which the intrusion detection systems need to remain active in a Mobile Ad Hoc Network. A probabilistic model is proposed that makes use of cooperation between IDSs among neighborhood nodes to reduce their individual active time. Usually, an IDS has to run all the time on every node to oversee the network behavior. This can turn out to be a costly overhead for a battery-powered mobile device in terms of power and computational resources. Hence, this project aim is to reduce the duration of active time of the IDSs without compromising on their effectiveness. To validate this proposed approach, it models the interactions between IDSs as a multi-player cooperative game in which the players have partially cooperative and partially conflicting goals

Manifestation and mitigation of node misbehaviour in adhoc networks

Mobile adhoc network is signified as a boon for advance and future wireless communication system. Owing to its self-establishing network features and decentralization, the system can actually establish a wireless communication with vast range of connectivity with the other nodes. However, the system of MANET is also beheld with various technical impediments owing to its inherent dynamic topologies. Although there are abundant volume of research work, but very few have been able to effectively address the node misbehavior problems in MANET. The paper initially tries to draw a line between different types of nodes in MANETs based on their behavior characteristics, then reviews some of the significant contribution of the prior researches for addressing node misbehavior issues. A major emphasis is laid on is the researches which use game theory as a tool to study and address the misbehavior problems. The manuscript is developed considering some of the latest and standard evidences of past 5 years and finally discusses the open issues related to the problems

Robotic Wireless Sensor Networks

In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future