Best neighbor strategy to enforce cooperation among selfish nodes in wireless ad hoc network推荐.pdfVIP

Computer Communications 30 (2007) 3721–3735 /locate/comcom Best neighbor strategy to enforce cooperation among selfish nodes in wireless ad hoc network K. Komathy *, P. Narayanasamy Department of Computer Science and Engineering, Anna University, Chennai, India Received 2 February 2007; received in revised form 12 July 2007; accepted 28 July 2007 Available online 6 August 2007 Abstract Trust among nodes in a self-organizing network such as a mobile ad hoc network presents a number of problems and paradoxes. One of the challenging characteristics of wireless and mobile ad hoc networks consists in exploring ways to cope up with selfish behavior of neighbors towards network functions such as routing and forwarding. This paper attempts to deal with such mechanisms and as a result it introduces a distinct model to study the behavior of selfish neighbors using strategic, non-cooperative game theory. Many research works have used Tit-For-Tat strategy for analysis when they deploy game theory to stimulate cooperation. A compliant and an adaptable strategy called Best Neighbor Strategy [BNS] is proposed in this paper for the packet forwarding game in a wireless ad hoc environment. The behavior of nodes is probed varying the proportion of selfishness and also the size of the population while forwarding the packets. The investigations have brought out that the proposed cooperation enforcement policy is scalable, is able to converge faster and is robust against selfishness. BNS achieves evolutionary stability even under the invasion of selfish strategy at different proportions. Further