CN116321469B - Method for avoiding channel conflict of large-scale self-organizing network based on conflict graph - Google Patents
Method for avoiding channel conflict of large-scale self-organizing network based on conflict graph Download PDFInfo
- Publication number
- CN116321469B CN116321469B CN202310313618.2A CN202310313618A CN116321469B CN 116321469 B CN116321469 B CN 116321469B CN 202310313618 A CN202310313618 A CN 202310313618A CN 116321469 B CN116321469 B CN 116321469B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- channel
- graph
- interference
- 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
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000005540 biological transmission Effects 0.000 claims abstract description 38
- 238000004891 communication Methods 0.000 claims abstract description 30
- 238000004040 coloring Methods 0.000 claims abstract description 29
- 238000005457 optimization Methods 0.000 claims abstract description 8
- 238000013178 mathematical model Methods 0.000 claims abstract description 4
- 239000011159 matrix material Substances 0.000 claims description 27
- 230000008569 process Effects 0.000 claims description 18
- 239000003086 colorant Substances 0.000 claims description 11
- 238000009826 distribution Methods 0.000 claims description 10
- 238000005562 fading Methods 0.000 claims description 7
- 238000013507 mapping Methods 0.000 claims description 6
- 235000007164 Oryza sativa Nutrition 0.000 claims description 3
- 239000000654 additive Substances 0.000 claims description 3
- 230000000996 additive effect Effects 0.000 claims description 3
- 230000001186 cumulative effect Effects 0.000 claims description 3
- 230000000694 effects Effects 0.000 claims description 3
- 235000009566 rice Nutrition 0.000 claims description 3
- 240000007594 Oryza sativa Species 0.000 claims 1
- 238000004220 aggregation Methods 0.000 claims 1
- 230000002776 aggregation Effects 0.000 claims 1
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 6
- 230000006855 networking Effects 0.000 description 4
- 241000209094 Oryza Species 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- QVFWZNCVPCJQOP-UHFFFAOYSA-N chloralodol Chemical compound CC(O)(C)CC(C)OC(O)C(Cl)(Cl)Cl QVFWZNCVPCJQOP-UHFFFAOYSA-N 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 230000006698 induction Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
本发明涉及场域网多跳通信技术领域，具体地说，是一种基于冲突图的大规模自组织网络信道冲突规避方法，该方法主要采用跳频技术和着色方法来分配信道，规避信道冲突。主要步骤包括，建立网络拓扑，建立信道模型，计算干扰和信干噪比；生成跳频序列，解决不同网络的节点之间的冲突；建立干扰模型，生成冲突图，建立信道分配问题；引入跳频模式，将信道分配问题转化为时隙分配问题；建立数学模型，解决网络内部的信道冲突；建立优化问题，将时隙分配问题转化为图论中的顶点着色问题；采用图着色算法求解问题。该方法可以减少无线信道冲突，提升数据传输效率，降低端到端传输时延。
The present invention relates to the field of field area network multi-hop communication technology, specifically, a large-scale self-organizing network channel conflict avoidance method based on conflict graph, which mainly adopts frequency hopping technology and coloring method to allocate channels and avoid channel conflicts. The main steps include: establishing network topology, establishing channel model, calculating interference and signal-to-interference-noise ratio; generating frequency hopping sequence to solve conflicts between nodes of different networks; establishing interference model, generating conflict graph, and establishing channel allocation problem; introducing frequency hopping mode, converting channel allocation problem into time slot allocation problem; establishing mathematical model to solve channel conflicts within the network; establishing optimization problem, converting time slot allocation problem into vertex coloring problem in graph theory; using graph coloring algorithm to solve the problem. This method can reduce wireless channel conflicts, improve data transmission efficiency, and reduce end-to-end transmission delay.
Description
Technical Field
The invention relates to the technical field of field network multi-hop communication, in particular to a large-scale self-organizing network channel conflict avoidance method based on a conflict graph.
Background
The power distribution area side multimode communication network consists of a central main control node, a routing sink node and a terminal sensing node, wherein the central main control node and a plurality of routing sink nodes form a main network taking the central main control node as a center, the terminal sensing node is connected into the main network in a wireless mode, terminal sensing node equipment is low-power consumption equipment for battery power supply or induction power taking, an access point of the terminal sensing node can be the central main control node or the routing sink node, the central main control node equipment and the routing sink node equipment are normal power supply node equipment for alternating current power supply or direct current power supply, the central main control node and the routing sink node take power lines and wireless as transmission media to form a mesh network structure taking the central main control node as a center, the central main control node and the routing sink node can be added with corresponding communication modules, the wireless sensing equipment for standard communication such as Q/GDW12020, Q/GDW12021 wireless sensing equipment and BLE, wiFi, zigBee, loRa is expanded and supported, the multimode communication network is a network which is in various communication modes such as FHPLC, 470MHz-RF and 2.4 GHz-RF.
The low-voltage power line is used as a transmission medium, the low-voltage power line is composed of a large number of carrier nodes arranged on the power line, and a multi-hop network system formed by a power carrier communication mode is a communication network for supporting automatic avoidance of carrier working frequency bands and realizing equipment state information acquisition, control, event reporting, power consumer electricity consumption convergence, transmission and interaction in the distribution area. At present, the communication technology is fast and fast, the communication system is different day by day, but the corresponding network channel resources are increasingly in shortage, and the utilization of the power network channel to bear new services is an effective measure for solving the shortage of communication frequency band resources.
The wireless radio frequency communication is combined with the power line carrier communication to form a multimode communication network, and the method has great help to optimize the network structure and improve the network performance. However, under the condition that a plurality of networks operate in a field area network, because of a plurality of nodes and complex network topology, a plurality of communication links share the same channel in the data transmission process, so that the conditions of increased channel conflict, increased packet loss rate and time delay and reduced throughput are caused, a corresponding channel avoidance strategy is required to be designed, limited channel resources are reasonably allocated to each link, interference and conflict among the communication nodes are reduced, normal operation of the network is ensured, and the transmission performance of the network is improved.
Disclosure of Invention
The invention aims to provide a large-scale self-organizing network channel conflict avoidance method based on a conflict graph, which mainly solves the problem that channel conflict and interference can be generated in a data transmission process in a network under the conditions of limited spectrum resources and coexistence of multiple networks, and needs to design a reasonable resource allocation scheme to avoid the channel conflict, improve the data transmission efficiency and reduce the end-to-end transmission delay.
The technical scheme adopted by the invention is as follows:
a large-scale self-organizing network channel conflict avoidance method based on a conflict graph adopts a frequency hopping technology and a coloring method to allocate channels and avoid channel conflicts, and comprises the following specific steps:
Step S1, establishing a network topology;
Step S2, a channel model is established, interference and signal-to-interference-and-noise ratios are calculated, a wireless channel model is analyzed, each routing sink node supporting wireless transmission and a central master control node are regarded as a base station, a lognormal shadow path loss model is adopted, and path loss is expressed as:
Where d is the communication distance between two nodes, d 0 is the near-ground reference distance, n is the path loss coefficient, X δ is the random variable with Gaussian distribution with mean 0 and variance delta caused by shadow effect,
Order theConstant, PL (d) =k Ldn.
Considering small-scale multipath fading as Rayleigh fading, setting a receiving and transmitting node of a communication link as i and j respectively, wherein the transmitting power of the node i is P i, and the power received by the node j isIt is assumed here that the antennas are all omni-directional antennas, and the antenna gain of node i isChannel fading gainFollowing the rice distribution, the noise is additive white gaussian noise with a mean value of 0 and a variance of sigma 2, and the cumulative interference I n that a receiving end node j in a communication link (I, j) is interfered by all neighbor nodes except a transmitting node I is:
the signal-to-interference-and-noise ratio (SINR, signal to interference plus noise ratio) received by node j is:
S3, resolving conflicts among nodes of different networks, in a field network, referring to frequency hopping sequences of other surrounding networks in a networking stage, generating frequency hopping sequences orthogonal to the surrounding networks through a correlation algorithm, so that channels used between different networks are orthogonal at the same time, channel conflicts and interference are avoided, a method for designing the frequency hopping sequences is specifically, adjustment can be carried out according to the situation of an actual network, if a part of channels are used by a single network to support data transmission of the network, available channels can be grouped and distributed to different networks, channels used between the networks are not identical, channel conflicts among the networks can not be generated, if the scale of the single network is relatively large, all channels are needed to be used to support data transmission of the networks, the frequency hopping sequences between adjacent networks need to be guaranteed to be orthogonal, the fact that a node used by the adjacent networks occupies a channel time in a certain time slot number is avoided, the situation that the adjacent networks are just subjected to frequency hopping to the working condition of the adjacent networks is carried out after the node which is not finished in the certain network occupies a channel time is avoided, and interference is generated;
Step S4, after network node networking, node positions are not moved any more, the transmitting power of each node is fixed to be P t, a network topology graph G is established according to a transmission path given by a routing algorithm, the graph G is a connected graph, points in the graph represent RN nodes in an actual network, edges in the graph represent the routing paths of data transmission to next hop nodes, a conflict graph G' is established by analyzing conflicts existing in links, the points in the graph represent one link in the topology graph, edges in the graph represent links represented by the nodes at two ends of the edges generate conflicts and are required to be distributed to different channels;
s5, introducing a frequency hopping mode, and converting the channel allocation problem into a time slot allocation problem;
S6, establishing a mathematical model to solve channel conflicts in the network;
The flow S6.1, the route path obtained according to the route algorithm can generate an adjacency matrix E, E= { E i,j|Ei,j∈{0,1}}N×N, which is a matrix of N rows and N columns, and represents the route relation between the node i and the node j. E i,j = 0 indicates that there is no route from node i to node j, E i,j = 1 indicates that there is a route from node i to node j, where node i is the transmitting node and node j is the receiving node;
And S6.2, generating an interference matrix I:I= { I n,k,|In,k,∈{0,1}}N×N according to a conflict graph calculated by the established interference model, wherein the interference matrix I= { I n,k,|In,k,∈{0,1}}N×N is a matrix of N rows and N columns, and represents the condition that the links N and k simultaneously use the same channel to generate interference. If I n,k = 1/0, it means that links n and k will/will not interfere when using the same channel at the same time;
The result of the solution in the flow S6.3 is that the non-interference allocation matrix a: a= { a n,m|an,m∈{0,1}}N×M is a matrix of N rows and M columns, indicating a possible slot allocation scheme, a n,m =1 if slot M is allocated to link N, otherwise a n,m =0. The interference-free allocation matrix must satisfy the interference constraint:
Step S7, creating an optimization problem, abstracting the above-mentioned time slot allocation into a vertex coloring problem in a graph theory, for a graph G (V, E) and a color set c, where V is a vertex set of the graph G, representing links in the network, c represents an available color set of vertices, each color represents a time slot, E is an edge set, and is determined by the interference constraint matrix I, if and only if I n,k =1, there is an edge between two different vertices n, k E V, and the coloring condition corresponding to the effective time slot allocation satisfying the interference constraint condition can be described as that when there is an edge between two vertices, the same color cannot be simultaneously colored. The coloring process is a mapping process of assigning a color C v e C to each vertex V e V, ensuring that the color is different from the colors of its neighbors, mathematically representing ：R(G,C)＝{<v,c>|(v∈V∩c∈C∩(<vi,ci>∈R∩<v,vi>∈E→c≠ci))}. to define a color set c= [ C 1,c2,…,cn ], initializing all to 0 for the available color set, and if a color C i is assigned to a vertex V i, forming a mapping pair < V i,ci >, where C i =1. The optimization objective is to color all links for links in the current network using the least number of colors, namely: Obtaining a required minimum color number of c tot and a corresponding coloring scheme;
And S8, solving by adopting a graph coloring algorithm, and traversing the search by adopting a backtracking method for solving how to finish the coloring process by using K colors. If a solution can be found in the search and backtracking process, the problem is solved, and if all cases are traversed, the problem can be considered as having no solution. And introducing heuristic strategies, namely coloring the vertex with the smallest value range preferentially in the current state, wherein the more the neighbor node colors of one vertex are defined, the smaller the value range of the vertex is, and comparing the degree of the vertex with the maximum degree preferentially in the case of the same value range.
The invention has the beneficial effects that:
(1) After the channel allocation is performed by a coloring algorithm, each link cannot transmit data in the same channel with other surrounding links at the same time, so that interference signals in the channel are greatly reduced, and the signal-to-interference-and-noise ratio of the wireless link is obviously improved;
(2) After the channel allocation of the coloring algorithm, the throughput of the wireless link is improved, and the throughput is close to that of the wired link, so that the end-to-end throughput is not limited by the wireless link any more, and the transmission performance of the whole network is greatly improved;
(3) After the channel allocation by the coloring algorithm, the end-to-end transmission delay is reduced;
(4) The more surrounding interference links are distributed with channels through a coloring algorithm, the higher the interference reduction degree is, so that the coloring algorithm channel distribution scheme provided by the invention is suitable for a network with dense node distribution, and can effectively reduce interference during inter-node communication.
Drawings
Fig. 1 is a diagram of a domain network node link relationship provided by the present invention.
Fig. 2 is a collision diagram establishment procedure provided by the present invention.
Fig. 3 is a diagram of a frequency hopping pattern provided by the present invention.
Fig. 4 is a frequency hopping sequence diagram provided by the present invention.
Fig. 5 is a schematic diagram of frequency hopping provided by the present invention.
Detailed Description
The present invention will be further described in detail with reference to the drawings and examples, which are only for the purpose of illustrating the invention and are not to be construed as limiting the scope of the invention.
A large-scale self-organizing network channel conflict avoidance method based on a conflict graph comprises the following specific steps:
Step S1, establishing network topology, wherein a domain network node link relation diagram is shown in FIG. 1, two types of nodes in a domain network are mainly researched, a central master control node (MN) and a routing sink node (RN), and a main research wireless Radio Frequency (RF) channel comprises the following procedures:
The method comprises the following steps that S1.1, a field network is composed of a plurality of areas, one area in the field network is shown in fig. 1 and is a multi-hop network composed of a central master control node (MN), a plurality of routing sink nodes (RNs) and a plurality of end sensing nodes (EN), each central master control node collects data reported by subordinate end sensing nodes and transmits the data to the central master control node through the multi-hop network, a transmission link between RN nodes is divided into two modes of Radio Frequency (RF) and high-speed power line carrier (HPLC), wherein the HPLC link is divided into ABC three-phase links, and the problem of channel conflict of the central master control node (MN) and the wireless RF link which are composed of the RN nodes is mainly studied;
In the process S1.2, in order to control the cost of the nodes, the RN node in the network adopts a half-duplex communication mode, namely, each node has only one wireless transceiver module, cannot simultaneously perform receiving and transmitting work, and can only communicate with one node on one channel in one time slot;
Step S2, a channel model is established, interference and signal-to-interference-and-noise ratios are calculated, a wireless channel model is analyzed, each routing sink node supporting wireless transmission and a central master control node are regarded as a base station, a lognormal shadow path loss model is adopted, and path loss is expressed as:
Wherein d is the communication distance between two nodes, d 0 is the near-ground reference distance, n is the path loss coefficient, X δ is a random variable with Gaussian distribution with mean value of 0 and variance of delta caused by shadow effect;
Order the Constant, PL (d) =k Ldn;
Considering small-scale multipath fading as Rayleigh fading, setting a receiving and transmitting node of a communication link as i and j respectively, wherein the transmitting power of the node i is P i, and the power received by the node j is It is assumed here that the antennas are all omni-directional antennas, and the antenna gain of node i isChannel fading gainObeying the rice distribution, the noise is additive white gaussian noise with a mean value of 0 and a variance of sigma 2. The cumulative interference I n that the receiving end node j receives as all neighbor nodes except the transmitting node I in the communication link (I, j) is:
the signal-to-interference-and-noise ratio (SINR, signal to interference plus noise ratio) received by node j is:
s3, generating a frequency hopping sequence, solving the conflict among nodes of different networks, in a field network, referring to the frequency hopping sequences of other surrounding networks in a networking stage, generating the frequency hopping sequence orthogonal to the surrounding networks through a correlation algorithm, so that the channels used between the adjacent networks are orthogonal at the same time, avoiding channel conflict and interference between the adjacent networks, specifically designing the frequency hopping sequence, adjusting according to the actual network condition, if a part of channels are used by a single network to support the data transmission of the network, grouping the available channels to the different networks, so that the channels used between the networks are not identical, and channel conflict among the networks is not generated;
And S4, after the network nodes are networked, the positions of the nodes are not moved any more, the transmitting power of each node is fixed to be P t, a network topology graph G is established according to a transmission path given by a routing algorithm, the graph G is a connected graph, a point in the graph represents an RN node in an actual network, an edge in the graph represents a routing path of data transmission to a next hop node, a conflict graph G' is established by analyzing conflicts existing in links, the point in the graph represents one link in the topology graph, the edges in the graph represent links represented by the nodes at two ends of the edge generate conflicts, and the links need to be distributed to different channels.
The process for establishing the conflict graph of the field network is shown in fig. 2, and the establishment flow is as follows:
Flow S4.1, for each link in G, a node is established in G',
In the process S4.2, for any one link l in G, the transmitting node is t (l), and the receiving node is r (l). If another link l' exists, when two links transmit data simultaneously, the following three situations occur, and the two links collide:
① The signal-to-interference-plus-noise ratio SINR of the receiving end r (l) or r (l') is lower than the threshold,
② The receiving node of one link is the transmitting node of the other link, i.e. r (l ')=t (l) or r (l) =t (l'),
③ The receiving nodes of the two links are the same node, i.e. r (l) =r (l'),
S4.3, establishing a connection between the corresponding nodes in the conflict graph G' for the two links in the conflict graph G;
Step S5, introducing a frequency hopping mode, wherein the field network adopts the frequency hopping mode to carry out wireless communication, channels used by nodes in the whole network are the same and unchanged in one time slot, after the current time slot is finished, nodes in the whole network synchronously hop to channels corresponding to the next time slot, the hopping rule of the channels is determined by a frequency hopping sequence generated during networking, but the situation that the receiving and transmitting nodes do not transmit in one time slot occupying the current channel is not completed, the adopted scheme is shown in figure 3, the receiving and transmitting nodes of data which are not transmitted in the current time slot do not synchronously hop with other nodes in the network, but continue to occupy the current channel until the data transmission is completed, the frequency hopping is shown in figure 5, the nodes in the network hop according to the frequency hopping sequence in figure 4, but the nodes in the network are not completely synchronous, the channels used by idle nodes in the network synchronously hop according to the frequency hopping sequence, the nodes which are transmitting data together with the idle nodes in the network after the data transmission is finished, the node is synchronous frequency hopping, the problem that the nodes which are set by the nodes in the network do not complete transmission of the data transmission is determined in the time slot cycle, the time slot can be allocated to the time slot in the current time slot when the data transmission is not finished, and the data transmission can be continuously carried out in the time slot cycle, and the data transmission can be started to the time slot is not completed in the time slot of the time slot;
S6, establishing a mathematical model to solve channel conflicts in the network;
The flow S6.1, the route path obtained according to the route algorithm can generate an adjacency matrix E, E= { E i,j|Ei,j∈{0,1}}N×N, which is a matrix of N rows and N columns, and represents the route relation between the node i and the node j. E i,j = 0 indicates that there is no route from node i to node j, E i,j = 1 indicates that there is a route from node i to node j, where node i is the transmitting node and node j is the receiving node;
and S6.2, generating an interference matrix I:I= { I n,k,|In,k,∈{0,1}}N×N according to a conflict graph calculated by the established interference model, wherein the interference matrix I= { I n,k,|In,k,∈{0,1}}N×N is a matrix of N rows and N columns, and represents the condition that the links N and k simultaneously use the same channel to generate interference. If I n,k = 1/0, it means that links n and k will/will not interfere when using the same channel at the same time;
The result of the solution in the flow S6.3 is that the non-interference allocation matrix a: a= { a n,m|an,m∈{0,1}}N×M is a matrix of N rows and M columns, indicating a possible slot allocation scheme, a n,m =1 if slot M is allocated to link N, otherwise a n,m =0. The interference-free allocation matrix must satisfy the interference constraint:
Step S7, creating an optimization problem, abstracting the above-mentioned time slot allocation into a vertex coloring problem in a graph theory, for a graph G (V, E) and a color set c, where V is a vertex set of the graph G, representing links in the network, c represents an available color set of vertices, each color represents a time slot, E is an edge set, and is determined by the interference constraint matrix I, if and only if I n,k =1, there is an edge between two different vertices n, k E V, and the coloring condition corresponding to the effective time slot allocation satisfying the interference constraint condition can be described as that when there is an edge between two vertices, the same color cannot be simultaneously colored. The coloring process is a mapping process of assigning a color C v e C to each vertex V e V, ensuring that the color is different from the colors of its neighbors, mathematically representing ：R(G,C)＝{<v,c>|(v∈V∩c∈C∩(<vi,ci>∈R∩<v,vi>∈E→c≠ci))}. to define a color set c= [ C 1,c2,…,cn ], initializing all to 0 for the available color set, and if a color C i is assigned to a vertex V i, forming a mapping pair < V i,ci >, where C i =1. The optimization objective is to color all links for links in the current network using the least number of colors, namely: Obtaining a required minimum color number of c tot and a corresponding coloring scheme;
And S8, solving by adopting a graph coloring algorithm, and traversing the search by adopting a backtracking method for solving how to finish the coloring process by using K colors. If a solution can be found in the search and backtracking process, the problem is solved, and if all cases are traversed, the problem can be considered as having no solution. And introducing heuristic strategies, namely coloring the vertex with the smallest value range preferentially in the current state, wherein the more the neighbor node colors of one vertex are defined, the smaller the value range of the vertex is, and comparing the degree of the vertex with the maximum degree preferentially in the case of the same value range.
The foregoing is merely a preferred embodiment of the present invention and it should be noted that modifications and adaptations to those skilled in the art may be made without departing from the principles of the present invention, which are intended to be comprehended within the scope of the present invention.
Claims (3)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310313618.2A CN116321469B (en) | 2023-03-28 | 2023-03-28 | Method for avoiding channel conflict of large-scale self-organizing network based on conflict graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310313618.2A CN116321469B (en) | 2023-03-28 | 2023-03-28 | Method for avoiding channel conflict of large-scale self-organizing network based on conflict graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116321469A CN116321469A (en) | 2023-06-23 |
| CN116321469B true CN116321469B (en) | 2025-03-14 |
Family
ID=86822237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310313618.2A Active CN116321469B (en) | 2023-03-28 | 2023-03-28 | Method for avoiding channel conflict of large-scale self-organizing network based on conflict graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116321469B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116828061B (en) * | 2023-08-18 | 2024-04-02 | 联桥科技有限公司 | Configuration method and system for power line carrier and wireless fusion communication |
| CN117640417B (en) * | 2023-12-06 | 2024-07-16 | 重庆理工大学 | Ultra-dense Internet of Things resource allocation method and system based on GCN-DDPG |
| CN118399989B (en) * | 2024-06-28 | 2024-08-27 | 成都汉度科技有限公司 | Frequency hopping method and system for total nodes of station area |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113038613A (en) * | 2021-03-01 | 2021-06-25 | 中国人民解放军国防科技大学 | Three-dimensional network resource allocation method and device based on graph coloring problem |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100877410B1 (en) * | 2006-12-26 | 2009-01-08 | 재단법인서울대학교산학협력재단 | Channel Allocation Method of Network and Multi-hop Wireless Network System Using the Same |
| DE102011015095B4 (en) * | 2011-03-25 | 2015-03-26 | Jens Elsner | Multi-level frequency hopping for interference reduced communication in an ad hoc network |
| CN103297927A (en) * | 2012-03-04 | 2013-09-11 | 山东大学威海分校 | Distributed graph coloring link dispatch of wireless sensor network |
| CN103052069B (en) * | 2012-12-14 | 2015-04-15 | 南京邮电大学 | Multi-radio-frequency multi-channel wireless Mesh network channel distribution method |
| US9350416B2 (en) * | 2014-05-07 | 2016-05-24 | Itron France | Frequency hopping sequence generation |
| CN104093208B (en) * | 2014-06-24 | 2017-11-17 | 重庆邮电大学 | A kind of non-slotted channel distribution method based on maximum matching in industry wireless network |
| CN106452699B (en) * | 2015-08-06 | 2019-05-14 | 中国科学院上海高等研究院 | Multi-carrier frequency digital multimedia radio broadcasting frequency-hopping transmissions mapping logical channels method |
| CN105848295B (en) * | 2016-05-13 | 2019-07-12 | 中国科学院计算技术研究所 | A kind of isomery car networking slot allocation method |
| CN107750056B (en) * | 2017-10-25 | 2020-12-11 | 河南理工大学 | Interference Mitigation Methods in Ultra-Dense Networks |
| CN108924878B (en) * | 2018-07-04 | 2020-11-03 | 北京邮电大学 | An Interference Elimination Method for Coexisting Wireless Body Area Networks Based on Graph Coloring Theory |
| WO2020166770A1 (en) * | 2019-02-15 | 2020-08-20 | 엘지전자 주식회사 | Method and apparatus for performing joint transmission in wireless lan system |
-
2023
- 2023-03-28 CN CN202310313618.2A patent/CN116321469B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113038613A (en) * | 2021-03-01 | 2021-06-25 | 中国人民解放军国防科技大学 | Three-dimensional network resource allocation method and device based on graph coloring problem |
Non-Patent Citations (1)
| Title |
|---|
| 面向配电网的场域网弹性表征和评估模型;朱晓荣;《物联网学报》;20220728;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116321469A (en) | 2023-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116321469B (en) | Method for avoiding channel conflict of large-scale self-organizing network based on conflict graph | |
| Ozger et al. | Clustering in multi-channel cognitive radio ad hoc and sensor networks | |
| Marina et al. | A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks | |
| Zhang et al. | Joint routing and scheduling in multi-radio multi-channel multi-hop wireless networks | |
| Das et al. | WLC30-4: static channel assignment in multi-radio multi-channel 802.11 wireless mesh networks: issues, metrics and algorithms | |
| Wu et al. | Multi-channel and cognitive radio approaches for wireless sensor networks | |
| Tian et al. | Traffic-demand-aware collision-free channel assignment for multi-channel multi-radio wireless mesh networks | |
| Sheu et al. | Location-free topology control protocol in wireless ad hoc networks | |
| Mansoor et al. | Spectrum aware cluster-based architecture for cognitive radio ad-hoc networks | |
| Huang et al. | Coverage and capacity of a wireless mesh network | |
| Zhao et al. | Scalability and performance evaluation of hierarchical hybrid wireless networks | |
| Diab et al. | Overview on Multi-Channel Communications in Wireless Sensor Networks. | |
| Zhou et al. | Practical routing and channel assignment scheme for mesh networks with directional antennas | |
| Shrestha et al. | Hidden node collision mitigated CSMA/CA-based multihop wireless sensor networks | |
| CN110190919A (en) | Multi-radio multi-channel wireless network channel allocation method | |
| Dai et al. | Effective Channel Assignment Based on Dynamic Source Routing in Cognitive Radio Networks. | |
| CN106131887B (en) | Distributed topology control method based on serial interference cancellation | |
| Gabriel et al. | Energy-aware routing scheme for large-scale Industrial Internet of Things (IIoT) | |
| De Oliveira et al. | Connectivity in multi-channel multi-interface wireless mesh networks | |
| Zhen et al. | Bandwidth-aware routing for TDMA-based mobile ad hoc networks | |
| Xin et al. | Gateway selection scheme for throughput optimization in multi-radio multi-channel wireless mesh networks | |
| Jiang et al. | Smart antenna-based multi-hop highly-energy-efficient DSA approach to drone-assisted backhaul networks for 5G | |
| Lee et al. | An integrated multihop cellular data network | |
| Zareei et al. | Dynamic spectrum allocation for cognitive radio ad hoc network | |
| Dow et al. | Avoidance of hidden terminal problems in cluster-based wireless networks using efficient two-level code assignment schemes |
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 |