Research On Concurrent Transmission Scheme Based On Constructive Interference In Wireless Sensor Networks

The wireless sensor network(WSN)is a wireless network formed by a large number of sensor nodes with low-energy,limited computing and processing capacity connected by multiple hops and self-organizing.Although WSN mainly considers the optimization of energy consumption in the early stages of design,as it is increasingly applied to performance-sensitive applications,such as safety and emergency management,urban infrastructure monitoring,health care,and manufacturing and other data-intensive,which poses serious challenges to communication performance.Constructive Interference(CI)uses multiple nodes to simultaneously transmit the same packet,and multiple signals form constructive interference at the common receiver,which can avoid broadcast storms,enhance link quality,and reduce transmission delay.However,existing CI-based data distribution schemes require all nodes in the network to forward,which consumes more energy.Studies have shown that it is not the more nodes transmitting simultaneously,the better the performance of CI.In addition,the existing CI-based end-to-end transmission scheme only uses a small number of secondary nodes for concurrent transmission,and the transmission performance needs to be further improved.In order to solve the above problem,this paper studies the CI-based data concurrent transmission scheme in wireless sensor networks in the following two aspects: data dissemination and end-to-end transmission.(1)The topology control problem for data distribution based on constructive interference in WSNs(TCCD).It mainly studies how to reasonably select the set of concurrent nodes for data transmission,so that the transmission latency and the transmission energy consumption are optimized.and is modeled as a multi-objective integer programming problem with nonlinear constraints.Firstly,this problem is modeled as a multi-objective integer programming problem with nonlinear constraints.Considering the high complexity of finding the optimal solution for large-scale WSNs,a central greedy heuristic algorithm is designed to find the sub-optimal solution.Simulation results show that the performance of this heuristic algorithm is close to the optimal solution.Considering the availability of the real WSNs environment,a distributed version(DGA)of a greedy heuristic algorithm using only local node information is proposed.Extensive simulation experiments show that the DGA algorithm has better transmission performance than the Baseline algorithm and existing algorithm.(2)A transmission scheme(CPS)based on concurrent transmission and sleep scheduling in a strip wireless sensor network.The scheme first divides the entire strip region into multiple partitions according to the partitioning algorithm,and designs a suitable sleep scheduling strategy for each partition.When a partition performs data forwarding,the node calculates its partition forwarding probability to decide whether to perform concurrent transmission.All partitions in the network are divided into the transport partition and the spare partition.The transport partition and the spare partition collaborate to complete the data transfer task.Simulation experiments show that the CPS can significantly reduce end-to-end transmission delay at the cost of a small amount of power consumption compared to other CI-based sleep scheduling transmission schemes.