CN103532877A - Scheduling method for guaranteeing real-time transmission of wireless sensor network information - Google Patents
Scheduling method for guaranteeing real-time transmission of wireless sensor network information Download PDFInfo
- Publication number
- CN103532877A CN103532877A CN201310521866.2A CN201310521866A CN103532877A CN 103532877 A CN103532877 A CN 103532877A CN 201310521866 A CN201310521866 A CN 201310521866A CN 103532877 A CN103532877 A CN 103532877A
- Authority
- CN
- China
- Prior art keywords
- queue
- packet
- priority
- scheduling
- state
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a scheduling method for guaranteeing real-time transmission of wireless sensor network information. The scheduling method comprises the following steps: 1) prioritizing data received by sensor nodes according to a wireless sensor network application environment and a monitoring object; 2) prioritizing buffer zone queues of wireless sensor nodes with routing functions according to the prioritization; 3) configuring corresponding parameters of an L-RQS (LCFS-based Real-time Queue Scheduling) algorithm and determining the initial values of the parameters; 4) building a wireless sensor network and initializing the network for enabling sensors to normally work; 5) when the sensor nodes receive data packets, performing a corresponding operation according to a state of a current queue and the priority of the data packets by a buffer zone management algorithm in L-RQS; 6) selecting a corresponding data packet for scheduling and setting a state of a high-priority queue according to the number of continuously transmitted high-priority data packets or waiting time by a queue scheduling algorithm in L-RQS; 7) when finishing the scheduling of the corresponding data packet at a time, selecting the state according to the number of the data packets in the queue by a scheduler. The scheduling method is used in the field of an application of the wireless sensor network with higher real-time requirement.
Description
Technical field
The present invention relates to wireless sensor network field, particularly about a kind of dispatching method that ensures wireless sensor network information real-time Transmission.
Background technology
Development along with wireless sensor network, a large amount of applications requires it that guarantee of service quality (QoS) is provided, as low delay, high reliability, yet the general small volume of wireless sensor node, by powered battery, computing capability are weak and memory source is limited therefore provides the guarantee of service quality to have very large challenge in wireless sensor network.A lot of new applications based on wireless sensor network are higher to the requirement of real-time of data at present, need to ensure that packet arrives data processing centre from monitoring in official hour, Bing You data processing centre makes corresponding reaction, and packet in network, to forward the consumed time be main time of delay, therefore reducing the delay of packet in network is the effective means that improves real-time.The delay of packet in network is mainly divided into propagation delay and processing delay, propagation delay is mainly determined by the physical characteristic of transmission medium, thereby it is more difficult to reduce propagation delay, by contrast, processing delay main routing node in network determines, the processing delay that therefore reduces node is to reduce packet to postpone feasible and effective mode.
Each (with routing function) sensor node has a buffering area queue that receives packet, the new packet arriving is waited for scheduling or is dropped in this queue, but the capacity of buffering area queue is limited, and the arrival of packet has certain bursting property, and because the application of wireless sensor network all has certain purpose, thereby different packets just may have importance in various degree, therefore for sensor node, receive which packet, cushion which packet, abandon which packet, and (forwarding) scheduling of how carrying out packet is an important task.Because the queue scheduling mode of First Come First Served (FCFS) has advantages of simply, fair relatively, it is therefore the main queue scheduling mode of most wireless sensor network application.
Development along with research, a lot of scholars find that the queue scheduling mode of First Come First Served can not meet the demand of application, therefore the queue scheduling mode of other type has been proposed, for example: the queue scheduling mode based on priority, queue scheduling mode based on redundant information, and the dynamic priority scheduling mode of taking into account priority and fairness, but these queue scheduling modes are still taked the mode of First Come First Served (FCFS) in the inside of each priority, in monitoring, in the application of most of wireless sensor networks such as tracking, the present case of new data total energy representative monitoring (or tracking) object producing, yet the packet of up-to-date generation is for the packet producing before, when choosing identical route, the always queue of more late arrival forward node, if take the queue scheduling mode of First Come First Served, the new data that produce have always been delayed to a certain extent.In addition, while having a large amount of packets to arrive sensor node within the short period, the queue of sensor node occurs congested possibly, at this moment the selection scheduling of packet and selection are abandoned and just become particularly important, moment sensor node is mostly taked tail drop mode, that is to say and probably abandoned the most current information, but retained " history " information.If therefore can thoroughly change First Come First Served queue scheduling mode and the tail drop mode that sensor node is taked, can effectively improve the real-time of packet.
Summary of the invention
For the problems referred to above, the object of this invention is to provide a kind of dispatching method that ensures wireless sensor network information real-time Transmission, real-time and Differentiated Services that can effective guarantee packet.
For achieving the above object, the present invention takes following technical scheme: a kind of dispatching method that ensures wireless sensor network information real-time Transmission, it comprises the following steps: 1) according to wireless sensor network applied environment and monitoring target feature, the data of sensor node reception are carried out to priority division, the data that are about to receive are divided into high-priority data and normal priority data; 2), according to the priority of described step 1) dividing data bag, the buffering area queue of the wireless sensor node with routing function is divided into high-priority queue Q
1with normal priority queue Q
2; 3) relevant parameter of configuration L-RQS algorithm the initial value of definite each relevant parameter; 4) set up as required wireless sensor network, and carry out the initialization operation of network, each transducer is all worked; 5), when the sensor node with routing function receives after packet, the buffer management algorithm in L-RQS carries out corresponding caching and abandons operation according to the priority of the state of current queue and packet; 6) queue scheduling algorithm in L-RQS selects corresponding packet to dispatch according to the residing state of high-priority queue and LCFS principle, and the state of high-priority queue was set according to the number of the high priority packets of Consecutive forwarding or stand-by period; 7) after completing the scheduling of a packet, scheduler is selected to continue carry out described step 6) or enter sleep state according to the number of packet in queue, when scheduler completes after the scheduling of a packet, if now there is new packet to arrive, or in queue, have the not packet of scheduling, scheduler continues according to step 6) operation dispatching; If have packet wait to dispatch scheduler in queue, do not enter sleep state.
The relevant parameter that configures L-RQS algorithm in described step 3) comprises for determining the minimal data bag threshold value Th of the packet that abandons which queue
i ls, i=Q
1or Q
2, carry out after packet discard operation Th
i lsthe renewal step-length λ upgrading
i ls, i=Q
1or Q
2, maximum continuously scheduling Q
1the scheduling threshold value of packet number in queue
, Q
1queue the k time is in the stand-by period of wait state T
k w, k=1,2 ..., the k time stand-by period increase step-length λ after full
k w.
The detailed process that buffer management algorithm in described step 5) in L-RQS carries out corresponding caching and abandons operation according to the priority of the state of current queue and packet is: when the sensor node with routing function receives after packet, first judge whether the queue of current buffering area is congested and judge Q
1and Q
2length sum whether equal the length of Q, if the buffering area queue of current sensor node, less than, i.e. available free space, and receives a normal priority packet and this packet is inserted into the tail of the queue of normal priority queue; If between the queue empty of buffering area less than, and the packet that the packet that present node receives is high priority, judge the state of high-priority queue, if high-priority queue is in dispatch state, this packet is inserted into high-priority queue to tail, if high-priority queue, in wait state, abandons this packet; If the buffering area queue of current sensor node is full, there is no free space, judge the priority of the current packet receiving, if high priority packets judges whether to insert this packet and deletes packet from a team position of which queue according to default principle one, and newly arrived packet is inserted into the tail of the queue of high-priority queue; If the packet receiving current is normal priority packet, thereby delete packet according to following default principle two judgements from a team position of which queue, newly arrived packet is inserted into the tail of the queue of respective queue.
The course of work of described default principle one is: first judge the state of high-priority queue, if high-priority queue, in wait state, abandons this packet, if high-priority queue, in dispatch state, judges queue Q
2length and queue Q
2minimal data bag threshold value
difference whether be less than 0, if be less than 0, represent queue Q
2in packet number seldom, be not suitable for abandoning Q
2in packet, now abandon Q
1the packet of a queue team position, if Q
2length and minimal data bag threshold value
difference be greater than 0, represent Q
2queue meets the condition of packet discard, now abandons Q
2the packet of a queue team position, shown in the concrete following formula of formula:
The course of work of described default principle two is: first judge queue Q
1length and queue Q
1minimal data bag threshold value
difference whether be less than 0, if be less than 0, represent to be not suitable for abandoning Q
1in packet, now abandon Q
2the packet of a queue team position; If Q
1length and minimal data bag threshold value
difference be greater than 0, represent to abandon Q
1packet in queue, so judgement Q
2length and minimal data bag threshold value
difference and Q
1length and minimal data bag threshold value
difference between ratio, the number that judges packet in which queue more, more than the minimum threshold value of this queue, if ratio is more than or equal to 1, represents to be more suitable for abandoning Q
2packet in queue, now abandons Q
2the packet of a queue squadron position; If ratio is less than 1, represent Q
1queue is more suitable for packet discard, now abandons Q
1the packet of a queue team position, shown in the concrete following formula of formula:
The specific works process of described step 6) is: while having packet in high-priority queue, scheduler priority scheduling high priority packets, if there is no packet in high-priority queue, but there is high priority packets to arrive in the process of scheduling normal priority packet, scheduler is abandoned the scheduling of normal priority packet immediately, then carry out the scheduling of high priority packets, the high priority packets of continuous scheduling is added up simultaneously, if the high priority packets number of scheduling meets scheduling threshold value continuously, high-priority queue transfers wait state to from dispatch state, and the packet of not dispatching in high-priority queue is all abandoned, when high-priority queue does not carry out the scheduling of any high priority packets during in wait state, scheduler is only dispatched the normal priority packet in common queue, if there is high priority packets to arrive during this period of time, unconditionally abandon, high-priority queue enters wait state each time, need to be detained T in wait state
k w, k=1,2 ..., the long time, wherein k represents and enters wait state the k time, meet the stand-by period after high-priority queue from wait state, go back to dispatch state, the stand-by period next time of renewal simultaneously.
The present invention is owing to taking above technical scheme, it has the following advantages: 1, the present invention carries out priority division according to wireless sensor network applied environment and monitoring target feature to the data of sensor node reception, and according to the priority of dividing data bag, the buffering area queue of the wireless sensor node with routing function is carried out to the division of priority, owing to having adopted priority query, therefore can provide Differentiated Services to the packet of different brackets.2, between the buffering area queue empty of the present invention due to high-priority queue and normal priority queue sharing sensor node, and do not carry out the division of length, therefore can share node queue space, improve the utilance in node queue space.3, the present invention is owing to taking the dynamic drop mechanism of packet on buffer management, therefore ensureing that high priority packets preferentially enters the guarantee that fairness is provided on the basis of buffering area queue.4, the present invention is owing to adopting the mode of Head-dropping in each inner queue, in the situation that queue is congested, can abandon part historical data bag, therefore retain the most current packet, can ensure that the most current information do not lose, effectively improved the real-time of transfer of data.5, the present invention has taked the rear first principle of service (LCFS) that arrives in queue scheduling mode, therefore can effectively ensure the priority scheduling of the most current packet, and then improve the real-time of service.6, the present invention is because the number of the packet that high-priority queue is dispatched continuously limits, therefore can prevent that high priority packets from continuing to arrive, thereby the situation that causes general data bag to dispatch, fairness was so both provided, can prevent that again sensor node is by malicious attack, thereby continue to send the scheduling that high priority packets is disturbed normal data packet.7, the present invention is due to when high-priority queue is converted to wait state by dispatch state, in high-priority queue, also the packet of scheduling will not be dropped, abandon the high priority packets that can not guarantee real-time, to prepare for other packets enter queue, effective utilization that therefore can supporting team's column space.8, the present invention's scheduler owing to there is no packet in queue when enters sleep state, therefore can reduce energy consumption, extends the useful life of transducer.The present invention can be widely used in the wireless sensor network application higher to requirement of real-time.
Accompanying drawing explanation
Fig. 1 is the overall procedure schematic diagram of L-RQS method of the present invention;
Fig. 2 is node queue's model schematic diagram in the present invention;
Fig. 3 is the schematic flow sheet of L-RQS buffer management algorithm of the present invention;
Fig. 4 is that the present invention receives the schematic diagram of packet when queue is not congested;
Fig. 5 is that the present invention receives and the schematic diagram of packet discard when queue is congested;
Fig. 6 is L-RQS array dispatching method schematic flow sheet of the present invention.
Embodiment
Below in conjunction with accompanying drawing and example, the present invention is described in detail.
As shown in Figure 1, the dispatching method of guarantee wireless sensor network information real-time Transmission of the present invention, comprises the following steps:
1, according to wireless sensor network applied environment and monitoring (or tracking) features of the object to sensor node receive (or collection) to data carry out priority division, the data that are about to receive are divided into high-priority data and normal priority data.
High-priority data and common prioritized data are mainly the emergency for data, because wireless sensor network is used for monitoring and tracking field, if the characteristic that monitoring or tracing object show meets the condition of emergency data, at this moment the data that sensor node captures are exactly emergency data, high-priority data namely, the data that do not meet on the contrary emergency data condition are normal priority data.For example, when utilizing wireless senser to monitor risk of forest fire, suppose to be about to (or) breaking out of fire while spending when ambient temperature value is more than or equal to 90, so the ambient temperature data of temperature sensor collection is carried out to priority division according to preset value, the ambient temperature data that is more than or equal to 90 degree that is about to collect is divided into high-priority data, and the ambient temperature data that the temperature value collecting is less than to 90 degree is divided into normal priority data.
2,, according to the priority of step 1 dividing data bag, the buffering area queue Q of the wireless sensor node with routing function is divided into high-priority queue Q
1with normal priority queue Q
2, wherein, high-priority queue Q
1in packet be high priority packets, normal priority queue Q
2in packet be normal priority packet, Q
1and Q
2in packet can be both that present node produces, can be also but that other node produces the packet being forwarded by present node.
As shown in Figure 2, in system queue, different letters represent the data in different queue, e represents high-priority data, c represents normal priority data, system queue equals high-priority queue and adds normal priority queue and add free area again, in order effectively to improve the utilance between the queue empty of buffering area, this two Class Queue is shared between the queue empty of node buffering area physically, do not carry out the division of the reserved and length in space, Ji Zheliangge priority query can " arbitrarily " be used system queue space, as long as system queue has living space, newly arrived packet just can enter into queue, no matter be high priority packets or normal priority packet, can effectively improve the utilance of system queue like this.The present invention does not divide each priority query physically, but distinguish priority query based on following thought: the packet of equal priority is stored in some position, these positions just form the queue of this priority after being connected so, if other priority data bag is stored in this position later, it is exactly a part for another priority query so
Be that each priority query is dynamic, but not static division.
3, configuration L-RQS(LCFS-Based Real-time Queue Scheduling is based on the rear real-time queue scheduling mechanism to first serving) relevant parameter of algorithm the initial value of definite each relevant parameter, the relevant parameter that L-RQS algorithm need to configure comprises for determining " the minimal data bag threshold value Th of the packet that abandons which queue
i ls(i=Q
1or Q
2) ", carry out after packet discard operation Th
i lsthat upgrades " upgrades step-length λ
i ls(i=Q
1or Q
2) ", maximum continuously scheduling Q
1" the scheduling threshold value of packet number in queue
", Q
1queue the k time " the stand-by period T in wait state
k w(k=1,2 ...) ", the k time stand-by period " increase step-length λ after full
k w".
Wherein, Th
i ls(i=Q
1or Q
2) represent minimal data bag threshold value in queue i, Th
i lseffect be that the management algorithm of L-RQS buffering area is according to the length of current queue and Th when buffering area queue is congested
i lsvalue determine to abandon the packet of which queue Head-of-line, thereby insert newly arrived packet, that is: the packet number in queue i is more than Th
i lstime, the packet in queue i can be dropped, otherwise packet in queue i cannot be dropped.
λ
i ls(i=Q
1or Q
2) expression Th
i lsrenewal step-length, the data in queue i are dropped, corresponding Th
i lsincrease λ
i, λ
i lseffect be when from queue Q
jthe team of (j=1 or 2) deletes after a packet, by Th a position
i lsincrease a step-length λ
i lsimprove queue i minimal data bag threshold value, to reduce the probability of deleting packet in this queue next time.
T
k w(k=1,2 ...) expression Q
1the queue the k time time in wait state, each Q
1after being stopped scheduling, from dispatch state, be converted to wait state, the time that wait state maintains is T
k w, i.e. Q
1the queue the k time stand-by period when wait state, work as Q
1time in wait state meets T
k wtime, Q
1from wait state, proceed to dispatch state, if after this there is the packet of high priority to arrive, can priority scheduling.
λ
k wrepresent the increase step-length after the k time stand-by period completely, Q
1when queue returns to dispatch state from wait state at every turn, need to arrange stand-by period T next time
k+1 w, the rule of setting is T
k+1 w=T
k w+ λ
k w.
4, set up as required wireless sensor network, and carry out the initialization operation of network, each transducer is all worked.
The networking mode of wireless sensor network is varied, can static networking also can dynamic group net, the initialization operation of network is also because the difference of application networking mode is different, but the object of this single stepping is each transducer can work, the sensor node that does not possess routing function can correctly pass to the sensor node with routing function by packet, with the sensor node of routing function, can normally receive packet and carry out the forwarding of packet.
5,, when the sensor node with routing function receives after packet, the buffer management algorithm in L-RQS carries out corresponding caching and abandons operation according to the priority of the state of current queue and packet.
The operation principle of the buffer management algorithm in L-RQS is the current minimal data bag threshold value Th of length, each queue according to queue
i ls(i=Q
1or Q
2), the priority of packet that receives is, the information such as state of high-priority queue, the process that packet is entered to buffering area queue manages, when buffering area queue is congested, L-RQS both can guarantee that the new packet arriving entered queue, again the queue of different priorities is provided to distinguish to abandon service, and taken into account fairness.
As shown in Figure 3, when the sensor node with routing function receives after packet, first judge that current buffering area queue whether congested (whether full between the queue empty of buffering area) judges Q
1and Q
2length sum whether equal the length of Q, if the buffering area queue of current sensor node is less than (as shown in Figure 4), be available free space, and what receive is a normal priority packet, this packet is inserted into the tail of the queue of normal priority queue; If between the queue empty of buffering area less than, and the packet that present node receives is high priority packets, judge the state of high-priority queue, if high-priority queue is in dispatch state, this packet is inserted into the tail of the queue of high-priority queue, if high-priority queue, in wait state, abandons this packet; If the buffering area queue of current sensor node is full, there is no free space, judge the priority of the current packet receiving, if high priority packets judges whether to insert this packet and deletes packet from a team position of which queue according to default principle one, and newly arrived packet is inserted into the tail of the queue of high-priority queue; If the packet receiving current is normal priority packet, thereby delete packet according to following default principle two judgements from a team position of which queue, newly arrived packet is inserted into the tail of the queue of respective queue.Wherein, the course of work of default principle one and default principle two is respectively:
Default principle one: first judge the state of high-priority queue, if high-priority queue, in wait state, abandons this packet, if high-priority queue, in dispatch state, judges queue Q
2length and queue Q
2minimal data bag threshold value
difference whether be less than 0, if be less than 0, represent queue Q
2in packet number seldom, be not suitable for abandoning Q
2in packet, now abandon Q
1the packet of a queue team position, if Q
2length and minimal data bag threshold value
difference be greater than 0, represent Q
2queue meets the condition of packet discard, now abandons Q
2the packet of a queue team position, shown in the concrete following formula of formula (1):
In formula, L (x) represents the statistics to queue x length, calculates the number of packet in queue x.
Default principle two: first judge queue Q
1length and queue Q
1minimal data bag threshold value
difference whether be less than 0, if be less than 0, represent to be not suitable for abandoning Q
1in packet, now abandon Q
2the packet of a queue team position; If Q
1length and minimal data bag threshold value
difference be greater than 0, represent to abandon Q
1packet in queue, so judgement Q
2length and minimal data bag threshold value
difference and Q
1length and minimal data bag threshold value
difference between ratio, the number that judges packet in which queue more, more than the minimum threshold value of this queue, if ratio is more than or equal to 1, represents to be more suitable for abandoning Q
2packet in queue, now abandons Q
2the packet of a queue squadron position; If ratio is less than 1, represent Q
1queue is more suitable for packet discard, now abandons Q
1the packet of a queue team position, shown in the concrete following formula of formula (2):
As shown in Figure 5, for the packet of a normal priority has been expired and has been received in the queue of present node buffering area, suppose that according to the result of formula (2) judgement be the position deletion packet of the team from normal priority queue, and newly arrived packet is inserted into the tail of the queue position of normal priority queue.
6, the queue scheduling algorithm in L-RQS is according to the residing state of high-priority queue with rear select corresponding packet to dispatch to first serving (LCFS) principle; And the state of high-priority queue is set according to the number of the high priority packets of Consecutive forwarding or stand-by period.
The residing state of high-priority queue of the present invention comprises dispatch state and wait state, and wherein dispatch state represents that queue has and receives and the qualification of data dispatching bag, if queue in this state, newly arrived packet can be inserted into queue and be scheduled; Wait state represents that the qualification that queue receives packet and obtains scheduling power is deprived of, if queue in this state, newly arrived packet is always dropped.The operation principle of the queue scheduling algorithm in L-RQS is to the principle of first serving after the scheduling mode of each queue is all taked, it is the packet that priority scheduling finally enters queue, and high-priority queue has the right of priority scheduling, even if normal priority queue is dispatched, when having high priority packets to enter queue, scheduler also can be abandoned the scheduling of normal priority queue at once, carry out the scheduling of high-priority queue, each high priority packets of scheduling is continuously added up simultaneously, when reaching some, will temporarily deprive the right that high-priority queue receives packet and is scheduled, and the packet of also not dispatching in high-priority queue is all abandoned, after this scheduler only to normal priority queue dispatch, after waiting for a period of time, recover the right that high-priority queue receives packet and is scheduled, can on the basis that different queue is provided to different priorities service, take into account fairness like this.
High-priority queue and normal priority queue zero hour, the queue in dispatch state both can receive packet, also can carry out the scheduling of packet all in dispatch state.While having packet in high-priority queue, scheduler priority scheduling high priority packets, if there is no packet in high-priority queue, but there is high priority packets to arrive in the process of scheduling normal priority packet, scheduler is abandoned the scheduling of normal priority packet immediately, then carry out the scheduling of high priority packets, the high priority packets of continuous scheduling is added up simultaneously, if the high priority packets number of scheduling meets scheduling threshold value continuously, high-priority queue transfers wait state to from dispatch state, and also abandon in high-priority queue the not packet of scheduling, when high-priority queue does not carry out the scheduling of any high priority packets during in wait state, scheduler is only dispatched the normal priority packet in common queue, if there is high priority packets to arrive during this period of time, unconditionally abandon, high-priority queue enters wait state each time, need to be detained T in wait state
k w(k=1,2 ...) and the long time, wherein k represents and enters wait state the k time, meet the stand-by period after high-priority queue from wait state, go back to dispatch state, the stand-by period next time of renewal simultaneously.
As shown in Figure 6, queue Q in L-RQS queue scheduling algorithm
2always in dispatch state, Q
1also in dispatch state, only have the packet number when scheduling continuously to surpass threshold value under normal circumstances
after, Q
1enter wait state, Q after meeting the stand-by period
1return to dispatch state.Based on Q
1, Q
2in queue, the character of data, works as Q
1in have packet to arrive and Q
1queue is when dispatch state, even Q
2packet in queue is scheduled, Q
1also seize scheduling power, i.e. Q at once
1in packet can be with the mode priority scheduling of seizing, for preventing Q
1thereby in continue to have new data packets to arrive to cause Q
2in long data packet time situation about cannot dispatch, to each Q
1number with the packet of continuous dispatching after preempt-mode acquisition scheduling power is added up, and when surpassing, dispatches threshold value
time, stop Q
1the scheduling of queue, and abandon the packet of not dispatching in Q1 queue, carry out Q
2the scheduling of packet in queue, to first service, always selects the most newly arrived packet to dispatch after the mode of scheduling remains.Q
1queue enters wait state after being stopped scheduling, and the stand-by period is T
k w, the high priority packets receiving at stand-by period inner sensor node will be dropped, and not enter queue, after the stand-by period is full, and Q
1queue returns to dispatch state, simultaneously by T
k wupgrade, increase certain step-length λ
k w, return to after dispatch state Q
1if the mode that queue has new packet to arrive can seize again preferentially obtains scheduling power.
7, after completing the scheduling of a packet, scheduler is selected to continue execution step 6 or enters sleep state according to the number of packet in queue, that is: when scheduler completes after the scheduling of a packet, if now there is new packet to arrive, or in queue, have the not packet of scheduling, scheduler continues according to step 6 operation dispatching; If have packet wait to dispatch scheduler in queue, do not enter sleep state, can reduce to a certain extent energy consumption like this, extend the useful life of sensor node.
The various embodiments described above are only for illustrating the present invention, and wherein each implementation step of method etc. all can change to some extent, and every equivalents of carrying out on the basis of technical solution of the present invention and improvement, all should not get rid of outside protection scope of the present invention.
Claims (7)
1. a dispatching method that ensures wireless sensor network information real-time Transmission, it comprises the following steps:
1) according to wireless sensor network applied environment and monitoring target feature, the data of sensor node reception are carried out to priority division, the data that are about to receive are divided into high-priority data and normal priority data;
2), according to the priority of described step 1) dividing data bag, the buffering area queue of the wireless sensor node with routing function is divided into high-priority queue Q
1with normal priority queue Q
2;
3) relevant parameter of configuration L-RQS algorithm the initial value of definite each relevant parameter;
4) set up as required wireless sensor network, and carry out the initialization operation of network, each transducer is all worked;
5), when the sensor node with routing function receives after packet, the buffer management algorithm in L-RQS carries out corresponding caching and abandons operation according to the priority of the state of current queue and packet;
6) queue scheduling algorithm in L-RQS selects corresponding packet to dispatch according to the residing state of high-priority queue and LCFS principle, and the state of high-priority queue was set according to the number of the high priority packets of Consecutive forwarding or stand-by period;
7) after completing the scheduling of a packet, scheduler is selected to continue carry out described step 6) or enter sleep state according to the number of packet in queue, when scheduler completes after the scheduling of a packet, if now there is new packet to arrive, or in queue, have the not packet of scheduling, scheduler continues according to step 6) operation dispatching; If have packet wait to dispatch scheduler in queue, do not enter sleep state.
2. a kind of dispatching method that ensures wireless sensor network information real-time Transmission as claimed in claim 1, is characterized in that: the relevant parameter that configures L-RQS algorithm in described step 3) comprises for determining the minimal data bag threshold value Th of the packet that abandons which queue
i ls, i=Q
1or Q
2, carry out after packet discard operation Th
i lsthe renewal step-length λ upgrading
i ls, i=Q
1or Q
2, maximum continuously scheduling Q
1the scheduling threshold value of packet number in queue
, Q
1queue the k time is in the stand-by period of wait state T
k w, k=1,2 ..., the k time stand-by period increase step-length λ after full
k w.
3. a kind of dispatching method that ensures wireless sensor network information real-time Transmission as claimed in claim 1 or 2, it is characterized in that: the detailed process that the buffer management algorithm in described step 5) in L-RQS carries out corresponding caching and abandons operation according to the priority of the state of current queue and packet is: when the sensor node with routing function receives after packet, first judge whether the queue of current buffering area is congested and judge Q
1and Q
2length sum whether equal the length of Q, if the buffering area queue of current sensor node, less than, i.e. available free space, and receives a normal priority packet and this packet is inserted into the tail of the queue of normal priority queue; If between the queue empty of buffering area less than, and the packet that the packet that present node receives is high priority, judge the state of high-priority queue, if high-priority queue is in dispatch state, this packet is inserted into high-priority queue to tail, if high-priority queue, in wait state, abandons this packet; If the buffering area queue of current sensor node is full, there is no free space, judge the priority of the current packet receiving, if high priority packets judges whether to insert this packet and deletes packet from a team position of which queue according to default principle one, and newly arrived packet is inserted into the tail of the queue of high-priority queue; If the packet receiving current is normal priority packet, thereby delete packet according to following default principle two judgements from a team position of which queue, newly arrived packet is inserted into the tail of the queue of respective queue.
4. a kind of dispatching method that ensures wireless sensor network information real-time Transmission as claimed in claim 3, it is characterized in that: the course of work of described default principle one is: the state that first judges high-priority queue, if high-priority queue is in wait state, abandon this packet, if high-priority queue, in dispatch state, judges queue Q
2length and queue Q
2minimal data bag threshold value
difference whether be less than 0, if be less than 0, represent queue Q
2in packet number seldom, be not suitable for abandoning Q
2in packet, now abandon Q
1the packet of a queue team position, if Q
2length and minimal data bag threshold value
difference be greater than 0, represent Q
2queue meets the condition of packet discard, now abandons Q
2the packet of a queue team position, shown in the concrete following formula of formula:
5. a kind of dispatching method that ensures wireless sensor network information real-time Transmission as claimed in claim 3, is characterized in that: the course of work of described default principle two is: first judge queue Q
1length and queue Q
1minimal data bag threshold value
difference whether be less than 0, if be less than 0, represent to be not suitable for abandoning Q
1in packet, now abandon Q
2the packet of a queue team position; If Q
1length and minimal data bag threshold value
difference be greater than 0, represent to abandon Q
1packet in queue, so judgement Q
2length and minimal data bag threshold value
difference and Q
1length and minimal data bag threshold value
difference between ratio, the number that judges packet in which queue more, more than the minimum threshold value of this queue, if ratio is more than or equal to 1, represents to be more suitable for abandoning Q
2packet in queue, now abandons Q
2the packet of a queue squadron position; If ratio is less than 1, represent Q
1queue is more suitable for packet discard, now abandons Q
1the packet of a queue team position, shown in the concrete following formula of formula:
6. a kind of dispatching method that ensures wireless sensor network information real-time Transmission as described in claim 1 or 2 or 4 or 5, it is characterized in that: the specific works process of described step 6) is: while having packet in high-priority queue, scheduler priority scheduling high priority packets, if there is no packet in high-priority queue, but there is high priority packets to arrive in the process of scheduling normal priority packet, scheduler is abandoned the scheduling of normal priority packet immediately, then carry out the scheduling of high priority packets, the high priority packets of continuous scheduling is added up simultaneously, if the high priority packets number of scheduling meets scheduling threshold value continuously, high-priority queue transfers wait state to from dispatch state, and the packet of not dispatching in high-priority queue is all abandoned, when high-priority queue does not carry out the scheduling of any high priority packets during in wait state, scheduler is only dispatched the normal priority packet in common queue, if there is high priority packets to arrive during this period of time, unconditionally abandon, high-priority queue enters wait state each time, need to be detained T in wait state
k w, k=1,2 ..., the long time, wherein k represents and enters wait state the k time, meet the stand-by period after high-priority queue from wait state, go back to dispatch state, the stand-by period next time of renewal simultaneously.
7. a kind of dispatching method that ensures wireless sensor network information real-time Transmission as claimed in claim 3, it is characterized in that: the specific works process of described step 6) is: while having packet in high-priority queue, scheduler priority scheduling high priority packets, if there is no packet in high-priority queue, but there is high priority packets to arrive in the process of scheduling normal priority packet, scheduler is abandoned the scheduling of normal priority packet immediately, then carry out the scheduling of high priority packets, the high priority packets of continuous scheduling is added up simultaneously, if the high priority packets number of scheduling meets scheduling threshold value continuously, high-priority queue transfers wait state to from dispatch state, and the packet of not dispatching in high-priority queue is all abandoned, when high-priority queue does not carry out the scheduling of any high priority packets during in wait state, scheduler is only dispatched the normal priority packet in common queue, if there is high priority packets to arrive during this period of time, unconditionally abandon, high-priority queue enters wait state each time, need to be detained T in wait state
k w, k=1,2 ..., the long time, wherein k represents and enters wait state the k time, meet the stand-by period after high-priority queue from wait state, go back to dispatch state, the stand-by period next time of renewal simultaneously.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310521866.2A CN103532877B (en) | 2013-10-29 | 2013-10-29 | A kind of dispatching method ensureing wireless sensor network information real-time Transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310521866.2A CN103532877B (en) | 2013-10-29 | 2013-10-29 | A kind of dispatching method ensureing wireless sensor network information real-time Transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103532877A true CN103532877A (en) | 2014-01-22 |
| CN103532877B CN103532877B (en) | 2016-06-29 |
Family
ID=49934563
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310521866.2A Active CN103532877B (en) | 2013-10-29 | 2013-10-29 | A kind of dispatching method ensureing wireless sensor network information real-time Transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103532877B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105049357A (en) * | 2015-06-18 | 2015-11-11 | 华北科技学院 | Internet-of-things real-time monitoring remote transmission validity optimization method based on Big Dipper message |
| CN107222475A (en) * | 2017-05-26 | 2017-09-29 | 马鸣 | A kind of Data Transport Protocol method for wireless sensor network intelligent building conservation system |
| CN108037983A (en) * | 2017-11-22 | 2018-05-15 | 链家网（北京）科技有限公司 | Method for scheduling task and distributed scheduling system in distributed scheduling system |
| CN110753401A (en) * | 2018-07-23 | 2020-02-04 | 成都鼎桥通信技术有限公司 | Data packet scheduling method and device |
| CN111459690A (en) * | 2020-04-10 | 2020-07-28 | Oppo广东移动通信有限公司 | Data transmitting and receiving control method and device, mobile terminal and storage medium |
| CN111866910A (en) * | 2019-09-18 | 2020-10-30 | 上海葡萄纬度科技有限公司 | Networking method and system of spliced building blocks and spliced building blocks suitable for wireless networking |
| CN112637962A (en) * | 2021-01-25 | 2021-04-09 | 南开大学 | Bluetooth gateway optimization method applied to feeding environment monitoring |
| CN113647069A (en) * | 2019-04-05 | 2021-11-12 | 思科技术公司 | Telemetry for cloud switch queuing offsets |
| CN113965528A (en) * | 2021-10-21 | 2022-01-21 | 傲普(上海)新能源有限公司 | Data classification dynamic sorting transmission control method based on queue |
| CN114666292A (en) * | 2022-04-01 | 2022-06-24 | 广州大学 | Instant messaging technology method, system and medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030086431A1 (en) * | 2001-11-07 | 2003-05-08 | Via Technologies, Inc. | Method and device for coordinating packet transmission order |
| CN101360028A (en) * | 2008-07-24 | 2009-02-04 | 华中科技大学 | Real-time scheduling method suitable for industrial sensor network |
| CN101452519A (en) * | 2008-12-10 | 2009-06-10 | 华中科技大学 | Data scheduling method for identifying middleware by radio frequency |
| CN101459932A (en) * | 2009-01-06 | 2009-06-17 | 北京交通大学 | Wireless Mesh network MAC layer bandwidth request and allocation method based on IEEE802.16d standard |
| CN102665295A (en) * | 2012-05-07 | 2012-09-12 | 浙江大学 | Agricultural environment monitoring and early-warning system and method by using distributed heterogeneous wireless sensor network facility |
-
2013
- 2013-10-29 CN CN201310521866.2A patent/CN103532877B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030086431A1 (en) * | 2001-11-07 | 2003-05-08 | Via Technologies, Inc. | Method and device for coordinating packet transmission order |
| CN101360028A (en) * | 2008-07-24 | 2009-02-04 | 华中科技大学 | Real-time scheduling method suitable for industrial sensor network |
| CN101452519A (en) * | 2008-12-10 | 2009-06-10 | 华中科技大学 | Data scheduling method for identifying middleware by radio frequency |
| CN101459932A (en) * | 2009-01-06 | 2009-06-17 | 北京交通大学 | Wireless Mesh network MAC layer bandwidth request and allocation method based on IEEE802.16d standard |
| CN102665295A (en) * | 2012-05-07 | 2012-09-12 | 浙江大学 | Agricultural environment monitoring and early-warning system and method by using distributed heterogeneous wireless sensor network facility |
Non-Patent Citations (1)
| Title |
|---|
| 王新琭 等: "一种基于无线传感器网络的目标跟踪调度算法", 《计算机应用研究》 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105049357B (en) * | 2015-06-18 | 2018-04-24 | 华北科技学院 | Internet of Things real-time monitoring remote transmission availability optimization method based on Big Dipper message |
| CN105049357A (en) * | 2015-06-18 | 2015-11-11 | 华北科技学院 | Internet-of-things real-time monitoring remote transmission validity optimization method based on Big Dipper message |
| CN107222475A (en) * | 2017-05-26 | 2017-09-29 | 马鸣 | A kind of Data Transport Protocol method for wireless sensor network intelligent building conservation system |
| CN108037983A (en) * | 2017-11-22 | 2018-05-15 | 链家网（北京）科技有限公司 | Method for scheduling task and distributed scheduling system in distributed scheduling system |
| CN110753401A (en) * | 2018-07-23 | 2020-02-04 | 成都鼎桥通信技术有限公司 | Data packet scheduling method and device |
| CN110753401B (en) * | 2018-07-23 | 2023-05-26 | 成都鼎桥通信技术有限公司 | Data packet scheduling method and device |
| CN113647069A (en) * | 2019-04-05 | 2021-11-12 | 思科技术公司 | Telemetry for cloud switch queuing offsets |
| CN111866910A (en) * | 2019-09-18 | 2020-10-30 | 上海葡萄纬度科技有限公司 | Networking method and system of spliced building blocks and spliced building blocks suitable for wireless networking |
| CN111459690A (en) * | 2020-04-10 | 2020-07-28 | Oppo广东移动通信有限公司 | Data transmitting and receiving control method and device, mobile terminal and storage medium |
| CN111459690B (en) * | 2020-04-10 | 2023-09-08 | Oppo广东移动通信有限公司 | Data receiving and transmitting control method and device, mobile terminal and storage medium |
| CN112637962A (en) * | 2021-01-25 | 2021-04-09 | 南开大学 | Bluetooth gateway optimization method applied to feeding environment monitoring |
| CN113965528A (en) * | 2021-10-21 | 2022-01-21 | 傲普(上海)新能源有限公司 | Data classification dynamic sorting transmission control method based on queue |
| CN114666292A (en) * | 2022-04-01 | 2022-06-24 | 广州大学 | Instant messaging technology method, system and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103532877B (en) | 2016-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103532877A (en) | Scheduling method for guaranteeing real-time transmission of wireless sensor network information | |
| Kaul et al. | Status updates through queues | |
| Nasser et al. | Dynamic multilevel priority packet scheduling scheme for wireless sensor network | |
| Kaul et al. | Real-time status: How often should one update? | |
| Pásztor et al. | Opportunistic mobile sensor data collection with scar | |
| Akkaya et al. | Efficient aggregation of delay-constrained data in wireless sensor networks. | |
| CN113821516B (en) | Time sensitive network switching system based on virtual queue | |
| Sarkar et al. | Optimal routing and scheduling in multihop wireless renewable energy networks | |
| Ullah et al. | Statistical multipath queue-wise preemption routing for zigbee-based WSN | |
| Natarajan et al. | A cross-layer design: energy efficient multilevel dynamic feedback scheduling in wireless sensor networks using deadline aware active time quantum for environmental monitoring | |
| Santos et al. | A real-time analysis approach in opportunistic networks | |
| Uthra et al. | A probabilistic approach for predictive congestion control in wireless sensor networks | |
| CN106454937B (en) | Distribution control method for mobile terminal cache space | |
| Hao et al. | Utility-based scheduling algorithm for wireless multi-media sensor networks | |
| Aoun et al. | Queueing model and optimization of packet dropping in real-time wireless sensor networks | |
| Mishra et al. | Design of Per-Flow Fairness Protocol with Dynamic Priority for Ad Hoc Networks | |
| KR20090059291A (en) | Method and system controlling pwoer of sense network according to event | |
| Mishra et al. | Integrated FRTCP: Fair and Reliable Transmission Control Protocol for Ad Hoc Networks | |
| Banerjee et al. | Delay-efficient energy and velocity conscious non-preemptive scheduler (DEV-NS) for mobile ad hoc networks | |
| Ghosh et al. | Min (N, T) Policy M/G/1 Queue based Reduction of Power Consumption in Wireless Sensor Networks | |
| Mishra et al. | Fair and reliable transmission control protocol for ad hoc networks | |
| Yang et al. | A buffer management strategy based on message drop history in dtn satellite network | |
| Zhou et al. | Analysis on event delay in event-driven wireless sensor networks | |
| George et al. | Greatest Weight Based Packet Scheduling for Retransmission and Packet Drop | |
| Mishra et al. | Congestion control and fairness with dynamic priority for ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |