CN107222903B - Constructive interference-based data collection method in asynchronous low-duty-ratio WSN - Google Patents
Constructive interference-based data collection method in asynchronous low-duty-ratio WSN Download PDFInfo
- Publication number
- CN107222903B CN107222903B CN201710447072.4A CN201710447072A CN107222903B CN 107222903 B CN107222903 B CN 107222903B CN 201710447072 A CN201710447072 A CN 201710447072A CN 107222903 B CN107222903 B CN 107222903B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- data
- hop
- forwarding
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 57
- 238000013480 data collection Methods 0.000 title claims abstract description 23
- 230000005540 biological transmission Effects 0.000 claims abstract description 74
- 230000007958 sleep Effects 0.000 claims abstract description 43
- 230000008569 process Effects 0.000 claims abstract description 20
- 230000007246 mechanism Effects 0.000 claims abstract description 16
- 238000005265 energy consumption Methods 0.000 claims abstract description 13
- 235000008694 Humulus lupulus Nutrition 0.000 claims abstract description 5
- 239000000523 sample Substances 0.000 claims description 14
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 claims description 7
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 5
- 101100339496 Caenorhabditis elegans hop-1 gene Proteins 0.000 claims description 4
- 230000000977 initiatory effect Effects 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 7
- 238000012423 maintenance Methods 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000002035 prolonged effect Effects 0.000 description 2
- 230000002618 waking effect Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000005059 dormancy Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明公开了异步低占空比WSN中基于相长干涉的数据收集方法，所述数据收集方法是将n个传感器节点随机地分布在一个面积为M×M平方米的区域内形成无线传感器网络，在传感器节点中至少包括Source节点、转发节点和1个Sink节点，除Sink节点外，无线传感器网络中的其他传感器节点都采用异步LPP机制进行睡眠调度，在网络初始化过程中，传感器节点会进行层次选择从而获取传感器节点到Sink节点的跳数，当有数据需要发送时，Source节点选择网络中苏醒的转发节点进行数据并发传输到Sink节点，并发传输完毕后，Source节点与转发节点返回到LPP睡眠调度状态。本发明可以有效的减少网络中的控制开销，提高数据包接收率，减少端到端延迟和网络能量消耗。
The invention discloses a data collection method based on constructive interference in an asynchronous low duty cycle WSN. The data collection method is to randomly distribute n sensor nodes in an area of M×M square meters to form a wireless sensor network , the sensor nodes include at least a Source node, a forwarding node and a sink node. Except for the sink node, other sensor nodes in the wireless sensor network use the asynchronous LPP mechanism for sleep scheduling. During the network initialization process, the sensor nodes will Hierarchical selection is used to obtain the number of hops from the sensor node to the sink node. When there is data to be sent, the source node selects the awake forwarding node in the network to transmit the data to the sink node concurrently. After the concurrent transmission, the source node and the forwarding node return to the LPP Sleep scheduling state. The invention can effectively reduce the control overhead in the network, improve the data packet reception rate, and reduce the end-to-end delay and network energy consumption.
Description
Technical Field
The invention relates to the technical field of wireless sensor networks, in particular to a constructive interference-based data collection method in an asynchronous low-duty-cycle WSN.
Background
The constructive interference is applied to data transmission of a Wireless Sensor Network (WSN), so that concurrent transmission of data can be realized, the data packet receiving rate is close to 100%, the data transmission delay is very low, and the concurrent transmission based on the constructive interference has the following characteristics: (1) in the concurrent transmission process, the same data packet is transmitted; (2) when a plurality of nodes send data to the same node at the same time, the condition of constructive interference needs to be met; (3) the node will not store neighbor and routing information; (4) all nodes participate in concurrent transmission; therefore, when the concurrent transmission based on the constructive interference is applied to the data collection protocol, the nodes do not need to maintain the information of the neighbor nodes and the routing state information, the energy consumption of the network is reduced, and the receiving rate of the data packets is improved. However, concurrent transmission requires all nodes to participate in data transmission, which results in large energy consumption, so that only part of nodes need to participate in concurrent transmission in combination with a low duty cycle mechanism, and the nodes that do not need to participate go to sleep, so as to reduce energy consumption of the network.
However, in applications based on event monitoring driving, such as environmental monitoring and medical fields, sensor nodes often do not perform continuous and high-frequency data collection, but send status messages or collected information to Sink nodes (Sink nodes, also called Sink nodes) when an event (forest fire, etc.) occurs. In a data collection protocol based on unicast forwarding, a node selects a father node from neighbor nodes thereof for data transmission, and finally routes a data packet to a Sink node. Due to the influence of factors such as environment and node energy, the information of the neighbor nodes may be sent and changed in real time. Therefore, in these protocols, in order to ensure the robustness of the routing, the node needs to perform neighbor information maintenance periodically, the energy consumed by the maintenance process is relatively large, and in the low duty ratio wireless sensor network, the node and the neighbor do not wake up simultaneously, and the maintenance process becomes more complicated. Therefore, in the low-duty-ratio wireless sensor network, an asynchronous duty ratio mechanism does not need to carry out clock synchronization and does not need to know the sleep scheduling of the neighbor node, and the life cycle of the network can be prolonged more effectively. In an asynchronous duty cycle network, compared with an LPL (Low Power listen) mechanism, an LPP (Low Power Probe) mechanism is suitable for an application scenario of waking up a part of nodes in a network, and as the scale of the network increases, the performance of the LPP mechanism is better. Therefore, in a low Duty ratio sensor network using an asynchronous LPP mechanism, a data collection protocol ADCCI (asynchronous Duty Cycle and Constructive interference) based on Constructive interference is provided, and a Sink node does not need to store and maintain neighbor information so as to reduce end-to-end delay and network energy consumption.
Disclosure of Invention
The invention aims to provide a data collection method based on constructive interference in an asynchronous low-duty ratio WSN (wireless sensor network), which can effectively reduce the control overhead in a network, improve the data packet receiving rate and reduce the end-to-end delay and the network energy consumption, and adopts the following technical effects in order to realize the aim:
according to one aspect of the present invention, there is provided a constructive interference based data collection method in an asynchronous low duty cycle WSN, the data collection method comprising the steps of: the method comprises the steps that n sensor nodes are randomly distributed in an area with the area of M multiplied by M square meters to form a wireless sensor network, wherein n is an integer larger than 1, the sensor nodes at least comprise a Source node, a forwarding node and 1 Sink node, except the Sink node, other sensor nodes in the wireless sensor network adopt an asynchronous LPP mechanism to carry out sleep scheduling, in the network initialization process, the sensor nodes can carry out hierarchical selection to obtain the hop count from the sensor nodes to the Sink node, when data needs to be sent, the Source node selects the forwarding node which wakes up in the network to carry out data forwarding, the forwarding node receives a data packet sent by the Source node and transmits the data packet to the Sink node in parallel, and after the data transmission is finished, the Source node and the forwarding node return to an LPP sleep scheduling state.
Preferably, in the network initialization process, the hierarchical selection performed by the sensor node includes the following steps:
step 21: the Sink node broadcasts a Packet (hop ═ 0) data Packet, wherein the hop represents the hop count from the Sink node;
step 22: any sensor node v in the networki(i e n) receiving neighbor node vj(j belongs to n, j is not equal to i) broadcasted data Packet(vjHop) if vi.hop<＝vjHop-1 then connects node viIs set to vi.hop＝vjHop +1, then continue broadcasting Packet (v)iHop) data packets are continuously transmitted until all nodes in the network hop to the Sink node, a node with hop being k is named as a k-layer node, wherein k is an integer greater than or equal to 1, and the k-layer node only needs to store hop information and does not need to store any information about adjacent-layer nodes.
Preferably, in the network initialization process, the sensor node only needs to perform level selection once, and after the network initialization is completed, the sensor node performs sleep scheduling according to an LPP mechanism.
Preferably, when data needs to be sent by a Source node on the k layer, the Source node monitors a network channel for a period of time, waits for a neighbor node to wake up and send a probe data packet to establish connection, and after the connection is established, receives an awake data packet sent by the Source node by a neighbor node to prolong the wake-up time of the neighbor node; the Source node sends an awake data packet to the Sink node finally, and the Sink node receives the awake data packet and then passes through TbackoffAfter waiting for time, the Sink node sends a feedback packet to the Source node, TbackoffThe waiting time ensures that the distance between all probe data packets and awake data packets being transmitted is at least two hops, and when receiving the awake packets, the Sink node in the network can process the awake packets according to the following three conditions:
case 41: the nodes with the k being more than or equal to the hop layer are directly discarded and enter a sleeping state, so that the nodes with the k being more than or equal to the hop layer are prevented from participating in the concurrent transmission, and the network energy consumption is reduced;
case 42: when the adjacent node of the k-1 layer forwards the awake data packet, the adjacent node of the hop (k-1) layer with the hop (k-1) information k > hop (k-1) is added to directly discard the awake data packet and enter a sleep state; after receiving the awake data packet, the k-2 layer node overwrites the hop (k-1) with the hop (k-2) before forwarding, and the k-2 layer node continues to perform the same operation as the hop (k-1) node;
case 43: the forwarding node which has processed the awake data packet and keeps awake is not influenced by the awake packet sent by the upper node;
preferably, after receiving the awake packet, the Sink node sends a feedback packet to the Source node, and a forwarding node, which receives the feedback packet, of the Source node processes the feedback packet according to the following three conditions:
case 51: the Source node receives the feedback data packet but does not receive the awake data packet, and discards the feedback data packet and enters a sleep state;
case 52: the forwarding nodes with k being more than or equal to the hop level directly discard the feedback packet and enter a sleep state;
case 53: and the forwarding nodes in the same level receive the feedback data packet sent by the node in the previous level at the same time, the forwarding nodes directly copy the data from the receiving queue to the sending queue without any processing for sending, and finally the feedback data packet is transmitted to the Source node in a concurrent mode and generates constructive interference at the Source node.
Preferably, through TbackoffAfter waiting for time, the Sink node sends a feedback packet to the Source node, and when the feedback packet reaches the Source node, the Source node is at TwaitAfter the waiting time, the initiation interval is TcountThe data packets collected by the sensor nodes are transmitted at the moment; after the forwarding nodes in the same level receive the data packet at the same time, there is a fixed waiting time T before sending the data packetprocessTherefore, the condition of constructive interference is met, and at the moment, the forwarding node on the path from the Source node to the Sink node cannot initiate a probe data packet or an awake data packet, so that the condition of T is metwait<Tbackoff；
After the Source node starts concurrent transmission, if the concurrent transmission is at 2 xTprocessIf the node does not hear that the k ═ hop-1 layer node forwards the data packet, then retransmission is carried out to increase the reliability of transmission; if the node is sensed and data Source nodes are still in the cache queue, the node is at Tcount＝2×TprocessAnd continuing to transmit data.
Preferably, after the concurrent transmission is completed, the forwarding node returns to the LPP sleep scheduling state, and after the data transmission is completed, the forwarding node on the transmission path is notified through an implicit termination method or a display termination method that the transmission is completed, and then enters the sleep state, and thereafter, the forwarding node performs the sleep scheduling according to the LPP.
Preferably, in the implicit termination mode, the forwarding nodes participating in the concurrent transmission acquire the number of data packets from the awake packet, and the forwarding nodes go to sleep after the forwarding of the last data packet is completed; in the display termination mode, after receiving all count data packets, the Sink node sends an acknowledgement ACK, otherwise sends a negative acknowledgement NACK, and after forwarding the ACK or the NACK, the forwarding nodes participating in the concurrent transmission terminate the concurrent transmission stage and enter the sleep.
By adopting the technical scheme, the invention has the following technical effects:
(1) the invention can effectively reduce the control overhead in the network, improve the data packet receiving rate, reduce the end-to-end delay and the network energy consumption, and is particularly suitable for the field of sensor monitoring application based on event drive.
(2) The Sink node does not need to store and maintain neighbor information and routing state information, end-to-end delay and network energy consumption can be greatly reduced, and data is quickly and reliably transmitted to the Sink node by using concurrent transmission based on constructive interference only when data is transmitted, so that the data packet receiving rate is improved; the invention combines a low duty ratio mechanism, only part of nodes are needed to participate in concurrent transmission, and the nodes which do not need to participate are not required to sleep, thereby reducing the energy consumption of the network.
(3) In the low-duty-ratio wireless sensor network, an asynchronous duty ratio mechanism is adopted, clock synchronization is not needed, the sleep scheduling of neighbor nodes is not needed, and the life cycle of the network can be prolonged more effectively.
Drawings
Fig. 1 is a schematic diagram of a distribution of sensor nodes of a wireless sensor network according to the present invention.
Fig. 2 is an operation diagram of the Sink node processing data in the whole protocol.
Fig. 3 is a flow chart of the data collection process of the sensor node of the present invention.
Fig. 4 is a diagram illustrating LPP sleep scheduling according to the present invention.
FIG. 5 is a graph illustrating the variation of the packet reception rate for different packet generation intervals according to the present invention;
fig. 6 is a schematic diagram of the variation of the duty cycle at different packet generation intervals according to the present invention.
Fig. 7 is a schematic diagram illustrating the variation of data transmission delay in different packet generation intervals according to the present invention.
Fig. 8 is a schematic diagram illustrating the change of the concurrent transmission phase to the data transmission delay ratio in different data packet generation intervals according to the present invention.
Fig. 9 is a diagram illustrating a variation of the overhead required to transmit each packet on average for different packet generation intervals according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings by way of examples of preferred embodiments. It should be noted, however, that the numerous details set forth in the description are merely for the purpose of providing the reader with a thorough understanding of one or more aspects of the present invention, which may be practiced without these specific details.
As shown in fig. 1, the data collection method based on constructive interference in the asynchronous low duty cycle WSN according to the present invention comprises the following steps: the method comprises the steps that n sensor network nodes are randomly distributed in an area with the area of M multiplied by M square meters, wherein n is an integer larger than 1, the sensor nodes at least comprise a Source node, a forwarding node and 1 Sink node, except the Sink node, other sensor nodes in the wireless sensor network adopt an asynchronous LPP mechanism to carry out sleep scheduling, the sensor nodes carry out hierarchical selection in the network initialization process so as to obtain the hop count from the sensor nodes to the Sink node, when data need to be sent, the Source node selects the waking forwarding node in the network to carry out data forwarding, the forwarding node receives a data packet sent by the Source node and transmits the data packet to the Sink node in parallel, and after the data transmission is finished, the Source node and the forwarding node return to an LPP sleep scheduling state. When the sensor Node collects data and needs to send the data to the Sink Node, the Node is called a Source Node (Source Node), and in the sensor network, the sensor Node which helps the Source Node send the data to the Sink Node is called a forwarding Node (Node).
(1) And when the Source node needs to send data, the channel is monitored all the time, a neighbor node is waited to wake up to send a probe data packet, the Source node sends ACK to establish connection after receiving the probe data packet, and the Source node sends an awake data packet to the Sink node at the moment.
(2) And after receiving the awake data packet, the Sink node returns a feedback data packet (feedback packet) after waiting for a period of time (avoiding collision with the probe data packet and the awake data packet). The forwarding Node1 and the forwarding Node2 are in the same hop, as shown in fig. 1, fig. 2 and fig. 3, so both will receive the feedback packet at the same time. The forwarding Node1 and the forwarding Node2 will not directly send the feedback packet by any processing, and the feedback packet will arrive at the Source Node at the same time and generate constructive interference.
(3) And after the source node receives the feedback packet, the source node considers that the nodes on the path of the Sink node are ready for concurrent transmission. After the Source Node waits for a period of time (collision with a feedback packet of the Sink is avoided), the Node1 forwarding Node and the Node2 forwarding Node send data, receive packets at the same time, and then directly send the packets, and constructive interference is generated at the Sink Node.
(4) And finally, the network can adopt explicit termination or implicit termination to finish data transmission, and the Source Node, the Node1 forwarding Node and the Node2 forwarding Node go to sleep and then carry out sleep scheduling according to the LPP.
In the network initialization process, the hierarchy selection of the Sink node comprises the following steps:
step 21: the Sink node broadcasts a Packet (hop ═ 0) data Packet, wherein the hop represents the hop count from the Sink node; therefore, the Source node acquires the hop count from the Source node to the Sink node;
step 22: any sensor node v in the networki(i e n) receiving neighbor node vj(j belongs to n, j is not equal to i) broadcasted data Packet (v)jHop) if vi.hop<＝vjHop-1 then connects node viIs set to vi.hop＝vjHop +1, then continue broadcasting Packet (v)iHop) data packets are continuously transmitted until all nodes in the network hop to the Sink node, a node with hop being k is named as a k-layer node, wherein k is an integer greater than or equal to 1, and the k-layer node only needs to store hop information and does not need to store any information about adjacent-layer nodes. In the network initialization process, that is, in the network life cycle, the sensor node only needs to perform one-time hierarchical selection, and after the network initialization is completed, the sensor node performs sleep scheduling according to the LPP mechanism, and in the present invention, in combination with fig. 1, fig. 2, fig. 3, and fig. 4, the LPP mechanism performs sleep scheduling according to the following manner:
when a Source node of a k hop layer has data to send, the Source node monitors a network channel for a period of time TlistenWaiting for the awakening of the neighbor node to send a probe data packet to establish connection, and after the connection is established, receiving an awake data packet sent by the Source node by the neighbor node to prolong the awakening time of the neighbor node; the Source node sends an awake data packet to the Sink node finally, and the Sink node receives the awake data packet and then passes through TbackoffAfter waiting for time, the Sink node sends a feedback packet to the Source node, TbackoffThe waiting time ensures that all probe packets and awake packets being transmitted are at least two hops away from Sink.
When passing TbackoffAfter waiting for time, the Sink node sends a feedback packet to the Source node, and when the feedback packet reaches the Source node, the Source node is at TwaitAfter the waiting time, the initiation interval is TcountThe data packets collected by the sensor nodes are transmitted at the moment; after the forwarding nodes in the same level receive the data packet at the same time, there is a fixed waiting time T before sending the data packetprocessThus satisfying the condition of constructive interference, in which case the sourceThe forwarding node on the path from the ce node to the Sink node cannot initiate a probe data packet or an awake data packet, so that the condition of T is metwait<Tbackoff(ii) a After the Source node starts concurrent transmission, if the concurrent transmission is at 2 xTprocessIf the node does not hear that the k ═ hop-1 layer node forwards the data packet, then retransmission is carried out to increase the reliability of transmission; if the node is sensed and data Source nodes are still in the cache queue, the node is at Tcount＝2×TprocessAnd continuing to transmit data. In the invention, when a Sink node in a sensor network receives an awake packet, the Sink node processes the awake packet according to the following three conditions:
case 41: the nodes with the k being more than or equal to the hop layer are directly discarded and enter a sleeping state, so that the nodes with the k being more than or equal to the hop layer are prevented from participating in the concurrent transmission, and the network energy consumption is reduced;
case 42: when the wake data packet is forwarded, the neighbor nodes of the k-1 layer add own hop (k-1) information; after receiving the awake data packet, the neighbor nodes of the k > hop (k-1) layer directly discard and enter a sleep state; after receiving the awake data packet, the k-2 layer node overwrites the hop (k-1) with the hop (k-2) before forwarding, and continues to perform the same operation as the hop (k-1) node;
case 43: the forwarding node which has processed the awake packet and keeps awake is not influenced by the awake packet sent by the upper node; after receiving the awake data packet, the Sink node sends a feedback data packet to the Source node, and the forwarding node, which receives the feedback data packet, of the Source node processes the feedback data packet according to the following three conditions:
case 51: the node receives the feedback data packet but does not receive the awake data packet, and the Source node discards the feedback data packet and enters a sleep state;
case 52: and the forwarding nodes with k being more than or equal to the hop level directly discard the feedback data packet and enter a sleep state.
Case 53: the forwarding nodes in the same level receive the feedback data packets sent by the nodes in the previous level at the same time, the forwarding nodes directly copy the data from the receiving queue to the sending queue without any processing for sending, and finally the feedback data packets are transmitted to the Source node in a concurrent mode and generate constructive interference at the Source node;
in the invention, a forwarding node receives a Source node data packet and transmits the data packet to a Sink node in parallel, and after the parallel transmission is finished, the Sink node transmits a feedback data packet to the Source node; when the feedback data packet arrives at the Source node, the waiting time of the Source node (Source node) is Twait(to avoid collisions with ongoing feedback packet transmissions) followed by an initiation interval of TcountAfter the forwarding nodes in the same layer receive the data packets at the same time, there will be a fixed waiting time T before sending the data packetsprocessThe waiting time generated by the process from the receiving of the data packet to the sending of the data packet by the sensor node is defined as Tprocess. Therefore, the nodes on the same level meet the condition of constructive interference, the end-to-end reliability is increased, and when k is equal to 1 level of nodes, the same data is simultaneously sent to the Sink node, constructive interference is generated, and the successful receiving probability of the data packet is further improved.
The forwarding node records the Metadata (Metadata) of the forwarded data packet, so the data packet is not retransmitted, and the problem of cyclic forwarding is prevented. At this stage, the source node starts to perform concurrent transmission and a node on the path to the Sink does not initiate a probe packet or an awake packet, so T is setwait<Tbackoff。
After the source node initiates the concurrent transmission, if at 2 × TprocessThen, if the forwarding data packet of the k ═ hop-1 layer node is not heard, retransmission is carried out, and the reliability of transmission is increased; if the source node senses that the data is heard and still exists in the buffer queue, the source node is at Tcount＝2×TprocessAnd continuing to transmit data.
After the concurrent transmission is finished, the forwarding node returns to the LPP sleep scheduling state, and after the data transmission is finished, the forwarding node on the transmission path is informed of finishing the transmission through an implicit termination mode or a display termination mode, and then enters the sleep state. Then, the nodes perform dormancy scheduling according to LPP, in the implicit termination mode, forwarding nodes participating in concurrent transmission acquire the number of data packets from awake data packets, and the nodes go to sleep after the last data packet is forwarded; the implicit termination mode is simple in transmission, but the forwarding node will always listen to the channel after the data packet is lost, so that the node is set in the adici protocol to exit the concurrent transmission stage and go to sleep after Timeout (tx (h)).
In the display termination mode, after receiving all count data packets, the Sink node sends an acknowledgement ACK, otherwise sends a negative acknowledgement NACK, and after forwarding the ACK or the NACK, the forwarding nodes participating in the concurrent transmission terminate the concurrent transmission stage and enter the sleep. Although the explicit termination method generates extra time for transmitting ACK or NACK, the explicit termination method can reduce Timeout time Timeout (tx (h)) of a node in a network with high packet loss rate.
In the present invention, one is selected to be 100X 100m2The square area of the network is provided with 50 nodes, the Sink node is positioned in the center of the area, and each node generates a data packet (20Bytes) in a data packet generation interval and routes the packet to the Sink node through multiple hops. In this example, the ADCCI employs an explicit termination scheme. In the ADCCI protocol, basic parameter settings are shown in Table 1
Table 1: ADCCI parameter settings
In the invention, by using a Data Collection protocol Tree-based Hop-by-hopeliable Data Collection (THRDC) on Contiki as a comparison protocol, the protocol is the realization of the Collection TreeProcot (CTP) on the Contiki, the performance of the CTP in an LPL mode is better than that in an LPP mode, therefore, an X-MAC protocol is used for providing sleep scheduling for the THRDC, and as shown in figure 4, the T of the X-MAC is setwakeupConsistent with the values of ADCCI. Parameters such as link quality are defaulted according to the system. In this chapter we mean the time interval between two events, denoted by the packet generation interval, and define the duty cycle as: t (time of average radio on per node within packet generation interval)/T (packet generation interval), as shown in fig. 5 and 6, fromAs can be seen in fig. 5, the packet reception rate of adici is close to 100%, while the packet reception rate of THRDC is around 94%. Because in the ADCCI, due to constructive interference, the reliability between the node layers is higher, and a plurality of paths exist in the network to transmit data simultaneously, and finally, the constructive interference is generated at the Sink node, so that the receiving probability is further increased. When the THRDC transmits data, each hop is a node with the smallest ETX (Expected Transmission Count) value. And when the data transmission fails, updating the ETX and then waiting for the node with the minimum ETX value to wake up again. If the ETX value changes greatly, the sending node also broadcasts to inform other nodes to update the route, thereby increasing the transmission delay and the wakeup time of the node. It is also evident from the duty cycle in fig. 6 that the THRDC protocol radio is on for a longer period of time during the same packet generation interval. It can therefore be concluded from fig. 6 that the adici improves the packet reception rate by 5.8% while reducing the duty cycle by 24.6% relative to the THRDC.
In the present invention, as shown in fig. 7, the average end-to-end delay and the concurrent transmission delay are shown, and as can be seen from fig. 7, the average end-to-end delay of THRDC is 12.78s and that of adici is 9.95s at different packet generation intervals. Thus the adici can reduce the end-to-end delay by 22.1% relative to the THRDC. As can be seen from fig. 8, the delay incurred by the concurrent transmission phase is 8.9% proportional to the adici average end-to-end delay (average 0.89s), while 91.1% of the time is in preparation for the concurrent transmission phase. The delay generated by the concurrent transmission phase does not vary much, so the proportion of the concurrent transmission phase becomes smaller as the average end-to-end delay increases, and thus two minima are generated when the packet generation interval is equal to 1200s and 2400 s. It can be seen from fig. 7 and 8 that the concurrent transmission based on constructive interference is a low-delay data transmission method.
The control overhead is controlled, and experiments compare the number of control packets required by average transmission of each data packet under different data packet generation intervals in the whole data transmission process of ADCCI and THRDC, wherein the smaller the overhead of each data packet is, the smaller the energy consumed by the whole network for transmitting each data packet is, the higher the energy utilization rate is, in an X-MAC protocol, a node continuously transmits beacon frames before a next hop node starts to receive the data packet, and the number of the continuously transmitted beacon frames is recorded as 1.
The number of control packets required for the THRDC is small when the packet generation interval is small, but this overhead increases rapidly as the packet generation interval increases because the THRDC protocol requires regular maintenance of the routing state and generates control packet overhead although there is no data to be transmitted in the network. Since the node generates the control packet only when there is a data packet to be sent, the required control packet for each data packet does not change significantly as the data packet generation interval increases, which illustrates that the duty cycle of THRDC does not decrease further and the duty cycle of adici tends to decrease in fig. 7 when the data packet generation interval is equal to 1800 s.
Network energy consumption for ADCCI and THRDC was analyzed in conjunction with FIGS. 6 and 9. The radio in the sensor node is the most energy consuming unit and figure 6 shows that the adici radio is turned on 24.6% less than the THRDC during the same packet generation interval. Fig. 9 shows that the control packet overhead required for averaging each data in the adici protocol hardly varies in different packet generation intervals, so that the adici can effectively reduce the network power consumption relative to the THRDC.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that those skilled in the art can make various improvements and modifications without departing from the principle of the present invention, and these improvements and modifications should also be construed as the protection scope of the present invention.
Claims (6)
1. The data collection method based on constructive interference in the asynchronous low-duty ratio WSN is characterized in that: the data collection method comprises the following steps: the method comprises the steps that n sensor nodes are randomly distributed in an area with the area of M multiplied by M square meters to form a wireless sensor network, wherein n is an integer larger than 1, the sensor nodes at least comprise Source nodes, forwarding nodes and 1 Sink node, except the Sink node, other sensor nodes in the wireless sensor network adopt an asynchronous LPP mechanism to carry out sleep scheduling, in the network initialization process, the sensor nodes can carry out hierarchical selection to obtain the hop count from the sensor nodes to the Sink node, when data needs to be sent, the Source nodes select the forwarding nodes which are awakened in the network to carry out data forwarding, the forwarding nodes receive data packets sent by the Source nodes and transmit the data packets to the Sink node in parallel, and after the data transmission is finished, the Source nodes and the forwarding nodes return to an LPP sleep scheduling state; in the network initialization process, the sensor node carries out hierarchical selection and comprises the following steps:
step 21: the Sink node broadcasts a Packet (hop ═ 0) data Packet, wherein the hop represents the hop count from the Sink node;
step 22: any sensor node v in the networki(i e n) receiving neighbor node vj(j belongs to n, j is not equal to i) broadcasted data Packet (v)jHop) if vi.hop<＝vjHop-1 then connects node viIs set to vi.hop＝vjHop +1, then continue broadcasting Packet (v)iHop) data packets are continuously transmitted until all nodes in the network hop to the Sink node, the nodes with hop being k are named as k-layer nodes, wherein k is an integer greater than or equal to 1, and the k-layer nodes only need to store hop information and do not need to store any information about the nodes of the adjacent layers;
when data need to be sent from a Source node on a k layer, the Source node monitors a network channel for a period of time, waits for a neighbor node to wake up and send a probe data packet to establish connection, and after the connection is established, the neighbor node receives an awake data packet sent by the Source node to prolong the wake-up time of the neighbor node; the Source node sends an awake data packet to the Sink node finally, and the Sink node receives the awake data packet and then passes through TbackoffAfter waiting for time, the Sink node sends a feedback packet to the Source node, TbackoffThe waiting time ensures that the distance between all probe data packets and awake data packets being transmitted is at least two hops, and when receiving the awake packets, the Sink node in the network can process the awake packets according to the following three conditions:
case 41: the nodes with the k being more than or equal to the hop layer are directly discarded and enter a sleeping state, so that the nodes with the k being more than or equal to the hop layer are prevented from participating in the concurrent transmission, and the network energy consumption is reduced;
case 42: when the wake data packet is forwarded, the neighbor nodes of the k-1 layer add own hop (k-1) information; after receiving the awake data packet, the neighbor nodes of the k > hop (k-1) layer directly discard and enter a sleep state; after receiving the awake data packet, the k-2 layer node overwrites the hop (k-1) with the hop (k-2) before forwarding, and the k-2 layer node continues to perform the same operation as the hop (k-1) node;
case 43: the forwarding node which has processed the awake packet is not affected by the awake packet sent by the upper node.
2. The method for data collection based on constructive interference in an asynchronous low duty cycle WSN according to claim 1, wherein: in the network initialization process, the sensor nodes only need to perform hierarchy selection once, and after the network initialization is completed, the sensor nodes all perform sleep scheduling according to an LPP mechanism.
3. The method for data collection based on constructive interference in an asynchronous low duty cycle WSN according to claim 1, wherein: after receiving the awake data packet, the Sink node sends a feedback data packet to the Source node, and the forwarding node, which receives the feedback data packet, of the Source node processes the feedback data packet according to the following three conditions:
case 51: the Source node receives the feedback data packet but does not receive the awake data packet, and discards the feedback data packet and enters a sleep state;
case 52: the forwarding nodes with k being more than or equal to the hop level directly discard the feedback packet and enter a sleep state;
case 53: and the forwarding nodes in the same level receive the feedback data packet sent by the node in the previous level at the same time, the forwarding nodes directly copy the data from the receiving queue to the sending queue without any processing for sending, and finally the feedback data packet is transmitted to the Source node in a concurrent mode and generates constructive interference at the Source node.
4. The method for data collection based on constructive interference in an asynchronous low duty cycle WSN according to claim 1, wherein: through TbackoffAfter waiting for time, the Sink node sends a feedback packet to the Source node, and when the feedback packet reaches the Source node, the Source node is at TwaitAfter the waiting time, the initiation interval is TcountThe data packets collected by the sensor nodes are transmitted at the moment; after the forwarding nodes in the same level receive the data packet at the same time, there is a fixed waiting time T before sending the data packetprocessTherefore, the condition of constructive interference is met, and at the moment, the forwarding node on the path from the Source node to the Sink node cannot initiate a probe data packet or an awake data packet, so that the condition of T is metwait<Tbackoff；
After the Source node starts concurrent transmission, if the concurrent transmission is at 2 xTprocessIf the node does not hear that the k ═ hop-1 layer node forwards the data packet, then retransmission is carried out to increase the reliability of transmission; if the node is sensed and data Source nodes are still in the cache queue, the node is at Tcount＝2×TprocessAnd continuing to transmit data.
5. The method for data collection based on constructive interference in an asynchronous low duty cycle WSN according to claim 1, wherein: after the concurrent transmission is finished, the forwarding node returns to the LPP sleep scheduling state, after the data transmission is finished, the forwarding node on the transmission path is informed to finish the transmission through an implicit termination mode or a display termination mode, and then the forwarding node enters the sleep state, and then the forwarding node performs sleep scheduling according to the LPP.
6. The method for constructive interference based data collection in an asynchronous low duty cycle WSN according to claim 5, wherein: in the implicit termination mode, forwarding nodes participating in concurrent transmission acquire the number of data packets from awake packets, and the forwarding nodes go to sleep after the forwarding of the last data packet is finished; in the display termination mode, after receiving all count data packets, the Sink node sends an acknowledgement ACK, otherwise sends a negative acknowledgement NACK, and after forwarding the ACK or the NACK, the forwarding nodes participating in the concurrent transmission terminate the concurrent transmission stage and enter the sleep.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710447072.4A CN107222903B (en) | 2017-06-14 | 2017-06-14 | Constructive interference-based data collection method in asynchronous low-duty-ratio WSN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710447072.4A CN107222903B (en) | 2017-06-14 | 2017-06-14 | Constructive interference-based data collection method in asynchronous low-duty-ratio WSN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107222903A CN107222903A (en) | 2017-09-29 |
| CN107222903B true CN107222903B (en) | 2020-04-24 |
Family
ID=59948847
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710447072.4A Active CN107222903B (en) | 2017-06-14 | 2017-06-14 | Constructive interference-based data collection method in asynchronous low-duty-ratio WSN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107222903B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108259131A (en) * | 2017-12-30 | 2018-07-06 | 武汉灵途传感科技有限公司 | A kind of low-power consumption number transmission method, transmitting terminal and receiving terminal |
| CN108668383B (en) * | 2018-07-11 | 2020-12-25 | 南京航空航天大学 | Topology control method for wireless sensor network data distribution based on constructive interference |
| CN110177351B (en) * | 2019-05-28 | 2020-10-30 | 中南大学 | An efficient data transmission method for low duty cycle wireless sensor networks |
| CN112073920B (en) * | 2020-09-15 | 2022-08-26 | 杭州萤石软件有限公司 | Networking method of wireless grid network node and network node equipment |
| CN112804658B (en) * | 2021-02-20 | 2023-08-04 | 深圳市名家汇科技股份有限公司 | Wireless sensor network based on constructive interference multi-cluster collected data and collection method |
| CN115002925A (en) * | 2022-06-23 | 2022-09-02 | 云链网科技(广东)有限公司 | Relay auxiliary communication method based on remote wide area network and related device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794687A (en) * | 2006-01-06 | 2006-06-28 | 中国人民解放军理工大学 | Adaptive dormancy method of network data chain circuit layer of cluster structured radio sensor |
| CN105262693A (en) * | 2015-07-30 | 2016-01-20 | 南京大学 | Constructive interference based efficient flooding method in asynchronous low duty ratio wireless sensor network |
| CN106412997A (en) * | 2016-10-21 | 2017-02-15 | 东南大学—无锡集成电路技术研究所 | Implementation method for asynchronous sensor oriented hopcount reduced broadcasting with multiple metrics (HR-MM) broadcasting protocol |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090059827A1 (en) * | 2007-09-04 | 2009-03-05 | Board Of Regents, The University Of Texas System | System, Method and Apparatus for Asynchronous Communication in Wireless Sensor Networks |
-
2017
- 2017-06-14 CN CN201710447072.4A patent/CN107222903B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794687A (en) * | 2006-01-06 | 2006-06-28 | 中国人民解放军理工大学 | Adaptive dormancy method of network data chain circuit layer of cluster structured radio sensor |
| CN105262693A (en) * | 2015-07-30 | 2016-01-20 | 南京大学 | Constructive interference based efficient flooding method in asynchronous low duty ratio wireless sensor network |
| CN106412997A (en) * | 2016-10-21 | 2017-02-15 | 东南大学—无锡集成电路技术研究所 | Implementation method for asynchronous sensor oriented hopcount reduced broadcasting with multiple metrics (HR-MM) broadcasting protocol |
Non-Patent Citations (3)
| Title |
|---|
| Correlated Flooding in Low-Duty-Cycle Wireless Sensor Networks;Shuo Guo et al.;《2011 19th IEEE International Conference on Network Protocols》;20111231;全文 * |
| 低占空比传感器网络的数据传输调度问题研究;徐力杰;《中国博士学位论文全文数据库 信息科技辑》;20160115;正文第1章 * |
| 无线传感器网络中一种能量均衡的基于连通支配集的数据收集算法;奎晓燕等;《电子学报》;20130831;正文第2-5节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107222903A (en) | 2017-09-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107222903B (en) | Constructive interference-based data collection method in asynchronous low-duty-ratio WSN | |
| Lu et al. | An adaptive energy-efficient and low-latency MAC for data gathering in wireless sensor networks | |
| CN102651898B (en) | Delay-constrained and energy-efficient online routing in asynchronous sensor networks | |
| Lu et al. | An adaptive energy-efficient and low-latency MAC for data gathering in sensor networks | |
| Tang et al. | PW-MAC: An energy-efficient predictive-wakeup MAC protocol for wireless sensor networks | |
| CN101296249B (en) | Media access control method for wireless sensor network | |
| CN102740365B (en) | Single-stream bulk data acquisition method suitable for wireless sensor network | |
| CN102625427B (en) | Wireless sensor network data acquisition method based on asynchronous awakening scheduling | |
| Durresi et al. | Delay-energy aware routing protocol for sensor and actor networks | |
| CN103596235A (en) | Wireless sensor network route ant colony algorithm optimization method | |
| Fan et al. | Delay-bounded transmission power control for low-duty-cycle sensor networks | |
| CN112073931B (en) | Linear sensor network multi-hop data collection method based on redundant nodes | |
| Yang et al. | An adaptive sensor sleeping solution based on sleeping multipath routing and duty-cycled MAC protocols | |
| KR101019419B1 (en) | How Dynamic Mac-Protocols Based on Buffer Occupancy in USS | |
| CN109618357B (en) | A wireless transmission method and network | |
| Corbellini et al. | LA-MAC: Low-latency asynchronous MAC for wireless sensor networks | |
| Chang et al. | An energy conservation MAC protocol in wireless sensor networks | |
| Ghrab et al. | ECAB: An Efficient Context-Aware multi-hop Broadcasting protocol for wireless sensor networks | |
| CN102917467A (en) | Asynchronous reservation channel access method of wireless sensor network | |
| Singh et al. | A low delay cross-layer contention based synchronous MAC protocol for a multi-hop WSN | |
| Sudheendran et al. | Challenges of mobility aware MAC protocols in WSN | |
| Teshome et al. | Performance analysis and enhancement of contention-based sensors medium access control protocol in wireless sensor networks | |
| Yang et al. | A better choice for sensor sleeping | |
| Kirubakaran et al. | A self-adaptive duty cycle receiver reservation MAC protocol for power efficient wireless sensor networks | |
| Ghosh et al. | Energy efficient MAC protocols with adaptive duty cycle for wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |