Multi-hop data dissemination with selfish nodes: Optimal decision and fair cost allocation based on the Shapley value

We consider a data dissemination scenario in a wireless network with selfish nodes. A message available at a source node has to be disseminated through the network in a multi-hop manner. In order to incentivize a node to forward the source's message to others, a forwarding cost is paid to a forwarder by its respective receiver. In the case of multicast transmission, the cost is shared among the receivers using the Shapley value (SV). Moreover, a node may exploit the maximal ratio combining (MRC) technique to receive the message from multiple transmitting nodes. In this paper, we show that in a game theoretic framework, the optimal decision of a node for receiving the message with minimum cost can be achieved by solving a linear optimization problem. In addition, we propose an algorithm by which truthfulness is a dominant strategy for the nodes and thus, fair cost allocation is guaranteed. Simulation results show that our proposed algorithm shares the cost of data dissemination among the nodes of a network in a fair manner. Compared to previous algorithms, the proposed algorithm can reduce the total cost paid by the nodes in the network for receiving messages.

[1]  Nasser Yazdani,et al.  Energy-efficient topology control in wireless ad hoc networks with selfish nodes , 2012, Comput. Networks.

[2]  J. V. D. Merwe,et al.  Self-Organized Public Key Management for Mobile Ad Hoc Networks , 2002 .

[3]  Jason R. Marden,et al.  Stable utility design for distributed resource allocation , 2014, 53rd IEEE Conference on Decision and Control.

[4]  David Hausheer,et al.  Power Control in Wireless Broadcast Networks using Game Theory , 2015 .

[5]  David Hausheer,et al.  Game-based multi-hop broadcast including power control and MRC in wireless networks , 2015, 2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[6]  Alessandro Aldini,et al.  Virtual currency and reputation-based cooperation incentives in user-centric networks , 2012, 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC).

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

[8]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[9]  Ivan Stojmenovic,et al.  MOBILE AD HOC NETWORKING : THE CUTTING EDGE DIRECTIONS , 2012 .

[10]  Jiannong Cao,et al.  Sleeping Schedule Aware Minimum Transmission Broadcast in Wireless Ad Hoc Networks , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.

[11]  G. Owen,et al.  A Simple Expression for the Shapley Value in a Special Case , 1973 .

[12]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[13]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[14]  L. S. Shapley,et al.  17. A Value for n-Person Games , 1953 .

[15]  Mohammed Wael Baidas,et al.  A game-theoretic framework with reinforcement learning for multinode cooperation in wireless networks , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).