High-density data transmission and scheduling method in wireless sensor networks based on Wi-Fi

Abstract

In wireless sensor network, the storage amount of information is high, and the transmission and scheduling of control information is reasonable. The node communication model, network structure model, and energy consumption model are constructed. On this basis, the high-density data in wireless sensor network are scheduled to optimize the time for nodes to perform tasks. The nodes in the network are fully scheduled to control the generation time of packets in the network and the generation time of packets in the network. Experimental results show that in different iterations, the proposed method has lower node delay and node energy consumption, with values less than 0.2 and 2, respectively, and the maximum data fusion quality can reach 98, with high fusion benefits, so as to improve the transmission and scheduling efficiency and quality of high-density data in wireless sensor network.

Keywords

Wireless sensor network high-density data transmission and scheduling energy consumption

Introduction

The rapid development of technologies and theories such as microelectronics, computers, embedded computing, communications, control, and radio frequency identification has led to the significant increase in the focus on the Internet of things in industry, academia, and governments.^1,2 The Internet of things is the future direction of the network, and it is the focus of the world information industry after the mobile communication network, the Internet, and computers. The Internet of things is the information carrier obtained on the basis of the traditional telecommunication network. It can realize the interconnection and interconnection between ordinary independent physical objects and has three characteristics of intelligence, interconnection, and equipment.^2,3 The Internet of things has been widely used in agriculture, defense and military, industrial manufacturing, logistics economy, health care, ecological and environmental protection, power grid, and food safety.^3,4 Its terminal network is the wireless sensor network, which provides the way to perceive the world of the Internet of things in a large space–time scale.⁵ Nodes have energy-limited phenomena in the network, and the main way to consume energy is data transmission. The main reason that affects the transmission delay of wireless sensor networks is data transmission scheduling. Therefore, it is necessary to study the data transmission scheduling method.

The work by Li⁶ proposed to build optimization models including data transmission model and conflict resolution model with the goal of collecting network data in a short time. Through the imaging software, the scheduling tasks of different sizes in the wireless sensor network are obtained, and the genetic algorithm and the dynamic programming method are combined to solve the problem, and the transmission of high-density data in the network is realized. In this method, the energy consumed by the node transmission data is higher, but there is a problem of high energy consumption of the node. The work by Lin et al.⁷ proposed to use the 0-k knapsack problem to replace the high-density data transmission and scheduling problem in the network. Based on the analysis of the structure characteristics of Fat-Tree, the operation rules, particle position, and particle velocity are determined. The data flow and scheduling model is constructed using the total difference value of the conflict flow in the two iterations as the objective function. The discrete particle swarm optimization algorithm is used to solve the data transmission scheduling model and realize the transmission scheduling of high-density data in the network. After scheduling by this method, there is the delay in the transmission of data in the network, and there is the problem of high node delay. The work by Chen et al.⁸ considers the difference between communication-based overhead and computational overhead and considers the balance between the two. The processor is allocated based on the shortest completion time to achieve transmission and scheduling of high-density data. The data fusion quality of this method is low, and there is the problem of low convergence income. The work by Gu⁹ determines the constraint conditions of scheduling resources, divides the state of resource data, and constructs a data scheduling model. The nodes are divided according to computing power, and the up-sorting value calculation method is used to sort the scheduling tasks in the wireless sensor network. The node that uses the shortest time to complete the scheduling task is selected as the distribution node to implement data transmission scheduling. This method has the problem of high energy consumption of nodes. The work by Zhang et al.¹⁰ proposed a secure storage method of high-density information in network data transmission center based on compressed sensing. The high-density information of network data transmission is measured by compressed sensing, and the data compression is reconstructed by optimizing the measurement matrix of storage nodes and forwarding probability. Considering the digital characteristics of data storage, such as the use intensity and minimum transmission granularity, the fingerprint gradient in the process of compression and reconstruction of data storage is optimized to realize the flow separation of high-density information data. This method can realize high-density information efficient storage and reduce the information security storage delay under the premise of flow separation, but the calculation process is complicated and the delay is high.

