CN109005065A - A kind of appreciable cluster algorithm of concealed nodes for extensive D2D network - Google Patents
A kind of appreciable cluster algorithm of concealed nodes for extensive D2D network Download PDFInfo
- Publication number
- CN109005065A CN109005065A CN201810931318.XA CN201810931318A CN109005065A CN 109005065 A CN109005065 A CN 109005065A CN 201810931318 A CN201810931318 A CN 201810931318A CN 109005065 A CN109005065 A CN 109005065A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- network
- nodes
- channel access
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/02—Hybrid access techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/04—Scheduled or contention-free access
- H04W74/06—Scheduled or contention-free access using polling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
- H04W74/085—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
Abstract
The invention discloses a kind of appreciable cluster algorithms of concealed nodes for extensive D2D network, belong to wireless network concealed nodes technical field, comprising the following steps: select a high-performance node as controller first；Monitor channel obtains the neighbor node of each node of D2D network later；Then controller merges the neighbor node of all nodes, obtains the global view of network topology；Then controller carries out sub-clustering to the node in the global view of network topology；Finally according to sub-clustering as a result, the node in the global view of network topology carries out channel access and data transmission.The present invention is by carrying out sub-clustering to the node in whole network topology, the influence of the drastic conditions and concealed nodes of node competitive channel to network performance can be effectively relieved, furthermore it is at war with channel and transmission to different cluster nodes by polling mode or DCF mode, the collision problem that conflicts caused by concealed nodes is alleviated significantly, the access delay for reducing network improves the performance of network.
Description
Technical field
The invention belongs to wireless network concealed nodes technical field, especially a kind of hiding for extensive D2D network
The appreciable cluster algorithm of node.
Background technique
In the D2D network based on 802.11 wireless local area network technologies, node is based on DCF access-control protocol access letter
Road, DCF method are based on access/collision prevention (CSMA/CA) mechanism more than carrier sense.Node first perceives one section of distribution before accessing channel
Formula interframe gap (distributed interframe space, DIFS), if listening to channel idle, node is immediately accessed
Channel.Otherwise, node starts to move back by randomly selecting backoff counter (backoff counter, BC) from (0, w)
Circumvent journey.Here, w represents the contention window size of present node, and the value of w occurs every time since minimum value (CWmin)
It is doubled when conflict, until reaching maximum value (CWmax).
Under large-scale D2D network environment, because including a large number of users node in network topology, in communication process
The middle conflict collision that high probability can occur, so that the performance of whole network is influenced, specifically, the D2D net of large scale and high density
Network is based on DCF access-control protocol there are serious hidden node problem, and network node is needed through contention access channel, by
The communication information can be mutually monitored between the broadcast characteristic of wireless network, node, in the process based on DCF contention access channel
In, by mutually monitoring the communication information, can effectively avoid that identical BC is selected to cause to transmit collision problem, but mutually hide
Node can not listen to the communication information between them, and during accessing channel and transmission data, node can not monitor that
The BC of this selection is easy to happen conflict collision, increases the access delay of network, reduce the performance of network.
Summary of the invention
Technical problem solved by the invention is to provide a kind of concealed nodes for extensive D2D network appreciable
Cluster algorithm.
The technical solution for realizing the aim of the invention is as follows: a kind of concealed nodes for extensive D2D network can perceive
Cluster algorithm, comprising the following steps:
Step 1 selects a high-performance node as controller；
Step 2 passes through monitor channel, the neighbor node of each node of acquisition D2D network；
Step 3, controller merge the neighbor node of all nodes, obtain the global view of network topology；
Step 4, controller carry out sub-clustering to the node in the global view of the network topology；
Step 5, according to the sub-clustering of step 4 as a result, the node in the global view of network topology carries out channel access and number
According to transmission.
Compared with prior art, the present invention its remarkable advantage: 1) present invention utilizes the propagation characteristic of wireless network, passes through prison
Listen the concealed nodes that can effectively find in network；2) present invention by merge node within the scope of each node-node transmission and
Concealed nodes obtain the global view of whole network topology, and carry out sub-clustering to the node in whole network topology, can be effective
Alleviate the influence of the drastic conditions and concealed nodes of node competitive channel to network performance；3) to I/H cluster node in the present invention
Channel access and transmission are carried out by polling mode, is at war with channel and transmission to O cluster node by 802.11DCF mode,
The collision problem that conflicts caused by concealed nodes is alleviated significantly, reduces the access delay of network, improves the performance of network.
Present invention is further described in detail with reference to the accompanying drawing.
Detailed description of the invention
Fig. 1 is flow chart of the present invention for the appreciable cluster algorithm of concealed nodes of extensive D2D network.
Fig. 2 is the network model figure of the network concealed node of D2D.
Fig. 3 is the process schematic for carrying out sub-clustering in the present invention to the node in the global view of network topology.Wherein scheme
It (a) is the first cluster result schematic diagram；Scheming (b) is the second cluster result schematic diagram；Scheming (c) is third cluster result schematic diagram.
Fig. 4 is that the result for carrying out sub-clustering to the node in the global view to network topology in the embodiment of the present invention is illustrated
Figure.
Fig. 5 is that the node in the embodiment of the present invention in the global view of network topology carries out channel access and transmission process is shown
It is intended to.
Specific embodiment
In conjunction with Fig. 1, the present invention is used for the appreciable cluster algorithm of concealed nodes of extensive D2D network, including following step
It is rapid:
Step 1 selects a high-performance node as controller.Wherein, high-performance node is wireless router.
Step 2 passes through monitor channel, the neighbor node of each node of acquisition D2D network.The neighbor node of each node
Including the node and concealed nodes being located within the scope of the node-node transmission.Wherein, in conjunction with Fig. 2, the concealed nodes for obtaining node are specific
Are as follows:
Assuming that obtaining the concealed nodes of node A, node B of the node A into its transmission range sends data frame, and node B exists
ACK frame is returned after the SIFS period to be responded, and node C also has received ACK frame in the transmission range of node B, and finds
The recipient of ACK frame is node A, but node C does not listen to the frame of node A transmission, then node A and node C hides section each other
Point.
Step 3, controller merge the neighbor node of all nodes, obtain the global view of network topology.
Step 4, controller carry out sub-clustering to the node in the global view of network topology, specifically:
Step 4-1, controller randomly selects a node as cluster head from the global view of network topology.
Step 4-2, using cluster head as starting point, sub-clustering is carried out to the node in the global view of network topology by controller.
Specifically:
Step 4-2-1, all nodes that can listen to cluster head are denoted as I cluster as the first cluster；
Step 4-2-2, controller search can be listened to but the institute mutually hiding with cluster head by least one node in I cluster
There is node, using these nodes as the second cluster, is denoted as H cluster；
Step 4-2-3, controller search can be listened to but mutual with all nodes of I cluster by least one node in H cluster
Hiding all nodes are denoted as O cluster using these nodes as third cluster.
Further, it is assumed that the maximum number of O cluster node is M, and I cluster and H cluster node sum are N, then the maximum of O cluster node
Relationship between number and I cluster, H cluster knot points are as follows:
Step 5, according to the sub-clustering of step 4 as a result, the node in the global view of network topology carries out channel access and number
According to transmission, specifically:
Step 5-1, average division is carried out to BI (beacon interval) period of the 802.11WLAN of D2D network application, obtained
Two parts channel access period is denoted as first part's channel access period, second part channel access period respectively.
Step 5-2, in first part's channel access period, I/H cluster node carries out channel access and number by polling mode
According to transmission, specifically:
Step 5-2-1, first using cluster head as sender's node；
Step 5-2-2, some node of sender's node by data frame transfer into I/H cluster, the node are denoted as reception
Fang Jiedian；
Step 5-2-3, after recipient's node successful data reception frame, to sender's node send ACK frame acknowledgment receive at
Function, and its a certain neighbor node is chosen as next sender's node, and ACK frame is written into the MAC Address of the neighbor node
Destination address；
Step 5-2-4, after a SIFS period, step 5-2-2,5-2-3 is repeated.
Step 5-3, in the second part channel access period, O cluster node carries out channel access by 802.11 DCF mode
And data transmission, specifically:
(1) node that can mutually listen in O cluster node is vied each other by 802.11 DCF mode and carries out channel
Access and data transmission；
(2) node that cannot mutually monitor in O cluster node while channel access and data transmission are carried out, specifically: pass through
After one DIFS, the node that cannot mutually monitor carries out backoff procedure, has randomly choosed the node of identical BC value, when BC value simultaneously
Keep out of the way the node that when being 0, cannot mutually monitor while accessing channel and carries out channel access and data transmission.
The present invention is described in further detail combined with specific embodiments below.
Embodiment
In conjunction with Fig. 1, the present invention is used for the appreciable cluster algorithm of concealed nodes of extensive D2D network, including following interior
Hold:
(1) select a high-performance node as controller.Wherein, high-performance node is wireless router.
(2) by monitor channel, the neighbor node of each node of D2D network is obtained.
(3) controller merges the neighbor node of all nodes, obtains the global view of network topology.
(4) Fig. 3 is combined, controller carries out sub-clustering to the node in the global view of network topology: controller is opened up from network
A node CH is randomly selected in the global view flutterred0As cluster head；Later with cluster head CH0For starting point, by cluster head CH0It can
All nodes listened to are denoted as I cluster as the first cluster, as shown in the square nodes in Fig. 3 (a)；Controller search can be with
It is listened to by least one node in I cluster but all nodes mutually hiding with cluster head is denoted as using these nodes as the second cluster
H cluster, as shown in the triangular nodes in Fig. 3 (b)；Controller search can be listened to by least one node in H cluster but with I cluster
The mutually hiding all nodes of all nodes are denoted as O cluster using these nodes as third cluster, such as the circular node in Fig. 3 (c)
It is shown.The sub-clustering result finally obtained is as shown in figure 4, I cluster node is I0,I1,I2,I3,I4..., H cluster node is H0,H1,H2,H3,
H4..., O cluster node is O0,O1,O2,O3,O4…。
(5) average division is carried out to the BI period of the 802.11WLAN of D2D network application, obtains two parts channel access week
Phase is denoted as first part's channel access period, second part channel access period respectively.In conjunction with Fig. 5, with leader cluster node CH0, I
Cluster node I0、I3, H cluster node H1、H2, O cluster node O0,O1,O2,O3,O4For, the section in the global view of network topology is described
Point carries out the process of channel access and data transmission.First part's channel access period, I/H cluster node are accessed by polling method
Channel, when the channel access period of I/H cluster node starts, CH0By data frame transfer to the node I for belonging to I cluster0.As node I0
When successful data reception frame, I0To leader cluster node CH0Send ACK frame acknowledgment receive successfully, and select it a neighbours (such as
H1) it is used as next sender, by H1MAC Address write-in ACK frame destination address.After waiting SIFS, it is identified down
One sending node H1Start to node H2Send data packet.As node H2When successful data reception frame, H2To sending node H1Hair
It send ACK frame acknowledgment to receive successfully, and selects its neighbours (such as I3) it is used as next sender, by H1MAC Address write
Enter the destination address of ACK frame.Then after a SIFS period, H2One data frame is transferred to node I3.Second part letter
Road access cycle, O cluster node fight for channel access by 802.11DCF, and the node that can mutually listen to passes through competitive channel
(such as O0And O2) carry out data transmission, the node that cannot mutually monitor can be with parallel transmission (such as O1And O2), by waiting DIFS
Afterwards, node carries out backoff procedure, when it is 0 that BC value, which is kept out of the way, node O1And O2Access channel simultaneously carries out data transmission, and is transmitted
Afterwards, other nodes of O cluster are based on DCF competitive channel again.
Claims (10)
1. a kind of appreciable cluster algorithm of concealed nodes for extensive D2D network, which is characterized in that including following step
It is rapid:
Step 1 selects a high-performance node as controller；
Step 2 passes through monitor channel, the neighbor node of each node of acquisition D2D network；
Step 3, controller merge the neighbor node of all nodes, obtain the global view of network topology；
Step 4, controller carry out sub-clustering to the node in the global view of the network topology；
Step 5, according to the sub-clustering of step 4 as a result, the node in the global view of network topology carries out channel access and data pass
It is defeated.
2. the concealed nodes appreciable cluster algorithm according to claim 1 for extensive D2D network, feature exist
In high-performance node described in step 1 is wireless router.
3. the concealed nodes appreciable cluster algorithm according to claim 1 for extensive D2D network, feature exist
In the neighbor node of each node described in step 2 includes the node and concealed nodes within the scope of the node-node transmission.
4. the concealed nodes appreciable cluster algorithm according to claim 1 or 3 for extensive D2D network, special
Sign is, the concealed nodes of node are obtained in the neighbor node of each node for obtaining D2D network specifically:
Assuming that obtaining the concealed nodes of node A, node B of the node A into its transmission range sends data frame, and node B is in SIFS
ACK frame is returned after period to be responded, and node C also has received ACK frame in the transmission range of node B, and finds ACK
The recipient of frame is node A, but node C does not listen to the frame of node A transmission, then node A and node C concealed nodes each other.
5. the concealed nodes appreciable cluster algorithm according to claim 1 for extensive D2D network, feature exist
In, controller described in step 4 carries out sub-clustering to the node in the global view of the network topology, specifically:
Step 4-1, controller randomly selects a node as cluster head from the global view of network topology；
Step 4-2, using the cluster head as starting point, the node in the global view of the network topology is divided by controller
Cluster.
6. the concealed nodes appreciable cluster algorithm according to claim 5 for extensive D2D network, feature exist
In using the cluster head as starting point described in step 4-2, by controller to the node progress in the global view of the network topology
Sub-clustering, specifically:
Step 4-2-1, all nodes that can listen to the cluster head are denoted as I cluster as the first cluster；
Step 4-2-2, all sections that controller search can be listened to by least one node in I cluster but mutually be hidden with cluster head
Point is denoted as H cluster using these nodes as the second cluster；
Step 4-2-3, controller search can be listened to by least one node in H cluster but mutually be hidden with all nodes of I cluster
All nodes be denoted as O cluster using these nodes as third cluster.
7. the concealed nodes appreciable cluster algorithm according to claim 6 for extensive D2D network, feature exist
Relationship between the maximum number and I cluster of, the O cluster node, H cluster knot points are as follows:
Assuming that the maximum number of O cluster node is M, I cluster and H cluster node sum are N, then
8. the concealed nodes appreciable cluster algorithm according to claim 1 for extensive D2D network, feature exist
According to the sub-clustering of step 4 as a result, the node in the global view of network topology carries out channel access and data described in step 5
Transmission, specifically:
Step 5-1, average division is carried out to the BI period of the 802.11WLAN of D2D network application, obtains two parts channel access
Period is denoted as first part's channel access period, second part channel access period respectively；
Step 5-2, in first part's channel access period, I/H cluster node carries out channel access by polling mode and data pass
It is defeated；
Step 5-3, in the second part channel access period, O cluster node carries out channel access and number by 802.11 DCF mode
According to transmission.
9. the appreciable cluster algorithm of concealed nodes of extensive D2D network is used for according to claim 5 or 8, it is special
Sign is that I/H cluster node described in step 5-2 carries out channel access by polling mode and data are transmitted specifically:
Step 5-2-1, first using cluster head as sender's node；
Step 5-2-2, some node of sender's node by data frame transfer into I/H cluster, the node are denoted as recipient's section
Point；
Step 5-2-3, after recipient's node successful data reception frame, ACK frame acknowledgment is sent to sender's node and is received successfully, and
Its a certain neighbor node is chosen as next sender's node, and the MAC Address of the neighbor node is written to the target of ACK frame
Address；
Step 5-2-4, after a SIFS period, step 5-2-2,5-2-3 is repeated.
10. the concealed nodes appreciable cluster algorithm according to claim 8 for extensive D2D network, feature
It is, O cluster node described in step 5-3 carries out channel access by 802.11 DCF mode and data are transmitted, specifically:
(1) node that can mutually listen in O cluster node is vied each other by 802.11 DCF mode and carries out channel access
And data transmission；
(2) node that cannot mutually monitor in O cluster node while channel access and data transmission are carried out, specifically: pass through one
After DIFS, the node that cannot mutually monitor carries out backoff procedure, the node of identical BC value has been randomly choosed, when BC value is kept out of the way simultaneously
When being 0, the node that cannot mutually monitor while accessing channel and carry out channel access and data transmission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810931318.XA CN109005065B (en) | 2018-08-15 | 2018-08-15 | Hidden node-perceptible clustering algorithm for large-scale D2D network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810931318.XA CN109005065B (en) | 2018-08-15 | 2018-08-15 | Hidden node-perceptible clustering algorithm for large-scale D2D network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109005065A true CN109005065A (en) | 2018-12-14 |
| CN109005065B CN109005065B (en) | 2021-05-04 |
Family
ID=64593416
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810931318.XA Active CN109005065B (en) | 2018-08-15 | 2018-08-15 | Hidden node-perceptible clustering algorithm for large-scale D2D network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109005065B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114189468A (en) * | 2021-11-02 | 2022-03-15 | 云端领航(北京)通信科技股份有限公司 | Multi-identification network system routing method based on identification clustering |
| CN115002019A (en) * | 2022-06-22 | 2022-09-02 | 中国电信股份有限公司 | Hidden node determination method and device, nonvolatile storage medium and electronic equipment |
| CN115002019B (en) * | 2022-06-22 | 2024-05-14 | 中国电信股份有限公司 | Hidden node determining method and device, nonvolatile storage medium and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102595314A (en) * | 2012-02-14 | 2012-07-18 | 北京邮电大学 | Position-information-based device-to-device (D2D) clustering multicast method |
| CN106507316A (en) * | 2016-11-02 | 2017-03-15 | 西安邮电大学 | User's sub-clustering and resource allocation methods under a kind of D2D multicasts scene |
| EP3200550A1 (en) * | 2016-01-29 | 2017-08-02 | Alcatel Lucent | Method for sharing resources between mobile devices thanks to a location tracking server |
| CN108307470A (en) * | 2018-05-11 | 2018-07-20 | 重庆邮电大学 | A kind of network cluster dividing method based on node group relationship degree |
-
2018
- 2018-08-15 CN CN201810931318.XA patent/CN109005065B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102595314A (en) * | 2012-02-14 | 2012-07-18 | 北京邮电大学 | Position-information-based device-to-device (D2D) clustering multicast method |
| EP3200550A1 (en) * | 2016-01-29 | 2017-08-02 | Alcatel Lucent | Method for sharing resources between mobile devices thanks to a location tracking server |
| CN106507316A (en) * | 2016-11-02 | 2017-03-15 | 西安邮电大学 | User's sub-clustering and resource allocation methods under a kind of D2D multicasts scene |
| CN108307470A (en) * | 2018-05-11 | 2018-07-20 | 重庆邮电大学 | A kind of network cluster dividing method based on node group relationship degree |
Non-Patent Citations (2)
| Title |
|---|
| XIAOYING LEI: "Design of a collision-free backoff method to improve the IEEE 802.11 DCF", 《2016 EIGHTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS》 * |
| 石纯子: "D2D通信系统中基于QoS的分簇信道分配算法", 《信号处理》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114189468A (en) * | 2021-11-02 | 2022-03-15 | 云端领航(北京)通信科技股份有限公司 | Multi-identification network system routing method based on identification clustering |
| CN114189468B (en) * | 2021-11-02 | 2024-04-12 | 云端领航(北京)通信科技股份有限公司 | Multi-identification network system routing method based on identification clustering |
| CN115002019A (en) * | 2022-06-22 | 2022-09-02 | 中国电信股份有限公司 | Hidden node determination method and device, nonvolatile storage medium and electronic equipment |
| CN115002019B (en) * | 2022-06-22 | 2024-05-14 | 中国电信股份有限公司 | Hidden node determining method and device, nonvolatile storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109005065B (en) | 2021-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108924945B (en) | A kind of cut-in method and device | |
| Li et al. | A new backoff algorithm for IEEE 802.11 distributed coordination function | |
| Kanodia et al. | Ordered packet scheduling in wireless ad hoc networks: Mechanisms and performance analysis | |
| CN101795498B (en) | Data priority-based channel contention access method for wireless sensor network | |
| CN101584234B (en) | Method of congestion management in a wireless mesh network, system and station of the wireless mesh network | |
| JP4588465B2 (en) | Transmission control method | |
| CN105592564B (en) | Adaptive access mechanism based on the estimation of live-vertex number in wireless Mesh netword | |
| Jang et al. | Network status detection-based dynamic adaptation of contention window in IEEE 802.11 p | |
| JP7481445B2 (en) | Wireless network transmission method, device, communication node, and storage medium | |
| CN105376830B (en) | The up-link access method that a kind of channel bonding and orthogonal frequency-time multiple access are combined | |
| CN109005065A (en) | A kind of appreciable cluster algorithm of concealed nodes for extensive D2D network | |
| CN104581980A (en) | Wireless network collision-avoiding channel access control method based on distance partitions | |
| WO2017041629A1 (en) | Active scanning processing method and related device and communication system | |
| Lei et al. | Design of a collision-free backoff method to improve the IEEE 802.11 DCF | |
| CN108934081A (en) | A kind of wireless vehicle mounted network channel cut-in method | |
| Hsu et al. | Achieving ultra energy-efficient and collision-free data collection in wake-up radio enabled mIoT | |
| Lu et al. | A dynamic token passing MAC protocol for mobile ad hoc networks | |
| Ho et al. | Ieee 802.11/wi-fi medium access control: An overview | |
| Moad et al. | Padovan sequence based Backoff Algorithm for improved wireless medium access in MANETs | |
| Xu et al. | A heuristic approach for low delay distributed MAC using successive interference cancellation in priority-based industrial wireless network | |
| Syed et al. | Medium access for underwater acoustic sensor networks | |
| Li et al. | Unsaturated traffic oriented spatial clustering multiusers MAC protocol for the next generation WLAN | |
| Liao et al. | A distributed adaptive QoS MAC protocol for mobile ad hoc networks | |
| Hussain et al. | Dynamic contention window for quality of service in IEEE 802.11 networks | |
| Gangqiang et al. | Simulation Research on Underwater Acoustic Network MAC Layer Protocol Attack |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |