CN109005065B - Hidden node-perceptible clustering algorithm for large-scale D2D network - Google Patents
Hidden node-perceptible clustering algorithm for large-scale D2D network Download PDFInfo
- Publication number
- CN109005065B CN109005065B CN201810931318.XA CN201810931318A CN109005065B CN 109005065 B CN109005065 B CN 109005065B CN 201810931318 A CN201810931318 A CN 201810931318A CN 109005065 B CN109005065 B CN 109005065B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- cluster
- hidden
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
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 hidden node perceptible clustering algorithm for a large-scale D2D network, which belongs to the technical field of hidden nodes of wireless networks and comprises the following steps: firstly, selecting a high-performance node as a controller; then, a monitoring channel acquires neighbor nodes of each node of the D2D network; then the controller merges the neighbor nodes of all the nodes to obtain a global view of the network topology; then the controller clusters the nodes in the global view of the network topology; and finally, according to the clustering result, the nodes in the global view of the network topology carry out channel access and data transmission. The invention can effectively relieve the fierce condition of node competition channel and the influence of hidden node on network performance by clustering the nodes in the whole network topology, and in addition, different cluster nodes compete for channel and transmit in a polling mode or a DCF mode, thereby greatly relieving the conflict and collision problems caused by hidden nodes, reducing the access time delay of the network and improving the network performance.
Description
Technical Field
The invention belongs to the technical field of hidden nodes of wireless networks, and particularly relates to a hidden node perceivable clustering algorithm for a large-scale D2D network.
Background
In a D2D network based on 802.11 wireless local area network technology, nodes access a channel based on a DCF access control protocol, and a DCF method is based on a carrier sense multiple access/collision avoidance (CSMA/CA) mechanism. The node perceives a distributed interframe space (DIFS) before accessing the channel, and if the node detects that the channel is idle, the node immediately accesses the channel. Otherwise, the node starts the backoff process by randomly selecting a Backoff Counter (BC) from (0, w). Here, w represents the contention window size of the current node, and the value of w starts from the minimum value (CWmin) and doubles each time a collision occurs until the maximum value (CWmax) is reached.
In a large-scale D2D network environment, because a network topology includes a large number of user nodes, a high probability of collision can occur during communication, thereby affecting the performance of the entire network, and specifically, a large-scale high-density D2D network has a serious hidden node problem, based on the DCF access control protocol, network nodes need to access a channel through competition, due to the broadcast characteristics of a wireless network, the nodes can monitor communication information with each other, in the DCF competition access channel based process, the problem of transmission collision caused by selecting the same BC can be effectively avoided by monitoring communication information with each other, but the hidden nodes cannot monitor communication information between them, in the access channel and data transmission process, the nodes cannot monitor the BC selected from each other, collision easily occurs, and the access delay of the network is increased, reducing the performance of the network.
Disclosure of Invention
The technical problem solved by the invention is to provide a hidden node-aware clustering algorithm for large-scale D2D networks.
The technical solution for realizing the purpose of the invention is as follows: a hidden node aware clustering algorithm for large scale D2D networks, comprising the steps of:
step 2, acquiring neighbor nodes of each node of the D2D network by monitoring a channel;
step 3, the controller merges neighbor nodes of all nodes to obtain a global view of the network topology;
and step 5, according to the clustering result in the step 4, the nodes in the global view of the network topology carry out channel access and data transmission.
Compared with the prior art, the invention has the following remarkable advantages: 1) the invention can effectively discover hidden nodes in the network by monitoring by utilizing the propagation characteristic of the wireless network; 2) according to the invention, the nodes in the transmission range of each node and the hidden node are combined to obtain the global view of the whole network topology, and the nodes in the whole network topology are clustered, so that the fierce condition of node competition channels and the influence of the hidden node on the network performance can be effectively relieved; 3) in the invention, the I/H cluster nodes are subjected to channel access and transmission in a polling mode, and the O cluster nodes are subjected to channel competition and transmission in an 802.11DCF mode, so that the problem of collision caused by hidden nodes is greatly relieved, the access delay of the network is reduced, and the performance of the network is improved.
The present invention is described in further detail below with reference to the attached drawing figures.
Drawings
Fig. 1 is a flow chart of a hidden node aware clustering algorithm for large-scale D2D networks of the present invention.
Fig. 2 is a network model diagram of a hidden node of the D2D network.
Fig. 3 is a schematic diagram of a process of clustering nodes in a global view of a network topology according to the present invention. Wherein graph (a) is a schematic of the first cluster results; FIG. (b) is a schematic diagram of the second cluster result; panel (c) is a schematic of the third cluster results.
Fig. 4 is a schematic diagram of a result of clustering nodes in a global view of a network topology according to an embodiment of the present invention.
Fig. 5 is a schematic diagram of a process of channel access and transmission by a node in a global view of a network topology according to an embodiment of the present invention.
Detailed Description
With reference to fig. 1, the hidden node-aware clustering algorithm for large-scale D2D network of the present invention includes the following steps:
and step 1, selecting a high-performance node as a controller. Wherein, the high-performance node is a wireless router.
And 2, acquiring neighbor nodes of each node of the D2D network by monitoring the channel. The neighbor nodes of each node include nodes that are within the transmission range of the node and hidden nodes. With reference to fig. 2, the hidden node of the acquisition node is specifically:
if a hidden node of the node A is obtained, the node A sends a data frame to a node B in the transmission range of the node A, the node B returns an ACK frame to respond after the SIFS period, and the node C also receives the ACK frame in the transmission range of the node B and finds that a receiver of the ACK frame is the node A but does not monitor the frame sent by the node A, the node A and the node C are hidden nodes mutually.
And 3, combining the neighbor nodes of all the nodes by the controller to obtain a global view of the network topology.
and 4-1, the controller randomly selects a node from the global view of the network topology as a cluster head.
And 4-2, clustering the nodes in the global view of the network topology by using the cluster head as a starting point through the controller. The method specifically comprises the following steps:
step 4-2-1, taking all nodes which can be monitored by cluster heads as a first cluster, and marking as an I cluster;
step 4-2-2, the controller searches all nodes which can be monitored by at least one node in the cluster I but are hidden by the cluster head, and takes the nodes as a second cluster and records the second cluster as an H cluster;
and 4-2-3, searching all nodes which can be monitored by at least one node in the H cluster but are hidden with all nodes in the I cluster by the controller, and taking the nodes as a third cluster and marking as an O cluster.
Further, assuming that the maximum number of O cluster nodes is M and the total number of I cluster and H cluster nodes is N, the relationship between the maximum number of O cluster nodes and the number of I cluster and H cluster nodes is:
step 5, according to the clustering result of step 4, the nodes in the global view of the network topology perform channel access and data transmission, specifically:
step 5-1, average division is carried out on BI (beacon interval) periods of 802.11WLAN applied by the D2D network, and two parts of channel access periods are obtained and are respectively marked as a first part of channel access period and a second part of channel access period.
Step 5-2, in the first part of channel access period, the I/H cluster node performs channel access and data transmission in a polling mode, specifically:
step 5-2-1, taking the cluster head as a sender node;
step 5-2-2, the sender node transmits the data frame to a certain node in the I/H cluster, and the node is marked as a receiver node;
step 5-2-3, after the receiving node successfully receives the data frame, sending an ACK frame to the sending node to confirm the successful receiving, selecting a certain neighbor node as the next sending node, and writing the MAC address of the neighbor node into the target address of the ACK frame;
and 5-2-4, repeating the steps 5-2-2 and 5-2-3 after an SIFS period.
Step 5-3, in the second part of channel access period, the O-cluster node performs channel access and data transmission in a DCF mode of 802.11, specifically:
(1) nodes which can be monitored by each other in the O cluster nodes compete with each other in a DCF mode of 802.11 to perform channel access and data transmission;
(2) the method comprises the following steps that nodes which cannot monitor each other in the O cluster nodes simultaneously carry out channel access and data transmission, and specifically comprises the following steps: after a DIFS, nodes which cannot monitor each other perform a backoff process, nodes with the same BC value are randomly selected, and when the BC value is simultaneously backed off to be 0, the nodes which cannot monitor each other simultaneously access a channel to perform channel access and data transmission.
The present invention will be described in further detail with reference to specific examples.
Examples
With reference to fig. 1, the hidden node-aware clustering algorithm for large-scale D2D network of the present invention includes the following:
(1) a high performance node is selected as the controller. Wherein, the high-performance node is a wireless router.
(2) By listening to the channel, neighbor nodes of each node of the D2D network are acquired.
(3) The controller merges the neighbor nodes of all the nodes to obtain a global view of the network topology.
(4) With reference to fig. 3, the controller clusters the nodes in the global view of the network topology: the controller randomly selects a node CH from the global view of the network topology0As a cluster head; then cluster head CH0As a starting point, a cluster head CH0All nodes that can be monitored are taken as a first cluster, which is denoted as an I cluster, and is shown as a square node in FIG. 3 (a); the controller searches all nodes which can be monitored by at least one node in the I cluster but are hidden from each other by the cluster head, and takes the nodes as a second cluster, which is marked as an H cluster, as shown by a triangular node in FIG. 3 (b); the controller searches for all nodes that can be heard by at least one node in the H cluster but are hidden from each other with all nodes in the I cluster, and regards these nodes as a third cluster, denoted as an O cluster, as shown by the circular nodes in fig. 3 (c). The final clustering result is shown in FIG. 4, where the node of the I cluster is I0,I1,I2,I3,I4…, the H cluster node is H0,H1,H2,H3,H4… with O cluster nodes being O0,O1,O2,O3,O4…。
(5) The BI periods of the 802.11WLAN applied to the D2D network are averagely divided to obtain two parts of channel access periods which are respectively marked as a first part of channel access period and a second part of channel access period. With reference to FIG. 5, the cluster head node CH0I cluster node I0、I3Node H of cluster H1、H2O cluster node O0,O1,O2,O3,O4For example, global of network topology is describedAnd the nodes in the view perform the processes of channel access and data transmission. In the first part of channel access period, the I/H cluster node accesses the channel by polling method, and at the beginning of the channel access period of the I/H cluster node, the CH0Transmitting data frames to nodes I belonging to I cluster0. When node I0Upon successful reception of a data frame, I0To cluster head node CH0Sending an ACK frame acknowledges successful reception and selects one of its neighbors (e.g., H)1) As the next sender, H1The MAC address of (1) is written into the destination address of the ACK frame. After waiting for SIFS, the next sending node H that has been acknowledged1To start to node H2And sending the data packet. When node H2When the data frame is successfully received, H2To the sending node H1Sending an ACK frame acknowledges successful reception and selects one of its neighbors (e.g., I)3) As the next sender, H1The MAC address of (1) is written into the destination address of the ACK frame. Then after one SIFS period, H2Transmitting a data frame to node I3. In the second part of the channel access period, the O-cluster nodes contend for the channel access through the 802.11DCF, and the nodes capable of mutually monitoring pass through a contention channel (such as O-cluster nodes)0And O2) For data transmission, nodes which cannot listen to each other can transmit in parallel (e.g. O)1And O2) After waiting for DIFS, the node performs a backoff process, and when the BC value is backed off to be 0, the node O1And O2And accessing the channel and transmitting data, and after the transmission is finished, other nodes of the O cluster compete for the channel based on the DCF again.
Claims (4)
1. A hidden node aware clustering algorithm for large-scale D2D networks, comprising the steps of:
step 1, selecting a high-performance node as a controller;
step 2, acquiring neighbor nodes of each node of the D2D network by monitoring a channel;
step 3, the controller merges neighbor nodes of all nodes to obtain a global view of the network topology;
step 4, clustering nodes in the global view of the network topology by the controller; the method specifically comprises the following steps:
step 4-1, the controller randomly selects a node from a global view of the network topology as a cluster head;
step 4-2, with the cluster head as a starting point, clustering nodes in the global view of the network topology by using a controller; the method specifically comprises the following steps:
step 4-2-1, taking all nodes which can be monitored by the cluster heads as a first cluster, and marking as an I cluster;
step 4-2-2, the controller searches all nodes which can be monitored by at least one node in the cluster I but are hidden by the cluster head, and takes the nodes as a second cluster and records the second cluster as an H cluster;
4-2-3, searching all nodes which can be monitored by at least one node in the H cluster but are hidden with all nodes in the I cluster by the controller, and taking the nodes as a third cluster and marking as an O cluster;
the relationship between the maximum number of the O cluster nodes and the number of the I cluster nodes and the H cluster nodes is as follows:
assuming that the maximum number of O cluster nodes is M and the total number of I cluster and H cluster nodes is N, then
Step 5, according to the clustering result of the step 4, the nodes in the global view of the network topology carry out channel access and data transmission; the method specifically comprises the following steps:
step 5-1, average dividing the BI period of the 802.11WLAN applied by the D2D network to obtain two parts of channel access periods which are respectively marked as a first part of channel access period and a second part of channel access period;
step 5-2, in the first part of channel access period, the I/H cluster nodes carry out channel access and data transmission in a polling mode; the method specifically comprises the following steps:
step 5-2-1, taking the cluster head as a sender node;
step 5-2-2, the sender node transmits the data frame to a certain node in the I/H cluster, and the node is marked as a receiver node;
step 5-2-3, after the receiving node successfully receives the data frame, sending an ACK frame to the sending node to confirm the successful receiving, selecting a certain neighbor node as the next sending node, and writing the MAC address of the neighbor node into the target address of the ACK frame;
after step 5-2-4, one SIFS cycle, repeating steps 5-2-2 and 5-2-3;
step 5-3, in the second part of channel access period, the O cluster nodes carry out channel access and data transmission in a DCF mode of 802.11; the O-cluster node performs channel access and data transmission in a DCF mode of 802.11, specifically:
(1) nodes which can be monitored by each other in the O cluster nodes compete with each other in a DCF mode of 802.11 to perform channel access and data transmission;
(2) the method comprises the following steps that nodes which cannot monitor each other in the O cluster nodes simultaneously carry out channel access and data transmission, and specifically comprises the following steps: after a DIFS, nodes which cannot monitor each other perform a backoff process, nodes with the same BC value are randomly selected, and when the BC value is simultaneously backed off to be 0, the nodes which cannot monitor each other simultaneously access a channel to perform channel access and data transmission.
2. The hidden-node-aware clustering algorithm for large-scale D2D networks according to claim 1, wherein the high-performance node of step 1 is a wireless router.
3. The hidden-node-aware clustering algorithm for large-scale D2D networks according to claim 1, wherein the neighbor nodes of each node in step 2 comprise nodes within the transmission range of the node and hidden nodes.
4. The hidden-node-aware clustering algorithm for large-scale D2D networks according to claim 1 or 3, wherein the hidden nodes of the acquisition nodes in the neighbor nodes of each node of the acquisition D2D network are specifically:
if a hidden node of the node A is obtained, the node A sends a data frame to a node B in the transmission range of the node A, the node B returns an ACK frame to respond after the SIFS period, and the node C also receives the ACK frame in the transmission range of the node B and finds that a receiver of the ACK frame is the node A but does not monitor the frame sent by the node A, the node A and the node C are hidden nodes mutually.
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 CN109005065A (en) | 2018-12-14 |
| CN109005065B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114189468B (en) * | 2021-11-02 | 2024-04-12 | 云端领航(北京)通信科技股份有限公司 | Multi-identification network system routing method based on identification clustering |
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 |
|---|
| D2D通信系统中基于QoS的分簇信道分配算法;石纯子;《信号处理》;20180615;第33卷(第7期);953-960 * |
| Design of a collision-free backoff method to improve the IEEE 802.11 DCF;Xiaoying Lei;《2016 Eighth International Conference on Ubiquitous and Future Networks》;20160811;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109005065A (en) | 2018-12-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102802171B (en) | For the back-off method of wireless communication system with keep out of the way equipment | |
| US9918340B1 (en) | Enhanced distributed channel access parameter variation within restricted access window | |
| CN103220065B (en) | The method of adjustment and device of clear channel assessment threshold | |
| CN110943861B (en) | Multilink concurrent transmission method suitable for underwater acoustic sensor network | |
| KR101667694B1 (en) | Reducing power consumption in wireless network stations by optimizing contention period overhead with station grouping, proxy csma, and tim monitoring | |
| JP7418716B2 (en) | Coordination of stations within a single BSS sharing a TXOP in the frequency domain | |
| JP4588465B2 (en) | Transmission control method | |
| KR101162709B1 (en) | Distributed medium access scheduling with implicit ordering | |
| CN108055702B (en) | Self-adaptive back-off method based on time slot CSMA \ CA mode | |
| CN105592564B (en) | Adaptive access mechanism based on the estimation of live-vertex number in wireless Mesh netword | |
| CN114788400A (en) | Coordinated WIFI stations with shared TXOP in time domain | |
| US10554351B1 (en) | Methods and systems for enabling communications from a station to an access point using an orthogonal frequency division multiple access (OFDMA) communication scheme | |
| WO2022057901A1 (en) | Channel access method in wireless local area network, and related apparatus | |
| JP6861812B2 (en) | How to send awakening packets, how to send the first frame after node awakening, devices and devices | |
| CN101150469A (en) | A packet dispatching method based on avoidance mechanism in WLAN | |
| WO2013159552A1 (en) | Radio frame receiving method and device | |
| CN102421151A (en) | Minimum contention window adaptive adjustment method based on WLAN (Wireless Local Area Network) contention station number | |
| US20060034208A1 (en) | Modified backoff mechanism for wireless networks | |
| CN102256317B (en) | Wireless channel access control method | |
| CN109819505B (en) | Method for adapting time slot of limited access window for optimizing network energy efficiency | |
| CN109005065B (en) | Hidden node-perceptible clustering algorithm for large-scale D2D network | |
| CN104581980A (en) | Wireless network collision-avoiding channel access control method based on distance partitions | |
| CN105191475A (en) | Method and device for performing access in wireless LAN system | |
| WO2015074574A1 (en) | Power-line communication network channel access control method and system | |
| CN108934081A (en) | A kind of wireless vehicle mounted network channel cut-in method |
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 |