CN109618357A - A kind of radio transmitting method and network - Google Patents
A kind of radio transmitting method and network Download PDFInfo
- Publication number
- CN109618357A CN109618357A CN201811572227.8A CN201811572227A CN109618357A CN 109618357 A CN109618357 A CN 109618357A CN 201811572227 A CN201811572227 A CN 201811572227A CN 109618357 A CN109618357 A CN 109618357A
- Authority
- CN
- China
- Prior art keywords
- subregion
- node
- transmission
- partition number
- data
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1221—Wireless traffic scheduling based on age of data to be sent
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to wireless communication technology fields, and in particular to a kind of radio transmitting method and network.Radio transmitting method of the invention is subregion to be carried out to wireless-transmission network, and different subregions are respectively set to transmission subregion and spare partitions, and sleep scheduling mechanism is used to divide different sleep scheduling strategies for each subregion；Node in data transfer phase, same subregion selects suitable node concurrent transmission using probability forwarding mechanism in subregion；It is transmitted data subregion where start node, until terminal node is properly received.Using the low energy consumption and low latency method of the invention, it is possible to realize data transmission in strip wireless sensor network, especially suitable for needing the strip wireless sensor network application of low latency and low energy consumption.
Description
Technical field:
The invention belongs to wireless communication technology fields, and in particular to a kind of radio transmitting method and network.
Background technique:
Strip wireless sensor network (SWSNs) is typically deployed at narrow scope but very long belt-like zone, carries out real
When monitoring and data collection, such as carry out gas-monitoring within coal mines, tunnel is only several meters wide but length has dozens of kilometres.It passes
Sensor node is usually run in a manner of low duty ratio, node only in a short period of time keep state of activation carry out data forwarding and
It receives.For this purpose, sending node needs to wait can carry out data transmission until receiving node becomes state of activation just for a long time, this
Have led to sleep delay.In SWSNs, cumulative sleep delay will lead to the end-to-end transmission time of longer data.
It is suggested to shorten prolonged transmission delay, Pipeline Sheduling as caused by node sleep in SWSNs.
Pipeline schedule is the node sequence distribution activation time slot in transmission path, and receiving node just receives data in sending node
When just wake up at once, sending node can be forwarded at once without any sleep delay.However this dispatching technique ignores list
Jump the unstability of Radio Link.When link is unstable causes data transmission fails, node is needed until next transmission cycle
Data could be given to receiving node again, this will lead to longer transmission delay.In order to handle link instability problem, multithread
The technologies such as waterline scheduling and chance pipeline schedule are proposed in succession.However both scheduling strategies are all number of the single-point to single-point
According to transmission, when channel is very unstable, also easily lead to retransmit, meanwhile, existing pipeline agreement needs node maintenance
Network state (for example, neighbor node wakeup time, routing state information etc.), this will expend the big energy of node.In addition, whenever
When thering is one group of new source and terminal node to carry out data interaction, it is necessary to re-establish routing between node, reset scheduling
Strategy.
In face of existing pipeline schedule there are the problem of, how to design a kind of guarantee transmission quality, low latency it is band-like
Wireless sensor network transmission method is with regard to extremely important.
Summary of the invention:
Goal of the invention:
Technical problem to be solved by the invention is to provide a kind of low latency, guarantee transmission quality based on concurrent transmission and
The radio transmitting method and network of sleep scheduling, main purpose are under the premise of guaranteeing that data are successfully decoded in terminal node, to the greatest extent
Amount reduces the end-to-end propagation delay time of strip wireless sensor network.
Technical solution:
A kind of radio transmitting method, the radio transmitting method include:
Step 1: subregion is carried out to wireless-transmission network, and different subregions are respectively set to transmission subregion and spare point
Area, wherein transmission subregion be responsible for data transmission, spare partitions be responsible for monitor transmission subregion whether Successful transmissions；
Step 2: sleep scheduling mechanism is used to divide different sleep scheduling strategies for each subregion；
Step 3: the node in data transfer phase, same subregion selects to close in subregion using probability forwarding mechanism
Suitable node concurrent transmission；It is transmitted data subregion where start node, until terminal node is properly received.
A kind of wireless-transmission network, the wireless-transmission network are strip wireless sensor network, including start node, end
Only node and multiple radio nodes,
The wireless-transmission network is divided into transmission subregion and spare partitions, the node of the transmission subregion and spare partitions
Node can receive data；And the radio node of the transmission subregion is used for transmission data, and the node of spare partitions is used for
Monitoring transmission subregion, whether Successful transmissions transmit to neighboring transmission subregion to listen to and when transmit subregion unsuccessful transmission
Data；And the different sleep scheduling strategy of each zone configuration of wireless-transmission network, and in data transfer phase, together
Node in one subregion is configured to select suitable node concurrently-transmitted data in subregion using probability forwarding mechanism.
Advantage and effect:
It is strong to enhance receiver reception signal for the data distribution mode of radio transmitting method of the invention based on concurrent transmission
Degree, improves link-quality, reduces the probability of node re-transmission.Meanwhile using sleep scheduling strategy, distributed for different subregions
Different time slot schedulings, reduce sleep delay.In addition, radio transmitting method of the invention is moved by node probability forwarding mechanism
The number of nodes of concurrent transmission, avoids the unnecessary concurrent transmission node of selection, reduces transmission energy in the adjustment subregion of state
Amount consumption；And when start node or terminal node change, does not need to re-establish and route and reset between node
Scheduling strategy.Particularly suitable for needing low latency to carry out the strip wireless sensor network application of data distribution.It can be seen that this
Invention is that space has been expanded in the technological progress of this field, and implementation result is good.
Detailed description of the invention:
Strip wireless sensor network of Fig. 1 embodiment of the present invention 1 containing unreliable link；
Strip wireless sensor network of Fig. 2 embodiment of the present invention 1 containing 9 subregions；
The time cycle schematic diagram of Fig. 3 embodiment of the present invention 1.
Specific embodiment:
Following further describes the present invention with reference to the drawings:
The purpose of the present invention, advantage and feature will be explained by the non-limitative illustration of preferred embodiment below.This
A little embodiments are only the prominent example using technical solution of the present invention, all skills taking equivalent replacement or equivalent transformation and being formed
Art scheme, all falls within the scope of protection of present invention.
The main thought of radio transmitting method based on concurrent transmission and sleep scheduling: entire belt-like zone is divided first
As transmission subregion and spare partitions.It transmits subregion to transmit for data, the transmission of spare partitions monitored data.In same subregion
Node has identical scheduling strategy, wakes up simultaneously, carries out concurrent transmission and data receiver.Meanwhile in partition data forwarding, use
Probability forwarding mechanism dynamically to adjust concurrent node quantity in subregion.Node energy consumption can be effectively reduced in node sleep, concurrently
Transmission can effectively improve signal quality, and The present invention gives the methods how effectively to combine the two.
A kind of radio transmitting method, the radio transmitting method include:
Step 1: subregion is carried out to wireless-transmission network, and different subregions are respectively set to transmission subregion and spare point
Area, wherein transmission subregion be responsible for data transmission, spare partitions be responsible for monitor transmission subregion whether Successful transmissions；Step 2: it uses
Sleep scheduling mechanism is that each subregion divides different sleep scheduling strategies；
Step 3: the node in data transfer phase, same subregion selects to close in subregion using probability forwarding mechanism
Suitable node concurrent transmission；It is transmitted data subregion where start node, until terminal node is properly received.
When step 1 netinit, subregion is arranged according to partition threshold α for each node in operation partitioning algorithm first
Number, and whole network is carried out by subregion according to partition number, the identical node division of partition number is in the same subregion, by partition number
It is set as transmission subregion for the subregion of odd number, if the transmission subregion that partition number is i is b_i；The subregion that partition number is even number is set
Spare partitions are set to, if the spare partitions that partition number is i are b ' _ i.
The partitioning algorithm comprises the concrete steps that: by zonal networks end to end two nodes be respectively defined as start node and
Terminal node, oneself partition number is set as 1 by start node, while broadcasting a subregion packet, and partition number is set as 1 in subregion packet；Net
All nodes for being successfully received subregion packet and also not set partition number in network, if the signal-to-noise ratio of received signal be greater than etc.
In threshold alpha, then the partition number of oneself is set the partition number in subregion packet by node, while passing through csma side
Formula broadcasts new subregion packet, and partition number is set as oneself partition number plus 1, if the signal-to-noise ratio of received signal in new subregion packet
Less than threshold alpha, then the subregion packet received is abandoned, do not broadcast the message；Node determines partition size by partition threshold α,
Partition threshold is bigger, and partition length is smaller；Partition threshold is smaller, and partition length is bigger.Partition length is excessive or too small can all make
Propagation delay time becomes larger and gets higher with network power consumption, therefore presence is so that all lesser optimally partitioned threshold of propagation delay time and network power consumption
Value α can be determined according to simulated experiment, and partition threshold α is traditionally arranged to be between -6~2.
If partition number i_x has been arranged in node, when receiving the subregion packet that partition number is i_y again, compare i_x and i_y
Size the partition number of oneself is updated to i_y if i_x > i_y, and broadcast new point by csma mode
Area is wrapped, and partition number is set as i_ (y+1) in new subregion packet, if i_x≤i_y, received subregion packet is abandoned, does not broadcast and disappears
Breath；
Network partition time threshold t is set, starts timing after oneself partition number is arranged in node, if in time threshold t
Partition number does not update, then the node ceases listening for subregion packet, and when terminal node ceases listening for subregion packet, terminal node will divide
Area code adds 1, and as an independent subregion, partitioning algorithm terminates.
The sleep scheduling strategy of step 2 comprises the concrete steps that；Time cycle is divided into the equal time slots of K, i.e., time slot 1,
Time slot 2 ..., time slot K；
For transmitting subregion b_i, if i≤K, the default wake-up time slot of subregion interior joint isIf K < i <
2 × K-3, then the default wake-up time slot of subregion interior joint beWith 1~(i mod K)；When i >=2 × K-3, entire week
Phase, which all presets, is in wake-up states；
For spare partitions b ' _ i, if i≤K, the default wake-up time slot of subregion interior joint isIf K < i < 2 ×
K-2, then the default wake-up period of subregion interior joint beWith 1~(i mod K), when i >=2 × K-2, whole cycle is all pre-
If being in wake-up states.
One time cycle is divided into K time slot, and the time cycle is calculated using following formula:
T=K × τ (1)；
Wherein, T represents the time cycle, and τ is slot unit duration, and K represents time slot；
Each subregion wakes up in fixed slot section, carries out data forwarding and reception.Slot unit duration τ is approximately equal to
Primary complete data single-hop transmission time (including data transmission, ACK transmission and protection interval), that is a cycle is divided
For K slot unit duration；Each subregion wakes up in fixed slot section, carries out data forwarding and reception；The value of K can root
It is set according to practical application request, K is smaller, then transmission delay is smaller and node energy consumption is higher, and K is bigger, then transmission delay is got over
It is big and node energy consumption is smaller.Terminal node is generally the receiving device for having continued power, presets it and is constantly in wake-up states.
Probability forwarding mechanism in step 3 uses formula:
Wherein, PjIndicate the probability that node j is forwarded, ρ is nodes density, and α is partition threshold, snrjIt is section
The signal of point j receives overall strength, and f (α) is sigmoid function, i.e.,
Specific data transmission procedure is in step 3: when transmission subregion b_i fails to transfer data to next transmission
When subregion b_ (i+2), spare partitions b ' _ (i+1) for listening to data is responsible for transferring data to next transmission subregion b_ (i+
2)；
Due to the uncertainty of wireless signal transmission, it will appear three kinds of situations at this time:
Situation 1: spare partitions b ' _ (i+1) and transmission subregion b_ (i+2) have node to receive transmission subregion b_i transmission
Data, at this point, spare partitions b ' _ (i+1) reply ACK message to transmission subregion b_i, transmission subregion b_ (i+2) reply ACK disappear
It ceases to spare partitions b ' _ (i+1), transmits after the node in subregion b_i and spare partitions b ' _ (i+1) receives ACK message, into
Enter sleep state；
Situation 2: transmission subregion b_ (i+2) receives data without node, and spare partitions b ' _ (i+1) has node to connect
Receive the data of transmission subregion b_i transmission；At this point, receiving the node reverts back ACK message of data in spare partitions b ' _ (i+1)
Transmission subregion b_i is given, transmits after the node in subregion b_i receives ACK and enters sleep state, and spare partitions b ' _ (i+1) is negative
Duty transfers data to transmission subregion b_ (i+2) in next time slot；
Situation 3: the node in spare partitions b ' _ (i+1) does not receive the data of transmission subregion b_i, and transmission subregion
Node in b_ (i+2) does not receive spare partitions b ' _ (i+1) data；Transmission failure.Both of these case can pass through setting
Suitable partition threshold is avoided, and subsequent content is no longer discussed for both of these case.
A kind of wireless-transmission network, the wireless-transmission network are strip wireless sensor network, including start node, end
Only node and multiple radio nodes,
The wireless-transmission network is divided into transmission subregion and spare partitions, the node of the transmission subregion and spare partitions
Node can receive data；And the radio node of the transmission subregion is used for transmission data, and the node of spare partitions is used for
Monitoring transmission subregion, whether Successful transmissions transmit to neighboring transmission subregion to listen to and when transmit subregion unsuccessful transmission
Data；And the different sleep scheduling strategy of each zone configuration of wireless-transmission network, and in data transfer phase, together
Node in one subregion is configured to select suitable node concurrently-transmitted data in subregion using probability forwarding mechanism.
It is operation partitioning algorithm, root that the wireless-transmission network, which is divided into transmission subregion and the specific method of spare partitions use,
According to partition threshold α, partition number is set for each node, and whole network is carried out by subregion according to partition number, partition number is identical
Node division is set as transmission subregion in the same subregion, by the subregion that partition number is odd number, if the transmission point that partition number is i
Area is b_i；Spare partitions are set by the subregion that partition number is even number, if the spare partitions that partition number is i are b ' _ i；
By zonal networks, two nodes are respectively defined as start node and terminal node end to end, and start node is by oneself subregion
It number is set as 1, while broadcasting a subregion packet, partition number is set as 1 in subregion packet；It is all in network to be successfully received subregion packet and go back
The node of not set partition number, if the signal-to-noise ratio of received signal is more than or equal to threshold alpha, node is by the partition number of oneself
The partition number being set as in subregion packet, while new subregion packet, new subregion Bao Zhongfen are broadcasted by csma mode
Area code is set as oneself partition number plus 1, if the signal-to-noise ratio of received signal is less than threshold alpha, the subregion that will be received
Packet abandons, and does not broadcast the message；
If partition number i_x has been arranged in node, when receiving the subregion packet that partition number is i_y again, compare i_x and i_y
Size the partition number of oneself is updated to i_y if i_x > i_y, and broadcast new point by csma mode
Area is wrapped, and partition number is set as i_ (y+1) in new subregion packet, if i_x≤i_y, received subregion packet is abandoned, does not broadcast and disappears
Breath；
Network partition time threshold t is set, starts timing after oneself partition number is arranged in node, if in time threshold t
Partition number does not update, then the node ceases listening for subregion packet, and when terminal node ceases listening for subregion packet, terminal node will divide
Area code adds 1, and as an independent subregion, partitioning algorithm terminates.
The sleep scheduling strategy is that the time cycle is divided into the equal time slots of K, i.e., time slot 1, time slot 2 ..., when
Gap K；
For transmitting subregion b_i, if i≤K, the default wake-up time slot of subregion interior joint isIf K < i <
2 × K-3, then the default wake-up time slot of subregion interior joint beWith 1~(i mod K)；When i >=2 × K-3, entire week
Phase, which all presets, is in wake-up states；
For spare partitions b ' _ i, if i≤K, the default wake-up time slot of subregion interior joint isIf K < i < 2 ×
K-2, then the default wake-up period of subregion interior joint beWith 1~(i mod K), when i >=2 × K-2, whole cycle is all pre-
If being in wake-up states.
Specific data transmission procedure is: when transmission subregion b_i fails to transfer data to next transmission subregion b_ (i+
2) when, spare partitions b ' _ (i+1) for listening to data is responsible for transferring data to next transmission subregion b_ (i+2).
Embodiment 1
A kind of radio transmitting method based on concurrent transmission and sleep scheduling, the radio transmitting method include:
Step 1: when netinit, subregion is arranged according to partition threshold α for each node in operation partitioning algorithm first
Number, and whole network is carried out by subregion according to partition number, the identical node division of partition number is in the same subregion, by partition number
It is set as transmission subregion for the subregion of odd number, if the transmission subregion that partition number is i is b_i；The subregion that partition number is even number is set
Spare partitions are set to, if the spare partitions that partition number is i are b ' _ i；Partition number i is positive integer；
Optimally partitioned threshold alpha is -5 in the present embodiment.
If Fig. 1 is the strip wireless sensor network model containing unreliable link, dot indicates sensor node.Dot
A indicates start node, and since partitioning algorithm until nodes all in network all divide subregion, be divided into 9 start node altogether
Subregion.
Step 2: sleep scheduling mechanism is used to divide different sleep scheduling strategies for each subregion: as shown in figure 3, will
Time cycle is divided into 6 equal time slots, i.e. time slot 1, time slot 2, time slot 3, time slot 4, time slot 5 and time slot 6；
If Fig. 2 is the strip wireless sensor network model containing 9 subregions, dot indicates sensor node.Band-like net
Digital representation partition number 1~9 below network.A cycle subregion is divided into 6 time slots in network, and each subregion is called out in fixed time slot
It wakes up, carries out data forwarding and reception.The time slot 1 that transmission subregion 1 is preset in each period wakes up；Spare partitions 2 are preset in each
The time slot 1,2 in period wakes up；The time slot 1,2,3 that transmission subregion 3 is preset in each period wakes up；Spare partitions 4 are preset in each
The time slot 2,3,4 in period wakes up；The time slot 2,3,4,5 that transmission subregion 5 is preset in each period wakes up；Spare partitions default 6 exist
The time slot 3,4,5,6 in each period wakes up；The time slot 1,3,4,5,6 that transmission subregion 7 is preset in each period wakes up；Spare partitions
8 time slots 1,2,4,5,6 for being preset in each period wake up；Transmission subregion 9 is preset in whole cycle and is in wake-up states.Node a
Indicate that start node, node b indicate terminal node.Consider a data forwarding process, start node (being in subregion 1) is wanted will
Data forwarding gives terminal node (being in subregion 9).
Step 3:
Step a: time slot k, transmit the node concurrently-transmitted data in subregion b_i, spare partitions b_ (i+1) and transmission subregion
B_ (i+2) receives data；If thering is node to receive data in spare partitions b_ (i+1), and transmits and do not saved in subregion b_ (i+2)
Point receives data, then the node that data are received in spare partitions b_ (i+1) concurrently replys ACK message；If spare partitions b_
(i+1) and in transmission subregion b_ (i+2) there is node to receive message, then transmit the section for receiving data in subregion b_ (i+2)
Point concurrently replys ACK message and gives spare partitions b_ (i+1), and the node that data are then received in spare partitions b_ (i+1) is concurrent
ACK message is replied to b_i.
Step b: time slot k+1, if thering is node to receive data in spare partitions b_ (i+1) in time slot k and transmitting subregion
There is no node to receive data in b_ (i+2), then transmission subregion b_i enters sleep state at this time, connects in spare partitions b_ (i+1)
The node concurrently-transmitted data of data is received, transmission subregion b_ (i+2), which receives data and replys ACK message, gives spare partitions b_ (i
+1)；If thering is node to receive message in spare partitions b_ (i+1) and transmission subregion b_ (i+2) in time slot k, pass at this time
Defeated subregion b_i and spare partitions b_ (i+1) enters sleep state, and transmission subregion b_ (i+2) carries out the operation of step a.
Node in all subregions carries out data forwarding according to step a and step b, due to the uncertainty of wireless transmission,
It is divided to two kinds of extreme cases to be illustrated the data transmission method in Fig. 2 below:
Situation 1: the data that all transmission subregions have node to receive a transmission subregion forwarding.At this point, time slot 1 is called out
Awake is subregion 1, and subregion 2, subregion 3, subregion 9, the transmission transmission data of subregion 1, transmitting in subregion 3 has node to receive data；
The wake-up of time slot 2 is subregion 3, subregion 4, subregion 5, subregion 9, transmit received in subregion 3 transmission 1 data of subregion node it is concurrent
Data are transmitted, transmitting in subregion 5 has node to receive data；The wake-up of time slot 3 is subregion 5, subregion 6, subregion 7, subregion 9, biography
The node concurrently-transmitted data of transmission 3 data of subregion is received in defeated subregion 5, transmitting in subregion 7 has node to receive data；When
The wake-up of gap 4 is subregion 7, subregion 8, and subregion 9 transmits the node concurrently-transmitted data that data are received in subregion 7, transmits subregion
Terminal node in 9 receives data；It is wake-up states that time slot 5 and time slot 6, which only have subregion 9,；Terminal node needs 4 time slots to connect
Receive data；
As shown in Fig. 2, situation 2: all transmission subregions all receive the data of upper transmission subregion forwarding without node,
I.e. each transmission subregion requires to receive the data of the spare partitions forwarding of the front.At this point, the wake-up of time slot 1 is subregion 1, point
Area 2, subregion 3, subregion 7, subregion 8, subregion 9, transmission subregion 1 send data, have node to receive data in spare partitions 2, and
There is no node to receive data in transmission subregion 3, transmission subregion 7 receives the node concurrently-transmitted data of data, in spare partitions 8
There is node to receive data, and transmitting in subregion 9 does not have node to receive data；The wake-up of time slot 2 is subregion 2, and subregion 3 divides
Area 4, subregion 5, subregion 8, subregion 9, spare partitions 2 receive the node concurrently-transmitted data of data, and transmitting in subregion 3 has node to connect
Data are received, spare partitions 8 receive the node concurrently-transmitted data of data, and transmitting in subregion 9 has node to receive data；Time slot
3 to wake up be subregion 3, subregion 4, subregion 5, subregion 6, subregion 7, subregion 9, and transmission subregion 3 receives the node concurrent transmission of data
Data have node to receive data in spare partitions 4, and transmitting in subregion 5 does not have node to receive data；What time slot 4 woke up
For subregion 4, subregion 5, subregion 6, subregion 7, subregion 8, subregion 9, spare partitions 4 receive the node concurrently-transmitted data of data, pass
There is node to receive data in defeated subregion 5；The wake-up of time slot 5 is subregion 5, subregion 6, subregion 7, subregion 8, subregion 9, transmission subregion
5 receive the node concurrently-transmitted data of data, have node to receive data in spare partitions 6, and transmitting in subregion 7 does not have node
Receive data；The wake-up of time slot 6 is subregion 6, subregion 7, subregion 8, subregion 9, and the node that spare partitions 6 receive data concurrently passes
Transmission of data, transmitting in subregion 7 has node to receive data；Terminal node needs 8 time slots to receive data.
The characteristics of transmission method of the invention is the spy by entire strip wireless sensor network region according to concurrent transmission
Property be divided into multiple approximately equal subregions, and use sleep scheduling mechanism for each subregion order-assigned activate time slot.It is same
Node in subregion has identical scheduling strategy, wakes up simultaneously, concurrent transmission, and multiple identical signals form construction interference, with this
Enhance received signal strength, improves link-quality.After the present invention, data can be realized in strip wireless sensor network
The low energy consumption and low latency of transmission, especially suitable for needing the strip wireless sensor network application of low latency and low energy consumption.
Claims (11)
1. a kind of radio transmitting method, it is characterised in that: the radio transmitting method includes:
Step 1: carrying out subregion to wireless-transmission network, and different subregions be respectively set to transmission subregion and spare partitions,
In, transmission subregion be responsible for data transmission, spare partitions be responsible for monitor transmission subregion whether Successful transmissions；
Step 2: sleep scheduling mechanism is used to divide different sleep scheduling strategies for each subregion；
Step 3: the node in data transfer phase, same subregion is selected suitably using probability forwarding mechanism in subregion
Node concurrent transmission；It is transmitted data subregion where start node, until terminal node is properly received.
2. radio transmitting method according to claim 1, it is characterised in that: when step 1 netinit, run first
According to partition threshold α partition number is arranged for each node, and whole network is carried out subregion according to partition number in partitioning algorithm, point
The identical node division of area code is set as transmission subregion in the same subregion, by the subregion that partition number is odd number, if partition number
It is b_i for the transmission subregion of i；Spare partitions are set by the subregion that partition number is even number, if the spare partitions that partition number is i are
b’_i。
3. radio transmitting method according to claim 2, it is characterised in that: the partitioning algorithm comprises the concrete steps that:
By zonal networks, two nodes are respectively defined as start node and terminal node end to end, oneself partition number is set as 1 by start node,
A subregion packet is broadcasted simultaneously, and partition number is set as 1 in subregion packet；It is all in network to be successfully received subregion packet and also not set point
The node of area code, if the signal-to-noise ratio of received signal is more than or equal to threshold alpha, node sets the partition number of oneself to point
Partition number in area's packet, while new subregion packet is broadcasted by csma mode, partition number is arranged in new subregion packet
1 is added for oneself partition number, if the signal-to-noise ratio of received signal is less than threshold alpha, the subregion packet received is abandoned, no
Broadcast message；
If partition number i_x has been arranged in node, when receiving the subregion packet that partition number is i_y again, compare the big of i_x and i_y
It is small, if i_x > i_y, the partition number of oneself is updated to i_y, and new subregion is broadcasted by csma mode
It wraps, partition number is set as i_ (y+1) in new subregion packet, if i_x≤i_y, received subregion packet is abandoned, is not broadcast the message；
Network partition time threshold t is set, starts timing after oneself partition number is arranged in node, if the subregion in time threshold t
It number does not update, then the node ceases listening for subregion packet, and when terminal node ceases listening for subregion packet, terminal node is by partition number
Add 1, as an independent subregion, partitioning algorithm terminates.
4. radio transmitting method according to claim 1, it is characterised in that: the sleep scheduling strategy specific steps of step 2
It is；Time cycle is divided into the equal time slots of K, i.e., time slot 1, time slot 2 ..., time slot K；
For transmitting subregion b_i, if i≤K, the default wake-up time slot of subregion interior joint isIf 2 × K- of K < i <
3, then the default wake-up time slot of subregion interior joint beWith 1~(i mod K)；When i >=2 × K-3, whole cycle is all pre-
If being in wake-up states；
For spare partitions b ' _ i, if i≤K, the default wake-up time slot of subregion interior joint isIf K < i 2 × K-2 of <,
Then the default wake-up period of subregion interior joint isWith 1~(i mod K), when i >=2 × K-2, all default place of whole cycle
In wake-up states.
5. radio transmitting method according to claim 1, it is characterised in that: the probability forwarding mechanism in step 3 is using public
Formula:
Wherein, PjIndicate the probability that node j is forwarded, ρ is nodes density, and α is partition threshold, snrjIt is node j
Signal receives overall strength, and f (α) is sigmoid function, i.e.,
6. the radio transmitting method according to claim 1 in concurrent transmission and sleep scheduling, it is characterised in that: step 3
Middle data transmission procedure is: when transmission subregion b_i fails to transfer data to next transmission subregion b_ (i+2), listening to
The spare partitions b ' of data _ (i+1) is responsible for transferring data to next transmission subregion b_ (i+2).
7. the radio transmitting method according to claim 6 in concurrent transmission and sleep scheduling, it is characterised in that: specific
Data transmission procedure is: due to the uncertainty of wireless signal transmission, it will appear three kinds of situations at this time:
Situation 1: spare partitions b ' _ (i+1) and transmission subregion b_ (i+2) have node to receive the number that transmission subregion b_i is sent
According at this point, spare partitions b ' _ (i+1), which replys ACK message, gives transmission subregion b_i, transmission subregion b_ (i+2) is replied ACK message and given
Spare partitions b ' _ (i+1) is transmitted after the node in subregion b_i and spare partitions b ' _ (i+1) receives ACK message, into sleeping
Dormancy state；
Situation 2: transmission subregion b_ (i+2) receives data without node, and spare partitions b ' _ (i+1) has node to receive
Transmit the data of subregion b_i transmission；At this point, receiving the node reverts back ACK message of data in spare partitions b ' _ (i+1) to biography
Defeated subregion b_i is transmitted after the node in subregion b_i receives ACK and is entered sleep state, and spare partitions b ' _ (i+1) is responsible for
Next time slot transfers data to transmission subregion b_ (i+2)；
Situation 3: the node in spare partitions b ' _ (i+1) does not receive the data of transmission subregion b_i, and transmission subregion b_ (i+
2) node in does not receive spare partitions b ' _ (i+1) data；Transmission failure.
8. a kind of wireless-transmission network, the wireless-transmission network is strip wireless sensor network, including start node, termination
Node and multiple radio nodes, it is characterised in that:
The wireless-transmission network is divided into transmission subregion and spare partitions, the node of the transmission subregion and the node of spare partitions
It can receive data；And the radio node of the transmission subregion is used for transmission data, and the node of spare partitions is for monitoring
Transmit subregion whether Successful transmissions, and when transmit subregion unsuccessful transmission, the data that are listened to the transmission of neighboring transmission subregion；
And the different sleep scheduling strategy of each zone configuration of wireless-transmission network, and in data transfer phase, same subregion
In node be configured to select suitable node concurrently-transmitted data in subregion using probability forwarding mechanism.
9. wireless-transmission network according to claim 8, it is characterised in that: the wireless-transmission network is divided into transmission subregion
The specific method used with spare partitions is operation partitioning algorithm, and according to partition threshold α, partition number is arranged for each node, and
Whole network is subjected to subregion according to partition number, partition number is surprise in the same subregion by the identical node division of partition number
Several subregions is set as transmission subregion, if the transmission subregion that partition number is i is b_i；It sets the subregion that partition number is even number to
Spare partitions, if the spare partitions that partition number is i are b ' _ i；
By zonal networks, two nodes are respectively defined as start node and terminal node end to end, and start node sets oneself partition number
It is 1, while broadcasts a subregion packet, partition number is set as 1 in subregion packet；It is all in network to be successfully received subregion packet and do not set also
The node of partition number is set, if the signal-to-noise ratio of received signal is more than or equal to threshold alpha, the partition number of oneself is arranged node
For the partition number in subregion packet, while new subregion packet, partition number in new subregion packet are broadcasted by csma mode
Oneself partition number is set as plus 1, if the signal-to-noise ratio of received signal is less than threshold alpha, the subregion packet received is lost
It abandons, does not broadcast the message；
If partition number i_x has been arranged in node, when receiving the subregion packet that partition number is i_y again, compare the big of i_x and i_y
It is small, if i_x > i_y, the partition number of oneself is updated to i_y, and new subregion is broadcasted by csma mode
It wraps, partition number is set as i_ (y+1) in new subregion packet, if i_x≤i_y, received subregion packet is abandoned, is not broadcast the message；
Network partition time threshold t is set, starts timing after oneself partition number is arranged in node, if the subregion in time threshold t
It number does not update, then the node ceases listening for subregion packet, and when terminal node ceases listening for subregion packet, terminal node is by partition number
Add 1, as an independent subregion, partitioning algorithm terminates.
10. wireless-transmission network according to claim 8, it is characterised in that: the sleep scheduling strategy is by the time
Period is divided into the equal time slots of K, i.e., time slot 1, time slot 2 ..., time slot K；
For transmitting subregion b_i, if i≤K, the default wake-up time slot of subregion interior joint isIf 2 × K- of K < i <
3, then the default wake-up time slot of subregion interior joint beWith 1~(i mod K)；When i >=2 × K-3, whole cycle is all pre-
If being in wake-up states；
For spare partitions b ' _ i, if i≤K, the default wake-up time slot of subregion interior joint isIf K < i 2 × K-2 of <,
Then the default wake-up period of subregion interior joint isWith 1~(i mod K), when i >=2 × K-2, all default place of whole cycle
In wake-up states.
11. wireless-transmission network according to claim 8, it is characterised in that: specific data transmission procedure is: working as transmission
When subregion b_i fails to transfer data to next transmission subregion b_ (i+2), spare partitions b ' _ (i+1) for listening to data is negative
Duty transfers data to next transmission subregion b_ (i+2).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811572227.8A CN109618357B (en) | 2018-12-21 | 2018-12-21 | Wireless transmission method and network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811572227.8A CN109618357B (en) | 2018-12-21 | 2018-12-21 | Wireless transmission method and network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109618357A true CN109618357A (en) | 2019-04-12 |
| CN109618357B CN109618357B (en) | 2022-03-11 |
Family
ID=66009067
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811572227.8A Active CN109618357B (en) | 2018-12-21 | 2018-12-21 | Wireless transmission method and network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109618357B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111698655A (en) * | 2020-05-08 | 2020-09-22 | 东南大学 | Non-interference pipelined data collection method based on duty ratio scheduling |
| CN112954727A (en) * | 2021-03-09 | 2021-06-11 | 陕西高速电子工程有限公司 | Tunnel wireless sensor network communication method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060077918A1 (en) * | 2004-10-13 | 2006-04-13 | Shiwen Mao | Method and apparatus for control and routing of wireless sensor networks |
| CN103747451A (en) * | 2013-12-27 | 2014-04-23 | 北京农业信息技术研究中心 | Farmland gradient environment wireless sensor network detection region division method |
-
2018
- 2018-12-21 CN CN201811572227.8A patent/CN109618357B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060077918A1 (en) * | 2004-10-13 | 2006-04-13 | Shiwen Mao | Method and apparatus for control and routing of wireless sensor networks |
| CN103747451A (en) * | 2013-12-27 | 2014-04-23 | 北京农业信息技术研究中心 | Farmland gradient environment wireless sensor network detection region division method |
Non-Patent Citations (2)
| Title |
|---|
| 孙泽华等: "无线传感器网络中基于网络覆盖的节点睡眠调度机制", 《计算机应用研究》 * |
| 王建平等: "巷道链状无线传感器节点部署研究", 《合肥工业大学学报(自然科学版)》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111698655A (en) * | 2020-05-08 | 2020-09-22 | 东南大学 | Non-interference pipelined data collection method based on duty ratio scheduling |
| CN112954727A (en) * | 2021-03-09 | 2021-06-11 | 陕西高速电子工程有限公司 | Tunnel wireless sensor network communication method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109618357B (en) | 2022-03-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Rodoplu et al. | An energy-efficient MAC protocol for underwater wireless acoustic networks | |
| CN102740365B (en) | Single-stream bulk data acquisition method suitable for wireless sensor network | |
| US8767696B2 (en) | System and method for media access control for a duty cycle network | |
| US10070388B2 (en) | Coordinated duty cycle assignment in mesh networks | |
| Merlin et al. | Schedule adaptation of low-power-listening protocols for wireless sensor networks | |
| US9826493B2 (en) | Synchronized multi-sink routing for wireless networks | |
| Tong et al. | A pipelined-forwarding, routing-integrated and effectively-identifying MAC for large-scale WSN | |
| Tong et al. | P-MAC: A cross-layer duty cycle MAC protocol towards pipelining for wireless sensor networks | |
| CN107222903B (en) | Constructive interference-based data collection method in asynchronous low-duty-ratio WSN | |
| Zhao et al. | An energy-efficient self-adaptive duty cycle MAC protocol for traffic-dynamic wireless sensor networks | |
| CN113573272B (en) | Design method of RTS (request to send) competition access control protocol for multi-hop underwater acoustic wireless sensor | |
| Miller et al. | On-demand TDMA scheduling for energy conservation in sensor networks | |
| Zhao et al. | A transmission power control MAC protocol for wireless sensor networks | |
| Wang et al. | Opportunistic cooperation in low duty cycle wireless sensor networks | |
| CN109618357A (en) | A kind of radio transmitting method and network | |
| Singh et al. | A cross-layer MAC protocol for contention reduction and pipelined flow optimization in wireless sensor networks | |
| Khan et al. | PMAC: Energy efficient medium access control protocol for wireless sensor networks | |
| Awerbuch et al. | The pulse protocol: sensor network routing and power saving | |
| Jacob et al. | Reducing energy consumption by cross layer design in wireless sensor networks | |
| Ghrab et al. | ECAB: An Efficient Context-Aware multi-hop Broadcasting protocol for wireless sensor networks | |
| Nguyen et al. | AM-MAC: an energy efficient, Adaptive Multi-hop MAC protocol for sensor networks | |
| Balachandran et al. | Adaptive sleeping and awakening protocol (ASAP) for energy efficient adhoc sensor networks | |
| Singh et al. | A low delay cross-layer contention based synchronous MAC protocol for a multi-hop WSN | |
| KR100892321B1 (en) | Communication method in the sensor network using variable duty-cycle scheme | |
| Zhang et al. | Delay-constrained efficient broadcasting in duty-unaware asynchronous 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 |