Game Theoretic Reward Based Adaptive Data Communication in Wireless Sensor Networks

Umar, Muhammad Muneer; Khan, Shafiullah; Ahmad, Rashid; Singh, Dhananjay

doi:10.1109/access.2018.2833468

Cited by 19 publications

(20 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This method effectively prolongs the network life cycle and reduces the average energy consumption of nodes. Umar et al 21 proposed an adaptive data communication method based on game theory reward for selfish or non-cooperative behavior of nodes. This method encourages the cooperation of nodes in the forwarding process through the reward and punishment mechanism, and effectively balances the workload of network nodes.…”

Section: Related Workmentioning

confidence: 99%

Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality

Hao

Hou

Dang

et al. 2021

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Aiming at the problems of low data transmission efficiency and uneven energy consumption caused by unreliable link communication in the routing process of wireless sensor networks, this article designs a routing game algorithm based on link quality. In this article, the index for evaluating link quality is defined first. Then, the link quality, node residual energy, and minimum jump transmission strategy are integrated into the utility function to establish a game model to determine the best next hop transmission node. Finally, the routing optimal transmission path is obtained according to the analysis of the existence of Nash equilibrium in the game. In the simulation experiment, the influence of the change of link quality parameters on the performance of the algorithm is analyzed, and the proposed algorithm is compared with non-linear weight particle swarm optimization (NWPSO) algorithm and Low Energy Adaptive Clustering Hierarchy-Improvement (LEACH-IMPT) algorithm in three aspects: the number of surviving nodes, network lifetime, and network energy consumption. The results show that the network lifetime of this method is 16.8% longer than that of LEACH-IMPT algorithm and 7.5% longer than that of NWPSO algorithm. This shows that the algorithm can effectively balance the network energy consumption and prolong the network life cycle. In addition, according to the routing path obtained in the simulation experiment, the optimality of its link quality is verified in the real experimental environment, and the experimental results prove the feasibility of the method in this article in practice.

show abstract

Section: Related Workmentioning

confidence: 99%

Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality

Hao

Hou

Dang

et al. 2021

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Socievole et al 49 proposed a social approach to encourage selfish and misbehavior nodes for cooperation. Umar et al 50 proposed a game‐theoretic scheme that motivates the nodes for cooperation to reduces the load on nodes. Vamsi et al 51 proposed a trust‐aware scheme to stimulate the nodes to take part in the routing process.…”

Section: Related Workmentioning

confidence: 99%

Honesty based democratic scheme to improve community cooperation for Internet of Things based vehicular delay tolerant networks

Rehman

Ghani

Zubair

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Many Internet of Things (IoT) applications have been developed and implemented on unreliable wireless networks like the delay tolerant network (DTN); however, efficient data transfer in DTN is still an important issue for the IoT applications. One of the application areas of DTN is vehicular delay tolerant network (VDTN) where the network faces communication disruption due to lack of end‐to‐end relay route. It is challenging as some of the nodes show selfish behavior to preserve their resources like memory and energy and become noncooperative. In this article, an honesty‐based democratic scheme (HBDS) is introduced where vehicles with higher honesty level are elected as heads—during the process. Vehicles involved in the process would maximize their rewards (reputation) through active participation in the network activities, whereas vehicles with noncooperative selfish behavior are punished. The honesty level of the heads is analyzed using Vickrey, Clarke, and Groves (VCG) model. The mathematical model and algorithms developed in the proposed HBDS technique are simulated using the VDTNSim framework to evaluate their efficiency. The performance results show that the proposed scheme dominates current schemes in terms of packet delivery probability, packet delivery delay, number of packets drop, and overhead ratio.

show abstract

“…The messages are barter traded between node and community. Umar et al [25] has proposed a game theoretic reward based technique which reduced a load of nodes in the network by encouraging them to behave in a cooperative manner. This social aspect of the nodes is utilized by the researchers to tackle the routing and other issues like social selfishness in a network.…”

Section: Related Workmentioning

confidence: 99%

IPS: Incentive and Punishment Scheme for Omitting Selfishness in the Internet of Vehicles (Iov)

Rehman¹,

Ghani

Zubair³

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

Internet of Vehicles (IoV) is a new emerging concept and is an extended notion of Vehicular Ad-hoc networks (VANETs). In IoV the vehicles (nodes) are connected to the internet and able to transmit information. However, due to resources constraint nature of vehicles, they may not want to cooperate in order to save its own resources such as memory, energy, and buffer, etc. This behavior may lead to poor system performance. IoV needs an efficient solution to motivate the nodes in terms of cooperation to avoid selfish behavior. A novel mechanism Incentive and Punishment Scheme (IPS) has been proposed in this article where vehicles with higher weight and cooperation are elected as Heads during the election process. Vickrey, Clarke, and Groves (VCG) model has been used to scrutinize the weight of these heads. Vehicle participating in the election process can increase its incentives (reputation) by active participation (forwarding data). Vehicles with repeated selfish behavior are punished. The monitoring nodes monitor the performance of their neighbor nodes after the election process. A mathematical model and algorithms has been developed for the election, monitoring and incentive processes. The proposed approach has been simulated through VDTNSim environment to analyze the performance of the proposed IPS. The performance results demonstrate that the proposed schemes outperform the existing schemes in terms of packet delivery ratio, average delivery delay, average cost, and overhead. INDEX TERMS Internet of vehicles, smart objects, VCG model, selfish behavior, incentive techniques.

show abstract

Game Theoretic Reward Based Adaptive Data Communication in Wireless Sensor Networks

Cited by 19 publications

References 30 publications

Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality

Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality

Honesty based democratic scheme to improve community cooperation for Internet of Things based vehicular delay tolerant networks

IPS: Incentive and Punishment Scheme for Omitting Selfishness in the Internet of Vehicles (Iov)

Contact Info

Product

Resources

About