"... this paper we propose two methods to evaluate the effectiveness of the CORE mechanism based on a cooperative game approach and a non-cooperative game approach: the results obtained using the first approach define a lower bound on the number of legitimate nodes in an ad hoc network when the CORE mech ..."

this paper we propose two methods to evaluate the effectiveness of the CORE mechanism based on a cooperative game approach and a non-cooperative game approach: the results obtained using the first approach define a lower bound on the number of legitimate nodes in an ad hoc network when the CORE mechanism is adopted while the second approach describe the asymptotical behavior of a selfish node that is controlled by CORE

"... Abstract—A hybrid ad hoc network is a structure-based network that is extended using multihop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station that has no direct connection with a ..."

Abstract—A hybrid ad hoc network is a structure-based network that is extended using multihop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station that has no direct connection with a base station can use other mobile stations as relays. Compared with conventional (single-hop) structure-based networks, this new generation can lead to a better use of the available spectrum and to a reduction of infrastructure costs. However, these benefits would vanish if the mobile nodes did not properly cooperate and forward packets for other nodes. In this paper, we propose a charging and rewarding scheme to encourage the most fundamental operation, namely packet forwarding. We use “MAC layering ” to reduce the space overhead in the packets and a stream cipher encryption mechanism to provide “implicit authentication ” of the nodes involved in the communication. We analyze the robustness of our protocols against rational and malicious attacks. We show that—using our solution—collaboration is rational for selfish nodes. We also show that our protocols thwart rational attacks and detect malicious attacks. Index Terms—Network-level security and protection, wireless communication, authentication security, payment schemes. 1

"... Abstract—Insufficiency of memory and battery power of sensors makes the security of sensor networks a hard task to do. This insufficiency also makes applying the existing methods of securing other type of networks on the sensor networks unsuitable. We propose a game theoretic framework for defensing ..."

Abstract—Insufficiency of memory and battery power of sensors makes the security of sensor networks a hard task to do. This insufficiency also makes applying the existing methods of securing other type of networks on the sensor networks unsuitable. We propose a game theoretic framework for defensing nodes in a sensor network. We apply three different schemes for defense. Our main concern in all three schemes is finding the most vulnerable node in a sensor network and protecting it. In the first scheme we formulate attack-defense problem as a two-player, nonzero-sum, non-cooperative game between an attacker and a sensor network. We show that this game achieves Nash equilibrium and thus leading to a defense strategy for the network. In the second scheme we use Markov Decision Process to predict the most vulnerable senor node. In the third scheme we use an intuitive metric (node’s traffic) and protect the node with the highest value of this metric. We evaluate the performance of each of these three schemes, and show that the proposed game framework significantly increases the chance of success in defense strategy for sensor network. I.

"... Sensor networks enable a wide range of applications in both military and civilian domains. However, the deployment scenarios, the functionality requirements, and the limited capabilities of these networks expose them to a wide-range of attacks against control traffic (such as wormholes, Sybil attack ..."

Sensor networks enable a wide range of applications in both military and civilian domains. However, the deployment scenarios, the functionality requirements, and the limited capabilities of these networks expose them to a wide-range of attacks against control traffic (such as wormholes, Sybil attacks, rushing attacks, etc). In this paper we propose a lightweight protocol called DICAS that mitigates these attacks by detecting, diagnosing, and isolating the malicious nodes. DICAS uses as a fundamental building block the ability of a node to oversee its neighboring nodes’ communication. On top of DICAS, we build a secure routing protocol, LSR, which in addition supports multiple node-disjoint paths. We analyze the security guarantees of DICAS and use ns-2 simulations to show its effectiveness against three representative attacks. Overhead analysis is conducted to prove the lightweight nature of DICAS.

"... Securing ad hoc networks is notoriously challenging, notably due to the lack of an online infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case where an ad hoc network is under the respons ..."

Securing ad hoc networks is notoriously challenging, notably due to the lack of an online infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case where an ad hoc network is under the responsibility of a mother certification authority (mCA). Since the nodes can frequently be collectively isolated from the mCA (e.g., for a remote mission) but still need the access to a certification authority, the mCA preassigns a special role to several nodes (called servers) that constitute a distributed certification authority (dCA) during the isolated period. We propose a solution, called DICTATE (DIstributed CerTification Authority with probabilisTic frEshness), to manage the dCA. This solution ensures that the dCA always processes a certificate update (or query) request in a finite amount of time and that an adversary cannot forge a certificate. Moreover, it guarantees that the dCA responds to a query request with the most recent version of the queried certificate in a certain probability; this probability can be made arbitrarily close to 1, but at the expense of higher overhead. Our contribution is twofold: 1) a set of certificate management protocols that allow trading protocol overhead for certificate freshness or the other way around, and 2) a combination of threshold and identity-based cryptosystems to guarantee the security, availability, and scalability of the certification function. We describe DICTATE in detail and, by security analysis and simulations, we show that it is robust against various attacks.

