In self-organizing networks

nodes are less self-identical

while self-serving nodes do not do their best to forward data to reduce the reliability of the network.Based on this

the joint game theory is established in the dynamic Bayesian framework

and a data transmission algorithm based on Bayesian game is formed.The algorithm first finds out the bad nodes according to the beliefs of each node

and then calculates the joint belief probability of each predicated environment and normalizes the joint existence probability according to the prediction of the network environment by the bad nodes.Next

we calculate the security benefit values of each joint under each joint

and obtain the corresponding contract.Then we use a priori medium to refuse to find the Bayesian steady state contract.Finally

the bad nodes are punished by setting the security capacity to calculate the weights

to ensure that the security capacity and benefits of each node in the federation are maximized and the data is effectively forwarded.The simulation results show that

compared with the other two algorithms

the proposed algorithm not only has less routing delay and control overhead

but also has a higher packet delivery rate

which effectively reduces the adverse effects of the bad nodes on the network.