Study On Channel Allocation Algorithm Based On Game For Wireless Sensor Network

Wireless sensor network(WSN) is an important part of the extensive application of the Internet of Things. And the self organization and fault tolerance ability of WSN make WSN be very suitable for special environment. However, the development of wireless communication technology makes the spectrum resources increasingly scarce. Furtnermore, the lack of reasonable channel allocation seriously increases the interference among nodes. The communication interference affects the success of data transmission, which influences the desired functionality and performance of WSN. At the same time, it exacerbates the retransmission energy consumption. As a result, some nodes prematurely fail, which reduces the network lifetime. What’s more, the failure of node may cause cascade failure to affect the application performance of WSN seriously. Thus, it has a certain theoretical and practical significance to study channel allocation algorithm to reduce interference, prolong the network lifetime and improve the anti-destroying ability of network for WSN with limited energy. This paper carries out the research on channel allocation algorithm for WSN based on game theory. The concrete researchs are as follows.(1) This paper illustrates the structure of WSN, and the research background and significance of this topic that studys channel allocation algorithm based on game theory, firstly. Then we analyse the research status at home and abroad of this topic, and summarize the existing algorithms. At the same time, we put forward the problems existing in the existing algorithms. These works provide a theoretical basis for the research of multi-channel allocation algorithm of WSN.(2) Considering that the lager interference will make some nodes of WSN prematurely fail and the network lifetime reduces, a novel lifetime model of nodes is structured by taking full advantage of the node load and esidual energy. And then, based on the best response dynamics, an anti-interference channel allocation algorithm(called CAGLO) is designed to optimize network lifetime. This algorithm uses ordinal potential game to integrate the path gain, intersecting interference and node lifetime into a utility function. And the channel selection with less interference, less and balanced energy consumption can be realized by maximizing the utility function, which prolongs the network lifetime effectively.(3) Due to the bad application environment and the absence of spectrum resources, the network interference and the energy consumption increase seriously, and anti-destroying ability of network is weakened. To solve the question, an improved lifetime optimization game algorithm(named CAIAD) for anti-destroying is proposed. This algorithm uses the composite failure probability and cascading failure coefficient to describe the anti-destroying ability of every node. Then, adopting potential game and the best response dynamics to select channel, which reduces the network interference and composite failure probability, and inhibit the phenomenon of network cascade, improve the network anti-destroying ability.