CN103313421A - Back off algorithm in medium access control protocol for multi-hop network and wireless sensor network - Google Patents
Back off algorithm in medium access control protocol for multi-hop network and wireless sensor network Download PDFInfo
- Publication number
- CN103313421A CN103313421A CN2013101942392A CN201310194239A CN103313421A CN 103313421 A CN103313421 A CN 103313421A CN 2013101942392 A CN2013101942392 A CN 2013101942392A CN 201310194239 A CN201310194239 A CN 201310194239A CN 103313421 A CN103313421 A CN 103313421A
- Authority
- CN
- China
- Prior art keywords
- grouping
- node
- delay sensitive
- way
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a back off algorithm in a medium access control protocol for a multi-hop network and a wireless sensor network. Different back off windows are adopted for back off according to different groups, the competitive influence of non delay sensitive groups on delay sensitive groups is effectively reduced, and the effective transmission of the delay sensitive groups is ensured; meanwhile, for the same groups, nodes calculate the queue length and the transmission times weighted value on a basic back off time slot, so that the groups having longer queue and more retransmission times have higher probability to obtain a small back off time slot, and the fairness of the networks is guaranteed.
Description
Technical field
The present invention relates to wireless communication technology field, particularly relate to the back off algorithm in the media access control protocol of a kind of multihop network and wireless sense network.
Background technology
Along with the development of wireless network, transducer and MEMS technology, the range of application of wireless sensor network and ad hoc network is more and more wider.Node in these networks is mostly with powered battery, and network throughput and energy efficiency have determined performance and the life cycle of network.In these networks, media access control protocol (MAC agreement) has determined the occupation mode of wireless channel, is used for making up the underlying basis structure of network system.Present MAC agreement generally is divided into two kinds, a kind of wireless channel time division multiplexing mode (Time Division Multiple Access that is based on, abbreviation TDMA) agreement, distribute fixing wireless channel to use the period for each node, thereby avoid the phase mutual interference between the node, but the propagation delay time of this agreement is comparatively fixing, in a lot of the application, need variation to external world in time to react, need node when monitoring abnormal conditions, report at once rather than wait for transmission time slot arrive after transmission again, and this agreement is very high for the requirement of time synchronized; Another is the competitive way at random that adopts wireless channel, when needing to send data again, uses node wireless channel at random, this MAC agreement that inserts at random can change to external world makes immediate reaction, but emphasis will consider to reduce internodal interference as far as possible, in the MAC agreement that inserts at random, node shares the collision problem that wireless channel has caused packet, this is because the MAC agreement that inserts is used CSMA/CA and binary system index backoff algorithm (Binary Exponential Backoff mostly at random, BEB) reduce collision, typically as the IEEE802.11DCF agreement etc.And this collision is to be kept out of the way by the time slot of keeping out of the way that distributed algorithm produces at random fully, and the possibility that packet bumps mutually is bigger, causes packet that phenomenon takes place to retransmit, indirect increase propagation delay time.
Wireless sense network and ad hoc network for the transmission heterogeneous data, consider to possess the application scenarios of following characteristics: node random distribution MANET, monitoring and the mac protocol transmission that the data that collect are passed through to insert at random arrive the sink node, run into accident or special circumstances, the data that monitor are delay sensitives, need transmission in time; And the data that monitor under the usual state are non-delay sensitives, can tolerate certain transmission delay.
Lay at the node under this scene, the drawback of traditional back off algorithm is more obvious, delay sensitive grouping with non-delay sensitive grouping because the identical back off algorithm of employing causes delay sensitive to be grouped in the forwarding aspect does not have any priority and can say, rely on the back off time that produces at random to be kept out of the way fully, the delay sensitive grouping might be defeated by non-delay sensitive grouping fully in channel competition, cause propagation delay time excessive, in addition, network fairness and energy consumption aspect are also because random back and uncontrollable.
Summary of the invention
Technical problem to be solved by this invention provides the back off algorithm in the media access control protocol of a kind of multihop network and wireless sense network, makes the delay sensitive grouping have precedence over non-delay sensitive transmitted in packets as much as possible.
The technical solution adopted for the present invention to solve the technical problems is: the back off algorithm in the media access control protocol of a kind of multihop network and wireless sense network is provided, may further comprise the steps:
(1) grouping that will transmit is divided into two types: delay sensitive grouping and non-delay sensitive divide into groups, and distinguish with flag bit at frame head;
(2) if during the responsive grouping of node transmission delay, establish each node keep out of the way normally window for (0, CW), at non-delay sensitive grouping, keep out of the way window become (0, CW/2), node keep out of the way timeslot number B=random (0, CW/2) * (1-qr/Qr) * φ * 1/k
kWherein, φ is the delay sensitive coefficient, and qr is the queue length of the current delay sensitive grouping of node, and Qr is the buffer length of delay sensitive grouping, and k is the number of transmissions of current group, wherein, and the responsive grouping of the preferential transmission delay of node;
(3) if when node will send the grouping of non-delay sensitive, if it is (0 that each node is kept out of the way window normally, CW), if before to record the packet type of communicating by letter in the network be delay sensitive grouping, then will keep out of the way window and become (CW/2, CW), node is kept out of the way timeslot number B=random (CW/2, CW) * (1-qn/ (Qr+Qn)) * 1/k; If before in the network of record the packet type of communicating by letter be non-delay sensitive grouping, node keep out of the way timeslot number B=random (0, CW) * (1-qn/ (Qr+Qn)) * 1/k; Wherein, qn is the queue length of the current non-delay sensitive grouping of node, and Qr is the buffer length of delay sensitive grouping, and Qn is the buffer length of non-delay sensitive grouping, and k is the number of transmissions of current group.
If node competitive channel success then sends the RTS grouping, after father node is received the RTS grouping, respond the CTS grouping in the described step (2), all comprise time and this packet type of communicating by letter and to send of this time communicate by letter and continuing in RTS grouping and the CTS grouping; Other neighbor nodes can be set self sleep timer according to call duration time wherein and enter sleep, and record the packet type that current network communicates when receiving RTS grouping and CTS grouping.
Successful as if the node competitive channel in the described step (3), comprise residue call duration time that NAV this time communicates by letter for expression in the transmission RTS grouping, NAV=t*n+T, wherein n is for remaining the grouping number that will send, t is for sending each needed time of dividing into groups, and T is total interFrameGap time; Wait for the acknowledgement frame of receiving target node after grouping of the each transmission of node, if do not receive then packet retransmission of acknowledgement frame.
When the energy of described node was lower than threshold value Eo, node sent one and self is about to the broadcast message of inefficacy, and suppressed self to receive or send non-delay sensitive and divide into groups, and received only and the responsive grouping of transmission delay.
If node competitive channel failure is then preserved this residue and kept out of the way timeslot number Bl, during next competitive channel, timeslot number Bm is kept out of the way on the new basis of generation, gets min(Bl in the described step (2), Bm) as the timeslot number of keeping out of the way of a new round.
If the node competitive channel is failed, then get the random number that produces again and keep out of the way timeslot number as the basis of a new round in the described step (3).
In transmission course, if node itself collection has produced other grouping, then to behind this sign off, participate in channel competition next time again.
Beneficial effect
Owing to adopted above-mentioned technical scheme, the present invention compared with prior art has following advantage and good effect:
Utilize the present invention, do not send and learn to have the delay sensitive grouping in the network time when node has delay sensitive grouping, automatically will keep out of the way the window hysteresis and be (CW/2, CW), avoid fully conflicting with delay sensitive grouping generation, even node is found out the delay sensitive grouping is not arranged in the network, keep out of the way window (0, CW) be delay sensitive grouping keep out of the way window (0, twice CW/2), the latter has bigger probability to obtain littler random number.
Utilize the present invention, between the grouping of the same race, keep out of the way under the much the same situation of time slot on the basis, queue length is more long, and the grouping that number of retransmissions is more many is more easy to obtain the less time slot of keeping out of the way, and has guaranteed the fairness of network.
Utilize the present invention, between the different grouping, the weight coefficient that every weight coefficient of delay sensitive grouping all divides into groups less than non-delay sensitive, even that adopts if not the transmission that has the delay sensitive grouping in the network is not found out in non-delay sensitive grouping keeps out of the way window entirely, produced than the littler basis of delay sensitive grouping and kept out of the way time slot, through after the weighted calculation, it is final keeps out of the way time slot and also may be beneficial to the transmission of delay sensitive packet priority greater than the time slot of keeping out of the way of delay sensitive grouping.
Description of drawings
Fig. 1 is algorithm flow chart of the present invention;
Fig. 2～4th, instantiation schematic diagram of the present invention.
Embodiment
Below in conjunction with specific embodiment, further set forth the present invention.Should be understood that these embodiment only to be used for explanation the present invention and be not used in and limit the scope of the invention.Should be understood that in addition those skilled in the art can make various changes or modifications the present invention after the content of having read the present invention's instruction, these equivalent form of values fall within the application's appended claims institute restricted portion equally.
Embodiments of the present invention relate to the back off algorithm in the media access control protocol of a kind of multihop network and wireless sense network, as shown in Figure 1, may further comprise the steps:
(1) node adopts periodic sleep and arouse machine processed, when node is waken up, at first intercept channel, if channel busy, node itself does not have grouping yet and will send, then node continues to intercept a period of time is not still had grouping and will send or receive, and timer directly is set enters sleep state, waits for the arrival of next wake-up period; If node has grouping to need to send, continue then to intercept that (node may be waken up constantly until receiving the grouping that comprises call duration time in the middle of certain transmission packets stage, this moment, it can only detect what grouping has energy in the channel and can't resolve what receive be) or listen to channel idle, according to wherein NAV value sleep timer is set then and enters sleep or begin competitive channel.
(2) grouping that will transmit is divided into two types: delay sensitive grouping and non-delay sensitive divide into groups, and distinguish with flag bit at frame head; The delay sensitive grouping always has precedence over non-delay sensitive grouping and transmits.When node listened to channel idle, the beginning competitive channel was carried out back off algorithm.If if listen to the control grouping of other node, then competition failure finishes this backoff procedure to node during keeping out of the way, record packet type and the call duration time of other node transmission, enter sleep.The competitive channel again of waking up when waiting other node communications time to arrive.
(3) process of the responsive grouping of node transmission delay is as follows:
When (a) node is wanted the grouping of transmission delay sensitivity, self is kept out of the way window by (0, CW) be reduced to (0, CW/2), therefrom select the basis to keep out of the way timeslot number B=random (0 at random, CW/2), keep out of the way when failure when node, it is B1 (k) that this residue is kept out of the way time slot, and node next time, the timeslot number of keeping out of the way that produces of competitive channel was Bm (k+1) again, get new round basis and keep out of the way timeslot number B (k+1)=min (B1 (k), Bm (k+1)).
(b) basis being kept out of the way timeslot number multiply by the number of transmissions weights coefficient and obtains B (k)=B*1/k
k, the k ongoing the number of transmissions of representing to divide into groups is when being increased by the visible packet transmission failure number of times of formula, the k value increases, and B is the monotone decreasing function of k, and it is very fast to converge on 0 speed, the value of B (k) will obviously trend towards diminishing when following minor node is competed again, will have bigger chance successfully to transmit grouping.
(c) will obtain keep out of the way timeslot number multiply by again queue length weights coefficient B (k, q)=B (k) * (1-qr/Qr) * φ, qr is the queue length of the current delay sensitive grouping of node, Qr is the buffer length of delay sensitive grouping.B (k, q) for the final timeslot number of keeping out of the way, more long by the visible queue length of formula, B (k, value q) is more little, and relatively more easy transmission has guaranteed to have the network fairness that bigger probability transmission grouping is arranged than the node of queue row.φ is the delay sensitive coefficient, is the formation weights that are not more than non-delay sensitive grouping for the formation weights that guarantee the delay sensitive grouping.
(4) to send the process of non-delay sensitive grouping as follows for node:
When (a) node will send the grouping of non-delay sensitive, check the packet type in network service last time of record earlier, if delay sensitive grouping, still may there be the competition of delay sensitive grouping in the communication this time of then thinking, self is kept out of the way window by (0, CW) become to (CW/2, CW), with as much as possible to delay sensitive grouping " giving way ".Even this time no longer there is the communication of delay sensitive grouping in the network, can not influence the competition of dividing into groups with other non-delay sensitives, because all competition nodes have all changed window because of the packet type of record yet.If the packet type of the communication last time of record is non-delay sensitive grouping, think that then this time communication does not need to change competition window, still be (0, CW).The basis keep out of the way timeslot number B=random (0, CW) or (CW/2, CW).
(b) basis being kept out of the way timeslot number multiply by the number of transmissions weights coefficient and obtains B (k)=B*1/k, the k ongoing the number of transmissions of representing to divide into groups, when being increased by the visible packet transmission failure number of times of formula, the k value increases, and B is the monotone decreasing function of k, compares with similar grouping, the competition frequency of failure is more many, grouping next time is easy the transmission successfully more, but compares with the delay sensitive grouping, and its weight coefficient obviously is weaker than the latter's weight coefficient 1/ (k+1) about the convergence rate of k
k, the time slot of keeping out of the way after the weighting of delay sensitive grouping trends towards 0 faster.
The timeslot number of keeping out of the way that (c) will obtain multiply by queue length weights coefficient B (k again, q)=B (k) * (1-qn/ (Qr+Qn)), qn is the queue length of the current non-delay sensitive grouping of node, and Qr is the buffer length of delay sensitive grouping, and Qn is the buffer length of non-delay sensitive grouping.B (k q) for the final timeslot number of keeping out of the way, is compared by the visible grouping of the same type of formula, and queue length is more long, and B (k, value q) is more little, and relatively more easy transmission has guaranteed to have the network fairness that bigger probability transmission grouping is arranged than the node of queue row.But with respect to the delay sensitive grouping,
Guarantee (1-qr/Qr) * φ＜1-qn/ (Qr+Qn-qn)/(Qr+Qn);
If φ=Qr/ (Qn+Qr) is 0＜φ＜1 → (1-qr/Qr) * φ=(Qr-qr)/(Qr+Qn);
Qr-qr＜Qr+Qn-qn→qn＜Qn+qr；
Because qn≤Qn, qr 〉=1 → qn＜Qn+qr is permanent to be set up.
Set up so (1-qr/Qr) * φ＜1-qn/ (Qr+Qn) is permanent.
Guaranteed that the formation weights coefficient of delay sensitive grouping is less than the formation weights coefficient of non-delay sensitive grouping.
The delay sensitive grouping is compared with non-delay sensitive grouping, if the former basis is kept out of the way timeslot number and is kept out of the way timeslot number smaller or equal to the basis of non-delay sensitive grouping, it is then final that to keep out of the way time slot also little certainly, even timeslot number is kept out of the way greater than the latter's the timeslot number of keeping out of the way in the former basis, the final time slot of keeping out of the way also might be less than the time slot of keeping out of the way of non-delay sensitive grouping.
If node 1,2,3,5 is all want to communicate with Centroid 0 in first round stage of communication among Fig. 2 (a), after the competition beginning, channel idle, nothing is grouped in the channel and sends, and each node begins backoff procedure.Time slot is kept out of the way on the basis that each node produces respectively separately, owing to include the delay sensitive grouping in node 1 and the node 3, is (0 so keep out of the way window, CW/2), other nodes temporarily also and do not know to exist in the network communication this time, still according to normal window (0, CW) keep out of the way.If CW=64, the numerical value that time slot is respectively 11,32,21, the 20(completely random produces is kept out of the way on the basis that each node produces), according to back off algorithm, establish Qr=20, Qn=20, the time slot of finally keeping out of the way of each node is:
B1=11*1/2*（1-4/20）*20/（20+20）=2
B2=32*1*（1–1/40）=31
B3=21*1/2*（1–2/20）*20/（20+20）=4
B5=20*1*（1-5/40）=17
Therefore node 1 wins channel with competition, sends the RTS grouping at the 2nd time slot, and node 2 and node 6 receive its RTS grouping in the communication range of node 1, finishes to keep out of the way timer is set enters sleep; Centroid receives that RTS grouping back sends the CTS grouping and responds node 1, and node 3,4,5 receives that the CTS grouping is laggard goes into sleep, shown in Fig. 2 (b).Node 1 sends packet until sign off, shown in Fig. 2 (c) then.First round sign off.
If be second to take turns the wake up situation of beginning competitive channel of each node of communication beginning back behind node 1 sign off among Fig. 3 (a), node 1 does not have grouping and will send, and node 4 has newly produced 3 non-delay sensitives groupings, and the grouping of other nodes remains unchanged.Node 2,4,5,6 is owing to recorded the transmission that had the delay sensitive grouping last time in the network at this moment, keep out of the way window and become (CW/2, CW), so this communication is the successful channels of node 3 competitions certainly, according to the proof of front, because the basic random back number that it produces is (0, CW/2) between, time slot is kept out of the way on basis less than non-delay sensitive grouping, and it is minimum that time slot is similarly after multiply by weighted value, shown in Fig. 3 (b), (c).
If among Fig. 4 (a) for third round communication begin the back each node behind node 1 sign off, wake up the beginning competitive channel situation, node 2 has newly produced 2 non-delay sensitive groupings, node 6 has newly produced 4 non-delay sensitive groupings, and the grouping of other nodes remains unchanged.Because the still delay sensitive grouping of communicating by letter in the last round of network, so the window of keeping out of the way of each node all is (CW/2, CW), if it is respectively 40,57,60,63,51 that number is kept out of the way on the basis that each node produces, node 2, the 5th, competitive channel for the third time, node 4 are competitive channels for the second time, and node 6 is competitive channels for the first time, node 3 also is the competitive channel first time because this is to send non-delay sensitive grouping for the first time.The time slot of finally keeping out of the way of each node is:
B2=40*1/3*(1-3/20)=11
B3=57*1*（1-2/20）=51
B4=60*1/2*（1-3/20）=25
B5=63*1/3*（1-2/20）=18
B6=51*1*（1-4/20）=40
Therefore node 2 wins channel with competition, as Fig. 4 (b), (c) by result of calculation as seen, though it is bigger that time slot is kept out of the way on the basis of node 5, but finally keep out of the way timeslot number still less than node 3,4,6, because node 5 the number of transmissions are more than them, therefore the number of transmissions weights are very little, make final to keep out of the way timeslot number still less than them, embodied the fairness of network.
The back is several takes turns just explanation one by one of communication, occurs if lower whorl has new delay sensitive grouping, and that respectively competes keeping out of the way window and will returning to that (0, CW), other processes are constant of node.
Claims (7)
1. the back off algorithm in the media access control protocol of a multihop network and wireless sense network is characterized in that, may further comprise the steps:
(1) grouping that will transmit is divided into two types: delay sensitive grouping and non-delay sensitive divide into groups, and distinguish with flag bit at frame head;
(2) if during the responsive grouping of node transmission delay, establish each node keep out of the way normally window for (0, CW), at non-delay sensitive grouping, keep out of the way window become (0, CW/2), node keep out of the way timeslot number B=random (0, CW/2) * (1-qr/Qr) * φ * 1/k
kWherein, φ is the delay sensitive coefficient, and qr is the queue length of the current delay sensitive grouping of node, and Qr is the buffer length of delay sensitive grouping, and k is the number of transmissions of current group, wherein, and the responsive grouping of the preferential transmission delay of node;
(3) if when node will send the grouping of non-delay sensitive, if it is (0 that each node is kept out of the way window normally, CW), if before to record the packet type of communicating by letter in the network be delay sensitive grouping, then will keep out of the way window and become (CW/2, CW), node is kept out of the way timeslot number B=random (CW/2, CW) * (1-qn/ (Qr+Qn)) * 1/k; If before in the network of record the packet type of communicating by letter be non-delay sensitive grouping, node keep out of the way timeslot number B=random (0, CW) * (1-qn/ (Qr+Qn)) * 1/k; Wherein, qn is the queue length of the current non-delay sensitive grouping of node, and Qr is the buffer length of delay sensitive grouping, and Qn is the buffer length of non-delay sensitive grouping, and k is the number of transmissions of current group.
2. the back off algorithm in the media access control protocol of multihop network according to claim 1 and wireless sense network, it is characterized in that, successful as if the node competitive channel in the described step (2), then send the RTS grouping, after father node is received the RTS grouping, respond the CTS grouping, all comprise time and this packet type of communicating by letter and to send of this time communicate by letter and continuing in RTS grouping and the CTS grouping; Other neighbor nodes can be set self sleep timer according to call duration time wherein and enter sleep, and record the packet type that current network communicates when receiving RTS grouping and CTS grouping.
3. the back off algorithm in the media access control protocol of multihop network according to claim 1 and wireless sense network, it is characterized in that, successful as if the node competitive channel in the described step (3), send in the RTS grouping and comprise the residue call duration time that NAV is used for this communication of expression, NAV=t*n+T, wherein n is for remaining the grouping number that will send, and t is for sending each needed time of dividing into groups, and T is total interFrameGap time; Wait for the acknowledgement frame of receiving target node after grouping of the each transmission of node, if do not receive then packet retransmission of acknowledgement frame.
4. the back off algorithm in the media access control protocol of multihop network according to claim 1 and wireless sense network, it is characterized in that, when the energy of described node is lower than threshold value Eo, node sends one and self is about to the broadcast message of inefficacy, and suppress self to receive or send non-delay sensitive and divide into groups, receive only and the responsive grouping of transmission delay.
5. the back off algorithm in the media access control protocol of multihop network according to claim 1 and wireless sense network, it is characterized in that, fail as if the node competitive channel in the described step (2), then preserve this residue and keep out of the way timeslot number Bl, next time is during competitive channel, timeslot number Bm is kept out of the way on the new basis that produces, and gets min(Bl, Bm) as the timeslot number of keeping out of the way of a new round.
6. the back off algorithm in the media access control protocol of multihop network according to claim 1 and wireless sense network, it is characterized in that, if the node competitive channel is failed, then get the random number that produces again and keep out of the way timeslot number as the basis of a new round in the described step (3).
7. the back off algorithm in the media access control protocol of multihop network according to claim 1 and wireless sense network, it is characterized in that, in transmission course, if node itself collection has produced other grouping, then to behind this sign off, participate in channel competition next time again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310194239.2A CN103313421B (en) | 2013-05-22 | 2013-05-22 | Back off algorithm in the media access control protocol of multihop network and wireless sense network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310194239.2A CN103313421B (en) | 2013-05-22 | 2013-05-22 | Back off algorithm in the media access control protocol of multihop network and wireless sense network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103313421A true CN103313421A (en) | 2013-09-18 |
| CN103313421B CN103313421B (en) | 2016-08-31 |
Family
ID=49138075
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310194239.2A Active CN103313421B (en) | 2013-05-22 | 2013-05-22 | Back off algorithm in the media access control protocol of multihop network and wireless sense network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103313421B (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105850217A (en) * | 2014-01-16 | 2016-08-10 | 华为技术有限公司 | Channel reservation method and communication device |
| CN106060903A (en) * | 2016-07-18 | 2016-10-26 | 北京交通大学 | New load network access back-off method for wireless multi-hop collaborative network |
| CN106060955A (en) * | 2016-05-17 | 2016-10-26 | 杨志军 | Method and system for controlling wireless sensor network MAC protocol polling based on three types of services |
| WO2017066942A1 (en) * | 2015-10-21 | 2017-04-27 | 华为技术有限公司 | Data transmission method and device |
| CN103957605B (en) * | 2014-05-05 | 2017-07-11 | 中国科学院微电子研究所 | Wireless resource dynamic access control method and system in body area network simulation |
| CN107969021A (en) * | 2016-10-19 | 2018-04-27 | 中南大学 | A kind of high usage route strategy between event and actuator based on Differentiated Services |
| CN108307439A (en) * | 2017-08-17 | 2018-07-20 | 上海大学 | A kind of self-adoptive retreating method under a large amount of multi-hop wireless nodes |
| CN108353427A (en) * | 2015-11-25 | 2018-07-31 | 高通股份有限公司 | Random access channel signaling on shared communication medium |
| CN108541076A (en) * | 2018-06-08 | 2018-09-14 | 上海交通大学 | CSMA/CA multiple access methods based on gated polling system |
| CN108834219A (en) * | 2018-07-20 | 2018-11-16 | 东北电力大学 | S-MAC Protocol of Wireless Sensor Network optimization method based on adaptive-flow |
| CN109428951A (en) * | 2017-08-31 | 2019-03-05 | 亚瑞源科技（深圳）有限公司 | Address automatic allocating method in serial communication system |
| CN110536473A (en) * | 2019-08-16 | 2019-12-03 | 中兴通讯股份有限公司 | Signaling method, device and storage medium |
| US11220033B2 (en) | 2017-02-08 | 2022-01-11 | Fundacio Eurecat | Computer implemented method for generating a mold model for production predictive control and computer program products thereof |
| CN114339983A (en) * | 2021-12-31 | 2022-04-12 | 电子科技大学 | Time synchronization method for wireless self-organizing network |
| CN114390001A (en) * | 2022-01-18 | 2022-04-22 | 中国联合网络通信集团有限公司 | Non-delay sensitive service queuing method, service access control method and device |
| CN114884629A (en) * | 2016-07-19 | 2022-08-09 | 德克萨斯仪器股份有限公司 | Channel hopping aware channel access and retransmission |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040004973A1 (en) * | 2002-07-08 | 2004-01-08 | Samsung Electronics Co., Ltd. | Method for performing contention-based access for real-time application and medium access control hierarchy module |
| CN102624608A (en) * | 2012-01-16 | 2012-08-01 | 华南理工大学 | Multi-class access dynamic backoff method for improving plug-and-play speed of intelligent sensor |
-
2013
- 2013-05-22 CN CN201310194239.2A patent/CN103313421B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040004973A1 (en) * | 2002-07-08 | 2004-01-08 | Samsung Electronics Co., Ltd. | Method for performing contention-based access for real-time application and medium access control hierarchy module |
| CN102624608A (en) * | 2012-01-16 | 2012-08-01 | 华南理工大学 | Multi-class access dynamic backoff method for improving plug-and-play speed of intelligent sensor |
Non-Patent Citations (1)
| Title |
|---|
| 赵玉申: "基于区分服务的无线多媒体传感器网络MAC协议研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10154434B2 (en) | 2014-01-16 | 2018-12-11 | Huawei Technologies Co., Ltd | Channel reservation method and communications device |
| CN105850217B (en) * | 2014-01-16 | 2019-08-20 | 华为技术有限公司 | The method and communication equipment of channel reservation |
| CN105850217A (en) * | 2014-01-16 | 2016-08-10 | 华为技术有限公司 | Channel reservation method and communication device |
| CN103957605B (en) * | 2014-05-05 | 2017-07-11 | 中国科学院微电子研究所 | Wireless resource dynamic access control method and system in body area network simulation |
| US10750537B2 (en) | 2015-10-21 | 2020-08-18 | Huawei Technologies Co., Ltd. | Data transmission method and apparatus |
| WO2017066942A1 (en) * | 2015-10-21 | 2017-04-27 | 华为技术有限公司 | Data transmission method and device |
| CN108353427A (en) * | 2015-11-25 | 2018-07-31 | 高通股份有限公司 | Random access channel signaling on shared communication medium |
| CN106060955A (en) * | 2016-05-17 | 2016-10-26 | 杨志军 | Method and system for controlling wireless sensor network MAC protocol polling based on three types of services |
| CN106060955B (en) * | 2016-05-17 | 2019-12-13 | 杨志军 | wireless sensor network MAC protocol polling control method based on three types of services |
| CN106060903A (en) * | 2016-07-18 | 2016-10-26 | 北京交通大学 | New load network access back-off method for wireless multi-hop collaborative network |
| CN106060903B (en) * | 2016-07-18 | 2019-05-28 | 北京交通大学 | A kind of new node networking back-off method of wireless multi-hop collaborative network |
| CN114884629B (en) * | 2016-07-19 | 2024-07-23 | 德克萨斯仪器股份有限公司 | Channel hopping aware channel access and retransmission |
| CN114884629A (en) * | 2016-07-19 | 2022-08-09 | 德克萨斯仪器股份有限公司 | Channel hopping aware channel access and retransmission |
| CN107969021B (en) * | 2016-10-19 | 2021-06-08 | 中南大学 | Efficient routing strategy between event and actuator based on differentiated service |
| CN107969021A (en) * | 2016-10-19 | 2018-04-27 | 中南大学 | A kind of high usage route strategy between event and actuator based on Differentiated Services |
| US11220033B2 (en) | 2017-02-08 | 2022-01-11 | Fundacio Eurecat | Computer implemented method for generating a mold model for production predictive control and computer program products thereof |
| CN108307439A (en) * | 2017-08-17 | 2018-07-20 | 上海大学 | A kind of self-adoptive retreating method under a large amount of multi-hop wireless nodes |
| CN109428951A (en) * | 2017-08-31 | 2019-03-05 | 亚瑞源科技（深圳）有限公司 | Address automatic allocating method in serial communication system |
| CN108541076A (en) * | 2018-06-08 | 2018-09-14 | 上海交通大学 | CSMA/CA multiple access methods based on gated polling system |
| CN108834219A (en) * | 2018-07-20 | 2018-11-16 | 东北电力大学 | S-MAC Protocol of Wireless Sensor Network optimization method based on adaptive-flow |
| CN108834219B (en) * | 2018-07-20 | 2021-05-25 | 东北电力大学 | Wireless sensor network S-MAC protocol optimization method based on flow self-adaption |
| CN110536473A (en) * | 2019-08-16 | 2019-12-03 | 中兴通讯股份有限公司 | Signaling method, device and storage medium |
| CN110536473B (en) * | 2019-08-16 | 2023-03-10 | 中兴通讯股份有限公司 | Signal transmission method, signal transmission device and storage medium |
| CN114339983A (en) * | 2021-12-31 | 2022-04-12 | 电子科技大学 | Time synchronization method for wireless self-organizing network |
| CN114390001A (en) * | 2022-01-18 | 2022-04-22 | 中国联合网络通信集团有限公司 | Non-delay sensitive service queuing method, service access control method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103313421B (en) | 2016-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103313421A (en) | Back off algorithm in medium access control protocol for multi-hop network and wireless sensor network | |
| Gobriel et al. | TDMA-ASAP: Sensor network TDMA scheduling with adaptive slot-stealing and parallelism | |
| Sitanayah et al. | ER-MAC: A hybrid MAC protocol for emergency response wireless sensor networks | |
| Huang et al. | RC-MAC: A receiver-centric MAC protocol for event-driven wireless sensor networks | |
| US20090207769A1 (en) | Method and apparatus for scheduling timing for communication between sensor nodes in wireless sensor network | |
| KR101386647B1 (en) | Methods and apparatus for paging in wireless communication networks | |
| CN102647805B (en) | Wireless sensor network transmission method based on medium access control (MAC) protocol | |
| Huang et al. | RC-MAC: A receiver-centric medium access control protocol for wireless sensor networks | |
| CN108307439B (en) | Self-adaptive back-off method under large number of multi-hop wireless nodes | |
| CN106792568B (en) | Energy optimization-based wireless sensor network hybrid Z-MAC protocol optimization method | |
| CN111132337B (en) | Lora communication method combining TDMA (time division multiple Access) and CSMA (Carrier sense multiple Access) mechanisms | |
| WO2015048620A2 (en) | Indicating a busy period in a wireless network | |
| Vermeulen et al. | Energy-delay analysis of full duplex wireless communication for sensor networks | |
| CN114641085A (en) | Self-adaptive back-off optimization method of CSMA/CA mechanism based on IEEE802.15.4 | |
| Guleria et al. | Asynchronous media access control protocols and cross layer optimizations for wireless sensor networks: An energy efficient perspective | |
| CN105007586A (en) | Two-factor based self-adaptive contention window adjusting method for SMAC protocol of wireless sensor network | |
| Singh et al. | A cross-layer MAC protocol for contention reduction and pipelined flow optimization in wireless sensor networks | |
| Liao et al. | A receiver-initiated MAC protocol for underwater acoustic sensor networks | |
| Nguyen et al. | MAC 2: a multi-hop adaptive MAC protocol with packet concatenation for wireless sensor networks | |
| RU2645599C2 (en) | Method of selecting nodes of multipoint retranslation | |
| Chaturvedi et al. | On the design of MAC protocol and transmission scheduling for Internet of Things | |
| Wang et al. | D-TDMA: An approach of dynamic TDMA scheduling for target tracking in wireless sensor networks | |
| CN108834219B (en) | Wireless sensor network S-MAC protocol optimization method based on flow self-adaption | |
| KR100846351B1 (en) | System for transmitting data in wireless sensor network based on virtual backbone | |
| Singh et al. | An improved TMAC protocol for wireless sensor 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 |