"... Abstract — In autonomous mobile ad hoc networks (MANET) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or, honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide ..."

Abstract — In autonomous mobile ad hoc networks (MANET) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or, honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide incentives for the users to act cooperatively by rewarding some payment for cooperative behaviors. In this paper, we model the pricing and routing as multi-stage dynamic games. By taking into consideration that the packet-forwarding will incur a cost to the relay user and the successful transmission brings benefits to the sender/receiver, we propose a dynamic pricing framework to maximize the sender/receiver’s payoff by considering the dynamic nature of MANETs, meanwhile, keeping the forwarding incentives of the relay nodes by providing the optimal payments based on the auction rules. The contributions of this paper are multi-folds: Firstly, by modeling the pricing and routing as a dynamic game, the sender is able to exploit the time diversity in MANET to increase their payoffs by adaptively allocating the packets to be transmitted into different stages. Secondly, based on the auction structure and routing dynamics, a simple optimal dynamic programming algorithm is developed to implement efficient multi-stage pricing for autonomous MANETs. Thirdly, the path diversity of MANET is exploited using the optimal auction mechanism in each stage. The simulation results illustrate that the proposed dynamic pricing framework has significant performance gains over the existing static pricing algorithms. I.

"... this paper solves both problems: It allows a mobile node to connect to a foreign Wireless Internet Service Provider (WISP) in a secure way while preserving its anonymity and it encourages the WISPs to provide the users with good QoS. We analyze the robustness of our solution against various attac ..."

this paper solves both problems: It allows a mobile node to connect to a foreign Wireless Internet Service Provider (WISP) in a secure way while preserving its anonymity and it encourages the WISPs to provide the users with good QoS. We analyze the robustness of our solution against various attacks and we prove by means of simulations that our reputation model indeed encourages the WISPs to behave correctly

Abstract — Though destructive to network functions, insider attackers are not detectable with only the classic cryptographybased techniques. Many mission-critic sensor network applications demand an effective, light, flexible algorithm for internal adversary identification with only localized information available. The insider attacker detection scheme proposed in this paper meets all the requirements by exploring the spatial correlation existent among the networking behaviors of sensors in close proximity. Our work is exploratory in that the proposed algorithm considers multiple attributes simultaneously in node behavior evaluation, with no requirement on a prior knowledge about normal/malicious sensor activities. Moreover, it is applicationfriendly, which employs original measurements from sensors and can be employed to monitor many aspects of sensor networking behaviors. Our algorithm is purely localized, fitting well to the large-scale sensor networks. Simulation results indicate that internal adversaries can be identifiedwithahighaccuracyand a low false alarm rate when as many as 25 % sensors are misbehaving. I.

"... Abstract—We consider the problem of establishing a route and sending packets between a source/destination pair in ad hoc networks composed of rational selfish nodes whose purpose is to maximize their own utility. In order to motivate nodes to follow the protocol specification, we use side payments t ..."

Abstract—We consider the problem of establishing a route and sending packets between a source/destination pair in ad hoc networks composed of rational selfish nodes whose purpose is to maximize their own utility. In order to motivate nodes to follow the protocol specification, we use side payments that are made to the forwarding nodes. Our goal is to design a fully distributed algorithm such that 1) a node is always better off participating in the protocol execution (individual rationality), 2) a node is always better off behaving according to the protocol specification (truthfulness), 3) messages are routed along the most energy-efficient (least cost) path, and 4) the message complexity is reasonably low. We introduce the COMMIT protocol for individually rational, truthful, and energy-efficient routing in ad hoc networks. To the best of our knowledge, this is the first ad hoc routing protocol with these features. COMMIT is based on the VCG payment scheme in conjunction with a novel game-theoretic technique to achieve truthfulness for the sender node. By means of simulation, we show that the inevitable economic inefficiency is small. As an aside, our work demonstrates the advantage of using a cross-layer approach to solving problems: Leveraging the existence of an underlying topology control protocol, we are able to simplify the design and analysis of our routing protocol and reduce its message complexity. On the other hand, our investigation of the routing problem in the presence of selfish nodes disclosed a new metric under which topology control protocols can be evaluated: the cost of cooperation. Index Terms—Wireless ad hoc networks, cooperation in ad hoc networks, cooperative routing, energy efficiency, topology control. Ç 1