To solve the problems in the above methods, a high-density data transmission scheduling method based on Wi-Fi is proposed. Wi-Fi is a short-range wireless technology^11,12 used in offices and homes. Its advantages include wide coverage, fast transmission speed, low cost, and high data transmission efficiency. The node communication model, network structure model, and energy consumption model are constructed to clarify the key factors of data transmission, so as to improve the data transmission efficiency and reduce the time consumption. Wi-Fi technology is used to optimize the task execution time of nodes, improve the quality of data fusion, optimize the energy saving effect of data transmission, and realize the transmission scheduling of high-density data in wireless sensor network.

Materials and methods

Network model construction

Node communication model

The traditional node communication model can only deal with the data communication transmission between multiple nodes, which does not require high sending and receiving sensitivity of the nodes, but it will lead to inaccurate results of subsequent data processing. In this article, single-node data communication is the main research object to improve the transmission accuracy of high-density data on nodes. Suppose there is only one receiving node and sending node in the system. From the physical layer, whether high-density data can be efficiently transmitted between nodes depends on factors such as the receiving sensitivity of the receiving node in the wireless sensor network, the path loss of the signal in the network, and the transmitting power of the transmitting node in the wireless sensor network.¹³ Based on the determination of various parameters of the node transceiver, the main reason for influencing wireless sensor communication between nodes is channel fading.¹⁴

The free space propagation model is used to reflect the channel fading of space in the ideal medium. It is the relatively common ideal channel model. Let Pr(d) represents the fading function, and its expression is as follows

P_{r} (d) = \frac{P_{l} G_{l} G_{r} λ^{2}}{{(4 π)}^{2} d^{2} L}

(1)

where $P_{r}$ represents the received power of the receiver in the wireless sensor network, d represents the distance between the receiver and the transmitter, $P_{l}$ represents the power corresponding to the transmitter, $G_{l}$ represents the gain of the transmitting antenna during data transmission, $G_{r}$ represents the gain of the receiving antenna during data transmission, λ represents the wavelength of the RF signal in the wireless sensor network, L represents the loss factor.

The attenuation function of the two-path ground reflection model is as follows

P_{r} (d) = \frac{P_{l} G_{l} G_{r} h_{l}^{2} h_{r}^{2}}{L d^{4}}

(2)

where $h_{r}$ and $h_{l}$ represent the height of the receiver and transmitter, respectively.

Based on the channel attenuation model, the communication between nodes in the wireless sensor network can be expressed as

