CN105704798B - A kind of implementation method of asynchronous class MAC protocol - Google Patents
A kind of implementation method of asynchronous class MAC protocol Download PDFInfo
- Publication number
- CN105704798B CN105704798B CN201610038555.4A CN201610038555A CN105704798B CN 105704798 B CN105704798 B CN 105704798B CN 201610038555 A CN201610038555 A CN 201610038555A CN 105704798 B CN105704798 B CN 105704798B
- Authority
- CN
- China
- Prior art keywords
- node
- mac
- data
- carry out
- 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.)
- Expired - Fee Related
Links
- 108700026140 MAC combination Proteins 0.000 title claims abstract description 24
- 238000000034 method Methods 0.000 title claims abstract description 18
- 230000007246 mechanism Effects 0.000 claims abstract description 33
- 230000005540 biological transmission Effects 0.000 claims abstract description 23
- 230000036578 sleeping time Effects 0.000 claims abstract description 16
- 230000003044 adaptive effect Effects 0.000 claims abstract description 13
- 238000004891 communication Methods 0.000 claims description 13
- 238000005265 energy consumption Methods 0.000 abstract description 16
- 238000004458 analytical method Methods 0.000 abstract description 9
- 238000004088 simulation Methods 0.000 abstract description 7
- 230000008901 benefit Effects 0.000 abstract description 5
- 230000006978 adaptation Effects 0.000 abstract description 3
- 208000032366 Oversensing Diseases 0.000 description 6
- 238000012360 testing method Methods 0.000 description 6
- 230000002618 waking effect Effects 0.000 description 4
- 230000007958 sleep Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000036961 partial effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000005059 dormancy Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008844 regulatory mechanism Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004622 sleep time Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of implementation methods of asynchronous class MAC protocol, the mechanism confirmed in advance using continuous short leading and receiving node, before sending node and receiving node realization are shaken hands, using coordination mechanism, the neighbor node with higher delivery rate is made to carry out data exchange with sending node in advance；Coordinated adaptive listening is carried out using cross talk phenomenon, makes cross-talk node after current transmission, wakes up carry out channel competition immediately, according to the service condition of data queue, carry out sleeping time adaptively adjusts node, and data cached more node is made to be easier to access channel；The present invention makes MAC protocol while improving channel utilization by coordination mechanism, coordinated adaptive listening mechanism, sleeping time adaptation mechanism, realizes low collision, low-power consumption and adaptive advantage.HP-MAC realizes high performance target, and by theory analysis and simulation results show, the performance indicators such as data delivery rate, time delay and energy consumption are superior to B-MAC and X-MAC.
Description
Technical field
The present invention relates to wireless sensor network technology field, specifically a kind of realization side of asynchronous class MAC protocol
Method.
Background technique
Wireless sensor network (Wireless Sensor Network, WSN) be one be made of sensor node it is more
Ad hoc network system is jumped, is had wide purposes at present.Channel access protocol (Media Access Control, MAC)
It directly determines how node accesses channel, has conclusive influence to upper-layer protocol, so optimization MAC protocol is to improve WSN
Important one of the means of performance.
It is required according to difference of the MAC protocol to clock, MAC protocol is divided into syncsort and asynchronous class.Syncsort MAC
Protocol requirement realizes a degree of time synchronization in WSN, if S-MAC needs to realize the time synchronization of same virtual cluster, and
TDMA needs to realize the time synchronization of entire WSN.Syncsort MAC protocol generally has preferable network performance, but time synchronization
The process of realization is typically complex, and is caused the scalability of network poor and is increased the additional energy of network.
Asynchronous class MAC protocol has no requirement to time synchronization, and such as B-MAC, which listens to technology using low-power consumption
(Low Power Listening, LPL) realizes low power loss communication, and uses clear channel assessment (CCA) mechanism (Clear Channel
Assessment, CCA) channel ruling is carried out, sending node before sending data packet before needing first to send one section of regular length
It leads, if receiving node listens to leading after waking up, keeps active state, become empty again until receiving data or channel
Not the problems such as until spare time, B-MAC does not need any time synchronizing information, but there is leading too long and neighbor node cross-talks.For
The long preambles of B-MAC are revised as a series of the short leading of fixed interval (FI)s, and benefit by the fixed problem of B-MAC preamble length, X-MAC
It is further reduced with the method for shifting to an earlier date acknowledgement frame (EarlyACK, EACK) progress data exchange by receiving node active transmission leading
Length, X-MAC considerably reduces leading length, is better than B-MAC by its transmission performance of simulating, verifying, but X-MAC is in net
It is lower to the channel utilization of network when network flow is larger.
Asynchronous class MAC protocol has many advantages, such as that easy to operate, dynamic is strong, favorable expandability, is WSN mono- preferable choosing
It selects.But such MAC protocol lacks time synchronization, causes channel that idle situation can discontinuously occur, in addition, in sending node and
Before receiving node is shaken hands, channel causes other nodes that can not access channel always by leading occupancy, this all affects the benefit of channel
With rate.
Summary of the invention
For the low problem of the generally existing channel utilization of above-mentioned asynchronous class MAC protocol, the present invention provides a kind of different
Walk the implementation method of class MAC protocol.
In order to solve the above technical problems, the technical solution adopted by the present invention are as follows:
A kind of implementation method of asynchronous class MAC protocol, the mechanism confirmed in advance using continuous short leading and receiving node,
Before sending node and receiving node realization are shaken hands, using coordination mechanism, shift to an earlier date the neighbor node with higher delivery rate and hair
Node is sent to carry out data exchange；Coordinated adaptive listening is carried out using cross talk phenomenon, makes cross-talk node after current transmission, immediately
It wakes up and carries out channel competition, according to the service condition of data queue, carry out sleeping time adaptively adjusts node, makes data cached
More node is easier to access channel；The coordination mechanism passes through the node facilitating communications ring with preferable communication environment
The poor node in border；The cross talk phenomenon, that is, cross-talk node obtains current data using the network allocation vector that control frame includes
The correct time terminated is exchanged, after current data exchange, is waken up immediately；
It includes the continuous short leading of receiving node Suc information that the sending node, which is sent, wherein the length of short leading space
Time needed for carrying out lightweight channel competition plus cooperative node equal to the time needed for node transmission control frame；Wherein Suc
For the success rate for sending data to the neighbor node, size is equal to the ratio for sending the total degree of successful number and transmission.
Beneficial effects of the present invention:
The implementation method (HP-MAC) of asynchronous class MAC protocol provided by the invention, using coordination mechanism, make sending node and
The preferable neighbor node collaboration communication of communication environment improves data delivery rate；Cross-talk node carries out coordinated adaptive listening, in current number
It is waken up immediately according to after the end of transmission, to reduce data delay；Node adjusts in real time according to the use ratio of local data queue
Sleeping time is reduced by the data of queue drop；Emulation shows to compare with B-MAC, X-MAC, and HP-MAC is improving channel usage
Under the premise of rate, data delivery rate is improved, data delay and network energy consumption are reduced；
The implementation method of asynchronous class MAC protocol provided by the invention passes through coordination mechanism, coordinated adaptive listening mechanism, sleep
Time adaptation mechanism makes MAC protocol while improving channel utilization, realizes low collision, low-power consumption and adaptively excellent
Point.HP-MAC realizes high performance target, passes through theory analysis and simulation results show, data delivery rate, time delay and energy
The performance indicators such as consumption are superior to B-MAC and X-MAC.
Detailed description of the invention
The implementation procedure figure of Fig. 1 coordination mechanism of the present invention；
The implementation procedure figure of Fig. 2 coordinated adaptive listening of the present invention；
Fig. 3 inventive network topological diagram；
The average delivered rate of Fig. 4 data of the present invention；
The average delay of Fig. 5 data of the present invention；
The average total energy consumption of Fig. 6 inventive network.
Specific embodiment
The present invention is further elaborated With reference to embodiment.
A kind of implementation method of asynchronous class MAC protocol, the mechanism confirmed in advance using continuous short leading and receiving node,
Before sending node and receiving node realization are shaken hands, using coordination mechanism, shift to an earlier date the neighbor node with higher delivery rate and hair
Node is sent to carry out data exchange；Coordinated adaptive listening is carried out using cross talk phenomenon, makes cross-talk node after current transmission, immediately
It wakes up and carries out channel competition, according to the service condition of data queue, carry out sleeping time adaptively adjusts node, makes data cached
More node is easier to access channel；The coordination mechanism passes through the node facilitating communications ring with preferable communication environment
The poor node in border；The cross talk phenomenon, that is, cross-talk node obtains current data using the network allocation vector that control frame includes
The correct time terminated is exchanged, after current data exchange, is waken up immediately.
Under normal conditions, node is randomly placed in monitoring region, this is easier some nodes by hiding section
The influence of point and exposed node directly contributes the delivery rate decline of the data of these nodes transmission.HP-MAC receiving node not
In the case where being waken up, alleviate influence of the communication environment to node using coordination mechanism in advance.
Shown in the realization procedure chart 1 of coordination mechanism.Firstly, all nodes need to maintain a neighbor list, such as 1 institute of table
Show, wherein Nei is the ID of neighbor node；Suc is the success rate for sending data to the neighbor node, and size, which is equal to, to be sent successfully
The ratio of number and the total degree of transmission, their value with network operation real-time update.
| Nei | Suc |
| 1 | 65% |
| 2 | 60% |
| … | … |
The composition of 1 neighbor list of table
It includes the continuous short leading of receiving node Suc information that sending node, which is sent, wherein the length of short leading space is equal to
Time needed for node transmission control frame (maximum time for being defined as all control frames) carries out lightweight letter plus cooperative node
Time needed for road competition.Sending node, if listening to the EACK of receiving node, sends data during idle listening.
If sending node listen to other neighbor nodes collaboration communication claim frame (Cooperation Request To Send,
CRTS after), judged using neighbor list, if the Suc of cooperative node is greater than the Suc of receiving node, corresponded to sending
Collaboration communication remove message (Cooperation Clear To Send, CCTS) after, continue send data packet, complete data
Exchange；If it is does not satisfy the condition, then ignoring the CRTS, continuous short leading carry out channel competition is sent.Receiving node is being listened to
To it is corresponding it is short it is leading after, send EACK, wait data to be received, complete data exchange.
Neighbor node listen to other nodes it is short it is leading after, judged using neighbor list, if receiving node
Suc be greater than it is short it is leading in include Suc, then send CRTS, apply to become cooperative node.In view of cooperative node may be done
The EACK for disturbing receiving node transmission, and may have multiple nodes to meet cooperation condition, so cooperative node is before sending CRTS,
Need to carry out the random back of lightweight.Cooperative node completes data exchange after receiving corresponding CCTS, with sending node,
Situations such as if there is EACK, CRTS, the CCTS for listening to other nodes and waiting CCTS overtime, is directly entered sleep state.
Do not need to cooperate without artis listen to other nodes it is short it is leading after, be directly transferred to sleep state.
Coordination mechanism is exactly the node by making to have the node facilitating communications environment of preferable communication environment poor, thus
Connect the delivery rate for improving data.The mechanism improves the utilization rate of channel by improving channel utilization rate and data delivery rate.
The coordinated adaptive listening process of cross-talk node is as shown in Figure 2.No artis is in the EACK for listening to other neighbor nodes
Or after CCTS, coordinated adaptive listening is carried out, i.e. cross-talk node utilizes the control frame network allocation vector (Network that includes
Allocation Vector, NAV) show that the correct time that current data exchange terminates is stood after current data exchange
Wake up.
Since the cross-talk node that can listen to EACK and CCTS unintentionally is seldom, so being needed as cooperative node
The cross-talk node for sending data only needs the random back for carrying out lightweight i.e. and short leading carry out channel competition can be transmitted, without
It only needs to listen to channel after sending the cross-talk waking up nodes of data.
The network flow of WSN has lack of uniformity, and the node in network load concentrated area can receive a large amount of data
Packet.Since the length of data queue of node is limited, partial data packet can be due to first in, first out (the First Input of data queue
First Output, FIFO) mechanism and be dropped.Under normal conditions, LPL is a regular time value, and agreement is to alleviate to be somebody's turn to do
Problem makes node adjust sleeping time in real time according to the service condition of data queue.
The pseudocode of the sleeping time algorithm of node is as shown in algorithm 1, wherein TLPLMade by node in the transmission of next data
Sleeping time；Tmax is the longest sleeping time of node, and size is equal to node and sends continuous short leading maximum duration；
QP is the use ratio of current data queue；Tmin is the most short sleeping time of node, and size is defined by the user.
Node determines the sleeping time of oneself by algorithm 1, makes the data cached positive competitive channel of more node, thus
By reducing the data packet being dropped since data queue is limited, data delivery rate and channel utilization are improved.
The main performances evaluation indexes such as the time delay, delivery rate, energy consumption of HP-MAC, and and B- are theoretically analyzed below
MAC and X-MAC are compared.
Delivery rate: for the asynchronous class MAC using LPL, the wake-up moment of node is uncertain.It is assumed that LPL when
Between be definite value, i.e. sleeping time is fixed, and is divided into W time slot, and wherein the size of time slot is equal to and waking up nodes and carries out
Time needed for idle listening, then node is 1/W in the probability that each time slot is waken up and is listened to, and node is in i-th of time slot
The probability of wake-up is i/W.It is assumed that the data queue of node is q there are the probability of data to be sent, then node is in i slot wakeup
And the probability for needing to send data is iq/W.When setting node needs to occupy t in total from transmission is leading to Successful transmissions data
Gap sets a jump range interior nodes total number as N (i.e. exposed node is N-1), and concealed nodes number is M, carries out following analysis.
For exposed node, if waking up before test node, then test node will be because of listening to channel busy
It is commonplace and be transferred to sleep.Therefore, analysis neighbor node does not need to carry out data transmission or the slot wakeup before test node
Probability be
For concealed nodes, test node is when sending data, if concealed nodes also carry out data transmission, that
This transmission of test node will the failure due to data collision.Therefore, analysis will not meet with during test node is sent
Meet the probability of concealed nodes interferenceIt is to obtain the node transmission successful probability of data
Since HP-MAC avoids the region that node is concentrated using coordination mechanism, so making compared with B-MAC and X-MAC
With the node of HP-MAC by much fewer than actual quantity (N-1) and M of exposed node and concealed nodes quantity.In addition, X-MAC
Shift to an earlier date affirmation mechanism using continuous leading and receiving node, so that its (N-1) and M are less than B-MAC, so PeHP-MAC>
PeX-MAC> PeB-MAC、PhHP-MAC> PhX-MAC> PhB-MAC, i.e. PHP-MAC> PX-MAC> PB-MAC, the delivery rate of HP-MAC is better than B-
MAC and X-MAC.
Time delay: time delay is exactly that data packet receives the data packet from the data queue for entering source node to destination node
Time.It jumps time delay by analysis one come the average delay of data, is mainly shaken hands the shadow of time by interdependent node
It rings.
In B-MAC, node needs to send the fixed long preambles of a segment length before sending data, so data packet is flat
Equal time delay is equal to node and sends leading set time length plus data packet be T in the delay of queueB-MAC=TLPL+
Tqueue-B。
It is short leading and affirmation mechanism reduces leading length and reduces preamble length in advance for X-MAC, so theoretically
Sending node needs TLPL/ 2 time shakes hands with receiving node, i.e., the average delay of data packet is THP-MAC< TLPL/2+
Tqueue-X。
For HP-MAC, since node is waken up using cross talk phenomenon in advance and using short leading and in advance affirmation mechanism subtracts
Few leading length, so theoretically sending node needs to be less than TLPL/ 2 time shakes hands with receiving node, i.e., data packet is flat
Equal time delay is THP-MAC< TLPL/2+Tqueue-H。
B-MAC, X-MAC and HP-MAC use the queue scheduling of FIFO, so queue time delay and node send data
Speed is closely coupled, and HP-MAC adjusts sleeping time according to the service condition of data queue in real time, i.e. Tqueue-H <
Tqueue-X < Tqueue-B, so THP-MAC< TX-MAC< TB-MAC, i.e., the average delay of HP-MAC is less than B-MAC and X-MAC.
Energy consumption: assuming that the reception power of node is Pr, transmission power is Ps, and listening to power is Pi, and node sends data packet
Required time Tda, to analyze consumed average energy when sending node and receiving node exchange single data packet.
For sending node, the average energy consumption that B-MAC sends single data packet is ESend-B=Ps* (TLPL+ Tda), X-
The energy consumption of MAC is ESend-X=Ps* (TLPL/ 2+Tda), and the energy consumption E of HP-MACSend-HP< Ps* (TLPL/ 2+Tda), i.e. ESend-HP
< ESend-X< ESend-B。
For receiving node, B-MAC receives the average energy consumption E of single data packetReceive-B=Pi*TLPL+ Pr*Tda, X-
The energy consumption of MAC is EReceive-X=Pi* (TLPL/ 2)+Pr*Tda, and the energy consumption E of HP-MACReceive-HP< Pi* (TLPL/2)+Pr*
Tda, i.e. EReceive-HP< EReceive-X< EReceive-B。
Analysis learns that the average energy consumption that HP-MAC exchanges single data packet is less than B-MAC and X-MAC.
HP-MAC protocol emulation analysis: for the performance for further verifying HP-MAC, using network media management NS2 to B-
The performance of MAC, X-MAC and HP-MAC carry out simulating, verifying.In simulations, source node generate CBR Business Stream, and ceaselessly to
SINK node is sent, and the business arrival time interval by changing CBR stream changes network load, to ensure the comparable of two agreements
Property, it is configured using simulation parameter as shown in Table 2.
2. partial simulation parameter setting of table
It is assumed that placed 50 nodes in the range of 1000m*1000m, as shown in Figure 3.The performance of research agreement, when changing
Change business arrival time interval changes to 10s from 1s, shows data volume from high to low.
Fig. 4 describes the variation of the average delivered rate of data packet, mainly hides section due to sending failure data
Data collision caused by point, and the coordination mechanism of HP-MAC reduces influence of the concealed nodes to node, and by adjusting sleeping
The dormancy time reduces the data packet abandoned by data queue, so delivery rate improves 120% or so compared with B-MAC, with X-
MAC is compared and is improved 13% or so.
Fig. 5 describes the variation of data packet average delay, it can be seen from the figure that due to HP-MAC using it is continuous it is short before
Lead, receiving node confirms in advance, cross-talk node self-adapting is listened to and sleeping time Regulation mechanism, to make holding for interdependent node
The hand time significantly reduces, so the time delay of HP-MAC reduces 50% or so compared with B-MAC, reduces compared with X-MAC
11% or so.
It is found in the simulation result that the network described from Fig. 6 is averaged total energy consumption, HP-MAC is by reducing the re-transmissions of data
Number and leading length, reduce network energy consumption, so HP-MAC reduces 35% or so network energy compared with B-MAC
Consumption, reduces 15% or so compared with X-MAC.
In addition, the performance indicators such as delivery rate, time delay, energy consumption of HP-MAC are obviously excellent in the biggish situation of network load
In B-MAC and X-MAC, with the increase for sending interval, the load of network is gradually decreased, the influence of concealed nodes and exposed node
It reduces therewith, the performance difference of all agreements tends towards stability.
The present invention provides a kind of high-performance MAC protocol: HP-MAC, the agreement by coordination mechanism, coordinated adaptive listening mechanism,
Sleeping time adaptation mechanism makes MAC protocol while improving channel utilization, realizes low collision, low-power consumption and adaptive
The advantages of.HP-MAC realizes high performance target, by theory analysis and simulation results show, data delivery rate, time delay and
The performance indicators such as energy consumption are superior to B-MAC and X-MAC.
Claims (2)
1. a kind of implementation method of asynchronous class MAC protocol, it is characterised in that: confirmed in advance using continuous short leading and receiving node
Mechanism, sending node and receiving node realization shake hands before, using coordination mechanism, mention the neighbor node with high delivery rate
It is preceding to carry out data exchange with sending node；Coordinated adaptive listening is carried out using cross talk phenomenon, terminates cross-talk node in current transmission
Afterwards, it wakes up immediately and carries out channel competition, according to the service condition of data queue, carry out sleeping time adaptively adjusts node, makes
Data cached more node is easier to access channel；The coordination mechanism is to assist to lead to by the node with good communication environment
Believe the node of environment difference；The cross talk phenomenon, that is, cross-talk node obtains current number using the network allocation vector that control frame includes
It is waken up immediately after current data exchange according to the correct time that exchange terminates.
2. the implementation method of asynchronous class MAC protocol as described in claim 1, it is characterised in that: the sending node sends packet
The information of Suc containing receiving node it is continuous short leading, wherein the length of short leading space be equal to node transmission control frame needed for when
Between plus cooperative node carry out lightweight channel competition needed for the time；Wherein Suc be send data to the neighbor node at
Power, size are equal to the ratio for sending the total degree of successful number and transmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610038555.4A CN105704798B (en) | 2016-01-21 | 2016-01-21 | A kind of implementation method of asynchronous class MAC protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610038555.4A CN105704798B (en) | 2016-01-21 | 2016-01-21 | A kind of implementation method of asynchronous class MAC protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105704798A CN105704798A (en) | 2016-06-22 |
| CN105704798B true CN105704798B (en) | 2019-06-18 |
Family
ID=56227674
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610038555.4A Expired - Fee Related CN105704798B (en) | 2016-01-21 | 2016-01-21 | A kind of implementation method of asynchronous class MAC protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105704798B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2618518A1 (en) * | 2003-10-15 | 2013-07-24 | QUALCOMM Incorporated | High speed media access control |
| CN103906207A (en) * | 2014-03-03 | 2014-07-02 | 东南大学 | Wireless sensor network data transmission method based on self-adaptation required awakening technology |
| CN104092523A (en) * | 2014-07-30 | 2014-10-08 | 东南大学 | Data transmission method for wireless sensor network in multi-flow competition scene |
| CN104853445A (en) * | 2015-06-01 | 2015-08-19 | 河南科技大学 | A broadcasting message based wireless sensor network MAC protocol |
| CN105208671A (en) * | 2015-09-30 | 2015-12-30 | 河南科技大学 | Implementation method for high channel utilization H-MAC protocol of wireless sensor network |
-
2016
- 2016-01-21 CN CN201610038555.4A patent/CN105704798B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2618518A1 (en) * | 2003-10-15 | 2013-07-24 | QUALCOMM Incorporated | High speed media access control |
| CN103906207A (en) * | 2014-03-03 | 2014-07-02 | 东南大学 | Wireless sensor network data transmission method based on self-adaptation required awakening technology |
| CN104092523A (en) * | 2014-07-30 | 2014-10-08 | 东南大学 | Data transmission method for wireless sensor network in multi-flow competition scene |
| CN104853445A (en) * | 2015-06-01 | 2015-08-19 | 河南科技大学 | A broadcasting message based wireless sensor network MAC protocol |
| CN105208671A (en) * | 2015-09-30 | 2015-12-30 | 河南科技大学 | Implementation method for high channel utilization H-MAC protocol of wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105704798A (en) | 2016-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3207761B1 (en) | Communication between devices of a neighbor aware network | |
| US8964619B2 (en) | Network assisted power management | |
| Chen et al. | Scheduling channel access based on target wake time mechanism in 802.11 ax WLANs | |
| CN108541047A (en) | The indicating means and equipment of downlink service data | |
| Ahmad et al. | Towards an Improved Energy Efficient and End‐to‐End Secure Protocol for IoT Healthcare Applications | |
| Malekshan et al. | An energy efficient MAC protocol for fully connected wireless ad hoc networks | |
| JP2010161772A (en) | Method for scheduling wake/sleep cycles by central device in wireless network | |
| TW200935818A (en) | System and method for power savings in a wireless communication network | |
| CN102006670B (en) | Dynamic polling medium access control method of emergency response supported sensor network | |
| Wu et al. | Named data networking enabled power saving mode design for WLAN | |
| Tseng et al. | Rotational listening strategy for IEEE 802.15. 4 wireless body networks | |
| CN105208671B (en) | The implementation method of high channel utilization rate H-MAC agreements for wireless sensor network | |
| Ding et al. | Research on the multi-channel probability detection CSMA protocol with sensor monitoring function | |
| Liang et al. | Energy-efficient DRX scheduling for multicast transmissions in 3GPP LTE-Advanced wireless networks | |
| CN105163394B (en) | The implementation method of service-aware SQ-MAC agreements for wireless sensor network | |
| Ho et al. | Dynamic GTS allocation scheme in IEEE 802.15. 4 by multi-factor | |
| Damdinsuren et al. | Lifetime extension based on residual energy for receiver-driven multi-hop wireless network | |
| CN104602280B (en) | The Distributed admission control method of low-power consumption body area network based on adaptive polling | |
| CN105704798B (en) | A kind of implementation method of asynchronous class MAC protocol | |
| Yang et al. | An energy efficient cross-layer MAC for wireless sensor networks | |
| Bhandari et al. | Study on improving the network life time maximazation for wireless sensor network using cross layer approach | |
| Xie et al. | An adaptive PSM mechanism in WLAN based on traffic awareness | |
| Hu et al. | RP-MAC: A passive MAC protocol with frame reordering for wireless sensor networks | |
| Wu et al. | An energy-efficient MAC protocol with downlink traffic scheduling strategy in IEEE 802.11 infrastructure WLANs | |
| Hsu et al. | An application-specific duty cycle adjustment MAC protocol for energy conserving over 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200612 Address after: 511400 Nansha street public collective household, Room 501, no.15-2, Yinchuan street, Nansha District, Guangzhou City, Guangdong Province Patentee after: Liu Guoying Address before: 471000 Xiyuan Road, Jianxi District, Henan, No. 48, No. Patentee before: HENAN University OF SCIENCE AND TECHNOLOGY |
|
| CP02 | Change in the address of a patent holder |
Address after: 242199 Room 501, Office Building of Market Supervision Bureau of Langchuan Avenue, Jianping Town, Langxi County, Xuancheng City, Anhui Province Patentee after: Liu Guoying Address before: 511400 Nansha street public collective household, Room 501, no.15-2, Yinchuan street, Nansha District, Guangzhou City, Guangdong Province Patentee before: Liu Guoying |
|
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 511400 Nansha street public collective house, Room 501, no.15-2, Yinchuan street, Nansha District, Guangzhou City, Guangdong Province Patentee after: Liu Guoying Address before: Room 501, office building, Langchuan Avenue, Jianping Town, Langxi County, Xuancheng City, Anhui Province Patentee before: Liu Guoying |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210425 Address after: 226600 No. 288 Changjiang West Road, Haian Town, Haian City, Nantong City, Jiangsu Province Patentee after: NANTONG HAIJIA ITELLIGENT TECHNOLOGY Co.,Ltd. Address before: 511400 Nansha street public collective household, Room 501, no.15-2, Yinchuan street, Nansha District, Guangzhou City, Guangdong Province Patentee before: Liu Guoying |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220328 Address after: 226600 No. 300, Baichuan Road, hi tech Zone, Hai'an City, Nantong City, Jiangsu Province Patentee after: Nantong saiyasi Technology Co.,Ltd. Address before: 226600 No.288, Changjiang West Road, Hai'an town, Hai'an City, Nantong City, Jiangsu Province Patentee before: NANTONG HAIJIA ITELLIGENT TECHNOLOGY Co.,Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190618 |