CN103929284A - High-reliability transmission method for wireless sensor network - Google Patents
High-reliability transmission method for wireless sensor network Download PDFInfo
- Publication number
- CN103929284A CN103929284A CN201410141466.3A CN201410141466A CN103929284A CN 103929284 A CN103929284 A CN 103929284A CN 201410141466 A CN201410141466 A CN 201410141466A CN 103929284 A CN103929284 A CN 103929284A
- Authority
- CN
- China
- Prior art keywords
- node
- receiving node
- frame
- sending node
- sending
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 39
- 238000000034 method Methods 0.000 title claims abstract description 22
- 230000005059 dormancy Effects 0.000 claims description 17
- 230000000737 periodic effect Effects 0.000 claims description 17
- 230000002776 aggregation Effects 0.000 claims description 10
- 238000004220 aggregation Methods 0.000 claims description 10
- 230000002618 waking effect Effects 0.000 claims description 10
- 230000009191 jumping Effects 0.000 claims description 9
- 238000012423 maintenance Methods 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 abstract description 4
- 238000002474 experimental method Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000004224 protection Effects 0.000 description 2
- 108700026140 MAC combination Proteins 0.000 description 1
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000008713 feedback mechanism Effects 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000035800 maturation Effects 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a high-reliability transmission method for the wireless sensor network. According to the method, at first, nodes joining the wireless sensor network are initialized, a sending node sets up a receiving list and a neighbor list and sends data, when the remaining buffer memory space fed back by a receiving node is zero, sending to the receiving node is eliminated, the sending node hibernates instantly till being wakened in the next period, if the remaining buffer memory space fed back by the receiving node is still zero after the sending node is wakened, a timer is started, the longest period of wakening and monitoring a channel is maintained, during the monitoring period, a proper father node is searched for transmitting data packets, and the original state is switched back after transmitting is finished. The data transmission method is particularly suitable for burst traffic load scenes, and good in performance under the low-flow load scenes.
Description
Technical field
The present invention relates to a kind of highly-reliable transmission method of wireless sensor network, belong to highly-reliable transmission mac-layer protocol design in wireless sensor network, for solving transmission packet loss problem.
Background technology
Wireless sensor network (Wireless Sensor Networks, WSN) be the multihop self-organizing network system forming by radio communication by being deployed in microsensor nodes a large amount of in monitored area, its objective is the information of monitored target in perception collaboratively, acquisition and processing network's coverage area, and send to observer.Along with the continuous maturation of wireless sensor network theory and technology, its application is also expanded to environmental monitoring, traffic administration, medical treatment & health, industrial and commercial service, anti-terrorism by initial military field and the numerous areas such as combats a natural disaster.When towards application-specific such as flood monitoring, forest fire protections, due to the generation of a certain area burst event, network presents a kind of burst high load condition.Multiple nodes can monitor after this event to gateway node transferring large number of data bag.Wireless sensor network is considered Financial cost, and node Resources on Chip is often very limited, and the high capacity transmission in the short time can cause the via node spatial cache of receiving terminal to overflow, and causes the loss of packet, reduces network performance.Therefore, effectively utilize nodal cache under high capacity scene, the reliability that promotes as far as possible transmission is most important.
The bottom part of MAC agreement in Protocol of Wireless Snesor Network, having determined the occupation mode of wireless channel has very big impact to radio sensing network performance.It is mainly responsible for channel access, controls transfer of data the taking wireless sharing channel of node, and carry out more effective, the orderly and fair shared channel that uses to ensure the overall performance of network by one group of rule and process, therefore MAC agreement is one of most important technology in wireless sensor network.
Transmission packet loss is ever-present problem in radio sensing network application.There is the reason of packet loss a lot, for example network congestion, receive the co-channel interference of the too little and wireless signal of the buffer area of grouping.For the problems referred to above, people have proposed multiple MAC agreement solution.The MAC agreement of for example IEEE802.11 adopts CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) wireless MAC agreement, before sending Frame, first channel is preengage, avoid collision to reduce packet loss by intercepting channel, most of MAC agreements are all extensively to adopt retransmission mechanism to solve transmission packet loss problem, if many agreements are not received ACK acknowledgement frame after Frame transmission finishes, Frame will be retransmitted, but still can reply ACK acknowledgement frame to the grouping of receiving after receiving node cache overflow, such packet loss sending node cannot know that causing overflowing packet loss is to be retransmitted transmission.
Summary of the invention
Goal of the invention: in order to overcome the deficiencies in the prior art, the invention provides a kind of highly-reliable transmission method of wireless sensor network, for the radio sensing network application scenarios of accident, carry out MAC Protocol Design and the realization of highly-reliable transmission; The present invention can realize and utilize limited cache resources to reduce as far as possible network packet loss rate, effectively utilizes neighbor node simultaneously, balance network load, and prolong network lifetime, finally makes network performance be highly improved.
Technical scheme: for achieving the above object, the technical solution used in the present invention is:
A kind of highly-reliable transmission method of wireless sensor network, the dynamic forwarding mechanism that adopts receiving terminal buffer memory feedback mechanism and father node self adaptation to switch, determine whether continuing to send grouping according to the size of receiving terminal spatial cache, the packet loss problem of having avoided receiving terminal to overflow, simultaneously according to the dynamic forwarding data grouping of network load condition, effectively utilize idle neighbor node, balance network load, prolong network lifetime.Be specially: first the node that adds wireless sensor network is carried out to initialization, sending node is set up and received list and neighbor list; Sending node sends data, in the time that the remaining cache space of receiving node feedback is zero, cancels the transmission to receiving node, and sending node dormancy is at once until next periodic awakening; If waking the remaining cache space of rear receiving node feedback next time up is still zero, opening timing device, keep waking up and intercepting the longest one-period of channel: in this listening periods, find suitable father node and carry out the forwarding of packet, switch back original state after completing transmission.
Said method specifically comprises the steps:
Step 1, sending node have data to need to send, and inquire-receive list, if receiving node is in the reception list of sending node, enters step 1-1; If receiving node, in the reception list of sending node, does not enter step 1-2;
The time that step 1-1, sending node prediction receiving node are waken up, before receiving node is waken up, wake up and intercept channel, enter step 2;
Step 1-2, sending node wake up at once intercepts channel, enters step 2;
Step 2, receiving node wake up, and the concurrent beacon frame that send, enters step 3;
If step 3 sending node receives non-full beacon frame, enter step 3-1; Overflow beacon frame if sending node receives, enter step 3-2; If sending node is received other types grouping, enter step 3-3;
Step 3-1, now show wake-up waiting of receiving node, and can receive data, sending node can send Frame; The list of sending node inquire-receive also sends Frame: if receiving node is receiving in list, in the Frame sending, add request mark position; If receiving node, receiving in list, directly sends Frame; Enter step 4;
The dormancy at once of step 3-2, sending node, returns to step 1, waits for next periodic awakening;
Step 3-3, sending node receive for the packet of issuing oneself, and enter step 4; The packet that sending node is received for cross-talk abandons;
Step 4, receiving node are received Frame, whether contain request mark position and buffer queue remaining space reply ACK frame: if Frame contains request mark position, enter step 4-1 according to Frame; If Frame, containing request mark position, does not enter step 4-2; If receiving node has detected collision, enter step 4-3;
Step 4-1, receiving node interpolation self schedule information and buffer memory remaining space, to ACK frame, send ACK frame, enter step 5;
Step 4-2, receiving node add buffer memory remaining space to ACK frame, send ACK frame, enter step 5;
Step 4-3, use binary exponential backoff method, receiving node sends the beacon frame with competition window, returns to step 3;
Step 5, sending node are received ACK frame and the receiving node spatial cache carrying in ACK frame are judged: enter step 5-1 if receiving node buffer memory is discontented, if receiving node cache overflow enters step 5-2;
Step 5-1, sending node continue transmission, until oneself do not have data or receiving node there is no remaining space, in the time that receiving node does not have remaining space, sending node dormancy, returns to step 1, waits for next periodic awakening;
Periodic awakening is waited in step 5-2, sending node dormancy, overflows beacon frame if received after waking up, enters step 6;
Step 6, setting MAC layer state are SUB_FATHER, opening timing device, and arranging and intercepting the maximum duration of channel is one-period, enters step 7;
Step 7, maintenance wake up, intercept channel: enter step 7-1 if listen to beacon frame within this cycle, enter step 7-2 if do not listen to suitable beacon frame within this cycle;
Step 7-1, the shortest jumping figure that sends nodal distance aggregation node when beacon frame are less than the shortest jumping figure of this nodal distance aggregation node, and beacon frame to send the remaining cache space of node non-vanishing, enter step 8; Otherwise, return to step 7;
Step 7-2, dormancy at once, MAC layer exits SUB_FATHER state, returns to step 1, waits for next periodic awakening;
Step 8, cancellation timer, selected beacon sends node as new father node, dynamically forwards, and end of transmission switches back original father node and makes MAC layer exit SUB_FATHER state.
Concrete, in described step 1, sending node adopts linear congruential method prediction receiving node wake-up time, is specially:
X
n+1=(aX
n+c)mod m
Wherein, m is coefficient, m>0; A is multiplier, 0<a<m; C is increment, 0<c<m; X
ncurrent seed, 0<X
n<m; Each X
nthe X producing
n+1can be for pseudo random number, become a new seed.Therefore, as long as sending node can be known m, a, c and X
nvalue, sending node just can be extrapolated the receiving node wakeup time in future so.
Beneficial effect: the highly-reliable transmission method of wireless sensor network provided by the invention, tool has the following advantages: 1, can dynamically adjust subsequent transmission according to the situation of receiving node buffer memory, ensure to divide into groups not overflow loss at receiving terminal; 2, make full use of neighbor node and alleviate receiving node buffer memory pressure, dynamically forwarding data grouping, balance network load, prolong network lifetime; 3, be applicable to WSN network intensive, high capacity, be applicable to too sparse, low laod network.
Brief description of the drawings
Fig. 1 is overall flow figure of the present invention;
Fig. 2 is ACK frame format schematic diagram;
Fig. 3 is that prediction wakes MAC schematic diagram up;
Fig. 4 is the flow chart of step 3;
Fig. 5 is the flow chart of step 4;
Fig. 6 is step 5,6 flow chart;
Fig. 7 is emulation experiment topological diagram;
Fig. 8 is the comparison diagram of packet transmission rate.
Embodiment
Below in conjunction with accompanying drawing, the present invention is further described.
A highly-reliable transmission method for wireless sensor network, first carries out initialization to the node that adds wireless sensor network, and sending node is set up and received list and neighbor list; Sending node sends data, in the time that the remaining cache space of receiving node feedback is zero, cancels the transmission to receiving node, and sending node dormancy is at once until next periodic awakening; If waking the remaining cache space of rear receiving node feedback next time up is still zero, opening timing device, keep waking up and intercepting the longest one-period of channel: in this listening periods, find suitable father node and carry out the forwarding of packet, switch back original state after completing transmission.As shown in Figure 1, the method specifically comprises the steps:
Step 1, sending node have data to need to send, and inquire-receive list, if receiving node is in the reception list of sending node, enters step 1-1; If receiving node, in the reception list of sending node, does not enter step 1-2;
The time that step 1-1, sending node prediction receiving node are waken up, before receiving node is waken up, wake up and intercept channel, enter step 2;
Step 1-2, sending node wake up at once intercepts channel, enters step 2;
Step 2, receiving node wake up, and the concurrent beacon frame that send, enters step 3;
If step 3 sending node receives non-full beacon frame, enter step 3-1; Overflow beacon frame if sending node receives, enter step 3-2; If sending node is received other types grouping, enter step 3-3;
Step 3-1, now show wake-up waiting of receiving node, and can receive data, sending node can send Frame; The list of sending node inquire-receive also sends Frame: if receiving node is receiving in list, in the Frame sending, add request mark position; If receiving node, receiving in list, directly sends Frame; Enter step 4;
The dormancy at once of step 3-2, sending node, returns to step 1, waits for next periodic awakening;
Step 3-3, sending node receive for the packet of issuing oneself, and enter step 4; The packet that sending node is received for cross-talk abandons;
Step 4, receiving node are received Frame, whether contain request mark position and buffer queue remaining space reply ACK frame: if Frame contains request mark position, enter step 4-1 according to Frame; If Frame, containing request mark position, does not enter step 4-2; If receiving node has detected collision, enter step 4-3;
Step 4-1, receiving node interpolation self schedule information and buffer memory remaining space, to ACK frame, send ACK frame, enter step 5;
Step 4-2, receiving node add buffer memory remaining space to ACK frame, send ACK frame, enter step 5;
Step 4-3, use binary exponential backoff method, receiving node sends the beacon frame with competition window, returns to step 3;
Step 5, sending node are received ACK frame and the receiving node spatial cache carrying in ACK frame are judged: enter step 5-1 if receiving node buffer memory is discontented, if receiving node cache overflow enters step 5-2;
Step 5-1, sending node continue transmission, until oneself do not have data or receiving node there is no remaining space, in the time that receiving node does not have remaining space, sending node dormancy, returns to step 1, waits for next periodic awakening;
Periodic awakening is waited in step 5-2, sending node dormancy, overflows beacon frame if received after waking up, enters step 6;
Step 6, setting MAC layer state are SUB_FATHER, opening timing device, and arranging and intercepting the maximum duration of channel is one-period, enters step 7;
Step 7, maintenance wake up, intercept channel: enter step 7-1 if listen to beacon frame within this cycle, enter step 7-2 if do not listen to suitable beacon frame within this cycle;
Step 7-1, the shortest jumping figure that sends nodal distance aggregation node when beacon frame are less than the shortest jumping figure of this nodal distance aggregation node, and beacon frame to send the remaining cache space of node non-vanishing, enter step 8; Otherwise, return to step 7;
Step 7-2, dormancy at once, MAC layer exits SUB_FATHER state, returns to step 1, waits for next periodic awakening;
Step 8, cancellation timer, selected beacon sends node as new father node, dynamically forwards, and end of transmission switches back original father node and makes MAC layer exit SUB_FATHER state.
Concrete, in described step 1, sending node adopts linear congruential method prediction receiving node wake-up time, is specially:
X
n+1=(aX
n+c)mod m
Wherein, m is coefficient, m>0; A is multiplier, 0<a<m; C is increment, 0<c<m; X
ncurrent seed, 0<X
n<m; Each X
nthe X producing
n+1can be for pseudo random number, become a new seed.Therefore, as long as sending node can be known m, a, c and X
nvalue, sending node just can be extrapolated the receiving node wakeup time in future so.
Be illustrated with regard to specific implementation of the present invention below.
After netinit, when sending node has Frame to send, check in oneself reception list, if receiving node not in the reception list of oneself, sending node is the beacon frame of wake-up waiting receiving node at once; If receiving node in the reception list of oneself, the time that sending node prediction receiving node is waken up, before receiving node is waken up, wake up and intercept channel, after sending node is successfully received the beacon frame of receiving node, carry out the transmission of Frame.Sending node, send before Frame can inquire-receive node whether in the reception list at oneself, if do not existed, adds request mark position in Frame, requires receiving node that schedule information is provided.
Receiving node receives that Frame can detect Frame afterwards and whether contain request mark position, and for the Frame that contains request mark position, receiving node carries schedule information in the ACK acknowledgement frame of replying, and ACK frame format as shown in Figure 2.After this, sending node can predict the time that receiving node is waken up, and wakes up in advance, and the transmission of dividing into groups as shown in Figure 3, has greatly reduced sending node time of intercept, and its core mechanism is to utilize pseudo random number algorithm, as shown in Equation (1):
X
n+1=(aX
n+c)mod m （1）
Wherein, m is coefficient, m>0; A is multiplier, 0<a<m; C is increment, 0<c<m; X
ncurrent seed, 0<X
n<m; Each X
nthe X producing
n+1can be for pseudo random number, become a new seed.Therefore, as long as sending node can be known m, a, c and X
nvalue, sending node just can be extrapolated the receiving node wakeup time in future so.In the present invention's experiment, get a=21, c=7, m=750.
If sending node is not received the ACK frame of reply, after a period of time, meeting retransmitting data frame, is limited in re-transmission 5 times, and in the time that retransmission counter exceedes 5 times, this Frame can be dropped.If receive ACK frame, sending node is resolved ACK frame, checks whether receiving node spatial cache remains, if receiving node still has spatial cache, sending node can send Frame until receiving node spatial cache is zero to it always.Now, sending node is dormancy at once, by the time next periodic awakening transmission.
The beacon frame of next cycle sending node prediction wake-up waiting receiving node, if now show in beacon frame that the spatial cache of receiving node is still zero, sending node is opened timer and is kept waking up, intercept the longest one-period of channel, and the state of setting MAC layer is SUB_FATHER, within this cycle, intercept and choose first suitable neighbor node as new forwarding father node, the condition of choosing must meet following 2 points:
First, new father node must be less than the shortest jumping figure of sending node apart from aggregation node apart from the shortest jumping figure of aggregation node, and for fear of route loop, we have cancelled with jump set defeated, has reduced screening scope;
Secondly, newly forwarding father node buffer memory remaining space can not be zero.
If can find the sender of the beacon frame that meets these two conditions as new father node in this listening periods, sending node will be cancelled timer, the address of receiving node is changed into the address of new father node, and packet is transmitted to this node, complete the rear original state that switches back that transmits; If beacon frame not exclusively satisfies condition, continue to intercept; If sending node is not found suitable forward node within this cycle, the dormancy of sending node timer expiry, continues to wait until next periodic awakening, and MAC layer exits SUB_FATHER state.
Carry out experiment test below, the performance of contrast the present invention program and conventional solution:
Experiment porch: NS2 network simulation simulator.
Experiment scene: 11 star-like being distributed in apart within the scope of aggregation node one jumping of node, aggregation node is in centre.
Offered load: dynamically adjust according to sending node quantity and generation data break.
Fig. 7 is experiment topology.Fig. 8 is experimental result picture, and wherein abscissa represents that data send interval, and ordinate represents packet transmission rate, and triangulation point, round dot, side's point represent respectively one, two, three data flow.From Fig. 8, we can find out the increasing along with load, and owing to having adopted receiving terminal buffer memory feedback and dynamic forwarding mechanism, the present invention program's advantage is fairly obvious, and the present invention still keeps good performance under low load.
The above is only the preferred embodiment of the present invention; be noted that for those skilled in the art; under the premise without departing from the principles of the invention, can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (3)
1. a highly-reliable transmission method for wireless sensor network, is characterized in that: first the node that adds wireless sensor network is carried out to initialization, sending node is set up and received list and neighbor list; Sending node sends data, in the time that the remaining cache space of receiving node feedback is zero, cancels the transmission to receiving node, and sending node dormancy is at once until next periodic awakening; If waking the remaining cache space of rear receiving node feedback next time up is still zero, opening timing device, keep waking up and intercepting the longest one-period of channel: in this listening periods, find suitable father node and carry out the forwarding of packet, switch back original state after completing transmission.
2. the highly-reliable transmission method of wireless sensor network according to claim 1, is characterized in that: comprise the steps:
Step 1, sending node have data to need to send, and inquire-receive list, if receiving node is in the reception list of sending node, enters step 1-1; If receiving node, in the reception list of sending node, does not enter step 1-2;
The time that step 1-1, sending node prediction receiving node are waken up, before receiving node is waken up, wake up and intercept channel, enter step 2;
Step 1-2, sending node wake up at once intercepts channel, enters step 2;
Step 2, receiving node wake up, and the concurrent beacon frame that send, enters step 3;
If step 3 sending node receives non-full beacon frame, enter step 3-1; Overflow beacon frame if sending node receives, enter step 3-2; If sending node is received other types grouping, enter step 3-3;
Step 3-1, the list of sending node inquire-receive also send Frame: if receiving node is receiving in list, in the Frame sending, add request mark position; If receiving node, receiving in list, directly sends Frame; Enter step 4;
The dormancy at once of step 3-2, sending node, returns to step 1, waits for next periodic awakening;
Step 3-3, sending node receive for the packet of issuing oneself, and enter step 4; The packet that sending node is received for cross-talk abandons;
Step 4, receiving node are received Frame, whether contain request mark position and buffer queue remaining space reply ACK frame: if Frame contains request mark position, enter step 4-1 according to Frame; If Frame, containing request mark position, does not enter step 4-2; If receiving node has detected collision, enter step 4-3;
Step 4-1, receiving node interpolation self schedule information and buffer memory remaining space, to ACK frame, send ACK frame, enter step 5;
Step 4-2, receiving node add buffer memory remaining space to ACK frame, send ACK frame, enter step 5;
Step 4-3, use binary exponential backoff method, receiving node sends the beacon frame with competition window, returns to step 3;
Step 5, sending node are received ACK frame and the receiving node spatial cache carrying in ACK frame are judged: enter step 5-1 if receiving node buffer memory is discontented, if receiving node cache overflow enters step 5-2;
Step 5-1, sending node continue transmission, until oneself do not have data or receiving node there is no remaining space, in the time that receiving node does not have remaining space, sending node dormancy, returns to step 1, waits for next periodic awakening;
Periodic awakening is waited in step 5-2, sending node dormancy, overflows beacon frame if received after waking up, enters step 6;
Step 6, setting MAC layer state are SUB_FATHER, opening timing device, and arranging and intercepting the maximum duration of channel is one-period, enters step 7;
Step 7, maintenance wake up, intercept channel: enter step 7-1 if listen to beacon frame within this cycle, enter step 7-2 if do not listen to suitable beacon frame within this cycle;
Step 7-1, the shortest jumping figure that sends nodal distance aggregation node when beacon frame are less than the shortest jumping figure of this nodal distance aggregation node, and beacon frame to send the remaining cache space of node non-vanishing, enter step 8; Otherwise, return to step 7;
Step 7-2, dormancy at once, MAC layer exits SUB_FATHER state, returns to step 1, waits for next periodic awakening;
Step 8, cancellation timer, selected beacon sends node as new father node, dynamically forwards, and end of transmission switches back original state and makes MAC layer exit SUB_FATHER state.
3. the highly-reliable transmission method of wireless sensor network according to claim 1, is characterized in that: in described step 1, sending node adopts linear congruential method prediction receiving node wake-up time, is specially:
X
n+1=(aX
n+c)modm
Wherein, m is coefficient, m>0; A is multiplier, 0<a<m; C is increment, 0<c<m; X
ncurrent seed, 0<X
n<m; Each X
nthe X producing
n+1can be for pseudo random number, become a new seed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410141466.3A CN103929284B (en) | 2014-04-09 | 2014-04-09 | High-reliability transmission method for wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410141466.3A CN103929284B (en) | 2014-04-09 | 2014-04-09 | High-reliability transmission method for wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103929284A true CN103929284A (en) | 2014-07-16 |
| CN103929284B CN103929284B (en) | 2017-05-10 |
Family
ID=51147376
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410141466.3A Expired - Fee Related CN103929284B (en) | 2014-04-09 | 2014-04-09 | High-reliability transmission method for wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103929284B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106982460A (en) * | 2017-03-30 | 2017-07-25 | 西安电子科技大学 | Chunk data distribution method based on priority in dutycycle wireless sensor network |
| CN107396433A (en) * | 2017-07-31 | 2017-11-24 | 中南大学 | WLAN energy-saving method and STA based on NDN frameworks |
| CN107528677A (en) * | 2017-10-11 | 2017-12-29 | 杭州若联科技有限公司 | Information sends failure way to play for time and device |
| CN107949046A (en) * | 2017-12-21 | 2018-04-20 | 华为技术有限公司 | Wireless senser management method, apparatus and system |
| CN108696944A (en) * | 2018-03-15 | 2018-10-23 | 西安电子科技大学 | Data transmission method based on Quick-return ACK in a kind of wireless sensor network |
| CN110839221A (en) * | 2019-11-04 | 2020-02-25 | 大连大学 | Node data transmission method |
| CN113852589A (en) * | 2020-06-28 | 2021-12-28 | 华为技术有限公司 | Method, apparatus and medium for data transmission and data reception |
| WO2022001852A1 (en) * | 2020-06-28 | 2022-01-06 | 索尼集团公司 | Electronic device and method for controlling wireless communication network or sensor |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102625427A (en) * | 2012-03-14 | 2012-08-01 | 东南大学 | Wireless sensor network data acquisition method based on asynchronous awakening scheduling |
-
2014
- 2014-04-09 CN CN201410141466.3A patent/CN103929284B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102625427A (en) * | 2012-03-14 | 2012-08-01 | 东南大学 | Wireless sensor network data acquisition method based on asynchronous awakening scheduling |
Non-Patent Citations (1)
| Title |
|---|
| 郑军，张宝贤等: "《无线传感器网络技术》", 31 December 2012 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106982460A (en) * | 2017-03-30 | 2017-07-25 | 西安电子科技大学 | Chunk data distribution method based on priority in dutycycle wireless sensor network |
| CN107396433B (en) * | 2017-07-31 | 2019-10-18 | 中南大学 | WLAN energy-saving method and STA based on NDN framework |
| CN107396433A (en) * | 2017-07-31 | 2017-11-24 | 中南大学 | WLAN energy-saving method and STA based on NDN frameworks |
| CN107528677A (en) * | 2017-10-11 | 2017-12-29 | 杭州若联科技有限公司 | Information sends failure way to play for time and device |
| CN107949046A (en) * | 2017-12-21 | 2018-04-20 | 华为技术有限公司 | Wireless senser management method, apparatus and system |
| WO2019119922A1 (en) * | 2017-12-21 | 2019-06-27 | 华为技术有限公司 | Wireless sensor management method, apparatus, and system |
| CN107949046B (en) * | 2017-12-21 | 2020-09-04 | 华为技术有限公司 | Wireless sensor management method, device and system |
| CN108696944A (en) * | 2018-03-15 | 2018-10-23 | 西安电子科技大学 | Data transmission method based on Quick-return ACK in a kind of wireless sensor network |
| CN110839221A (en) * | 2019-11-04 | 2020-02-25 | 大连大学 | Node data transmission method |
| CN110839221B (en) * | 2019-11-04 | 2022-02-11 | 大连大学 | Node data transmission method |
| CN113852589A (en) * | 2020-06-28 | 2021-12-28 | 华为技术有限公司 | Method, apparatus and medium for data transmission and data reception |
| WO2022001852A1 (en) * | 2020-06-28 | 2022-01-06 | 索尼集团公司 | Electronic device and method for controlling wireless communication network or sensor |
| CN113852589B (en) * | 2020-06-28 | 2023-10-24 | 华为技术有限公司 | Method, apparatus and medium for data transmission and data reception |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103929284B (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103929284B (en) | High-reliability transmission method for wireless sensor network | |
| Pu et al. | Comparing underwater MAC protocols in real sea experiments | |
| Sun et al. | RI-MAC: a receiver-initiated asynchronous duty cycle MAC protocol for dynamic traffic loads in wireless sensor networks | |
| US8467327B2 (en) | Sensor network system and communication method thereof | |
| CN101827378B (en) | Blending MAC protocol design method suitable for wireless sensor network | |
| CN103906207B (en) | Wireless sensor network data transmission method based on self adaptation awakening technology on demand | |
| Shen et al. | Distributed congestion control approaches for the IEEE 802.11 p vehicular networks | |
| CN104092523B (en) | A kind of data transmission method under wireless sensor network multithread competition scene | |
| CN102647805B (en) | Wireless sensor network transmission method based on medium access control (MAC) protocol | |
| CN107040878A (en) | A kind of many chain wireless sensor networks without layered communication method | |
| CN102932919A (en) | Method and device for resource configuration of uplink sounding reference signal (SRS) | |
| CN103248436A (en) | Method for avoiding hidden terminal and exposed terminal of underwater acoustic communication network | |
| CN103974442A (en) | Low-delay scheduling method suitable for wireless sensor network | |
| Sarang et al. | Multi-priority based QoS MAC protocol for wireless sensor networks | |
| Khan et al. | Collision Free Mobility Adaptive (CFMA) MAC for wireless sensor networks | |
| Lee et al. | Performance of a receiver-initiated MAC protocol with aggregation for event-driven wireless sensor networks | |
| Spachos et al. | Performance comparison of opportunistic routing schemes in wireless sensor networks | |
| CN105208671B (en) | The implementation method of high channel utilization rate H-MAC agreements for wireless sensor network | |
| Henna | Sa-ri-mac: sender-assisted receiver-initiated asynchronous duty cycle mac protocol for dynamic traffic loads in wireless sensor networks | |
| Duan et al. | An adaptive RTS/CTS mechanism in IEEE 802.15. 4 for multi-hop networks | |
| Pande et al. | Various ways to implement energy efficient WiseMAC protocol for wireless sensor network | |
| Singh et al. | A low delay cross-layer contention based synchronous MAC protocol for a multi-hop WSN | |
| CN103687072B (en) | The link layer control method that conflict can be detected | |
| De Guglielmo et al. | A localized de-synchronization algorithm for periodic data reporting in IEEE 802.15. 4 WSNs | |
| Cano et al. | A novel MAC protocol for event-based wireless sensor networks: improving the collective QoS |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170510 |