Background
The underwater wireless sensor network uses the acoustic link to carry out communication between nodes, and the propagation speed of the sound wave under water is about 1500m/s, which is 5 orders of magnitude lower than that of the electromagnetic wave used on land, so that the underwater wireless sensor network has the characteristic of long propagation delay, the propagation distance of 1000m needs 0.67s of time, which is undoubtedly very long, and therefore the nodes cannot know the state of the channel in time. When a node senses that a channel is in an idle state, the channel may be occupied by other nodes at the moment, and if the node selects to send a message at the moment, collision may occur. The underwater sensor node works by using an acoustic modem, and the data packet has a long lead code, so that the transmission delay of the data packet is long, the time for a node to completely receive a data packet is long, and in the period of time, if other data packets just arrive at the node, collision can be generated, and the transmission of the data packet is failed. This situation is even more severe in heavily loaded underwater acoustic sensor networks. As shown in fig. 2, in the competitive MAC protocol, nodes reserve channels by sending RTS control packets, and when network load is large, collision becomes severe, which results in waste of energy and time, and therefore an underwater channel competition mechanism based on nash balance is designed.
Disclosure of Invention
Aiming at the problem that the collision probability is high under the condition of large network load faced by an underwater infinite sensor network, the invention provides an underwater channel competition mechanism based on Nash equilibrium. The invention can reduce the collision of control packets and improve the success rate of handshaking, thereby improving the throughput of the network, reducing the end-to-end delay and reducing the energy consumption. The technical scheme is as follows:
the design of an underwater channel competition mechanism based on Nash equilibrium comprises the following steps:
(1) the n member nodes are randomly distributed in the transmission range of a main node, the member nodes and the main node are anchored at a certain depth underwater and communicate through an underwater acoustic communication link, all the nodes in the network are synchronous in time, and all the nodes obtain the scale of the network, namely the number of the member nodes in the network, through information interaction in an initialization stage; the behavior that all member nodes send RTS control packets to compete for the channel every time starts at the same time;
(2) when member nodes are uniformly distributed in the transmission range of the main node, when one node transmits a control packet at the time 0, the time when the control packet transmitted by one member node reaches the main node is modeled as [0, T [ ]
max]So that the collision probability of two arbitrary member nodes sending control packets at the same time on the master node can be expressed as
;
(3) The behavior that n member nodes send RTS control packets to compete for a channel at the same time is modeled into a non-cooperative game with incomplete information, a mixed strategy of the nodes at the beginning of one round of communication is set as (P, 1-P), wherein P is the probability of selective sending, and because each member node is a symmetric game party, when any member node sends the RTS control packet, the expectation of main node collision is that
The pay function is Y = P
.P
1 .S+P(1-P
1) F + (1-P) W, so that a Nash equilibrium under a hybrid strategy of (P, 1-P) can be obtained, wherein
S represents that the data sent by the node is successfully paid, W represents that the node waits for the payment which is not sent, and F represents that the node sends the payment which generates collision;
(4) and all the member nodes selectively send the RTS control packet competition channel according to the obtained mixed strategy, namely, a probability P sends the RTS control packet competition channel.
The invention provides an underwater channel competition mechanism based on Nash equilibrium, each node is taken as a game party, the behavior of sending an RTS control packet competition channel at the same time is modeled into a non-cooperative game with incomplete information, so that Nash equilibrium under a mixed strategy is obtained, and the nodes compete for the channel according to the mixed strategy, so that the handshake efficiency and the throughput are improved.
Drawings
In order to clearly illustrate the underwater channel competition mechanism based on nash equalization designed by the present invention, the following detailed explanation is made on the drawings involved in the present invention.
Fig. 1 is an application scenario for a channel contention mechanism designed by the present invention;
FIG. 2 is a diagram of data collisions caused by long transmission delays of data packets;
fig. 3 is a discrete probability distribution list of probabilities that no collision occurs.
Detailed description of the preferred embodiments
The invention provides an underwater channel competition mechanism based on Nash equilibrium, wherein each node is taken as a game party, the behavior of sending an RTS control packet competition channel at the same time is modeled into a non-cooperative game with incomplete information, so that Nash equilibrium under a mixed strategy is obtained, and the nodes compete for the channel according to the mixed strategy, so that the collision of control packets is reduced, and the success rate of handshake and the throughput of a network are improved.
The underwater channel competition mechanism based on Nash equilibrium is provided for a single-hop wireless sensor network communication scene based on a cluster structure, namely n member nodes are randomly distributed in the transmission range of a main node, the member nodes and the main node are anchored at a certain depth underwater and communicate through an underwater acoustic communication link, all nodes in the network are synchronous in time, all nodes obtain the scale of the network through information interaction in an initialization stage, the member nodes send collected data to the main node through the underwater acoustic link, and the main node forwards the data to a water surface gateway node through the underwater acoustic link after processing the data. The specific operation flow is directed to a single cluster consisting of n member nodes and a master node.
The specific operation flow of the invention is as follows:
(1) the n member nodes are randomly distributed in the transmission range of a main node, the member nodes and the main node are anchored at a certain depth underwater and communicate through an underwater acoustic communication link, all the nodes in the network are synchronous in time, and all the nodes obtain the scale of the network, namely the number of the member nodes in the network, through information interaction in an initialization stage; the behavior that all member nodes send RTS control packets to compete for the channel every time starts at the same time;
(2) when member nodes are uniformly distributed in the transmission range of the main node, when one node transmits a control packet at the time 0, the time when the control packet transmitted by one member node reaches the main node is modeled as [0, T [ ]
max]So that the collision probability of two arbitrary member nodes sending control packets at the same time on the master node can be expressed as
;
(3) The behavior that n member nodes send RTS control packets to compete for a channel at the same time is modeled into a non-cooperative game with incomplete information, a mixing strategy of the nodes at the beginning of one round of communication is set to be (P, 1-P), wherein P is the probability of selective sending, and as each member node is a symmetrical game party, the mixing strategy of each node is the same. After any member node i sends data, if m sending nodes send data in n-1 sending nodes in the transmission range of the main node, the probability that the m sending nodes cannot influence the receiving of the node i at the main node is equal to
Then at the same time, the probability that m sending nodes transmit data simultaneously is
Thus, the discrete distribution column of fig. 3 may be obtained, so that when any one member node sends an RTS control packet, the expectation of a primary node collision is
Then the pay function for i is Y = P
.P
1 .S+P(1-P
1) F + (1-P) W, derived from P
Then, a Nash equilibrium under a hybrid strategy of (P, 1-P) can be obtained, wherein
S represents that the data sent by the node is successfully paid, W represents that the node waits for the payment which is not sent, and F represents that the node sends the payment which generates collision;
(4) and all the member nodes selectively send the RTS control packet competition channel according to the obtained mixed strategy, namely, the probability P sends the RTS control packet competition channel.