Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Secure Selective Exclusion in Ad Hoc Wireless Network
SEC '02 Proceedings of the IFIP TC11 17th International Conference on Information Security: Visions and Perspectives
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Rushing attacks and defense in wireless ad hoc network routing protocols
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine
Small-world optimization based QoS multicast routing scheme with ABC supported
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Cooperative game-based routing approach for wireless sensor network
International Journal of Computer Applications in Technology
Hi-index | 0.00 |
This paper focuses on the design of security enforcement mechanisms for the prevention of denial of service (DoS) attacks in wireless sensor networks. In the first part, we identify the requirement for security enforcement using auction theory, which allows us to detect non-cooperative nodes. Our novel scheme for preventing DoS attacks is called Secure Auction based Routing (SAR). In the proposed protocol, nodes prefer to participate in forwarding incoming packets and gaining reputation in the network. Nodes willing to do so must compete against each other, and the competition is based on auction theory. The amount of bid that each node offers is equal to its utility value; and the price that a winner of a bid pays is a reduction in its original battery power. Since a node's truthful bidding is shown to be a dominant strategy, in order to prevent DoS attack, nodes that do not bid truthfully should be isolated. In the second part, we formulate the attack-defense problem as a non-cooperative, two-player, non-zero-sum game between an attacker and a wireless sensor network. We show that this game achieves Nash equilibrium, thus leading to a defense strategy for the network. We propose two novel schemes. The first one is called Utility based Dynamic Source Routing (UDSR), which incorporates the total utility of each en-route node in data packets, where utility is the difference between gain and cost for each node. The second scheme is based on a watch-list, where each node earns a rating from its neighbors, based on its previous cooperation in the network. Simulation results show that the proposed game theoretic framework significantly increases the chance of success in defense strategy for the wireless sensor network.