An incentive-based leader selection mechanism for mobile ad-hoc networks (MANETs)

In this paper, we study the problem of leader selection in the presence of selfish nodes in mobile ad-hoc networks (MANETs). In order to encourage selfish nodes to assume the leadership role, some form of incentive mechanism is required. We present an incentive-based leader selection mechanism in which incentives are incorporated in the form of credit transfer to the leader, which motivates nodes to compete with each other for assuming the leadership role. The competition among nodes is modeled as a series of one-on-one incomplete information, alternating offers bargaining games. Furthermore, we propose an efficient algorithm in order to reduce the communication overhead imposed on the network for selecting a new leader, in case the current leader is disconnected from the network due to reasons such as mobility and battery depletion. Simulation results show that the proposed mechanism not only increases the overall lifetime of a network, but also decreases the amount of imposed communication overhead on the network in comparison with the traditional leader selection algorithms.

[1]  Haiying Shen,et al.  Game-Theoretic Analysis of Cooperation Incentive Strategies in Mobile Ad Hoc Networks , 2012, IEEE Transactions on Mobile Computing.

[2]  Prabir Bhattacharya,et al.  This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. IEEE TRANSACTIONS ON DEPEDABLE AND SECURE COMPUTING 1 Mechanism Design-Based Secure Leader Elec , 2022 .

[3]  Wenke Lee,et al.  A cooperative intrusion detection system for ad hoc networks , 2003, SASN '03.

[4]  Simon A. Dobson,et al.  Enhancement of Self-organisation in Wireless Networking through a Cross-Layer Approach , 2009, ADHOCNETS.

[5]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

[6]  Ron Lavi,et al.  Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.

[7]  Yang Yang,et al.  A Service Negotiation Model for Selfish Nodes in the Mobile Ad Hoc Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

[8]  Sajal K. Das,et al.  A Game Theory-Based Pricing Strategy to Support Single/Multiclass Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems , 2007, IEEE Transactions on Parallel and Distributed Systems.

[9]  J.-Y. Le Boudec,et al.  Toward self-organized mobile ad hoc networks: the terminodes project , 2001, IEEE Commun. Mag..

[10]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Ratan K. Guha,et al.  Effective intrusion detection using multiple sensors in wireless ad hoc networks , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[12]  Julita Vassileva,et al.  An extended alternating-offers bargaining protocol for automated negotiation in multi-agent systems , 2002, OTM.

[13]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[14]  Orhan Dagdeviren,et al.  A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks , 2008, ICCS.