CN111328109A - Distributed synchronization-free transmission scheduling method and system of multi-hop wireless network - Google Patents
Distributed synchronization-free transmission scheduling method and system of multi-hop wireless network Download PDFInfo
- Publication number
- CN111328109A CN111328109A CN202010084566.2A CN202010084566A CN111328109A CN 111328109 A CN111328109 A CN 111328109A CN 202010084566 A CN202010084566 A CN 202010084566A CN 111328109 A CN111328109 A CN 111328109A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- scheduling
- module
- network
- 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.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 58
- 238000000034 method Methods 0.000 title claims description 20
- 238000004220 aggregation Methods 0.000 claims abstract description 21
- 230000002776 aggregation Effects 0.000 claims abstract description 21
- 230000004044 response Effects 0.000 claims abstract description 21
- 238000009826 distribution Methods 0.000 claims abstract description 19
- 238000005070 sampling Methods 0.000 claims abstract description 17
- 230000007246 mechanism Effects 0.000 claims abstract description 13
- 238000009827 uniform distribution Methods 0.000 claims abstract description 11
- 238000013461 design Methods 0.000 claims abstract description 9
- 238000004891 communication Methods 0.000 claims description 9
- 230000001360 synchronised effect Effects 0.000 claims description 5
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 claims description 3
- 238000000638 solvent extraction Methods 0.000 claims description 3
- 238000004040 coloring Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 5
- 230000000737 periodic effect Effects 0.000 description 4
- 230000007547 defect Effects 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 239000013078 crystal Substances 0.000 description 2
- 238000004043 dyeing Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000003860 storage Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
-
- 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
- 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
- H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
-
- 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
The invention discloses a distributed synchronization-free transmission scheduling system of a multi-hop wireless network, which comprises: the design module is used for designing a single-hop synchronization-free transceiving scheduling mode; the building module is used for building a multi-hop wireless network system model; the selection module is used for sending the uniform distribution condition of the time slots and selecting a scheduling scheme; a first allocating module, configured to allocate the selected scheduling scheme to all nodes in a network; the second distribution module is used for changing a distribution strategy if a scene of interference exists between the subnets, so that the node and an adjacent node of a subnet adjacent to the same layer are distributed with different scheduling modes; the aggregation module is used for enabling the sensing node to periodically upload data packets to the aggregation node according to the sampling period; the response module is used for adding an ACK response mechanism in the converged data stream; and the distribution module is used for enabling the aggregation node to periodically distribute the data packets to all nodes of the whole network.
Description
Technical Field
The invention relates to the technical field of industrial wireless networks, in particular to a distributed synchronization-free transmission scheduling method and system of a multi-hop wireless network.
Background
Industry 4.0 is a new industry trend that relies on data-driven business models to improve the intelligence level of the manufacturing industry, with the technical bases being Cyber Physical Systems (CPS) and internet of things (IoT). The industrial wireless network is used as a basic technology of the industrial internet of things, and due to a flexible system configuration scheme, a strong technical driving force is provided for the development of industry 4.0, and the industrial wireless network is more and more concerned by the industry. However, because the current industrial wireless network has certain defects in the aspects of real-time performance of communication, certainty of transmission, reliability guarantee and the like, the industrial wireless network still has no wide application in an industrial control system with strict real-time requirements, and is often used as a supplement of wired transmission for links such as non-critical data acquisition, fault reporting and the like. One of the main reasons why the industrial wireless network is rarely applied in a complex industrial scene is that most of the industrial wireless networks adopt a centralized architecture to complete the transceiving scheduling between nodes at present, the real-time performance of the method is guaranteed to be seriously dependent on the clock synchronization precision between the nodes, the nodes need to adopt high-precision temperature compensation crystal oscillators, and communication compensation drifting is periodically carried out, so that the production cost and the running time expenditure of equipment are increased, the centralized architecture inevitably has the problem of failure of a central main control node, the failure of the main control node causes the unavailability of the whole network, and the reliability of the system is seriously influenced.
Disclosure of Invention
The invention aims to provide a distributed synchronization-free transmission scheduling method and system of a multi-hop wireless network aiming at the defects of the prior art, and the whole network does not need clock synchronization, so that a common crystal oscillator can be used, the manufacturing cost of equipment is reduced, and the synchronous communication overhead during the operation of the equipment is reduced. The distributed network architecture eliminates the problem of single point of failure and effectively solves the key problem in the practical application of the industrial wireless network.
In order to achieve the purpose, the invention adopts the following technical scheme:
a distributed, synchronization-free transmission scheduling system for a multi-hop wireless network, comprising:
the design module is used for designing a single-hop synchronous-free transceiving scheduling mode, so that any node determines that the sending time slots of different nodes do not conflict in a determined time delay range under the condition of independent asynchronous operation by using a sending data packet with two or more sending time slots repeated in one period;
the building module is used for building a multi-hop wireless network system model;
the selection module is used for sending the uniform distribution condition of the time slot and selecting one scheduling scheme from a plurality of scheduling schemes corresponding to a plurality of nodes according to the uniformity of the time slot and the end-to-end delay condition in the multi-hop wireless network system model;
a first allocating module, configured to allocate the selected scheduling scheme to all nodes in a network;
the second distribution module is used for changing a distribution strategy if a scene of interference exists between the subnets, so that the node and an adjacent node of a subnet adjacent to the same layer are distributed with different scheduling modes;
the aggregation module is used for enabling the sensing node to periodically upload data packets to the aggregation node according to the sampling period;
the response module is used for adding an ACK response mechanism in the converged data stream;
and the distribution module is used for enabling the aggregation node to periodically distribute the data packets to all nodes of the whole network.
Furthermore, all nodes in the network in the design module have equal periods, and the number of the sending time slots in each period is equal to the number of the nodes.
Further, the construction module also comprises a topology planning module which utilizes a graph partitioning algorithm to control the number of nodes in each conflict domain within a preset range, the two conflict domains are overlapped to form a cross domain, one node is placed in the cross domain and used as a routing node of two subnets, the function of multi-hop forwarding is realized, and the communication between the subnets is completed.
Further, the building module further includes:
the relationship between the number of nodes in the subnet and the number of nodes in the single-hop synchronization-free transceiving scheduling mode is as follows:
m≤M
wherein, M represents the number of nodes in the subnet, and M represents the number of nodes contained in the synchronization-free transceiving scheduling mode;
the end-to-end transmission delay is:
wherein i, j is a node, N is the number of nodes in the network, f is a data stream, fi,jFor node i to send a packet to node j,
the time for node i to send the kth packet,
receiving the time of the kth data packet sent by the node i for the destination node;
the packet delivery rate is:
wherein isendNumber of cycles, j, for sending a packet for node ireceive_iThe number of cycles that node i sends a packet is received for node j.
Further, the selecting module specifically measures the uniform distribution condition of the sending time slots by using a uniformity function;
the scheduling scheme is as follows:
wherein S is a scheduling scheme, SiIs a scheduling pattern of node i, aijThe number of time slot intervals between the sending time slots;
the uniformity is:
wherein, i, j is node, M is node number contained in the receiving and dispatching mode without synchronization, aijIs the number of slot intervals between transmission slots.
Further, the first allocation module specifically allocates the scheduling modes included in the scheduling scheme selected by the selection module to all nodes of the whole network by using a graph coloring algorithm, so as to realize conflict-free scheduling of the whole network.
Further, the aggregation module specifically disables the CSMA/CA protocol and the CCA function, and the sensing node periodically uploads a data packet to the aggregation node according to a sampling period; to ensure that the data flow is schedulable, then:
ω≥τTN
R≥Nv
C≥N
wherein, R is the sending rate of the sink node, v is the sending rate of other nodes, C is the buffer queue of the sink node, τ is the time slot, T is the number of time slots in the period, ω is the sampling period, and N is the number of network nodes.
Further, the response module adds an ACK response mechanism on the basis of the aggregation module, and after the next hop node receives the message of the current node, the current node returns an ACK response packet, and the current node receives the returned ACK without performing subsequent redundant transmission.
Further, the distribution module is specifically configured to periodically distribute the data packet to all nodes in the whole network by the sink node, and to ensure that the data stream can be scheduled, the distribution module:
ω≥τT
C≥1
wherein τ is a time slot, T is the number of time slots in a period, ω is a sampling period, and C is a buffer queue.
Correspondingly, a distributed synchronization-free transmission scheduling method of the multi-hop wireless network is also provided, which comprises the following steps:
s1, designing a single-hop synchronization-free transceiving scheduling mode, so that any node determines that transmission time slots of different nodes do not conflict in a determined time delay range under the condition of independent asynchronous operation by using a transmission data packet with two or more repeated transmission time slots in one period;
s2, constructing a multi-hop wireless network system model;
s3, sending the uniform distribution condition of the time slots, and selecting one scheduling scheme from multiple scheduling schemes corresponding to a plurality of nodes according to the uniformity of the time slots and the end-to-end delay condition in the multi-hop wireless network system model;
s4, distributing the selected scheduling scheme to all nodes in a network;
s5, if the interference scene exists between the sub-networks, changing an allocation strategy to enable the node and the adjacent node of the adjacent sub-network on the same layer to allocate different scheduling modes;
s6, enabling the sensing node to periodically upload data packets to the sink node according to the sampling period;
s7, adding an ACK response mechanism in the converged data stream;
and S8, enabling the sink node to periodically distribute the data packets to all nodes of the whole network.
Compared with the prior art, the method ensures the certainty and reliability of data transmission delay on the premise of not requiring accurate clock synchronization; the invention provides a synchronous-free transceiving scheduling mode, which ensures that the transmitting time slots of nodes do not conflict in a determined time delay range through the redundant transmission in a period, and ensures the certainty and the reliability of data transmission delay; the expandability of the network is improved by a multi-hop forwarding mode, a multi-hop wireless network system model is established by using a graph division algorithm, a scheduling scheme is selected by using a uniformity function, and a scheduling mode is distributed to realize conflict-free scheduling of the whole network; the invention also designs two scheduling algorithms to realize the uplink convergence and downlink distribution communication of the periodic data flow.
Drawings
Fig. 1 is a structural diagram of a distributed synchronization-free transmission scheduling system of a multi-hop wireless network according to an embodiment;
fig. 2 is a schematic diagram of a single-hop synchronization-free transceiving scheduling mode according to an embodiment;
FIG. 3 is a schematic diagram of a clock-free multi-hop industrial wireless network model according to an embodiment;
FIG. 4 is a schematic diagram illustrating a comparison of delay of an aggregated data stream according to an embodiment;
fig. 5 is a schematic diagram illustrating delay comparison of distributed data streams according to an embodiment.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It is to be noted that the features in the following embodiments and examples may be combined with each other without conflict.
The invention aims to provide a distributed synchronization-free transmission scheduling method and system of a multi-hop wireless network aiming at the defects of the prior art.
Example one
In this embodiment, a distributed synchronization-free transmission scheduling system of a multi-hop wireless network is provided, as shown in fig. 1, including:
the design module 11 is configured to design a single-hop synchronization-free transceiving scheduling mode, so that any node determines that transmission time slots of different nodes do not collide within a determined time delay range under the condition of independent asynchronous operation by using a transmission data packet in which two or more transmission time slots are repeated within one period;
the building module 12 is used for building a multi-hop wireless network system model;
a selecting module 13, configured to send a uniform distribution condition of a time slot, and select one scheduling scheme from multiple scheduling schemes corresponding to a plurality of nodes according to a uniformity of the time slot and an end-to-end delay condition in a multi-hop wireless network system model;
a first allocating module 14, configured to allocate the selected scheduling scheme to all nodes in the network;
a second allocating module 15, configured to change an allocation policy if there is an interference scenario between subnets, so that a node and an adjacent node of a neighboring subnet on the same layer allocate different scheduling modes;
the aggregation module 16 is configured to enable the sensor node to periodically upload a data packet to the aggregation node according to a sampling period;
the response module 17 is configured to add an ACK response mechanism to the aggregated data stream;
and the distribution module 18 is used for enabling the aggregation node to periodically distribute the data packets to all nodes in the whole network.
In the design module 11, a single-hop synchronization-free transceiving scheduling mode is designed, so that any node determines that transmission time slots of different nodes do not collide in a determined time delay range under the condition of independent asynchronous operation by using a transmission data packet in which two or more transmission time slots are repeated in one period.
The method specifically comprises the following steps: designing a single-hop synchronization-free transceiving scheduling mode; in a single-hop network, any node uses a data packet sent by two or more sending time slots repeatedly in a period to ensure that the sending time slots can not conflict within a determined time delay range under the condition of independent asynchronous operation of different nodes, the condition that the clocks of the nodes are not synchronous can be simulated by cyclic shift of the sending time slots in the period, and the condition that the time slots of the nodes are not aligned can be summarized into the condition of time slot alignment through the principles of time slot splitting and capacitance. The single-hop synchronization-free transceiving scheduling mode requires that the periods T of all nodes in the network are equal, and the number of sending time slots in each period is equal to the number N of the nodes. The dispatching of the transceiving time slots of a single node in one period is a dispatching mode S of the node, and a group of non-synchronous transceiving dispatching modes of all the nodes is a dispatching scheme S of corresponding N nodes.
Fig. 2 shows a non-synchronized transceiving scheduling mode of two nodes. S1Scheduling mode for the first node, S2Is the scheduling mode of the second node, if S1Taking the first and second time slots as transmission time slots, S2Taking the first time slot and the third time slot as sending time slots, and when the relative offset of the two scheduling modes is 0, the time slots for conflict-free sending exist; when the relative offset of the two scheduling modes is 1, i.e. S2Taking the second and fourth time slots as sending time slots, wherein the time slots for conflict-free sending still exist; since the case when the relative offsets of the two scheduling modes are 2 or more is equivalent to the above two cases, there are time slots for collision-free transmission in any relative offset case, thereby ensuring real-time reliable transmission of data.
In the building module 12, a multi-hop wireless network system model is built.
Specifically, a multi-hop wireless network system model is constructed; and performing topology planning by using a graph partitioning algorithm, controlling the number of nodes in each collision domain within a preset range, overlapping the two collision domains to form a cross region, placing one node in the cross region, serving as a routing node of two subnets, realizing a multi-hop forwarding function and finishing communication between the subnets. The relation between the number of nodes in the subnet and the number of nodes contained in the synchronization-free transceiving scheduling mode is as follows:
m≤M
wherein M is the number of nodes in the subnet, and M is the number of nodes included in the synchronization-free transceiving scheduling mode.
FIG. 3 shows a clock-free synchronization multi-hop industrial wireless network model, where the first layer is 1 node, i.e., sink node, m is the number of nodes in a subnet, L is the number of layers of the model, and L is the number of nodes in the subnetnIndicates the number of nodes of the n-th layer, then Ln＝2n-2(m-1), N is the number of nodes in the whole network, NnRepresenting the total number of N layers of nodes, then Nn＝(2n-1-1)(m-1)+1。
The end-to-end transmission delay is:
wherein i, j is a node, N is the number of nodes in the network, f is a data stream, fi,jFor node i to send a packet to node j,
the time for node i to send the kth packet,
and receiving the time of the kth data packet sent by the node i for the destination node.
The packet delivery rate is:
wherein isendNumber of cycles, j, for sending a packet for node ireceive_iReceiving node i for node jThe number of cycles to send the packet.
In the selection module 13, the uniform distribution of the time slots is sent, and a scheduling scheme is selected from multiple scheduling schemes corresponding to a plurality of nodes according to the uniformity of the time slots and the end-to-end delay condition in the multi-hop wireless network system model.
The method specifically comprises the following steps: selecting a scheduling scheme; and measuring the uniform distribution condition of the sending time slots by using a uniformity function, and selecting a proper scheduling scheme S from multiple scheduling schemes corresponding to the M nodes according to the uniformity and the end-to-end delay condition of the network.
The scheduling scheme is as follows:
wherein S is a scheduling scheme, SiIs a scheduling pattern of node i, aijIs the number of slot intervals between transmission slots.
The uniformity is:
wherein, i, j is node, M is node number contained in the receiving and dispatching mode without synchronization, aijIs the number of slot intervals between transmission slots.
The present embodiment is extended based on a single-hop network with a size of 4 nodes, there are 6 scheduling schemes when N is 4 and T is 26, and according to the uniformity and the end-to-end delay condition of the network, the scheduling scheme used in the present embodiment is:
in a first allocating module 14, the selected scheduling scheme is allocated to all nodes in the network.
The method specifically comprises the following steps: allocating a scheduling mode; and distributing the scheduling mode contained in the scheduling scheme selected in the third step to all nodes of the whole network by using a graph dyeing algorithm to realize the conflict-free scheduling of the whole network, wherein the dyeing requirement is that the colors of any node in any subnet are different from those of other nodes in the subnet.
In the second allocating module 15, if there is an interference scenario between subnets, the allocation policy is changed, so that the node and the neighboring node of the neighboring subnet on the same layer allocate different scheduling modes.
The method specifically comprises the following steps: allocating a scheduling mode in an interference scene; and changing the allocation strategy in the scene of interference among the subnetworks, and allocating different scheduling modes to the node and the adjacent node of the adjacent subnet at the same layer on the basis of the fourth step.
In the sink module 16, the sensor node periodically uploads a data packet to the sink node according to a sampling period.
The method specifically comprises the following steps: aggregation of periodic data streams; and disabling the CSMA/CA protocol and the CCA function, and periodically uploading data packets to the sink node by the sensing node according to the sampling period. To ensure that the data flow is schedulable, then:
ω≥τTN
R≥Nv
C≥N
wherein, R is the sending rate of the sink node, v is the sending rate of other nodes, C is the buffer queue of the sink node, τ is the time slot, T is the number of time slots in the period, ω is the sampling period, and N is the number of network nodes.
In the acknowledgement module 17, an ACK acknowledgement mechanism is added to the aggregate data stream.
The method specifically comprises the following steps: adding an ACK response mechanism into the converged data stream; and adding an ACK response mechanism on the basis of the sixth step, returning an ACK response packet after the next hop node receives the message of the current node, and not performing subsequent redundancy transmission when the current node receives the returned ACK. As shown in fig. 4, the ACK response mechanism is added to compare the delay of the converged data stream, so as to improve the real-time performance of data transmission.
In the distribution module 18, the sink node is caused to periodically distribute the data packets to all nodes of the entire network.
In particular to distribute data streams; as shown in fig. 5, which is a comparison graph of time delays of data stream distribution, the sink node periodically distributes data packets to all nodes in the whole network, and in order to ensure that the data stream can be scheduled:
ω≥τT
C≥1
wherein τ is a time slot, T is the number of time slots in a period, ω is a sampling period, and C is a buffer queue.
In summary, the present embodiment provides a distributed synchronization-free real-time transmission scheduling method for a multi-hop wireless network, which ensures the certainty and reliability of data transmission delay without requiring precise clock synchronization; the embodiment provides a synchronization-free transceiving scheduling mode, which ensures that the sending time slots of the nodes do not conflict in a determined time delay range through the redundant sending in a period, and ensures the certainty and reliability of data transmission delay; the expandability of the network is improved by a multi-hop forwarding mode, a multi-hop wireless network system model is established by using a graph division algorithm, a scheduling scheme is selected by using a uniformity function, and a scheduling mode is distributed to realize conflict-free scheduling of the whole network; two scheduling algorithms are also designed in the embodiment, so that the uplink aggregation and the downlink distribution communication of the periodic data flow are realized.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable storage medium, and the storage medium may include: ROM, RAM, magnetic or optical disks, and the like.
Example two
The embodiment provides a distributed synchronization-free transmission scheduling method for a multi-hop wireless network, which comprises the following steps:
s1, designing a single-hop synchronization-free transceiving scheduling mode, so that any node determines that transmission time slots of different nodes do not conflict in a determined time delay range under the condition of independent asynchronous operation by using a transmission data packet with two or more repeated transmission time slots in one period;
s2, constructing a multi-hop wireless network system model;
s3, sending the uniform distribution condition of the time slots, and selecting one scheduling scheme from multiple scheduling schemes corresponding to a plurality of nodes according to the uniformity of the time slots and the end-to-end delay condition in the multi-hop wireless network system model;
s4, distributing the selected scheduling scheme to all nodes in a network;
s5, if the interference scene exists between the sub-networks, changing an allocation strategy to enable the node and the adjacent node of the adjacent sub-network on the same layer to allocate different scheduling modes;
s6, enabling the sensing node to periodically upload data packets to the sink node according to the sampling period;
s7, adding an ACK response mechanism in the converged data stream;
and S8, enabling the sink node to periodically distribute the data packets to all nodes of the whole network.
It should be noted that, the distributed synchronization-free transmission scheduling method for a multi-hop wireless network provided in this embodiment is similar to the embodiment, and is not described herein again.
Compared with the prior art, the method ensures the certainty and reliability of data transmission delay on the premise of not requiring accurate clock synchronization; the embodiment provides a synchronization-free transceiving scheduling mode, which ensures that the sending time slots of the nodes do not conflict in a determined time delay range through the redundant sending in a period, and ensures the certainty and reliability of data transmission delay; the expandability of the network is improved by a multi-hop forwarding mode, a multi-hop wireless network system model is established by using a graph division algorithm, a scheduling scheme is selected by using a uniformity function, and a scheduling mode is distributed to realize conflict-free scheduling of the whole network; two scheduling algorithms are also designed in the embodiment, so that the uplink aggregation and the downlink distribution communication of the periodic data flow are realized.
The specific embodiments described herein are merely illustrative of the spirit of the invention. Various modifications or additions may be made to the described embodiments or alternatives may be employed by those skilled in the art without departing from the spirit or ambit of the invention as defined in the appended claims.
Claims (10)
1. A distributed synchronization-free transmission scheduling system of a multi-hop wireless network, comprising:
the design module is used for designing a single-hop synchronous-free transceiving scheduling mode, so that any node determines that the sending time slots of different nodes do not conflict in a determined time delay range under the condition of independent asynchronous operation by using a sending data packet with two or more sending time slots repeated in one period;
the building module is used for building a multi-hop wireless network system model;
the selection module is used for sending the uniform distribution condition of the time slot and selecting one scheduling scheme from a plurality of scheduling schemes corresponding to a plurality of nodes according to the uniformity of the time slot and the end-to-end delay condition in the multi-hop wireless network system model;
a first allocating module, configured to allocate the selected scheduling scheme to all nodes in a network;
the second distribution module is used for changing a distribution strategy if a scene of interference exists between the subnets, so that the node and an adjacent node of a subnet adjacent to the same layer are distributed with different scheduling modes;
the aggregation module is used for enabling the sensing node to periodically upload data packets to the aggregation node according to the sampling period;
the response module is used for adding an ACK response mechanism in the converged data stream;
and the distribution module is used for enabling the aggregation node to periodically distribute the data packets to all nodes of the whole network.
2. The system according to claim 1, wherein the design module has the same period for all nodes in the network, and the number of transmission slots in each period is equal to the number of nodes.
3. The distributed synchronization-free transmission scheduling system of a multi-hop wireless network as claimed in claim 2, wherein the building module further performs topology planning by using a graph partitioning algorithm, controls the number of nodes in each collision domain within a predetermined range, overlaps two collision domains with each other to form a cross region, places a node in the cross region, and serves as a routing node of two subnets to realize a multi-hop forwarding function, thereby completing communication between subnets.
4. The system according to claim 3, wherein the building module further comprises:
the relationship between the number of nodes in the subnet and the number of nodes in the single-hop synchronization-free transceiving scheduling mode is as follows:
m≤M
wherein, M represents the number of nodes in the subnet, and M represents the number of nodes contained in the synchronization-free transceiving scheduling mode;
the end-to-end transmission delay is:
wherein i, j is a node, N is the number of nodes in the network, f is a data stream, fi,jFor node i to send a packet to node j,
the time for node i to send the kth packet,
receiving the time of the kth data packet sent by the node i for the destination node;
the packet delivery rate is:
wherein isendNumber of cycles, j, for sending a packet for node ireceive_iThe number of cycles that node i sends a packet is received for node j.
5. The system according to claim 4, wherein the selecting module is configured to measure a uniform distribution of the transmission slots using a uniformity function;
the scheduling scheme is as follows:
wherein S is a scheduling scheme, SiIs a scheduling pattern of node i, aijThe number of time slot intervals between the sending time slots;
the uniformity is:
wherein, i, j is node, M is node number contained in the receiving and dispatching mode without synchronization, aijIs the number of slot intervals between transmission slots.
6. The system according to claim 5, wherein the first allocating module specifically allocates the scheduling mode included in the scheduling scheme selected by the selecting module to all nodes in the entire network by using a graph coloring algorithm, so as to implement collision-free scheduling in the entire network.
7. The distributed non-synchronous transmission scheduling system of the multi-hop wireless network according to claim 6, wherein the aggregation module specifically disables a CSMA/CA protocol and a CCA function, and the sensing node periodically uploads a data packet to the aggregation node according to a sampling period; to ensure that the data flow is schedulable, then:
ω≥τTN
R≥Nv
C≥N
wherein, R is the sending rate of the sink node, v is the sending rate of other nodes, C is the buffer queue of the sink node, τ is the time slot, T is the number of time slots in the period, ω is the sampling period, and N is the number of network nodes.
8. The distributed synchronization-free transmission scheduling system of a multi-hop wireless network as claimed in claim 7, wherein the response module specifically adds an ACK response mechanism on the basis of the aggregation module, and after the next-hop node receives the message of the current node, an ACK response packet is returned, and the current node receives the returned ACK without performing subsequent redundant transmission.
9. The system according to claim 8, wherein the distribution module is specifically configured to periodically distribute the data packet to all nodes in the whole network by the sink node, and to ensure that the data flow is schedulable, the distribution module:
ω≥τT
C≥1
wherein τ is a time slot, T is the number of time slots in a period, ω is a sampling period, and C is a buffer queue.
10. A distributed synchronization-free transmission scheduling method of a multi-hop wireless network is characterized by comprising the following steps:
s1, designing a single-hop synchronization-free transceiving scheduling mode, so that any node determines that transmission time slots of different nodes do not conflict in a determined time delay range under the condition of independent asynchronous operation by using a transmission data packet with two or more repeated transmission time slots in one period;
s2, constructing a multi-hop wireless network system model;
s3, sending the uniform distribution condition of the time slots, and selecting one scheduling scheme from multiple scheduling schemes corresponding to a plurality of nodes according to the uniformity of the time slots and the end-to-end delay condition in the multi-hop wireless network system model;
s4, distributing the selected scheduling scheme to all nodes in a network;
s5, if the interference scene exists between the sub-networks, changing an allocation strategy to enable the node and the adjacent node of the adjacent sub-network on the same layer to allocate different scheduling modes;
s6, enabling the sensing node to periodically upload data packets to the sink node according to the sampling period;
s7, adding an ACK response mechanism in the converged data stream;
and S8, enabling the sink node to periodically distribute the data packets to all nodes of the whole network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010084566.2A CN111328109B (en) | 2020-02-10 | 2020-02-10 | Distributed synchronization-free transmission scheduling method and system for multi-hop wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010084566.2A CN111328109B (en) | 2020-02-10 | 2020-02-10 | Distributed synchronization-free transmission scheduling method and system for multi-hop wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111328109A true CN111328109A (en) | 2020-06-23 |
| CN111328109B CN111328109B (en) | 2023-04-18 |
Family
ID=71165167
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010084566.2A Active CN111328109B (en) | 2020-02-10 | 2020-02-10 | Distributed synchronization-free transmission scheduling method and system for multi-hop wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111328109B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111918403A (en) * | 2020-08-03 | 2020-11-10 | 浙江理工大学 | Industrial wireless network deterministic transmission scheduling method based on improved Monte Carlo search tree |
| CN113852940A (en) * | 2021-07-29 | 2021-12-28 | 浪潮软件科技有限公司 | Command distribution and synchronization method, device, equipment and readable storage medium |
| CN114449629A (en) * | 2022-01-24 | 2022-05-06 | 重庆邮电大学 | Wireless multi-hop network channel resource optimization method driven by edge intelligence |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050152291A1 (en) * | 2003-11-04 | 2005-07-14 | The Regents Of The University Of California | Half-duplex wireless network scheduling |
| US6963534B1 (en) * | 2000-10-05 | 2005-11-08 | International Business Machines Corporation | Methodology for improving the performance of asynchronous data traffic over TDD/TDMA wireless networks |
| CN101374140A (en) * | 2007-08-22 | 2009-02-25 | 湖南大学 | Node structure of wireless sensor network and MAC communication protocol thereof |
| CN102196502A (en) * | 2011-04-06 | 2011-09-21 | 东南大学 | Congestion control method for wireless sensor network |
| CN102740365A (en) * | 2012-06-28 | 2012-10-17 | 东南大学 | Single-stream bulk data acquisition method suitable for wireless sensor network |
| CN107040878A (en) * | 2017-04-14 | 2017-08-11 | 河海大学 | A kind of many chain wireless sensor networks without layered communication method |
| CN107968998A (en) * | 2017-11-28 | 2018-04-27 | 浙江理工大学 | A kind of distributed wireless networks method for protecting based on faith mechanism |
| CN108809707A (en) * | 2018-05-30 | 2018-11-13 | 浙江理工大学 | A kind of TSN dispatching methods towards real-time application demand |
-
2020
- 2020-02-10 CN CN202010084566.2A patent/CN111328109B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6963534B1 (en) * | 2000-10-05 | 2005-11-08 | International Business Machines Corporation | Methodology for improving the performance of asynchronous data traffic over TDD/TDMA wireless networks |
| US20050152291A1 (en) * | 2003-11-04 | 2005-07-14 | The Regents Of The University Of California | Half-duplex wireless network scheduling |
| CN101374140A (en) * | 2007-08-22 | 2009-02-25 | 湖南大学 | Node structure of wireless sensor network and MAC communication protocol thereof |
| CN102196502A (en) * | 2011-04-06 | 2011-09-21 | 东南大学 | Congestion control method for wireless sensor network |
| CN102740365A (en) * | 2012-06-28 | 2012-10-17 | 东南大学 | Single-stream bulk data acquisition method suitable for wireless sensor network |
| CN107040878A (en) * | 2017-04-14 | 2017-08-11 | 河海大学 | A kind of many chain wireless sensor networks without layered communication method |
| CN107968998A (en) * | 2017-11-28 | 2018-04-27 | 浙江理工大学 | A kind of distributed wireless networks method for protecting based on faith mechanism |
| CN108809707A (en) * | 2018-05-30 | 2018-11-13 | 浙江理工大学 | A kind of TSN dispatching methods towards real-time application demand |
Non-Patent Citations (1)
| Title |
|---|
| 张亚珂: "无线传感网络中拥塞控制与路由的跨层设计_分布式牛顿法", 《自动化学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111918403A (en) * | 2020-08-03 | 2020-11-10 | 浙江理工大学 | Industrial wireless network deterministic transmission scheduling method based on improved Monte Carlo search tree |
| CN111918403B (en) * | 2020-08-03 | 2023-10-31 | 浙江理工大学 | Industrial wireless network deterministic transmission scheduling method based on improved Monte Carlo search tree |
| CN113852940A (en) * | 2021-07-29 | 2021-12-28 | 浪潮软件科技有限公司 | Command distribution and synchronization method, device, equipment and readable storage medium |
| CN113852940B (en) * | 2021-07-29 | 2023-07-18 | 浪潮软件科技有限公司 | Command distribution and synchronization method, device, equipment and readable storage medium |
| CN114449629A (en) * | 2022-01-24 | 2022-05-06 | 重庆邮电大学 | Wireless multi-hop network channel resource optimization method driven by edge intelligence |
| CN114449629B (en) * | 2022-01-24 | 2023-07-21 | 重庆邮电大学 | Wireless multi-hop network channel resource optimization method driven by edge intelligence |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111328109B (en) | 2023-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111328109B (en) | Distributed synchronization-free transmission scheduling method and system for multi-hop wireless network | |
| Thubert et al. | 6TiSCH centralized scheduling: When SDN meet IoT | |
| CN100379183C (en) | Inter-synchronuos method for mobile wireless self-organized network | |
| Young | USAP multiple access: dynamic resource allocation for mobile multihop multichannel wireless networking | |
| Whitbeck et al. | HYMAD: Hybrid DTN-MANET routing for dense and highly dynamic wireless networks | |
| CN100452750C (en) | Token transfer and manage method for Ad Hoc network | |
| Christmann et al. | Realization of Try-Once-Discard in wireless multihop networks | |
| CN101827415B (en) | Channel allocating method and system in wireless mesh network | |
| US20200322951A1 (en) | Insertion slots along deterministic track for movable network device in a deterministic network | |
| CN114553697B (en) | Industrial wireless and TSN fusion-oriented network scheduling method | |
| Mennes et al. | A neural-network-based MF-TDMA MAC scheduler for collaborative wireless networks | |
| US11411818B2 (en) | Method and apparatus for a communication network | |
| CN106060957A (en) | CSMA/TDMA hybrid access control method | |
| CN110247787B (en) | Method, network element and control equipment for establishing flexible Ethernet path | |
| Terraneo et al. | TDMH-MAC: Real-time and multi-hop in the same wireless MAC | |
| CN114051715A (en) | Control device, switching device and method | |
| Karaagac et al. | Time-critical communication in 6TiSCH networks | |
| CN114884557B (en) | Satellite time sensitive network path selection method based on network algorithm | |
| Fiore et al. | Multihop multi-channel scheduling for wireless control in WirelessHART networks | |
| Veisi et al. | Sdn-tsch: Enabling software defined networking for scheduled wireless networks with traffic isolation | |
| Liu et al. | Topology-transparent scheduling in mobile ad hoc networks with multiple packet reception capability | |
| Yu et al. | Low jitter scheduling for industrial wireless sensor and actuator networks | |
| Wang et al. | Robust routing and scheduling in wireless mesh networks | |
| JP4353082B2 (en) | Wireless communication system | |
| KR20200071638A (en) | Method for supporting multipath transmission for tsch mac environments, node apparatus in a multipath transmitting tsch mac environment |
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 |