CN104780619B - The method of Wireless LAN Medium access control layer protocol based on collaboration communication - Google Patents
The method of Wireless LAN Medium access control layer protocol based on collaboration communication Download PDFInfo
- Publication number
- CN104780619B CN104780619B CN201510163632.4A CN201510163632A CN104780619B CN 104780619 B CN104780619 B CN 104780619B CN 201510163632 A CN201510163632 A CN 201510163632A CN 104780619 B CN104780619 B CN 104780619B
- Authority
- CN
- China
- Prior art keywords
- node
- frame
- data
- data frame
- source node
- 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
- 230000006854 communication Effects 0.000 title claims abstract description 32
- 238000004891 communication Methods 0.000 title claims abstract description 31
- 238000000034 method Methods 0.000 title claims abstract description 19
- 230000007246 mechanism Effects 0.000 claims abstract description 46
- 238000013461 design Methods 0.000 claims abstract description 18
- 230000005540 biological transmission Effects 0.000 claims description 52
- 239000011159 matrix material Substances 0.000 claims description 18
- 230000008569 process Effects 0.000 claims description 9
- 230000000694 effects Effects 0.000 claims description 8
- 230000008447 perception Effects 0.000 claims description 7
- 125000004122 cyclic group Chemical group 0.000 claims description 6
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 claims description 5
- 230000006870 function Effects 0.000 claims description 5
- 101000911390 Homo sapiens Coagulation factor VIII Proteins 0.000 claims description 3
- 239000012634 fragment Substances 0.000 claims description 3
- 102000057593 human F8 Human genes 0.000 claims description 3
- 230000010363 phase shift Effects 0.000 claims description 3
- 229940047431 recombinate Drugs 0.000 claims description 3
- 230000004044 response Effects 0.000 claims description 3
- 229920006395 saturated elastomer Polymers 0.000 claims description 3
- 230000017105 transposition Effects 0.000 claims description 3
- 238000012795 verification Methods 0.000 claims description 3
- 240000002853 Nelumbo nucifera Species 0.000 claims 1
- 235000006508 Nelumbo nucifera Nutrition 0.000 claims 1
- 235000006510 Nelumbo pentapetala Nutrition 0.000 claims 1
- 108700026140 MAC combination Proteins 0.000 abstract description 8
- 230000001965 increasing effect Effects 0.000 abstract description 3
- 238000012545 processing Methods 0.000 description 5
- 238000012790 confirmation Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000005855 radiation Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000009472 formulation Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000012857 repacking Methods 0.000 description 1
- 238000011160 research Methods 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
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
- H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1621—Group acknowledgement, i.e. the acknowledgement message defining a range of identifiers, e.g. of sequence numbers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1664—Details of the supervisory signal the supervisory signal being transmitted together with payload signals; piggybacking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/10—Small scale networks; Flat hierarchical networks
- H04W84/12—WLAN [Wireless Local Area Networks]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The method of the present invention provides a kind of Wireless LAN Medium access control layer protocol based on collaboration communication, the design work to the collaboration communication MAC protocol based on network code is mainly completed, mechanism involved in entire agreement includes: the Channel Access Mechanism of network code mechanism, frame format design and class distributed coordination function competition-based.The present invention provides a kind of novel collaboration communication MAC protocol based on network code, reduces access mechanism complexity, avoids the introducing of a large amount of control frames, has admirably been compatible with existing protocol, while effectively increasing network performance, has reduced the bit error rate.
Description
Technical field
The present invention relates to the MAC protocols of WLAN field, especially collaboration communication.
Background technique
WLAN (WLAN) is the computer communication network using wireless medium.In June, 1997, IEEE publication
802.11 standards, as international network interconnection agreement.The formulation and industry of standard, the common frequency that science and medical facility use
The opening of section (ISM band) has further pushed the rapid development of WLAN, is widely used.But WLAN is adopted
Caused by radio wave transmissions information decline and multipath effect be hinder channel capacity increase and service quality improve it is main
One of reason.
Collaboration communication by A.Sendonaris et al. document " User Cooperation Diversity, Part I:
System description [J] .IEEE Trans.onCommun, 2003,51 (11): the cooperation proposed in 1927-1938 "
The communication of algorithms has obtained huge concern, and has been increasingly becoming current one of research field with fastest developing speed, and core concept is
Carry out resource-sharing using between multiple nodes of a network, in the wireless network by the antenna using neighbor node come
The source node that cooperates carries out the transmission of data, is delayed end to end to improve throughput of system and reduce.Traditional wireless local area
Network MAC layer agreement uses the standard (IEEE of the wireless communication as defined in international motor electronic Engineering society (IEEE)
802.11MAC), main focus be solve the problems, such as exposed terminal and concealed terminal, but there is no considering in source and
The participation activity of neighbor node in destination node communication process.
Meanwhile earliest by R Ahlswede et al. in document " Network Information Flow.IEEE
Transactions on Information Theory, IT-46 46 (4): the network coding technique proposed in 1204-1216 "
It is an important breakthrough in recent years in Communication Studies field, provides new skill to improve the efficiency of transmission of wireless communication protocol
Art approach.Network coding technique increases coding link on the basis of the message transmission mode of tradition " storage forwarding ", by permitting
Perhaps nodes first encode the processing strategie sent afterwards to input information implementation, are changed into traditional information transmission mode
The new paragon of " storage-coding-forwarding ".Studies have shown that network code is improving network throughput, is improving load balancing, reduction
Transmission delay, saving node energy consumption, enhancing network robustness etc. all show its unique superiority, but network code pair
Physical hardware it is more demanding, need the estimated faster digital processing capabilities of higher operational capability.
Summary of the invention
In order to overcome the introducing of high, the excessive control frame of access mechanism design complexities in existing collaboration communication agreement and show
The low problem of the compatibility of some 802.11MAC agreements, the present invention are mainly completed to the collaboration communication MAC based on network code
The design work of agreement, mechanism involved in entire agreement include: network code mechanism, frame format design and competition-based
The Channel Access Mechanism of class distributed coordination function.
One, network code mechanism
Collaboration communication MAC (NCC-MAC) agreement uses random linear network encoding to improve own net performance, a frame
Valid data load have been partitioned into N number of subdivision, N is in network code by the divided number of data frame, it is assumed that is had
The overall length for imitating load is L bit, therefore the length l=L/N bit of each subdivision, original data are expressed as D=[d1,
d2,…,dN]T, wherein dn(n=1,2 ..., N) is n-th of subdivision, T representing matrix transposition；
Sending node, including source node or help node, are randomly generated the coefficient matrix C, C=of N × N rank first
[c1,c2,…,cN]T, the divided subdivision number of N, that is, data load, wherein cn=[cn1,cn2,…,cnN] it is known as coefficient
1 × N row vector of vector indicates linear between the coefficient vector once to N number of sub-portion Coded, N number of coefficient vector
Unrelated, data frame can be encoded into following form:
Wherein, D' indicates encoded data load, and D is original valid data load, dn' it is n-th of encoded son
Part, due to dn' and coefficient vector cnIt corresponds, therefore (dn',cn) it is one encoded right；
Since coefficient matrix C is not unique, and data can be encoded by other coefficient matrixes, therefore, as long as connecing
It is neat N number of encoded right that receiving end is collected, and the coefficient vector between N number of encoded pair is linearly uncorrelated, i.e. the order of coefficient matrix
Reach N, receiving end can be correctly decoded out initial data, it may be assumed that
D=C-1·D' (2)
Wherein C-1Indicate the inverse matrix of C；
N number of incoherent subdivision required for decoding mean the decoding process of initial data independent of it is specific certain
The either encoded subdivision of one coefficient matrix, so that this required N number of incoherent subdivision might not need
From source node and node can be helped to receive different subdivisions respectively from the same sending node, receiving node,
It is combined into a complete data frame, realizes correctly decoding；
In the initial phase of this environment and node, the present invention mainly uses the architecture system mould containing access node
Type, multiple node Node are randomly dispersed within the scope of access point access node can monitor, as shown in Figure 1, wherein Mei Gejie
Point greatest irradiation radius be R, i.e., nodal distance within the scope of R can be with mutual perception, can not perceive except, i.e., each other
Concealed terminal.In the whole process, network is in a saturated state, i.e., node has data to need to send always.
Each node location is fixed, and transmission power is certain.The operating mode of system and Typical Disposition according to
IEEE802.llb specification is configured, and node data transmission rate is set as 11Mbps, and modulation system selects quadrature phase shift keying
It is 50 μ s and slot time Slot Time is 20 μ s that the time span of QPSK, SIFS, which are defined as 10 μ s, DIFS,.It is moved back in index
It keeps away in the setting of relevant parameter, minimum competition window CWminIt is selected as 31 slot times, maximum contention window CWmaxIt is selected as
1023 slot times, maximum retransmission are set as 7 times, i.e., a data packet are at most only capable of retransmitting 7 times, when by 7 times
After transmission failure, which will be simply discarded；
Two, frame format designs
Data frame in existing 802.11 consensus standard is unable to satisfy the design requirement of NCC-MAC agreement, in order to carry
Wave realizes collaboration communication and network code on the basis of listening to multiple access/conflict avoidance (CSMA/CA), and the present invention is to existing
802.11 data frame and control frame carried out certain modification:
(A) data frame structure designs
Existing 802.11 mac frame format are as follows:
Wherein, the part frame control Frame Control has recorded the attribute of 802.11MAC, life cycle Duration/ID
It is mainly used in Virtual Carrier Sense mechanism, address Address1-Address4 respectively indicates the address of transmitting-receiving node,
Sequence Control sequence control field Seq-Ctrl is used to recombinate frame fragment and abandons repeating frame, and Frame Body is deposited
Put the effective data payload portion of user, Frame Check Sequence FCS enables work station to check the integrality of received frame；
On the basis of original data frame format, the present invention has carried out the amendment of following two points to frame format:
(A-1) Seq-Ctrl2, i.e. Sequence of equal length are added to after original Seq-Ctrl control word
Control2, to record the sequence number for helping the source node data transmitted in node, when the data for the transmission that do not want help
When, Seq-Ctrl2 is set to sky, and therefore, revised entirety frame format is as follows:
(A-2) data load and check part of original data frame have been partitioned into N number of in NCC-MAC data frame
Subdivision, wherein each subdivision includes one encoded pair and corresponding cyclic redundancy check position CRC, wherein verification
Position is specific as follows shown in data payload portion Frame body for verifying whether data are correctly received:
Wherein, 802.11 frame heads include the pervious corresponding information of payload in defined data frame format, each later
It is encoded to including encoded data load and corresponding coefficient vector in a subdivision；
(B) control signal frame designs
In order to meet the requirement of collaboration communication, is returned after having received data and show that the acknowledgement frame ACK being properly received is same
Sample needs to make corresponding adjustment, and original ACK frame format is as follows:
The part Frame Control corresponding part with data frame format, the attribute information containing 802.11MAC,
The effect of Duration is with life cycle in data frame, Duration/ID was identical, and Receiver Address is for indicating that ACK connects
The ID of node is received, FCS indicates that the Frame Check Sequence of the frame, the ACK frame in the present invention redefine as follows:
It is added to second reception address Address2 first, when receiving node receives source node simultaneously and helps node
Data frame when, need two addresses to identify the source-information for the data being properly received；It is deposited in Packet Information
Storage be corresponding received data frame correlation reception information, including the subdivision number that is properly received in the data frame and
Corresponding number of frames；
Three, class distributed coordination function DCF (Distributed Coordination Function) letter competition-based
Road access mechanism
The fundamental mechanism of channel access uses class CSMA/CA mechanism, it may be assumed that node first monitor channel before sending data；When
When node finds channel idle, start to execute exponential backoff mechanism；
Step 1: in NCC-MAC collaboration communication, source node sends the data frame with N number of subdivision first,
Node in source node transmission range, i.e. neighbor node start simultaneously at the data frame for receiving and having N number of subdivision, and will have N
The data frame of a subdivision is decoded, and is put into respective buffer area, at this point, neighbor node save for the help of source node
Point, meanwhile, other nodes for listening to source node transmission data will assert that channel is busy condition, and suspend itself and send data
The behavior of frame；
If access node be correctly received it is all using the encoded right of network code, will be in a short frame interval
The ACK control frame of a standard is replied after SIFS, the source node and source node for receiving ACK help nodes will accordingly
The data frame that buffer area is properly received and be buffered in from source node can be lost, a wheel transmission smoothly completes, and starts next round transmission；
If due to the interference of concealed terminal, access node has only had correctly received m1It is a encoded right, wherein 0≤m1<
N, can not correctly decode, then this transmission failure is assert, into step 2；
(1) source node S data transmission phase
(1-1) source node carries out network code, generates N to encoded right, completes data frame according to following format.
Wherein, the address of own node is set as in Address1, Address2 is set as access node address of node,
Seq-Ctrl records the sequence number of current data frame, and Seq-Ctrl2 is set as empty, valid data payload segment (Frame Body)
The 1st is stored respectively to n-th subdivision, and wherein each section includes one encoded pair and corresponding cyclic redundancy school
Test a CRC.
(1-2) source node sends data frame.When data frame is completed, index is first carried out in source node before transmitting
Avoidance mechanism, i.e. source node first will be from [0, CWmin] in randomly select an integer and multiplied by slot time (Slot Time)
The obtained time as initial time is kept out of the way, starts to keep out of the way.When channel is in idle condition and back off time countdown is to 0,
Source node starts to send data frame.
Due to the broadcast characteristic of wireless network, the neighbor node in source node radiation scope can also listen to data frame
Transmission.Therefore, neighbor node receives the data frame that access node is sent to from source node S.If in entire receive process
Without the interference of other signals, i.e. the concealed terminal of source node S sends data frame simultaneously, so that certain neighbor nodes receive simultaneously
When generating conflict to two data frames, the data frame being properly received is put into the buffer area of oneself by neighbor node.If generating
Conflict, neighbor node are then abandoned cooperating.Meanwhile if there is one in neighbor node buffer area from other nodes and having needed
When the data frame of cooperation, neighbor node still abandons this time received data frame, abandons cooperating, i.e. the node same time is only
Other nodes are helped to carry out collaboration communication.If the neighbor node being properly received determines that participating in this cooperates, the neighbours
Node becomes a help node of source node.
When data frame is sent completely, the ACK stages to be confirmed being properly received such as source node enters, and started to wait super
When timing.Time initialized waiting time TwaitIt is set as Twait=SIFS+TACK+TMa_x delay.Wherein, SIFS (Short
Interframe Space) indicate the smallest interframe space, TACKIt is the time transmitting ACK control frame and needing, TMax_delayIt indicates
The maximum delay due to caused by channel or other reasons is set as 30 μ s.
The waiting behavior of (1-3) other nodes.All detect leads to the node of channel busy due to sending data, all will be temporary
The avoidance mechanism for stopping itself initially enters wait state, waits ACK frame.If source node is waiting the ACK frame to be confirmed being properly received
After time-out, the ACK frame state to be broadcast such as likewise enter；
Step 2: the busy node to suspend transmission behavior of channel, including source section are listened to before all in step 1
Point and help node will all continue to suspend, until receiving the broadcast ACK frame sent by access node；
In the present invention, each node perceived channel clear simultaneously by access node sending control signal and
The control of own physical carrier sense mechanism, therefore, when access node channel perception is idle, i.e., no node is sent to access node
Data, all nodes are all in keeping out of the way or when wait state, access node will broadcast ACK frame；
Step 3: node and help nodes to receive broadcast ACK and when non-standard ACK frame, as transmission failure；This
When, all nodes complete two parts work as follows at this moment:
A) it determines channel clear, starts the channel idle response mechanism of original DCF standard；
B) data obtained in broadcast ACK are encoded to information, and the ID including sending node receives encoded pair of number
The sequence number of n and data frame, compare in the data frame that itself will send corresponding information to data frame re-encoded with
And delete work；
Wherein, step b) is primarily directed to the source node indicated in ACK and it helps node, and source node and help save
Point source node data will all be recompiled, generate new encoded pair and check bit, when source node find ACK frame
Middle data frame ID is itself, and sequence number is exactly when preparing the sequence number of the data frame retransmitted, and source node can leave out m1A data
Frame is encoded right, only transmits N-m1It is a encoded right, help nodes corresponding for source node, also according to doing for source node
Method reduces the encoded to number of source node data frame part, only transmits N-m therein1It is a encoded right, it generates by frame head, N-
m1The collaboration data frame that a encoded pair and corresponding check bit are constituted, source node and helps nodes all to complete data frame
Repack, as long as collecting neat N number of incoherent encoded right, data frame can be successfully decoded out in access node；
Step 4: when channel is completely idle, all nodes renew competition mechanism, including source node according to DCF standard
And the help node of collaboration data frame is carried, if source node wins the right to use of channel again, source node, which will be sent, to be passed through
The data frame deleted is recompiled, if one of help node to win the right to use, which will send the number that cooperates
According to frame, i.e., the data frame information of source node is transmitted in the data frame of itself, to complete collaborative task；
Still conflict again when retransmitting, it is assumed that it is m to number that it is encoded, which to retransmit the data being properly received, for kth timek(0≤mk< N,
K=1,2,3...), after access node receives work by k repeating transmission, collect altogetherIt is a encoded right, andBy network code principle it is found that access node can correctly solve the initial data from source node, and loopback mark
Quasi- ACK frame, indicates the successful reception of data frame.
The present invention provides a kind of novel collaboration communication MAC protocol based on network code, reduces access mechanism complexity
Property, the introducing of a large amount of control frames is avoided, existing protocol has admirably been compatible with, while effectively increasing network performance, is reduced
The bit error rate.Collaboration communication MAC protocol algorithm according to the present invention is simple, without the calculating of large amount of complex, is suitable for wireless
Deployment in local area network (WLAN)；Related collaboration method avoids the introducing of excessive control frame, and improve network executes effect
Rate, it is preferable to the compatibility of existing 802.11MAC agreement；Network code concept is applied to WLAN MAC Protocol
In design, an entire data frame is divided into data subdivision, substantially increased by the present invention according to the thought principle of network code
The utilization rate of conflict time, increases the handling capacity of network, improves network performance；MAC protocol according to the present invention can be compared with
The environment of more concealed terminals is adapted to well, and the mechanism of the broadcast ACK of proposition reduces the conflict between concealed terminal, reduces net
The collision probability of network；MAC protocol according to the present invention can not only work in the WLAN for having central node, while
Self-organizing peer to peer network (Ad-Hoc) is compatible with when design, the scope of application is wider.
Detailed description of the invention
Fig. 1 is network model figure locating for MAC protocol.
Fig. 2 is treatment mechanism schematic diagram when data portion is properly received.
Fig. 3 is broadcast ACK schematic diagram of mechanism.
Wherein, R indicates that node greatest irradiation radius, AP indicate that access point, i.e. other nodes are all clicked through to the access in Fig. 1
The transmission of row data frame, ACK indicate to feed back to the acknowledgement frame for sending hair, SIFS (Short after being properly received data frame
Interframe Space) indicate that the smallest interframe space, DIFS (DCF Interframe Space) indicate in DCF agreement
The time for needing to wait.
Specific embodiment
Present invention will be further explained below with reference to the attached drawings and examples.
One, network code mechanism
Collaboration communication MAC (NCC-MAC) agreement improves own net performance using random linear network encoding, different
In traditional data frame format, the valid data load of a frame has been partitioned into N number of subdivision, and N will be counted in network code
According to the divided number of frame, it is assumed that the overall length of payload is L bit, therefore the length l=L/N bit of each subdivision is former
The data of beginning can be expressed as D=[d1,d2,…,dN]T, wherein dn(n=1,2 ..., N) is n-th of subdivision, and T is indicated
Matrix transposition；
Sending node, including source node or help node, are randomly generated the coefficient matrix C, C=of N × N rank first
[c1,c2,…,cN]T, the divided subdivision number of N, that is, data load, wherein cn=[cn1,cn2,…,cnN] it is known as coefficient
1 × N row vector of vector indicates that, in the coefficient vector once to N number of sub-portion Coded, this N number of coefficient vector is each other
Linear independence, data frame can be encoded into following form:
Wherein, D is original valid data load, and D' indicates encoded data load, dn' it is n-th of encoded son
Part, due to dn' and coefficient vector cnIt corresponds, therefore (dn',cn) it is one encoded right；
Since coefficient matrix C is not unique, and data can be encoded by other coefficient matrixes, therefore,
As long as it is neat N number of encoded right that receiving end is collected, and the coefficient vector between them is linearly uncorrelated, i.e. the order of coefficient matrix reaches
To N, receiving end can be correctly decoded out initial data, it may be assumed that
D=C-1·D' (2)
Wherein C-1Indicate the inverse matrix of C；
N number of incoherent subdivision required for decoding mean the decoding process of initial data independent of it is specific certain
The either encoded subdivision of one coefficient matrix, so that this required N number of incoherent subdivision might not need
From source node and node can be helped to receive different subdivisions respectively from the same sending node, receiving node,
It is combined into a complete data frame, realizes correctly decoding.
In the initial phase of this environment and node, the present invention mainly uses the architecture system mould containing access node
Type, multiple node Node are randomly dispersed within the scope of access point access node can monitor, as shown in Figure 1, wherein Mei Gejie
Point greatest irradiation radius be R, i.e., nodal distance within the scope of R can be with mutual perception, can not perceive except, i.e., each other
Concealed terminal.In the whole process, network is in a saturated state, i.e., node has data to need to send always.
Each node location is fixed, and transmission power is certain.The operating mode of system and Typical Disposition according to
IEEE802.llb specification is configured, and node data transmission rate is set as 11Mbps, and modulation system selects quadrature phase shift keying
It is 50 μ s and slot time Slot Time is 20 μ s that the time span of QPSK, SIFS, which are defined as 10 μ s, DIFS,.It is moved back in index
It keeps away in the setting of relevant parameter, minimum competition window CWminIt is selected as 31 slot times, maximum contention window CWmaxIt is selected as
1023 slot times, maximum retransmission are set as 7 times, i.e., a data packet are at most only capable of retransmitting 7 times, when by 7 times
After transmission failure, which will be simply discarded.
Two, frame format designs
Data frame in existing 802.11 consensus standard can no longer meet the design requirement of NCC-MAC agreement, in order to
Collaboration communication and network code, the present invention couple are realized on the basis of Carrier Sense Multiple Access/conflict avoidance (CSMA/CA)
Existing 802.11 data frame and control frame has carried out certain modification.
(A) data frame structure designs
Existing 802.11 mac frame format are as follows:
Wherein, the part frame control Frame Control has recorded the attribute of 802.11MAC, life cycle Duration/ID
It is mainly used in Virtual Carrier Sense mechanism, address Address1-Address4 respectively indicates the address of transmitting-receiving node,
Sequence Control sequence control field Seq-Ctrl is used to recombinate frame fragment and abandons repeating frame, and Frame Body is deposited
Put the effective data payload portion of user, Frame Check Sequence FCS enables work station to check the integrality of received frame；
On the basis of original data frame format, the present invention has carried out the amendment of following two points to frame format:
(A-1) Seq-Ctrl2, i.e. Sequence of equal length are added to after original Seq-Ctrl control word
Control2, to record the sequence number for helping the source node data transmitted in node, when the data for the transmission that do not want help
When, Seq-Ctrl2 is set to sky, and therefore, revised entirety frame format is as follows:
(A-2) data load and check part of original data frame have been partitioned into N number of in NCC-MAC data frame
Subdivision, wherein each subdivision includes one encoded pair and corresponding cyclic redundancy check position CRC, wherein verification
Position is specific as follows shown in data payload portion Frame body for verifying whether data are correctly received:
Wherein, 802.11 frame heads include the pervious corresponding information of payload in defined data frame format, each later
It is encoded to including encoded data load and corresponding coefficient vector in a subdivision；
(B) control signal frame designs
In order to meet the requirement of collaboration communication, is returned after having received data and show that the acknowledgement frame ACK being properly received is same
Sample needs to make corresponding adjustment, and original ACK frame format is as follows:
The part Frame Control corresponding part with data frame format, the attribute information containing 802.11MAC,
The effect of Duration is with life cycle in data frame, Duration/ID was identical, and Receiver Address is for indicating that ACK connects
The ID of node is received, FCS indicates that the Frame Check Sequence of the frame, the ACK frame in the present invention redefine as follows:
It is added to second reception address Address2 first, when receiving node receives source node simultaneously and helps node
Data frame when, need two addresses to identify the source-information for the data being properly received；It is deposited in Packet Information
Storage be corresponding received data frame correlation reception information, including the subdivision number that is properly received in the data frame and
Corresponding number of frames；
Three, class DCF Channel Access Mechanism competition-based
The fundamental mechanism of channel access uses class CSMA/CA mechanism, it may be assumed that node first monitor channel before sending data；When
When node finds channel idle, start to execute exponential backoff mechanism；
Step 1: in NCC-MAC collaboration communication, source node sends the data frame with N number of subdivision first,
Node in source node transmission range, i.e. neighbor node, which start simultaneously at, receives these data frames, and these data frames are solved
Code, be put into respective buffer area, at this point, neighbor node in order to source node help node；
If access node be correctly received it is all using the encoded right of network code, will be in a short frame interval
The ACK control frame that a standard is replied after SIFS, the source node and corresponding help nodes for receiving ACK will be lost
The corresponding caching packet being successfully transmitted, a wheel transmission smoothly complete, and start next round transmission；
If due to the interference of concealed terminal, access node has only had correctly received m1It is a encoded right, wherein 0≤m1<
N, can not correctly decode, then this transmission failure is assert, into step 2；
(1) source node S data transmission phase
(1-1) source node carries out network code, generates N to encoded right, completes data frame according to following format.
Wherein, the address of own node is set as in Address1, Address2 is set as access node address of node,
Seq-Ctrl records the sequence number of current data frame, and Seq-Ctrl2 is set as empty, valid data payload segment (Frame Body)
The 1st is stored respectively to n-th subdivision, and wherein each section includes one encoded pair and corresponding cyclic redundancy school
Test a CRC.
(1-2) source node sends data frame.When data frame is completed, index is first carried out in source node before transmitting
Avoidance mechanism, i.e. source node first will be from [0, CWmin] in randomly select an integer and multiplied by slot time (Slot Time)
The obtained time as initial time is kept out of the way, starts to keep out of the way.When channel is in idle condition and back off time countdown is to 0,
Source node starts to send data frame.
Due to the broadcast characteristic of wireless network, the neighbor node in source node radiation scope can also listen to data frame
Transmission.Therefore, neighbor node receives the data frame that access node is sent to from source node S.If in entire receive process
Without the interference of other signals, i.e. the concealed terminal of source node S sends data frame simultaneously, so that certain neighbor nodes receive simultaneously
When generating conflict to two data frames, the data frame being properly received is put into the buffer area of oneself by neighbor node.If generating
Conflict, neighbor node are then abandoned cooperating.Meanwhile if there is one in neighbor node buffer area from other nodes and having needed
When the data frame of cooperation, neighbor node still abandons this time received data frame, abandons cooperating, i.e. the node same time is only
Other nodes are helped to carry out collaboration communication.If the neighbor node being properly received determines that participating in this cooperates, the neighbours
Node becomes a help node of source node.
When data frame is sent completely, the ACK stages to be confirmed being properly received such as source node enters, and started to wait super
When timing.Time initialized waiting time TwaitIt is set as Twait=SIFS+TACK+TMa_x delay.Wherein, SIFS (Short
Interframe Space) indicate the smallest interframe space, TACKIt is the time transmitting ACK control frame and needing, TMax_delayIt indicates
The maximum delay due to caused by channel or other reasons is set as 30 μ s.
The waiting behavior of (1-3) other nodes.All detect leads to the node of channel busy due to sending data, all will be temporary
The avoidance mechanism for stopping itself initially enters wait state, waits ACK frame.If source node is waiting the ACK frame to be confirmed being properly received
After time-out, the ACK frame state to be broadcast such as likewise enter.
If data frame is properly received by access node, enter stage (4-1), otherwise enters step 2.
Step 2: listening to the busy node to suspend transmission behavior of channel before all, including source node and help save
Point will all continue to suspend, until receiving the broadcast ACK frame sent by access node；
In the present invention, each node perceived channel clear simultaneously by access node sending control signal and
The control of own physical carrier sense mechanism, therefore, when access node channel perception is idle, i.e., no node is sent to access node
Data, all nodes are all in keeping out of the way or when wait state, access node will broadcast ACK frame；
(2-1) broadcasts ACK and retransmits the preparation stage
(2-1-1) broadcast ACK frame sends and receives.Since the node of multiple concealed terminals each other is simultaneously to access node
Data are sent, access node does not have correctly received the data frame from source node completely.But due to network code characteristic, access
Node still partially received correctly the m from source nodek(0≤mk< N, k=1,2 ...) it is a encoded right, wherein k expression connects
Receive the number of source node data frame (data can come from source node itself or the cooperation by helping node).Moreover, before
Accumulative reception it is encoded to numberIt can not be correctly decoded, therefore access node starts to generate pair as follows
The broadcast ACK frame answered.
Wherein the value of Receiver Address has been identified as broadcast address, and the ID of source node has been inserted in Address2
Value contains the sequence number of the source node data frame in Packet Information and has received mkA encoded pair
Information.
When not having node to send the i.e. channel idle of data to access node on channel, access node starts to broadcast
The ACK frame.Channel status is identified as the free time first, i.e. node can start after receiving broadcast ACK frame by all nodes
Or continue avoidance mechanism.
When (2-1-2) source node and the help node for being properly received source node data frame receive the ACK frame, detect
Address2 is identified as source node ID, therefore will be according to Packet Information information in frame to source node data frame
It is deleted accordingly.Since data frame is not properly received completely yet, data are re-started network code by source node, due to
Correctly received mkA encoded right, source node randomly selects N-m from newly-generated N number of encoded pair at randomkIt is a encoded right
And it is packaged into new data frame.Meanwhile node being helped then to be decoded the data frame being properly received, it is put into caching, then will
Obtained the data of same source node carries out identical processing, recompiles, after the N-m that will randomly selectkA source node data is
Coding is placed on itself before N number of encoded pair, constitutes the valid data payload segment in following collaboration data frame format.
In collaboration data frame frame head, the ID value for helping node is inserted in Address2, Address3 is configured to
The ID of source node, Seq-Ctrl record help the sequence number of node data frame, and Seq-Ctrl2 is set as the sequence of source node data frame
Row number.It should be noted that be not necessarily in data payload portion it is complete N number of encoded right, and be less than or equal to it is N number of
Coding pair.
Broadcast ACK frame is being received, after the packing for completing data frame, source node helps node and other all nodes
All enter the channel competition stage.
Step 3: node and help nodes to receive broadcast ACK and when non-standard ACK frame, as transmission failure；This
When, all nodes complete two parts work as follows at this moment:
A) it determines channel clear, starts the channel idle response mechanism of original DCF standard；
B) data obtained in broadcast ACK are encoded to information, and the ID including sending node receives encoded pair of number
The sequence number of n and data frame, compare in the data frame that itself will send corresponding information to data frame re-encoded with
And delete work；
Wherein, step b) is primarily directed to the source node indicated in ACK and it helps node, and source node and help save
Point source node data will all be recompiled, generate new encoded pair and check bit, when source node find ACK frame
Middle data frame ID is itself, and sequence number is exactly when preparing the sequence number of the data frame retransmitted, and source node can leave out m1A data
Frame is encoded right, only transmits N-m1It is a encoded right, for help nodes corresponding for source node, they also according to
The way of source node reduces the encoded to number of source node data frame part, only transmits N-m therein1It is a encoded right, it is raw
At by frame head, N-m1The collaboration data frame that a encoded pair and corresponding check bit are constituted, source node and helps nodes
Repacking for data frame is all completed, as long as collection is neat N number of incoherent encoded right, access node, which can be successfully decoded out, to be counted
According to frame；
(3-1) channel competition stage
In this stage, since the signal detection of concealed terminal is less than the behavior of concealed terminal will not influence source section
Point behavior, only considers the behavior of source node and its neighbor node herein.So mainly will appear following state:
(3-1-1) is if be this time other node busy channels that source node and help node can detect, source node
And helping node to listen to channel is busy, return step 2, waits ACK frame (broadcast ACK or standard ACK frame).
(3-1-2) is if source node competition takes the lead in sending data frame, then other neighbor nodes include help to the channel right to use
Node enters wait state, into initial source node transmission phase (1-2).
(3-1-3) helps node starts transmission data if node is helped to obtain the channel right to use first.In transmission,
The received data frame of access node may be not only the data frame of source node, it is also possible to receive the data for helping node.
(3-1-3-1) helps node to send data frame.When help node perceived channel idle and exponential backoff is over
When, help node to start to send the cooperation frame containing source node data and data, neighbor node listens to signal, assert
Channel enters busy condition, and pause is kept out of the way, into loitering phase.
The reception of (3-1-3-2) cooperation frame.When helping node to send cooperation frame, access node and its surrounding neighbours section
Point is possible to be properly received data frame.Due to the data frame be cooperation frame, no matter neighbor node be properly received with
No, neighbor node will all abandon the data frame.Access node shares following four for the reception condition of the data frame:
A) access node is properly received completely, i.e. source node data frame and help node data frame decodes completely, is obtained
When correct data, into (4-1), complete this time to cooperate.
B) access node reception failure, that is, be not properly received that any one is encoded right, then access node initially enters
Step 2 is ready for retransmitting, and this time mk=0,
C) access node only part received correctly the data frame of source node, i.e., this time has received mkIt is a encoded right.
If that accumulates is encoded right beforeAnd the respective linear independence of coefficient matrix, then access node can be correctly decoded, therefore
Access node enters (4-1), completes this time to cooperate.
D) access node received correctly the total data frame of source node, but part has received the m for helping node itselfk'
(0≤mk' < N) a encoded right, at this point, access node still enters (4-1), but there is still a need for sending to broadcast ACK frame, at this time not only
It needs to broadcast the information being properly received to source node data frame, also to identify to the reception condition for helping node.
Whether data frame it is complete reception or by the received accumulation in multiple part, access node will be correctly decoded
Source node data out, and have an opportunity to receive the data from node is helped, therefore will enter with the next stage.
Step 4: when channel is completely idle, all nodes renew competition mechanism, including source according to DCF standard
Node and the help node for carrying cooperation packet, if source node has won the right to use of channel again, source node will send and pass through
The data frame for recompiling and deleting is crossed, if one of help node to win the right to use, which will send and cooperate
Data frame transmits the data frame information of source node, that is, in the data frame of itself so as to complete collaborative task；
Still conflict again when retransmitting, it is assumed that it is m to number that it is encoded, which to retransmit the data being properly received, for kth timek(0≤mk< N,
K=1,2,3...), after access node receives work by k repeating transmission, collect altogetherIt is a encoded right, andBy network code principle it is found that access node can correctly solve the initial data from source node, and loopback mark
Quasi- ACK frame, indicates the successful reception of data frame
(4-1) is properly received processing stage
It is broadly divided into two kinds of situations:
The processing that (4-1-1) access node is properly received data.It is properly received data frame and is broadly divided into two kinds: a) only just
Really have received the data frame of source node；B) correct together or part has received help while being properly received source node data frame
The data frame of node.
(4-1-1-1) only source node data is correctly received.At this point, access node is by the ACK frame for the standard that sends, wherein
Receiver Address is identified as the ID of source node.
(4-1-1-2) source node is properly received, and when help node section reception, due to needing to inform connecing for two nodes
It collects mail and ceases, be used herein broadcast ACK frame to complete the task.In the ACK frame, Receiver Address is identified as source
The ID of node, Address2 are identified the ID in order to help node, store source node data in Packet Information
The information that frame is all properly received, and it is properly received the number letter of the sequence number and encoded pair that help node data
Breath.
(4-1-2) node receives each node of reaction mechanism after ACK frame and reacts the reception of broadcast ACK frame
When source node receives the ACK frame that confirmation is properly received, the data frame that source node will be deleted in the caching enters
Prepare the transmission work of next data frame.
When helping node to receive the received ACK frame of confirmation, node is helped first also to save the source being placed in buffer area
The data of point are abandoned, and this time cooperation terminates mark.Meanwhile if the ACK frame this time received is the format for broadcasting ACK frame,
And the address of Address2 be equal to the help node ID when, which will recompile the data load of transmission, record
Under encoded pair of number having correctly received, carry out deleting work such as stage (C-2) similar data subdivision number.
Meanwhile channel status is all identified as the free time after receiving ACK frame by all nodes, starts or continues to keep out of the way machine
System.
Claims (1)
1. a kind of method of the Wireless LAN Medium access control layer protocol based on collaboration communication, it is characterised in that including following
Step:
One, network code mechanism
Collaboration communication MAC (NCC-MAC) agreement uses random linear network encoding to improve own net performance, and a frame has
Effect data load has been partitioned into N number of subdivision, and N is by the divided number of data frame in network code, and valid data carry
The overall length of lotus is L bit, and the length l=L/N bit of each subdivision, original data are expressed as D=[d1,d2,…,dN]T,
Wherein dn(n=1,2 ..., N) is n-th of subdivision, T representing matrix transposition；
Sending node, including source node or help node, are randomly generated coefficient matrix C, the C=[c of N × N rank first1,
c2,…,cN]T, the divided subdivision number of N, that is, valid data load, wherein cn=[cn1,cn2,…,cnN] be known as be
1 × N row vector of number vector indicates the line between the coefficient vector once to N number of sub-portion Coded, N number of coefficient vector
Property is unrelated, and data frame can be encoded into following form:
Wherein, D' indicates encoded valid data load, and D is original valid data load, dn' it is n-th of encoded sub-portion
Point, dn' and coefficient vector cnIt corresponds, (dn',cn) it is one encoded right；
As long as it is neat N number of encoded right that receiving end is collected, and the coefficient vector between N number of encoded pair is linearly uncorrelated, that is, is
The order of matrix number reaches N, and receiving end can be correctly decoded out initial data, it may be assumed that
D=C-1·D' (2)
Wherein C-1Indicate the inverse matrix of C；
N number of incoherent subdivision required for decoding mean the decoding process of initial data independent of it is specific some
The either encoded subdivision of coefficient matrix, so that it is not absolutely required to come for this required N number of incoherent subdivision
From in the same sending node, receiving node from source node and can help node to receive different subdivisions, combine respectively
At a complete data frame, correctly decoding is realized；
In the initial phase of this environment and node, multiple node Node are randomly dispersed in the model that access point access node can be monitored
Within enclosing, the greatest irradiation radius of each node is R, i.e., nodal distance within the scope of R can nothing with mutual perception, except
Method perception, i.e. concealed terminal each other, in the whole process, network is in a saturated state, i.e., node has data to need to send always；
Each node location is fixed, and transmission power is certain, and the operating mode and Typical Disposition of system are advised according to IEEE802.llb
Model is configured, and node data transmission rate is set as 11Mbps, and modulation system selects quadrature phase shift keying QPSK, SIFS when
Between length to be defined as 10 μ s, DIFS be that 50 μ s and slot time Slot Time are 20 μ s, in exponential backoff relevant parameter
In setting, minimum competition window CWminIt is selected as 31 slot times, maximum contention window CWmax1023 slot times are selected as, most
Big number of retransmissions is set as 7 times, i.e., a data packet is at most only capable of retransmitting 7 times, after 7 transmission failure, the number
It will be simply discarded according to frame；
Two, frame format designs
(A) data frame structure designs
Existing 802.11 mac frame format are as follows:
Wherein, the part frame control Frame Control has recorded the attribute of 802.11MAC, and life cycle, Duration/ID was main
For in Virtual Carrier Sense mechanism, address Address1-Address4 to respectively indicate the address of transmitting-receiving node, Sequence
Control sequence control field Seq-Ctrl is used to recombinate frame fragment and abandons repeating frame, and Frame Body storage user has
The data payload portion of effect, Frame Check Sequence FCS enable work station to check the integrality of received frame；
On the basis of original data frame format, the present invention has carried out the amendment of following two points to frame format:
(A-1) Seq-Ctrl2, i.e. Sequence of equal length are added to after original Seq-Ctrl control word
Control2, to record the sequence number for helping the source node data transmitted in node, when the data for the transmission that do not want help
When, Seq-Ctrl2 is set to sky, and therefore, revised entirety frame format is as follows:
(A-2) data load and check part of original data frame have been partitioned into N number of sub-portion in NCC-MAC data frame
Point, wherein each subdivision includes one encoded pair and corresponding cyclic redundancy check position CRC, wherein check bit is used
Whether it is correctly received in verification data, specific as follows shown in data payload portion Frame body:
Wherein, 802.11 frame heads include the pervious corresponding information of payload in defined data frame format, later each height
It is encoded to including encoded data load and corresponding coefficient vector in part；
(B) control signal frame designs
In order to meet the requirement of collaboration communication, is returned after having received data and show that the acknowledgement frame ACK being properly received equally is needed
Corresponding adjustment is made, original ACK frame format is as follows:
The part Frame Control corresponding part, the attribute information containing 802.11MAC, Duration with data frame format
Effect with life cycle in data frame, Duration/ID was identical, Receiver Address is for indicating ACK receiving node
ID, FCS indicate that the Frame Check Sequence of the frame, the ACK frame in the present invention redefine as follows:
It is added to second reception address Address2 first, when receiving node receives source node simultaneously and helps the number of node
When according to frame, two addresses are needed to identify the source-information for the data being properly received；It is stored in Packet Information
It is the correlation reception information of corresponding received data frame, including the subdivision number being properly received in the data frame and correspondence
Number of frames；
Three, class distributed coordination function DCF (Distributed Coordination Function) channel competition-based connects
Enter mechanism
The fundamental mechanism of channel access uses class CSMA/CA mechanism, it may be assumed that node first monitor channel before sending data；Work as node
It was found that starting to execute exponential backoff mechanism when channel idle；
Step 1: in NCC-MAC collaboration communication, source node sends the data frame with N number of subdivision first, saves in source
Node in point transmission range, i.e., neighbor node starts simultaneously at the data frame for receiving and having N number of subdivision, and will have N number of son
Partial data frame is decoded, and is put into respective buffer area, at this point, neighbor node in order to source node help node,
Meanwhile other nodes for listening to source node transmission data will assert that channel is busy condition, and suspend itself and send data frame
Behavior；
If access node be correctly received it is all using the encoded right of network code, will a short frame interval SIFS it
The ACK control frame of a standard is replied afterwards, and the source node and source node for receiving ACK help nodes that will lose accordingly
The data frame of buffer area is properly received and is buffered in from source node, and a wheel transmission smoothly completes, and starts next round transmission；
If access node has only had correctly received m1It is a encoded right, wherein 0≤m1< N can not be correctly decoded, then be assert
This transmission failure, into step 2；
(1) source node S data transmission phase
(1-1) source node carries out network code, generates N to encoded right, completes data frame according to following format:
Wherein, the address of own node is set as in Address1, Address2 is set as access node address of node, Seq-
Ctrl records the sequence number of current data frame, and Seq-Ctrl2 is set as empty, and valid data payload segment (Frame Body) is respectively
The 1st is stored to n-th subdivision, wherein each section includes one encoded pair and corresponding cyclic redundancy check position
CRC；
(1-2) source node sends data frame；When data frame is completed, exponential backoff is first carried out in source node before transmitting
Mechanism, i.e. source node first will be from [0, CWmin] in randomly select an integer and obtained multiplied by slot time (Slot Time)
Time as keeping out of the way initial time, start to keep out of the way；When channel is in idle condition and back off time countdown is to 0, source section
Point starts to send data frame；
Neighbor node receives the data frame that access node is sent to from source node S, if not having other in entire receive process
The interference of signal, the i.e. concealed terminal of source node S send data frame simultaneously, so that certain neighbor nodes receive two numbers simultaneously
When generating conflict according to frame, the data frame being properly received is put into the buffer area of oneself by neighbor node；If generating conflict, neighbours
Node is then abandoned cooperating；Meanwhile if had in neighbor node buffer area one from other nodes and the number that needs to cooperate
When according to frame, neighbor node still abandons this time received data frame, abandons cooperating, i.e. the node same time only helps other
A node carry out collaboration communication；If the neighbor node being properly received determines that participating in this cooperates, the neighbor node
For a help node of source node；
When data frame is sent completely, the ACK stages to be confirmed being properly received such as source node enters, and started to wait time-out
Timing；Time initialized waiting time TwaitIt is set asWherein, SIFS (Short
Interframe Space) indicate the smallest interframe space, TACKIt is the time transmitting ACK control frame and needing, TMax_delayIt indicates
The maximum delay due to caused by channel or other reasons is set as 30 μ s；
The waiting behavior of (1-3) other nodes；All detect leads to the node of channel busy due to sending data, will all suspend certainly
The avoidance mechanism of body initially enters wait state, waits ACK frame；If source node is waiting the ACK frame timeout to be confirmed being properly received
Afterwards, the ACK frame state to be broadcast such as likewise enter；
Step 2: it is busy to suspend the node of transmission behavior to listen to channel before all in step 1, including source node and
Help node that will all continue to suspend, until receiving the broadcast ACK frame sent by access node；
When access node channel perception is idle, i.e., no node sends data to access node, all nodes all in keeping out of the way or
When wait state, access node will broadcast ACK frame；
Step 3: node and help nodes to receive broadcast ACK and when non-standard ACK frame, as transmission failure；At this point, institute
There is node to complete two parts work as follows at this moment:
A) it determines channel clear, starts the channel idle response mechanism of original DCF standard；
B) obtain broadcast ACK in data it is encoded to information, the ID including sending node, receive encoded pair number n with
And the sequence number of data frame, it compares corresponding information in the data frame that itself will send and data frame is re-encoded and deleted
Subtract work；
Wherein, step b) is primarily directed to the source node indicated in ACK and it helps node, source node and help nodes
Source node data will all be recompiled, and generate new encoded pair and check bit, when number in source node discovery ACK frame
It is itself according to frame ID, and sequence number is exactly when preparing the sequence number of the data frame retransmitted, source node can leave out m1A data frame is
Coding pair, only transmits N-m1A encoded right, help nodes corresponding for source node contract also according to the way of source node
Subtract the encoded to number of source node data frame part, only transmits N-m therein1It is a encoded right, it generates by frame head, N-m1It is a
The collaboration data frame that encoded pair and corresponding check bit are constituted, source node and helps nodes all to complete the weight of data frame
New to be packaged, as long as collection is neat N number of incoherent encoded right, data frame can be successfully decoded out in access node；
Step 4: when channel is completely idle, all nodes renew competition mechanism according to DCF standard, including source node and
The help node of collaboration data frame is carried, if source node wins the right to use of channel again, source node will be sent by again
The data frame deleted is encoded, if one of help node to win the right to use, which will send collaboration data frame,
The data frame information that source node is transmitted i.e. in the data frame of itself, to complete collaborative task；Still conflict again when retransmitting, it is false
If it is m to number that it is encoded, which to retransmit the data being properly received, for kth timek(0≤mk< N, k=1,2,3...), when access node is passed through
After k repeating transmission receives work, collect altogetherIt is a encoded right, andBy network code principle it is found that access section
Point can correctly solve the initial data from source node, and loopback standard ACK frame, indicate the successful reception of data frame.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510163632.4A CN104780619B (en) | 2015-04-08 | 2015-04-08 | The method of Wireless LAN Medium access control layer protocol based on collaboration communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510163632.4A CN104780619B (en) | 2015-04-08 | 2015-04-08 | The method of Wireless LAN Medium access control layer protocol based on collaboration communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104780619A CN104780619A (en) | 2015-07-15 |
| CN104780619B true CN104780619B (en) | 2018-12-14 |
Family
ID=53621763
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510163632.4A Expired - Fee Related CN104780619B (en) | 2015-04-08 | 2015-04-08 | The method of Wireless LAN Medium access control layer protocol based on collaboration communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104780619B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017041847A1 (en) * | 2015-09-10 | 2017-03-16 | Huawei Technologies Co., Ltd. | Client and access point communication devices and methods for random access communication |
| CN109906621B (en) | 2016-10-31 | 2021-01-29 | 华为技术有限公司 | Network entity and mobile communication device for providing communication services |
| CN107770873B (en) * | 2017-09-08 | 2018-09-04 | 温州大学 | A kind of optimal power contribution method of multi-user's linear network encoding cooperative system |
| CN113225828B (en) * | 2021-04-25 | 2022-06-21 | 西北工业大学 | WiFi-ZigBee network oriented cooperative transmission method |
| CN115379020B (en) * | 2022-08-08 | 2023-06-09 | 南京信息工程大学 | Embedded multi-machine communication protocol design method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494879A (en) * | 2009-03-05 | 2009-07-29 | 上海交通大学 | Intermedium control method capable of holding collaboration communication in wireless LAN |
| CN102740496A (en) * | 2012-07-30 | 2012-10-17 | 北京航空航天大学 | Uplink cooperative MAC (media access control) protocol for optimizing energy efficiency of system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101038804B1 (en) * | 2009-08-10 | 2011-06-07 | 성균관대학교산학협력단 | Method for cooperative communication in wireless lans |
-
2015
- 2015-04-08 CN CN201510163632.4A patent/CN104780619B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494879A (en) * | 2009-03-05 | 2009-07-29 | 上海交通大学 | Intermedium control method capable of holding collaboration communication in wireless LAN |
| CN102740496A (en) * | 2012-07-30 | 2012-10-17 | 北京航空航天大学 | Uplink cooperative MAC (media access control) protocol for optimizing energy efficiency of system |
Non-Patent Citations (1)
| Title |
|---|
| Distributed Cooperative MAC for Wireless Networks Based on Network Coding;Ruonan zhang,Qin Heng，etc;《IEEE wireless communication and Networking Conference》;20150312;正文第III-V节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104780619A (en) | 2015-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7394920B2 (en) | Communication devices, communication methods and integrated circuits | |
| US10623219B2 (en) | Multi-user communication in wireless networks | |
| US10880874B2 (en) | Method for transmitting a response request frame and a response frame in a multi-user based wireless communication system | |
| RU2586317C2 (en) | Improved fragmentation for long packets in low-speed wireless network | |
| CN104780619B (en) | The method of Wireless LAN Medium access control layer protocol based on collaboration communication | |
| CN104270822B (en) | Uplink space division multiple access operation method, equipment and computer storage medium | |
| US9433018B2 (en) | System and method for using SIC to solve WiFi collisions | |
| GB2510139A (en) | Method, apparatus and computer program for providing a transmission opportunity with HARQ | |
| CN106797661A (en) | Radio communication integrated circuit, wireless communication terminal and wireless communications method | |
| WO2006073038A1 (en) | Wireless communication apparatus | |
| US20230164831A1 (en) | Method and device for updating parameters in communication system supporting multi-link | |
| CN115152305A (en) | Request trigger frame and TXOP sharing initiated by NON-AP STA | |
| JP2013219687A (en) | Radio communication device, and radio communication method | |
| Antonopoulos et al. | Network coding-based cooperative ARQ scheme for VANETs | |
| CN104584626B (en) | For the improvement segmentation of long grouping in low-speed wireless network | |
| JP2023120277A (en) | Communication device and method | |
| WO2022131317A1 (en) | Station apparatus and access point apparatus | |
| CN105308998A (en) | Unlicensed frequency spectrum usage method and base station, and terminal | |
| WO2022270489A1 (en) | Communication device and communication method | |
| Lee | A MAC throughput in the wireless LAN | |
| WO2017114033A1 (en) | Method for determining transmission opportunity and access point | |
| WO2022254897A1 (en) | Communication device and communication method | |
| WO2023033184A1 (en) | Communication device and communication method | |
| US20240097859A1 (en) | Communication apparatus and communication method for multi-ap synchronous transmission | |
| JP2005072664A (en) | Wireless lan apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate 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: 20181214 Termination date: 20200408 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |