CN101291296B - Method for reducing media access collision of wireless local area network by cross-layer structure - Google Patents
Method for reducing media access collision of wireless local area network by cross-layer structure Download PDFInfo
- Publication number
- CN101291296B CN101291296B CN200810115267XA CN200810115267A CN101291296B CN 101291296 B CN101291296 B CN 101291296B CN 200810115267X A CN200810115267X A CN 200810115267XA CN 200810115267 A CN200810115267 A CN 200810115267A CN 101291296 B CN101291296 B CN 101291296B
- Authority
- CN
- China
- Prior art keywords
- message
- node
- sequence label
- node sequence
- buffering area
- 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
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000005540 biological transmission Effects 0.000 claims abstract description 58
- 238000012545 processing Methods 0.000 claims abstract description 17
- 230000003139 buffering effect Effects 0.000 claims description 49
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 claims description 16
- 230000002860 competitive effect Effects 0.000 claims description 9
- 238000005538 encapsulation Methods 0.000 claims description 6
- 238000009432 framing Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 8
- 238000004806 packaging method and process Methods 0.000 abstract 1
- 238000013461 design Methods 0.000 description 11
- 238000005516 engineering process Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 4
- 238000001228 spectrum Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a method for reducing media access conflict of a wireless local area network through cross-layer architecture, belonging to the computer communication field. The method comprises two parts of processing of node interception messages and processing of transmitted messages during the process of message transmission; a sequence mark is set for each node; following status information is stored in various nodes: node sequence marks used for transmission of the prior message of the nodes, node sequence marks of messages intercepted lately and physical addresses of the node sequence marks; node interception reads corresponding control information for all received messages; and the status that whether a transmitting buffer of the node is empty and a transmitting node sequence mark which is represented by a nonnegative integer are added into a message header during the process of packaging the messages into frames. The method fully utilizes the status information of the various nodes in the network through the cross-layer architecture to reduce the probability of the conflict in a small-scale wireless local area network and then further achieve the aim of improving the message capacity in the wireless local area network.
Description
Technical field
The invention belongs to computer communication field, the particularly communication in the radio packet network relates to conflict in the middle and small scale WLAN (wireless local area network) that adopt to share medium access and avoids the problem that improves with message capacity.
Background technology
WLAN (wireless local area network) (english abbreviation is WLAN), it is a kind of short-distance wireless block data communication technology, be applicable to that in public arenas such as library, airport the terminal for flowing provides the network insertion service or set up communication network fast in the environment that can not connect up, and has stronger flexibility and application prospects.
At present the wireless local area network technology that adopts in China mainly is technical standards such as the physical layer formulated in the IEEE802.11 series standard and media interviews control.Aspect media interviews control, this technology has adopted carrier sense media interviews (CSMA/CA) the channel competition mechanism that has collision avoidance mechanism, can be subdivided into point coordination function (PCF) and distributed coordination function (DCF) according to whether adopting Centroid to dispatch; Each node uses identical frequency spectrum resource to communicate in DCF mechanism, wireless channel is carried out STDM, adopt competition mechanism that channel resource is distributed, method for channel allocation in the similar Ethernet, but added the function that conflict is avoided, concrete channel allocation is: when node has message to send, at first channel is intercepted, the state of supervisory channel, if channel idle, then random back a period of time,, otherwise keep out of the way timer when detecting the occupied then locking of channel if the channel continuous idle is then carried out the transmission of message after keeping out of the way the phase end in backoff procedure, idle once more up to detecting channel, the operation of timer is kept out of the way in recovery, and up to keeping out of the way the timer timing to zero and channel idle, node carries out the transmission of message so repeatedly.
The base unit of keeping out of the way the timer timing is a time slot, and detect needs to wait for after the channel idle could start behind the DCF interFrameGap (DIFS) and keep out of the way timer at every turn.The length of DIFS is short interFrameGap (SIFS) and a slot length sum.SIFS has considered that wireless signal propagates the time factor that needs and the time span of the different frame of setting distinguished in the space.Keep out of the way the initialization of timer and use the definite number of waiting for time slot of equally distributed integer between [0, CW-1], wherein CW becomes the requisition window, is one of parameter of medium access control protocol.The length of time slot and SIFS is set accordingly according to the modulation system of physical layer and the frequency spectrum resource of use, in the IEEE802.11 series standard these is had more detailed explanation.
In above-mentioned DCF medium access mechanism, the message that relies on being chosen at random of channel status detection and back off time to avoid a plurality of nodes to carry out the message transmission to a certain extent in the synchronization scope and cause sends the generation of unsuccessful incident, this a plurality of node by chance is chosen in the incident of carrying out the message transmission in the synchronization scope and causing message to send failure and is called as conflict, the number that will send the message node in the probability that conflict takes place and the network is relevant, when the load of network heavier, when having a large amount of nodes will carry out the message transmission, the likelihood ratio that conflict takes place is bigger, has seriously influenced the message capacity in the WLAN (wireless local area network).
Communication issue for WLAN (wireless local area network), a kind of utilizable character that exists is exactly the broadcast characteristic of wireless channel, because the reception of each node is all adopted identical frequency spectrum resource with sending, the frame of a node transmission can be received by nodes all in the WLAN (wireless local area network).Can utilize this character in the transmission of each frame, to add other nodes in the specific control information notice WLAN (wireless local area network), can improve the communication capacity of WLAN (wireless local area network).
In traditional network architecture design, in order to simplify the function design, the general structure that adopts hierarchical design, as OSI7 layer model and TCP/IP framework, the design of these layerings packet network in early days plays important effect, but along with the particularly development of wireless network of modern network technology, the limitation of hierarchical design progressively displays, isolated design between each layer has influenced further developing of network technology, under this background, the thought of striding layer design is not designed the person gradually and accepts, and becomes the focus of modern wireless network research.The main thought of striding layer design is to carry out the fusion between layer and the layer or make carrying out more alternately between layer and the layer at the characteristics of network, realizes better network service effect, among the present invention also based on striding a layer thought that designs.
Carry out in the process of message transmission at node, usually also can some messages to be sent of buffer memory in buffering area, this data production process with node is relevant, for the transmission of some data application as video data, when after encoding, transmitting with frame of video, because data volume is bigger, the data of this frame of video can be broken down into a plurality of different network layer messages, these messages can be sent to the transmission buffering area and store, can both in time obtain the transmission buffering area situation of this node when each physical layer frame is sent, this method is striden in layer research of design at some has certain application.
Summary of the invention
The objective of the invention is the problem that clashes in the communication that solves WLAN (wireless local area network), a kind of method that reduces media access collision of wireless local area network by cross-layer structure is proposed, the present invention can realize the combined optimization of media access layer and network layer, can effectively reduce conflict and unnecessary keeping out of the way, improve utilization ratio channel.
A kind of method that reduces media access collision of wireless local area network by cross-layer structure of the present invention, this method is included in processing two parts that node in the message transmission procedure is intercepted the processing behind the message and sent message, it is characterized in that, each node is provided with the node sequence label, each intra-node is preserved following state information: the last message of this node sends employed node sequence label, and the last time listens to the node sequence label and the physical address thereof of message;
Described node is intercepted to the message that all are received and is read its corresponding control information, two kinds of control informations are joined together the stem of message in the process of message encapsulation framing, whether the transmission buffering area that these two kinds of control informations are respectively this nodes is empty state and sending node order label that nonnegative integer is represented;
Described node listens to the processing behind any one message, may further comprise the steps:
11) judge at first whether listen to message states and send the buffering area non-NULL, if the statement non-NULL, then this node is not had in next round and keep out of the way the physical address that needs in the circulation to wait for and be made as the current physical address that listens to message;
12) judge the residing state of present node,, then carry out CSMA/CA and keep out of the way rule, suspend and keep out of the way timer that wait for that this intercepts to restart after the acceptance and keep out of the way timer, this message is intercepted processing and finished if node is in the CSMA/CA backoff procedure; If node has been held the node sequence label and has been in the wait transmit status, then forward step 13) to;
13) judge whether the message listen to comes from the physical address that epicycle is waited in sending, if then finish the back and wait for the transmission of carrying out message after SIFS at interval waiting for that this is intercepted; Otherwise wait for after this intercepts end and proceed to intercept next time;
Described node sends the processing of message, may further comprise the steps:
21) judge whether present node rigidly connects into network and intercept that if then continue to intercept the length of channel 2 * CW time slot, press the mode competitive channel of CSMA/CA agreement afterwards, the access right up to obtaining channel forwards step 22 to);
Otherwise judge whether present node has held the node sequence label, if do not hold the node sequence label then by the mode competitive channel of CSMA/CA agreement, access right up to obtaining channel forwards step 22 to), then forward step 24 to if hold the node sequence label);
22) obtain current transmission buffer state, judge in the current transmission buffering area whether to be empty, if current transmission buffering area forwards step 23 to for the empty node sequence label that then the node sequence label in this message is made as the message that the last time listens to); If current transmission buffering area non-NULL, then the node sequence label of this message is made as the node sequence label that the last time listens to message and adds 1, forward step 23 to);
23) with the node sequence label with send the head that buffer state adds message to be sent to, and send the process of transmitting that message finishes this message,, then forward step 21 to if still have message to be sent in the buffering area) carry out the message process of transmitting of a new round;
24) judge whether the node sequence label of being held is 0, if the node sequence label is 0 and forwards step 25 to) otherwise forward step 26 to);
25) press the mode competitive channel of CSMA/CA agreement, up to the access right that obtains channel, use the head of the message to be sent of current transmission buffer state and 0 interpolation of node sequence label, and send the process of transmitting that message finishes this message, forward step 26 to); If still have message to be sent in the buffering area, then forward step 21 to) carry out the message process of transmitting of a new round;
26) wait for that the node of holding the corresponding physical address of last node sequence label sends message, obtains to forward step 27 to behind this message);
27) obtain the node sequence label that the node of holding the corresponding physical address of last node sequence label sends new statement in the message, judge whether this node sequence label is 0, if this node sequence label is 0 and forwards step 28 to); Otherwise forward step 29 to);
28) obtain the node of holding the corresponding physical address of last node sequence label and send the buffer state that illustrates in the message, if the node that illustrates in this message sends buffering area and then this node sequence label that sends message is made as 0 for empty, otherwise this node sequence label that sends message is made as 1; Forward step 210 to)
29) obtain current buffer state, judge in the current transmission buffering area whether to be empty, if current transmission buffering area forwards 210 to for the empty node sequence label that then the node sequence label in this message is made as the message that the last time listens to); If current transmission buffering area non-NULL, then the node sequence label of this message is made as the node sequence label that the last time listens to message and adds 1, forward step 210 to);
210) node sequence label and current transmission buffer state are added to the head of message to be sent, wait for the SIFS time interval and send the process of transmitting that message finishes this message, if still have message to be sent in the buffering area, then forward step 21 to) carry out the message process of transmitting of a new round.
Above-mentioned steps 22), obtain current buffer state 29), specifically can be divided into two kinds of implementations, a kind of is thereby that the state that will send buffering area downwards in the process of will the network layer message transmitting obtains this method as parameter adjoint network layer message transmission downwards together and is included in the message transmission procedure, node is intercepted the processing behind the message and is sent processing two parts of message; Another kind is to make the transmission buffering area that the interface that can inquire about is provided, and media access layer can be inquired about the transmission buffering area in the process of carrying out the message encapsulation fast obtain current buffer state.
The principle of the invention
The present invention will improve existing wireless local area network technology by cross-layer structure, design the working method of new media access control, and the probability that can avoid conflict to a certain extent and occur improves the message capacity of WLAN (wireless local area network) on the whole.Basic principle of the present invention is that the state of current transmission buffering area (sky or non-NULL) is added in the stem that sends message as control information, utilizes the broadcast characteristic of wireless channel to make each node can both obtain this information; The node that has a large amount of messages to send in a period of time is called live-vertex, next whether other node will have message to send this information in one period to each node in the current network by understanding, self-organizing ground forms live-vertex and sends ring, carrying out message in the message process of transmitting of next round efficiently sends, reduce the to conflict probability that takes place and reduce unnecessary backoff procedure improves the message capacity of network.
Characteristics of the present invention and beneficial effect:
Main contribution of the present invention is that the broadcast characteristic of using cross-layer structure and utilizing wireless network has designed the working method of new media access control.
1. only need carry out minor modifications to existing architecture and related protocol just can significantly reduce the probability that conflict takes place in the radio local network environment and avoid unnecessary keeping out of the way to a certain extent.
2. algorithm is simple, and computation complexity is little, is easy to realize.
3. each node only need be preserved a spot of state information, realizes that cost is lower.
4. under any circumstance, this method all can improve the throughput of whole network than the more effective work of prior protocols.
Description of drawings
Fig. 1 is the process flow block diagram after node of the present invention listens to any one message;
Fig. 2 is the process flow block diagram that node of the present invention sends message;
Embodiment
A kind of method by cross-layer structure minimizing media access collision of wireless local area network that the present invention proposes reaches embodiment in conjunction with the accompanying drawings and is described in detail as follows:
The inventive method is included in processing two parts that node in the message transmission procedure is intercepted the processing behind the message and sent message, it is characterized in that, each node is provided with the order label, each intra-node is preserved following state information: the last message of this node sends employed node sequence label, and the last time listens to the node sequence label and the physical address thereof of message;
Described node is intercepted to the message that all are received and is read its corresponding control information, two kinds of control informations are joined together the stem of message in the process of message encapsulation framing, whether the transmission buffering area that two kinds of control informations are respectively this nodes is empty state and sending node order label that nonnegative integer is represented;
Described node listen to behind any one message handling process as shown in Figure 1, may further comprise the steps:
11) judge at first whether listen to message states and send the buffering area non-NULL, if the statement non-NULL, then this node is not had in next round and keep out of the way the physical address that needs in the circulation to wait for and be made as the current physical address that listens to message;
12) judge the residing state of present node,, then carry out CSMA/CA and keep out of the way rule, suspend and keep out of the way timer that wait for that this intercepts to restart after the acceptance and keep out of the way timer, this message is intercepted processing and finished if node is in the CSMA/CA backoff procedure; If node has been held nodal scheme and has been in the wait transmit status, then forward step 13) to;
13) judge whether the message listen to comes from the physical address that epicycle is waited in sending, if then finish the back and wait for the transmission of carrying out message after SIFS at interval waiting for that this is intercepted; Otherwise wait for after this intercepts end and proceed to intercept next time;
Described node sends the handling process of message, as shown in Figure 2, may further comprise the steps:
21) judge whether present node rigidly connects into network and intercept that if then continue to intercept the length of channel 2 * CW time slot, press the mode competitive channel of CSMA/CA agreement afterwards, the access right up to obtaining channel forwards step 22 to);
Otherwise judge whether present node has held the node sequence label, if do not hold the node sequence label then by the mode competitive channel of CSMA/CA agreement, access right up to obtaining channel forwards step 22 to), then forward step 24 to if hold the node sequence label);
22) obtain current transmission buffer state, judge in the current transmission buffering area whether to be empty, if current transmission buffering area forwards step 23 to for the empty node sequence label that then the node sequence label in this message is made as the message that the last time listens to); If current transmission buffering area non-NULL, then the node sequence label of this message is made as the node sequence label that the last time listens to message and adds 1, forward step 23 to);
23) with the node sequence label with send the head that buffer state adds message to be sent to, and send the process of transmitting that message finishes this message,, then forward step 21 to if still have message to be sent in the buffering area) carry out the message process of transmitting of a new round;
24) judge whether the node sequence label of being held is 0, if the node sequence label is 0 and forwards step 25 to) otherwise forward step 26 to);
25) press the mode competitive channel of CSMA/CA agreement, up to the access right that obtains channel, use the head of the message to be sent of current transmission buffer state and 0 interpolation of node sequence label, and send the process of transmitting that message finishes this message, forward step 26 to); If still have message to be sent in the buffering area, then forward step 21 to) carry out the message process of transmitting of a new round;
26) wait for that the node of holding the corresponding physical address of last node sequence label sends message, obtains to forward step 27 to behind this message);
27) obtain the node sequence label that the node of holding the corresponding physical address of last node sequence label sends new statement in the message, judge whether this order label is 0, if this label is 0 and forwards step 28 to); Otherwise forward step 29 to);
28) obtain the node of holding the corresponding physical address of last node sequence label and send the buffer state that illustrates in the message, if the node that illustrates in this message sends buffering area and then this order label that sends message is made as 0 for empty, otherwise this order label that sends message is made as 1; Forward step 210 to)
29) obtain current buffer state, judge in the current transmission buffering area whether to be empty, if current transmission buffering area forwards 210 to for the empty node sequence label that then the node sequence label in this message is made as the message that the last time listens to); If current transmission buffering area non-NULL, then the node sequence label of this message is made as the node sequence label that the last time listens to message and adds 1, forward step 210 to);
210) node sequence label and current transmission buffer state are added to the head of message to be sent, wait for the SIFS time interval and send the process of transmitting that message finishes this message, if still have message to be sent in the buffering area, then forward step 21 to) carry out the message process of transmitting of a new round.
Above-mentioned steps 22), 29) in obtain current buffer state, specifically can be divided into two kinds of implementations, a kind of is will send the state of buffering area downwards in the process of will the network layer message transmitting as parameter adjoint network layer message transmission downwards together; Another kind is to make the transmission buffering area that the interface that can inquire about is provided, and media access layer can be inquired about the transmission buffering area in the process of carrying out the message encapsulation fast obtain current buffer state.
Claims (3)
1. method that reduces media access collision of wireless local area network by cross-layer structure, this method is included in processing two parts that node in the message transmission procedure is intercepted the processing behind the message and sent message, it is characterized in that, each node is provided with the node sequence label, each intra-node is preserved following state information: the last message of this node sends employed node sequence label, and the last time listens to the node sequence label and the physical address thereof of message;
Described node is intercepted to the message that all are received and is read its corresponding control information, two kinds of control informations are joined together the stem of message in the process of message encapsulation framing, whether the transmission buffering area that these two kinds of control informations are respectively this nodes is empty state and sending node order label that nonnegative integer is represented;
Described node listens to the processing behind any one message, may further comprise the steps:
11) judge at first whether listen to message states and send the buffering area non-NULL, if the statement non-NULL, then this node is not had in next round and keep out of the way the physical address that needs in the circulation to wait for and be made as the current physical address that listens to message;
12) judge the residing state of present node,, then carry out CSMA/CA and keep out of the way rule, suspend and keep out of the way timer that wait for that this intercepts to restart after the end and keep out of the way timer, this message is intercepted processing and finished if node is in the CSMA/CA backoff procedure; If node has been held the node sequence label and has been in the wait transmit status, then forward step 13) to;
13) judge whether the message listen to comes from the physical address that epicycle is waited in sending, if then finish the back and wait for the transmission of carrying out message after SIFS at interval waiting for that this is intercepted; Otherwise wait for after this intercepts end and proceed to intercept next time;
Described node sends the processing of message, may further comprise the steps:
21) judge whether present node rigidly connects into network and intercept that if then continue to intercept the length of channel 2 * CW time slot, press the mode competitive channel of CSMA/CA agreement afterwards, the access right up to obtaining channel forwards step 22 to);
Otherwise judge whether present node has held the node sequence label, if do not hold the node sequence label then by the mode competitive channel of CSMA/CA agreement, access right up to obtaining channel forwards step 22 to), then forward step 24 to if hold the node sequence label);
22) obtain current transmission buffer state, judge in the current transmission buffering area whether to be empty, if current transmission buffering area forwards step 23 to for the empty node sequence label that then the node sequence label in this message is made as the message that the last time listens to); If current transmission buffering area non-NULL, then the node sequence label of this message is made as the node sequence label that the last time listens to message and adds 1, forward step 23 to);
23) with the node sequence label with send the head that buffer state adds message to be sent to, and send the process of transmitting that message finishes this message,, then forward step 21 to if still have message to be sent in the buffering area) carry out the message process of transmitting of a new round;
24) judge whether the node sequence label of being held is 0, if the node sequence label is 0 and forwards step 25 to) otherwise forward step 26 to);
25) press the mode competitive channel of CSMA/CA agreement,, uses the head of the message to be sent that current transmission buffer state and node sequence label 0 add, and the transmission message finishes the process of transmitting of this message up to the access right that obtains channel; If still have message to be sent in the buffering area, then forward step 21 to) carry out the message process of transmitting of a new round;
26) wait for that the node of holding the corresponding physical address of last node sequence label sends message, obtains to forward step 27 to behind this message);
27) obtain the node sequence label that the node of holding the corresponding physical address of last node sequence label sends new statement in the message, judge whether this node sequence label is 0, if this node sequence label is 0 and forwards step 28 to); Otherwise forward step 29 to);
28) obtain the node of holding the corresponding physical address of last node sequence label and send the buffer state that illustrates in the message, if the node that illustrates in this message sends buffering area and then this node sequence label that sends message is made as 0 for empty, otherwise this node sequence label that sends message is made as 1; Forward step 210 to)
29) obtain current buffer state, judge in the current transmission buffering area whether to be empty, if current transmission buffering area forwards 210 to for the empty node sequence label that then the node sequence label in this message is made as the message that the last time listens to); If current transmission buffering area non-NULL, then the node sequence label of this message is made as the node sequence label that the last time listens to message and adds 1, forward step 210 to);
210) node sequence label and current transmission buffer state are added to the head of message to be sent, wait for the SIFS time interval and send the process of transmitting that message finishes this message, if still have message to be sent in the buffering area, then forward step 21 to) carry out the message process of transmitting of a new round.
2. method according to claim 1, it is characterized in that, described step 22), obtain current buffer state 29), be in the process that the network layer message is transmitted downwards, the state that sends buffering area is transmitted downwards together as parameter adjoint network layer message and get access to current buffer state.
3. method according to claim 1, it is characterized in that, described step 22), obtain current buffer state 29), be to make to send buffering area the interface that can inquire about is provided, make media access layer in the process of carrying out the message encapsulation, can inquire about and obtain current buffer state sending buffering area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810115267XA CN101291296B (en) | 2008-06-20 | 2008-06-20 | Method for reducing media access collision of wireless local area network by cross-layer structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810115267XA CN101291296B (en) | 2008-06-20 | 2008-06-20 | Method for reducing media access collision of wireless local area network by cross-layer structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101291296A CN101291296A (en) | 2008-10-22 |
| CN101291296B true CN101291296B (en) | 2010-09-15 |
Family
ID=40035381
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810115267XA Expired - Fee Related CN101291296B (en) | 2008-06-20 | 2008-06-20 | Method for reducing media access collision of wireless local area network by cross-layer structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101291296B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104125108A (en) * | 2013-04-26 | 2014-10-29 | 富士通株式会社 | Fault diagnosis device and method thereof and setting method of back-off time |
| CN105812295B (en) * | 2014-12-30 | 2020-05-12 | 中兴通讯股份有限公司 | Data transmission method and station |
| CN104507125B (en) * | 2015-01-05 | 2018-05-25 | 重庆邮电大学 | Back-off method based on node buffer performance in sensor network |
| CN113225584B (en) * | 2021-03-24 | 2022-02-22 | 西安交通大学 | Cross-layer combined video transmission method and system based on coding and caching |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1578239A (en) * | 2003-07-29 | 2005-02-09 | 三星电子株式会社 | Medium access control in wireless local area network |
| CN101155101A (en) * | 2006-09-30 | 2008-04-02 | 华为技术有限公司 | Method, device and system for preventing meshed network beaconing information collision in wireless local area network |
| CN101156381A (en) * | 2005-03-14 | 2008-04-02 | 纳诺无线股份公司 | Wlan transmit scheduler comprising an accelerated back-off function |
| CN101159644A (en) * | 2001-11-13 | 2008-04-09 | 皇家飞利浦电子股份有限公司 | Apparatus and method for providing ieee 802.11e hybrid coordinator recovery and backoff rules |
-
2008
- 2008-06-20 CN CN200810115267XA patent/CN101291296B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159644A (en) * | 2001-11-13 | 2008-04-09 | 皇家飞利浦电子股份有限公司 | Apparatus and method for providing ieee 802.11e hybrid coordinator recovery and backoff rules |
| CN1578239A (en) * | 2003-07-29 | 2005-02-09 | 三星电子株式会社 | Medium access control in wireless local area network |
| CN101156381A (en) * | 2005-03-14 | 2008-04-02 | 纳诺无线股份公司 | Wlan transmit scheduler comprising an accelerated back-off function |
| CN101155101A (en) * | 2006-09-30 | 2008-04-02 | 华为技术有限公司 | Method, device and system for preventing meshed network beaconing information collision in wireless local area network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101291296A (en) | 2008-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khorov et al. | A survey on IEEE 802.11 ah: An enabling networking technology for smart cities | |
| RU2635284C2 (en) | Systems and methods of transmitting and receiving messages of detection and personal call | |
| CN105122924B (en) | System and method for the conflict management in neighborhood aware network | |
| CN102387572B (en) | Mobile electronic device and data transmission method of the same | |
| CN103190195B (en) | There is the physical layer header of Access Point Identifier | |
| KR101928617B1 (en) | Methods and arrangements for traffic indication map segmentation in wireless networks | |
| CN105453686A (en) | Method and apparatus for accessing channel | |
| CN110661870A (en) | HPLC communication networking method, device, storage medium and electronic equipment | |
| CN101227367B (en) | Method for competing access period multilevel collocation of distributed wireless sensor network | |
| CN105916199A (en) | Systems, methods, and apparatus for a short beacon in low rate WI-FI communication | |
| JP2014090448A (en) | Systems and methods for parallel communication with legacy wlan receivers | |
| US20110069656A1 (en) | Method for wireless multi-hop network using synchronous mac protocol | |
| EP1700436A1 (en) | Terminal apparatus for enabling a plurality of different communication systems to coexist | |
| CN102595648B (en) | Adaptive carrier sense multiple access (CSMA)/conditional access (CA) method based on institute of electrical and electronics engineers (IEEE)802.15.4 | |
| JP2009521187A (en) | Multi-pole instructions to save more power | |
| US7953030B2 (en) | Method and apparatus for controlling power consumption of stations on a CSMA/CA-based wireless LAN | |
| CN106233791A (en) | The definition of different NDP PS polling types | |
| CN101291296B (en) | Method for reducing media access collision of wireless local area network by cross-layer structure | |
| CN104378730A (en) | Access system for M2M service in cellular wireless communication system | |
| CN103596236A (en) | Cross-layer wireless sensor network MAC protocol communication method and system | |
| Anastasi et al. | The MAC unreliability problem in IEEE 802.15. 4 wireless sensor networks | |
| CN104780619A (en) | Method for designing WLAN (wireless local area network) MAC (medium access control) layer protocol based on cooperative communication | |
| CN101765227B (en) | Method for optimizing 802.11 centralized coordination function | |
| CN105472718A (en) | Low power consumption MAC communication method based on flow self-adaption in wireless sensor network | |
| KR101046991B1 (en) | How to Improve Time Synchronization Performance of Superframe Structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| 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: 20100915 |