Study On Relay Selection Joint Consecutive Packet Transmission In Wireless Sensor Networks

How to reduce channel conflicts,latency and energy consumption has been a key problem to be solved for wake-up radio enabled wireless sensor networks.In a network with sparse data volume,most nodes have only few packets.In this case,there are more nodes involved in competition,but each node will only send less data after a successful competition,leading to intense conflicts and poor energy utilizationTo improve this situation,this thesis proposes a relay selection algorithm that enables packets to be gathered on a small number of nodes by a relay evaluation function.This function weights three factors,namely the number of packets,the distance to Sink,and the residual energy.Before sending data,a node selects the node with the highest value of the evaluation function in its relay set as the next hop of the route.In this way,the probability of a node with more packets becoming a relay increases,thus gathering the scattered packets in the network on a few nodes,reducing the number of nodes involved in competition,and the number of packets owned by each competing node also increases.In combination with the consecutive packet transmission strategy,nodes can send all the data in their queue at once after a successful competition,and the remaining failed nodes will not listen to the channel but go to sleep during this period,thus reducing conflicts and saving energy.In addition,in this thesis,in order to enable data gathering but prevent excessive delays,each node has two thresholds: packet queue length threshold and packet waiting time threshold,and the selection of relay nodes is performed when the current value of the node is greater than the corresponding threshold.In addition,for the energy hole problem in wireless sensor networks,these two thresholds are optimized in this thesis by using a small threshold in the far Sink region and a large threshold in the near Sink region to make full use of the remaining energy in the network and speed up data transmission.In this way,the Relay Selection for Packets Gathering joint Consecutive Packet Transmission(RSPG-CPT)strategy proposed in this paper will make nodes prefer those nodes with high number of packets,high residual energy and close to Sink as relay nodes for transmission during routing,thus reducing channel competition conflicts.Since the number of packets on the relay node is large,a successful competition enables a larger number of packets to be sent continuously,improving network throughput.Therefore,the RSPG-CPT algorithm combines the relay selection with the consecutive packet transmission strategy,which makes the performance of the network greatly improved.After the theoretical analysis and experimental results in this thesis,it is shown that the RSPG-CPT algorithm is able to improve packet reliability by 42.8%,reduce delay by 40.86%,and reduce energy consumption by 9.1%compared to the receiver-initiated consecutive packet transmission protocol using random routing.