SFPAG-R: A Reliable Routing Algorithm Based on Sealed First-Price Auction Games for Industrial Internet of Things Networks

Abstract

Due to the harsh deployment environment of the Industrial Internet of Things, the reliability of data transmission has always been an important challenge and a hot topic in Industrial Internet of Things (IIoT). Based on a multiple sink node network model, we propose a reliable routing algorithm called SFPAG-R, which is based on sealed first-price auction games. The algorithm offers a route discovery process and data transmission mechanism using the multi-sink network structure. The classic sealed first-price auction game is improved, and we propose a sealed first-price auction game model based on standard normal distribution, in order to ensure that the auction nodes can obtain higher returns. Based on an analysis of the factors affecting reliable data transmission in a large-scale, industrial IoT system, a data forwarding auction game model is established. Finally, to address the issue of selfish nodes, a dynamic revenue control method is proposed to promote cooperation between nodes. The simulation results indicate that the SFPAG-R algorithm proposed in this paper can reliably reduce the average amount of hops that occur during data transmission, ensure a high rate of successful data transmission, balance network energy consumption, and prolong the network's life cycle.