Game Theory Based Congestion Control for Routing in Wireless Sensor Networks

Abstract

The Congestion in wireless sensor networks can lead to the loss and retransmissions of packets, and excessive energy consumption. Since network congestion can deteriorate the throughput, the quality of service (QoS) in data transmission, and network lifetime, congestion control is a critical problem. In this paper, the data transmission process is firstly presented based on the data type. The cooperation game theory is used to model the transfer behavior of different type data. Further, a cooperation game based congestion control (CGCC) is proposed. The different type data cooperates with each other to use link capacity. And then Ant colony Routing algorithm combined with CGCC (ARCGCC) is designed. According to the congestion degree and QoS requirement of each type data, the routing path is built in the routing algorithm. When congestion is detected, the congestion information is exchange. In the light of the data traffic and priority, the nodes adjust the sending rate to the next hop node to mitigate the congestion. Experimental results show that our mechanism and algorithm have better performance than some other mechanism and algorithms in terms of the throughput, reliability, delay, and energy consumption.INDEX TERMS Wireless senor networks, congestion control, game theory, routing algorithm, QoS.

Distributed optimization game algorithm to improve energy efficiency for multi-radio multi-channel wireless sensor network

“…In Game Theory (Hu et al, 2021), there is a conflict of interest among the participants, where each participant chooses the strategy that maximizes his or her own interests based on the strategies of the other participants. So there is game and competition among participants.…”

Smart Bandwidth Prediction, Power Management and Adaptive Network Coding for WSN

“…However, as the simulation time increases, the delay and throughput progressively worsen. Cooperation game theory [10] is used to describe data transfer priorities. The level of congestion and the quality of service (QoS) requirements of each type of data inform the ant-based routing algorithm that is integrated with game theory to construct the path.…”

“…𝑀𝐷𝑇 = 𝑀𝑎𝑥 𝐷𝑎𝑡𝑎 𝑟𝑎𝑡𝑒 𝑇𝑟𝑎𝑛𝑠𝑚𝑖𝑡 = 𝐷 × 𝐸𝑇 (10) For network coding to take place, it is necessary and sufficient that nodes satisfy certain conditions in order to establish optimal pathways with potential coding nodes. Before to look at the network coding situation, let's establish some notations.…”