ec = {\begin{matrix} 1 & d \leq r \\ 0 & otherwise \end{matrix}

(3)

When the value of $ec$ is 1, communication between nodes can be realized in the network; when the value of $ec$ is 0,¹⁵ communication between nodes cannot be realized in the network; d represents the distance between the transmitting and receiving nodes in the network; $r$ represents the measured distance value of the transmission time.

Network structure model

The wireless sensor network is usually composed of several sensor nodes and sink nodes. In the absence of other interference, the communication capabilities of the two nodes in the network can be described by the node communication model. The number of nodes in the network is large. If multiple nodes are sent at the same time, the nodes are likely to interfere with each other. Protocol models and physical models are often used to describe communication interference between nodes in wireless sensor networks.^16,17

In the physical model, the data nodes sent at the same time are treated as sources of interference in the wireless sensor network channel. Considering the superposition of multiple node signals in the wireless sensor network, the given threshold or the size of the signal-to-noise ratio corresponding to the nodes determines whether the two nodes can communicate successfully in the wireless sensor network. $SIN R_{ij}$ represents the signal-to-noise ratio when the receiving node j receives the signal transmitted by the transmitting node i, and its calculation formula is as follows

SIN R_{ij} = \frac{P_{l} (d_{ij})}{N + \sum_{k \in S} P_{k} (d_{kj})}

(4)

where $d_{ij}$ represents the distance that exists between node i and node j in the wireless sensor network. $P_{j} (d_{ij})$ represents the signal strength corresponding to the signal transmitted by node i at node j. N stands for environmental noise. S stands for a set of nodes that simultaneously send information with node i.

Energy consumption model

The traditional wireless sensor data transmission energy consumption model is too general in the concept of energy consumption and does not classify it, resulting in inaccurate energy consumption evaluation results. There are two types of energy consumption, namely, the energy $P_{Rx}$ consumed to receive information and the energy $P_{Tx}$ consumed to transmit information.

$E_{Tx}$ represents the energy consumed by a node to transmit information in a wireless sensor network. The calculation formula is as follows

E_{Tx} = {\begin{matrix} E_{elec} b + ε_{fs} b r^{α} & (r < r_{0}) \\ E_{elec} b + ε_{amp} b r^{α} & (r \geq r_{0}) \end{matrix}

(5)

where b represents the number of bits acquired in a certain period of time. r represents the distance that the receiving node and the transmitting node exist in the wireless sensor network. $E_{elec}$ represents the energy consumed by a node to receive or send data. Both $ε_{fs}$ and $ε_{amp}$ represent constants, usually related to r and path loss exponent. α represents the path loss index. $r_{0}$ represents the conversion distance value between the multipath attenuation model and the free space model. When the conversion distance value $r_{0}$ is greater than the distance r, the signal in the network is propagated using the free space model, and the path loss index α is 2 at this time. When the conversion distance value $r_{0}$ is less than or equal to the distance r, the signal existing in the network is propagated using the multipath attenuation model, and the path loss index α is 4.¹⁸

Suppose $E_{Rx}$ represents the energy consumed by the node to receive data in the wireless sensor network. The formula is as follows

E_{Rx} = E_{elec} b

(6)

The energy consumption of all nodes in the network can be divided into two parts, namely the energy consumed to send data and receive data.^19,20 Assume that $E_{i}$ represents the energy consumed by the node receiving b in the wireless sensor network. The formula is as follows

E_{i} = E_{iTx} + E_{iRx}

(7)

According to the above analysis, for the data transmitted by the ancestor node, the nodes existing in the wireless sensor network can receive and forward. Suppose E represents the energy required for the node to receive and forward data in the wireless sensor network. The expression is as follows

E = [\begin{matrix} \begin{matrix} E_{11} & \dots & E_{1 i} \\ \dots & \dots & \dots \\ E_{i 1} & \dots & E_{ii} \end{matrix} \begin{matrix} \dots & E_{1 Z} \\ \dots & \dots \\ \dots & E_{iZ} \end{matrix} \\ \begin{matrix} \dots & \dots & \dots \\ E_{Z 1} & \dots & E_{Zi} \end{matrix} \begin{matrix} \dots & \dots \\ \dots & E_{ZZ} \end{matrix} \end{matrix}]

(8)

where $E_{ii}$ represents the energy consumption of receiving data within the node’s own coverage. When 1 ≤ i < j, $E_{ij}$ describes the energy consumed by node i to transfer the unit data amount to the receiving node j. When 1 > i ≥ j, $E_{ij}$ describes the energy consumed by node j to transfer the unit data amount to the receiving node i.²¹

It can be known from formula (6) that the distance does not affect the energy consumed by the node to receive data in the wireless sensor network, and the amount of data is the main reason that affects the energy consumption of the node receiving data.

According to the above analysis, the relationship between the length of the region, the total number of forwarding regions, and the distance between nodes satisfies the following formula

r = \frac{L}{Z}

(9)

When 1 ≤ i < j, the energy $E_{ij}$ can be calculated using equation (5), and the communication distance $r_{ij}$ of node i and node j in the wireless sensor network is calculated as follows

r_{ij} = r \times (j - i)

(10)

Combine formula (9) with formula (10) to get the following formula

r_{ij} = \frac{L}{Z} \times (j - i)

(11)

Combining equation (5) with equation (11), the energy consumed by the node to transmit data in the wireless sensor network is obtained

E_{ij} = {\begin{matrix} E_{elec} b + ε_{fs} b {[\frac{(j - i) L}{Z}]}^{α} & (r < r_{0}) \\ E_{elec} b + ε_{amp} b {[\frac{(j - i) L}{Z}]}^{α} & (r \geq r_{0}) \end{matrix}

(12)

The energy consumption of the data received by the node in the wireless sensor network can be directly calculated using equation (6), which is independent of the distance existing between the nodes.

The expressions for all nodes to forward and receive data X in the wireless sensor network are as follows

X = [\begin{matrix} \begin{matrix} X_{11} & \dots & X_{1 i} \\ \dots & \dots & \dots \\ X_{i 1} & \dots & X_{ii} \end{matrix} \begin{matrix} \dots & X_{1 Z} \\ \dots & \dots \\ \dots & X_{iZ} \end{matrix} \\ \begin{matrix} \dots & \dots & \dots \\ X_{Z 1} & \dots & X_{Zi} \end{matrix} \begin{matrix} \dots & \dots \\ \dots & X_{ZZ} \end{matrix} \end{matrix}]

(13)

where $X_{ii}$ represents the total amount of data that node i receives in the wireless sensor network within its own coverage. When 1 ≤ i < j, $X_{ij}$ is used to describe the total amount of data that node i transmits to node j in the wireless sensor network. When 1 > i ≥ j, $X_{ij}$ is used to describe the total amount of data that node i receives node j in the wireless sensor network.^22,23

The data that other nodes forward in the network and the data that the node itself perceives in the network are the same as the total amount of data forwarded by the node and can be expressed by the following formula

\sum_{k = 1}^{i} X_{ik} = \sum_{k = i + 1}^{Z} X_{ik}

(14)

The total amount of data received by node j in the wireless sensor network is equal to the total amount of data transmitted by node i to node j, so the matrix X main diagonal is symmetric. That is, $X_{ij} = X_{ji}$ .

The energy consumption $E_{i}$ of all nodes in the wireless sensor network satisfies the following formula

E_{i} = b \sum_{j = 1}^{Z - 1} E_{ij} X_{ji}

(15)

When 1 ≤ i < Z − 1, the energy consumed by each node in the wireless sensor network needs to satisfy the following formula

E_{i} = E_{i + 1}

(16)

Suppose T represents the lifetime of the wireless sensor network. The formula is as follows

T = \frac{N E_{init}}{Z E_{i}}

(17)

High-density data transmission scheduling

Based on the node communication model, network structure model, and energy consumption model constructed in “Network model construction,” the high-density data transmission scheduling of wireless sensor networks is completed.

Virtual subnet

According to the node communication model, the network structure model, and the energy consumption model, the time during which each task is executed in the actual process is not necessarily the same. Virtual subnets are divided in wireless sensor networks based on factors such as task priority and execution time. The resulting virtual subnet is scheduled and optimized,²⁴ as shown in Figure 1

Figure 1.

Virtual subnet division.

The execution time of the scheduled task in the wireless sensor network is not scheduling. The scheduling is to arrange the total amount of tasks in the wireless sensor network and the time when the data packet performs the task. The order in which tasks are executed can be scheduled according to the priority of the task in the wireless sensor network. In general, the priority of the task in the wireless sensor network can be determined by the shortest implementation priority algorithm or rate monotonic algorithm. The data frame format and execution time of the task in the same virtual subnet are the same, so the order in which the tasks are executed does not change the generation time and size of the data packet.^25,26 This is used as the theoretical basis to realize the transmission scheduling of high-density data in wireless sensor networks.

Counting the total number of tasks at different times

According to the execution period of the task in the wireless sensor network, the total number of tasks to be executed in the virtual subnet node at different times is counted. Suppose n represents the total number of nodes present in the control network

N_{d} = {N_{d}^{1}, N_{d}^{2}, \dots, N_{d}^{k}, \dots, N_{d}^{n}}

(18)

If there are a total of m task cycles in the wireless sensor network, the order from small to large is as follows

S_{p} = {S_{p}^{1}, S_{p}^{2}, \dots, S_{p}^{i}, \dots, S_{p}^{m}}

(19)

In different task cycles, the total number of signals corresponding to node k is as follows

h_{Nd}^{k} = {h_{Sp}^{1}, h_{Sp}^{2}, \dots, h_{Sp}^{i}, \dots, h_{Sp}^{m}}

(20)

The different combinations of all tuples in the task period $S_{p}$ are counted, and the least common multiple corresponding to the different combinations is calculated. The calculated results are arranged in ascending order to obtain the period $C_{p}$ of the public multiple tasks in the wireless sensor network

C_{p} = {C_{p}^{1}, C_{p}^{2}, \dots, C_{p}^{i}, \dots, C_{p}^{w}}

(21)

where $C_{p}^{w}$ represents the last moment in the period $C_{p}$ , and $C_{p}^{w} + C_{p}^{1}$ is used as the starting moment of the task execution, and the total number of tasks to be executed existing in each node at different times is obtained.²⁷

It is assumed that $h (N_{d}^{k}, C_{p}^{i})$ represents the total number of tasks that the kth node needs to perform in the wireless sensor network in the common multiple task period $C_{p}^{i}$ . The task period and nodes can be represented by the following matrix

H (N_{d}, C_{p}) = [\begin{matrix} \begin{matrix} h (N_{d}^{1}, C_{p}^{1}) & h (N_{d}^{1}, C_{p}^{2}) & \dots & h (N_{d}^{1}, C_{p}^{w}) \end{matrix} \\ \begin{matrix} h (N_{d}^{2}, C_{p}^{1}) & h (N_{d}^{2}, C_{p}^{2}) & \dots & h (N_{d}^{2}, C_{p}^{w}) \end{matrix} \\ \begin{matrix} \dots & \dots & \dots & \dots \end{matrix} \\ \begin{matrix} h (N_{d}^{n}, C_{p}^{1}) & h (N_{d}^{n}, C_{p}^{2}) & \dots & h (N_{d}^{n}, C_{p}^{w}) \end{matrix} \end{matrix}]

(22)

The column vector in the matrix $H (N_{d}, C_{p})$ represents the total number of waiting execution tasks $h (C_{p}^{i})$ that each node has in the common multiple task moment, and its calculation formula is as follows

\begin{matrix} h (C_{p}^{i}) = [h (N_{d}^{1}, C_{p}^{i}), h (N_{d}^{2}, C_{p}^{i}), \dots, h (N_{d}^{n}, C_{p}^{i})], \\ i = 1, 2, \dots, w \end{matrix}

(23)

High-density data transmission scheduling

The cycle time of the common multiple task period $C_{p}$ is optimized, including the waiting delay $τ_{wait}^{v}$ , the starting time $C_{p}^{i}$ , the time slot size $T_{slot}^{v}$ , the packet generation time $T_{packet}^{v}$ , and the number of packets $n_{packet}^{v}$ .

The signal nodes are arranged in at least a plurality of orders according to the total amount of data, thereby reducing the waiting time required in the optimization process.^28,29 First, the node with the largest total number of signals is sent, and the sort order $N^{v}$ of each node in the optimization process is obtained, $v = 1, 2, \dots, n_{send}$ , as shown in Figure 2.

Figure 2.

Task scheduling.

Assume that $t_{start}$ represents the starting time, set the starting time of the first-level virtual subnet in the wireless sensor network to 0, and set the ending time of the previous virtual subnet to the starting time of the next subnet.^30,31 After node i is optimized for the first time in the wireless sensor network in the ith common multiple task cycle, the initial time $t_{packet_s}^{ki 1}$ expression of the first task of the data packet in the network is as follows

t_{packet_s}^{ki 1} = C_{p}^{k, i} + (N^{ki 1}) T_{slot}^{ki 1} + t_{start}

(24)

Suppose $t_{packet_e}^{ki 1}$ represents the generation moment of the data packet in the network.^32,33 The calculation formula is as follows

t_{packet_e}^{ki 1} = t_{packet_s}^{ki 1} + T_{packet}^{ki 1}

(25)

Suppose $t_{slot_s}^{ki 1}$ represents the starting time of the time slot in the network, and its expression is as follows

t_{slot_s}^{ki 1} = t_{packet_e}^{ki 1}

(26)

Suppose $t_{slot_e}^{ki 1}$ represents the end time of the time slot in the network, and its expression is as follows

t_{slot_e}^{ki 1} = t_{slot_s}^{ki 1} + T_{slot}^{ki 1}

(27)

The first task of the packet is divided into the following two situations during the optimization process

When $T_{packet}^{k i v} > n_{node}^{kiv - 1} T_{slot}^{kiv - 1}$ , the end time of the last packet in the network is the starting moment $t_{packet_s}^{k i v}$ of the packet in the network; the expression is as follows

t_{packet_s}^{k i v} = t_{packet_e}^{kiv - 1}

(28)

When $T_{packet}^{k i v} \leq n_{node}^{kiv - 1} T_{slot}^{kiv - 1}$ , the starting time $t_{packet_s}^{k i v}$ can be calculated according to the time slot

\begin{matrix} t_{packet_s}^{k i v} = t_{packet_s}^{kiv - 1} + (n_{node}^{kiv - 1} + N^{ki - 1}) T_{slot}^{kiv - 1} \\ + (N^{ki} - 1) T_{slot}^{kiv - 1} - T_{packet}^{k i v} \end{matrix}

(29)

If $n_{packet}^{kiv - 1} \geq 2$ during an optimization process, multiple sets of data need to be sent during the optimization process.^34,35 There are also two cases at the beginning of all tasks. When $τ_{wait}^{k i v}$ is greater than 0, the end time corresponding to the previous data packet is the starting time corresponding to the current data packet, as shown in equation (28). When $τ_{wait}^{k i v}$ is less than or equal to 0, there is the following formula

t_{packet_s}^{k i v} = t_{slot_e}^{kiv - 1} + (n_{node}^{k i v} - 1) T_{slot}^{k i v} - T_{packet}^{k i v}

(30)

The loop iterations (23)–(30) can obtain the scheduling schedule of the first task of the data packet in the public multiple task periods and realize the transmission scheduling of high-density data in the wireless sensor network.

Experiment and discussion

Windows 10 operating system is adopted to verify the overall effectiveness of the proposed method. The experimental environment is Matlab simulation platform, which is used for algorithm development, data visualization, data analysis, and numerical calculation of advanced technical computing language and interactive environment, which is very applicable to the experiment in this article. Literature by Aetesam and Snigdh,⁵ Li,⁶ and Lin et al.⁷ were used as the experimental control group in the experiment, and the application effect of the proposed method was compared and tested. The time delay and energy consumption test indexes are selected to evaluate the performance of different methods.

Time delay

The test was carried out in different iterations, and the time delay of the four different methods was compared. The lower the time delay, the smaller the delay of the method, and the better the performance of the method. The test results are as follows:

Figure 3 shows that the time delay of high-density data transmission scheduling method based on Wi-Fi in wireless sensor network is within 0.2 s in multiple iterations, which does not affect the normal transmission of high-density data in wireless sensor network. The node transmission delay of the other three methods is higher than 0.5 s. The delay of node transmission in the other three methods is higher because the transmission and scheduling method of high-density data in the Wi-Fi-based wireless sensor network constructs the node communication model before scheduling high-density data. According to the node communication model, the characteristics of nodes transmitting data in wireless sensor networks are studied, and the time delay of nodes transmitting data is reduced.

Figure 3.

Time delay for four different methods.

Energy consumption

Let a represent the energy consumption coefficient of the node, and value is in the interval [0,10], which can better measure the energy consumption coefficient of different methods. The higher the energy consumption coefficient, the more energy consumed by the node in transmitting data in the wireless sensor network.

As can be seen from Figure 4, the energy consumed by the node transmission data of the high-density data transmission and scheduling method in the Wi-Fi-based wireless sensor network is lower than the energy consumption of the above three methods. This is because the method builds a node energy model and sets node energy constraints, which reduces the energy consumed by nodes to transmit high-density data in wireless sensor networks.

Figure 4.

Energy consumption coefficients of four different methods: (a) the proposed method and (b) energy consumption coefficient of method in literature by (c) Aetesam and Snigdh,⁵ (c) Li,⁶ and (d) Lin et al.⁷

Discussion

Based on further validation of Wi-Fi wireless sensor network, high-density data transmission scheduling method is found effective; through integration benefits of wireless sensor networks based on Wi-Fi density data transmission scheduling method and three methods of literature, fusion income represents the quality of data fusion in wireless sensor network, the quality of data fusion with parameter B, value within the interval [0100], the higher the value represents the higher the quality of data fusion, and four different methods of test results as shown in Figure 5.

Figure 5.

Data fusion quality comparison of different methods: (a) the proposed method and (b) data fusion quality of literature by Aetesam and Snigdh,⁵ (c) Li,⁶ and (d) Lin et al.⁷ method.

As can be seen from Figure 5, the Wi-Fi-based wireless sensor network high-density data transmission scheduling method has higher data fusion quality. In the five iterations, the data fusion quality value is higher than 80, which is much higher than the fusion quality value of the other three methods. Because the method controls the generation time of the data packet in the network when scheduling high-density data packets, this ensures that the generated data packets can be transmitted immediately. This solves the problem of data collision and queuing delay in the network, and improves the quality of the transmitted data, thereby improving the quality of data fusion.

Conclusion

The main function of wireless sensor network is to collect and transmit data, so the transmission and scheduling of data is the key problem of wireless sensor network. The current data transmission scheduling method has the problems of high node delay, high node energy consumption, and low fusion benefit. Therefore, a wireless sensor network high-density data transmission scheduling method based on Wi-Fi is proposed. This method constructs node communication model, network structure model, and energy consumption model before dispatching high-density data; fully considers the process of packet generation and transmission in wireless sensor network; and optimizes the time of node task execution, thus reducing node delay. The nodes in the network are fully scheduled to control the time of packet generation in the network, which further reduces the consumption of energy consumption. The transmission scheduling of high-density data in wireless sensor network is realized. Experiments show that the proposed method has low node delay, low energy consumption, and high fusion benefit, which not only provides a new idea for data transmission scheduling in wireless sensor networks, but also lays a foundation for the development of wireless sensor networks. In the future study, network conflict, packet delivery rate, packet discard rate, and other aspects will be further compared to improve this study.

Footnotes

Handling Editor: Wei-Chang Yeh

Declaration of conflicting interests

The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

Funding

The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research was funded by National Key R&D Program, grant number 2018YFF01014304, and Xinjiang Uygur Autonomous Region University Joint Fund (XJEDU2019Y049, XJEDU2019Y057).

ORCID iD

Yajun Zhang

References

Zhang

Fan

. Research on multi-layer data exchange scheduling optimization method for intelligent substation. Automat Instrument 2017; 61(2): 115–117.

Zhang

Wang

Qin

. An RNTP based coordinated resource allocation scheme in LTE indoor scenarios. J China Acad Electron Inform Technol 2017; 12(4): 241–245.

Sun

. Battery-friendly scheduling policy in MAC layer for WBAN data packets transmission. IET Commun 2017; 119: 1423–1430.

Zhang

Chen

Ren

, et al. Energy harvesting-aided spectrum sensing and data transmission in heterogeneous cognitive radio sensor network. IEEE Trans Veh Technol 2016; 66(1): 831–843.

Aetesam

Snigdh

. A comparative analysis of flat, hierarchical and location-based routing in wireless sensor networks. Wireless Person Commun 2017; 97(4): 5201–5211.

. Data transmission algorithm for wireless sensor network based on orthogonal redundancy pseudo-scheduling mechanism. Exper Tech Manage 2019; 36(9): 124–127.

Lin

Gao

, et al. Data center network flow scheduling based on DPSO algorithm. Acta Electron Sinica 2016; 44(3): 2197–2202.

Chen

Liu

, et al. Research on coordination strategy of data transmission scheduling and control in WTB bus protocol network. Electric Drive Locomot 2019; 32(2): 89–93.

. Study of the shared resource data scheduling method of the internet of things. Comput Simul 2017; 34(7): 268–271.

10.

Zhang

Meng

. Communication optimization for RDMA-based science data transmission tools. J Supercomput 2017; 72(9): 3312–3327.

11.

Zhang

Zhao

, et al. Dynamic data transmission technology designed for expendable current profiler. IEEE J Ocean Eng 2017; 76(5): 1–6.

12.

Shin

. An efficient small data transmission scheme in the 3GPP NB-IoT system. IEEE Commun Lett 2017; 21(3): 660–663.

13.

Zhang

Jian

Luo

, et al. REMT: a real-time end-to-end media data transmission mechanism in UAV-aided networks. IEEE Netw 2018; 37(9): 12–17.

14.

Bamiedakis

Shi

Chu

, et al. High-speed data transmission over flexible multimode polymer waveguides under flexure. IEEE Photon Technol Lett 2018; 30(14): 1329–1332.

15.

Salwe

Naik

. Discrete image data transmission in heterogeneous wireless network using vertical handover mechanism. IET Image Process 2017; 11(7): 550–558.

16.

Qiu

Shang

. Automatic scheduling method for resource transfer data in complex supply chain networks. Sci Technol Eng 2019; 19(21): 200–205.

17.

. Design of key big data encryption storage system in network transmission. Modern Electron Techn 2019; 42(16): 79–82.

18.

Cao

Liu

, et al. Simulation of secure storage of high density information for network data transmission. Comput Simul 2017; 34(12): 153–156.

19.

Zhu

Lang

Xing

. Modeling and simulation of secure data transmission in high-speed embedded systems. Comput Simul 2017; 36(10): 165–168.

20.

Chen

, et al. Research on cooperative data transmission based on network coding. J Chang Univ Sci Technol 2019; 42(3): 91–95, 127.

21.

Lai

. Optimization of network equipment maintenance and improvement of data communication transmission quality. Electron Test 2018; 32(19): 66.

22.

Ngo

. A slotted sense multiple access protocol for timely and reliable data transmission in dynamic wireless sensor networks. IEEE Sens J 2018; 18: 2184–2194.

23.

Liazid

Lehsaini

Liazid

. An improved adaptive dual prediction scheme for reducing data transmission in wireless sensor networks. Wireless Networks 2019; 25(8): 3545–3555.

24.

Ghosh

Banerjee

Sherratt

. On-demand fuzzy clustering and ant-colony optimisation based mobile data collection in wireless sensor network. Wireless Netw 2019; 25(4): 1829–1845.

25.

Wan

, et al. Design and analysis of a data fusion scheme in mobile wireless sensor networks based on multi-protocol mobile agents. Sensors 2017; 17(11): 2523.

26.

Kumar

Sharma

Singh

. Cluster-based single-sink wireless sensor networks and passive optical network converged network incorporating sideband modulation schemes. Optic Eng 2018; 57(2): 1.

27.

Bang

Cho

Kang

. Anomaly detection of network-initiated LTE signaling traffic in wireless sensor and actuator networks based on a hidden semi-Markov model. Comput Sec 2017; 65: 108–120.

28.

Zhang

Liu

Zhang

, et al. Mutual-information based weighted fusion for target tracking in underwater wireless sensor networks. Front Inform Technol Electron Eng 2018; 19(4): 544–556.

29.

Singh

Rai

Sanjay

. Modeling and performance analysis for pipelined-forwarding MAC protocols for linear wireless sensor networks. IEEE Sens J 2019; 19(15): 6539–6552.

30.

Liew

Tan

Gan

M-L

, et al. A fast, adaptive, and energy-efficient data collection protocol in multi-channel-multi-path wireless sensor networks. IEEE Comput Intell Mag 2018; 13(1): 30–40.

31.

Deng

Guan

Yue

, et al. Energy-based sound source localization with low power consumption in wireless sensor networks. IEEE Trans Indus Electron 2017; 64(6): 4894–4902.

32.

Liu

Han

Sammy

, et al. An SNR-assured anti-jamming routing protocol for reliable communication in industrial wireless sensor networks. IEEE Commun Mag 2018; 56(2): 23–29.

33.

Zhang

Chen

. Near optimal data gathering in rechargeable sensor networks with a mobile sink. IEEE Trans Mob Comput 2017; 16(6): 1718–1729.

34.

Horvath

Munster

Vojtech

, et al. Simultaneous transmission of accurate time, stable frequency, data, and sensor system over one fiber with ITU 100 GHz grid. Optic Fiber Technol 2018; 40(2): 139–143.

35.

Malekshan

Zhuang

. Joint scheduling and transmission power control in wireless ad hoc networks. IEEE Trans Wireless Commun 2017; 16(9): 5982–5993.