CN116321469A - 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
- CN116321469A CN116321469A CN202310313618.2A CN202310313618A CN116321469A CN 116321469 A CN116321469 A CN 116321469A CN 202310313618 A CN202310313618 A CN 202310313618A CN 116321469 A CN116321469 A CN 116321469A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- graph
- channel
- 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.)
- Pending
Links
Images
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
Abstract
The invention relates to the technical field of multi-hop communication of a field network, in particular to a large-scale self-organizing network channel conflict avoidance method based on a conflict graph. The method comprises the main steps of establishing network topology, establishing a channel model, and calculating interference and signal-to-interference-and-noise ratio; generating a frequency hopping sequence, and solving conflicts among nodes of different networks; establishing an interference model, generating a conflict graph and establishing a channel allocation problem; introducing a frequency hopping mode to convert the channel allocation problem into a time slot allocation problem; establishing a mathematical model to solve channel conflict in the network; establishing an optimization problem, and converting a time slot allocation problem into a vertex coloring problem in a graph theory; and solving the problem by adopting a graph coloring algorithm. The method can reduce wireless channel conflict, 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 station side multimode communication network consists of a central main control node, a routing aggregation node and a terminal perception node, wherein the central main control node and a plurality of routing aggregation nodes form a main network taking the central main control node as a center, and the terminal perception node is accessed into the main network in a wireless mode: the terminal sensing node equipment is low-power consumption equipment powered by a battery or powered by induction, and an access point of the terminal sensing node can be a central main control node or a routing sink node; the central main control node equipment and the routing sink node equipment are constant power supply node equipment for alternating current power supply or direct current power supply, and 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 the center; the central master control node and the routing sink node can be added with corresponding communication modules, and the wireless sensing devices for standard communication such as Q/GDW12020, Q/GDW12021, BLE, wiFi, zigBee, loRa and the like are expanded and supported; the multimode communication network is a communication network which integrates two transmission media of a power line and a wireless, supports a plurality of communication modes of FHPLC, 470MHz-RF, 2.4GHz-RF and the like, and provides data transmission interaction for distribution area side equipment.
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 situation that a plurality of communication links share the same channel in the data transmission process, so that channel conflict is increased, packet loss rate and time delay are increased, and throughput is reduced is caused, so that a corresponding channel avoidance strategy needs 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 is as follows: in order to achieve the above purpose, the invention adopts the following technical scheme:
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 a random variable with gaussian distribution with a mean value of 0, a variance of delta,
order the
Is constant, PL (d) =k L d n 。
Considering small-scale multipath fading as Rayleigh fading, a receiving node of a communication link is respectively i and j, and the transmitting power of the node i is P i The power received by node j is
It is assumed here that the antennas are all omni-directional antennas, the antenna gain of node i is +.>
Channel fading gain->
Obeying the rice distribution, the noise is 0 as the mean value and sigma as the variance 2 Is an accumulated interference I of all neighboring nodes except the transmitting node I, the receiving end node j in the communication link (I, j) is interfered with n The method comprises the following steps:
the signal-to-interference-and-noise ratio (SINR, signal to interference plus noise ratio) received by node j is:
step 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 the different networks are orthogonal at the same time, channel conflicts and interference between the different networks are avoided, a method for specifically designing the frequency hopping sequences can be adjusted according to the actual network conditions, 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 the different networks, and thus channels used between the networks are not identical, and channel conflicts between the networks are avoided; if the single network is large in scale, all channels are needed to be used for supporting the data transmission of the network, the frequency hopping sequences between adjacent networks are guaranteed to be orthogonal, and meanwhile, the fact that frequency sets used by the adjacent networks have no intersection in a certain time slot number is guaranteed, so that the situation that the adjacent networks just jump to the frequency to work after the node which is not finished in data transmission occupies one channel for too long in a certain network is prevented, and interference between the networks is generated;
s4, establishing an interference model, wherein after network node networking, the node position is not moved any more, and the transmitting power of each node is fixed as P t According to the transmission path given by the routing algorithm, a network topology graph G is established, which represents the routing path of data transmission, 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 path of data transmission to the next hop node, a conflict graph G' is established by analyzing conflicts existing in links, points in the graph represent one link in the topology graph, edges in the graph represent links represented by nodes at two ends of the edges generate conflicts, and the conflicts need 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 process S6.1, the routing path obtained according to the routing algorithm may generate an adjacency matrix, adjacency matrix E: e= { E i,j |E i,j ∈{0,1}} N×N Is a matrix of N rows and N columns, representing the routing relationship between node i and node j. E (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 of node i to node j, where node i is a transmitting node and node j is a receiving node;
flow S6.2, generating an interference matrix I according to a conflict graph calculated by the established interference model: i= { I n , k ,|I n,k ,∈{0,1}} N×N A matrix of N rows and N columns, represents the situation where simultaneous use of the same channel by links N and k would cause interference. If I n,k =1/0, meaning 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 a non-interference distribution matrix A: a= { a n,m |a n,m ∈{0,1}} N×M Is a matrix of N rows and M columns, representing a possible slot allocation scheme: if time slot m is assigned to link n, a n,m =1, otherwise a n,m =0. The interference-free allocation matrix must satisfy the interference constraint:
step S7, establishing an optimization problem, abstracting the time slot allocation into a vertex coloring problem in a graph theory, and for a graph G (V, E) and a color set c, wherein V is the vertex set of the graph G and represents links in a network, c represents the available color set of the vertices, each color represents a time slot, E is an edge set and is determined by an interference constraint matrix I, if and only if I n,k When=1, there is an edge between two different vertices n, k e V, and the coloring condition corresponding to the effective slot allocation satisfying the interference constraint condition can be described as: when there is one edge between two vertices, the same color cannot be simultaneously colored. The coloring process is to assign a color c to each vertex V e V v The mapping process of E C ensures that the color is different from the color of its neighbor, and the mathematical expression is: r (G, C) = {<v,c>|(v∈V∩c∈C∩(<v i ,c i >∈R∩<v,v i >∈E→c≠c i )) }. Define color set c= [ C ] 1 ,c 2 ,…,c n ]For the set of available colors, the initialization is 0, if it is a certain vertex v i Dispensing color c i Then form a mapping pair<v i ,c i >At this time 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 the minimum required color number of c tot 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. This problem is solved if a solution can be found during the search and backtracking process; if all cases are traversed, the problem can be considered to be unresolved. Heuristic strategies are introduced, namely: in the current state, the vertex with the smallest value range is colored preferentially, and the more the colors of the neighbor nodes of one vertex are defined, the smaller the value range of the vertex is; if the value ranges are the same, the degree of the vertices is compared, and the vertex with the highest degree is colored preferentially.
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:
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 a random variable with a mean value of 0 and a variance of delta and a gaussian distribution caused by shadow effect;
order the
Is constant, PL (d) =k L d n ；
Considering small-scale multipath fading as Rayleigh fading, a receiving node of a communication link is respectively i and j, and the transmitting power of the node i is P i The power received by node j is
It is assumed here that the antennas are all omni-directional antennas, the antenna gain of node i is +.>
Channel fading gain->
Obeying the rice distribution, the noise is 0 as the mean value and sigma as the variance 2 Additive white gaussian noise of (c). Receiving end node j in communication link (I, j) is interfered with as cumulative interference I of all neighbor nodes except transmitting node I n The method comprises the following steps:
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 between 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 channels used between the different networks are ensured to be orthogonal at the same time, channel conflict and interference between the different networks are avoided, the method for specifically designing the frequency hopping sequence can be adjusted according to the actual network condition, if a part of channels are used by a single network to support data transmission of the network, the available channels can be grouped and then distributed to the different networks, and thus, the channels used between the networks are not identical, and channel conflict between the networks can not be generated; if the single network is large in scale, all channels are needed to be used for supporting the data transmission of the network, the frequency hopping sequences between adjacent networks are guaranteed to be orthogonal, and meanwhile, the fact that frequency sets used by the adjacent networks have no intersection in a certain time slot number is guaranteed, so that the situation that the adjacent networks just jump to the frequency to work after the node which is not finished in data transmission occupies one channel for too long in a certain network is prevented, and interference between the networks is generated;
s4, establishing an interference model, wherein after network node networking, the node position is not moved any more, and the transmitting power of each node is fixed as P t According to the transmission path given by the routing algorithm, a network topology graph G is established, which represents the routing path of data transmission, the graph G is a connected graph, the points in the graph represent RN nodes in the actual network, the edges in the graph represent the routing path of data transmission to the next hop nodes, a conflict graph G' is established by analyzing the conflicts existing in links, the points in the graph represent one link in the topology graph,the edges in the figure represent that the links represented by the nodes on both sides of the edge collide and need to be allocated 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:
(1) the signal-to-interference-plus-noise ratio SINR of the receiving end r (l) or r (l') is lower than the threshold,
(2) 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'),
(3) 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 process S6.1, the routing path obtained according to the routing algorithm may generate an adjacency matrix, adjacency matrix E: e= { E i,j |E i,j ∈{0,1}} N×N Is a matrix of N rows and N columns, representing the routing relationship between node i and node j. E (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 of node i to node j, where node i is a transmitting node and node j is a receiving node;
flow S6.2, generating an interference matrix I according to a conflict graph calculated by the established interference model: i= { I n,k ,|I n,k ,∈{0,1}} N×N A matrix of N rows and N columns, represents the situation where simultaneous use of the same channel by links N and k would cause interference. If I n,k =1/0, meaning 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 a non-interference distribution matrix A: a= { a n,m |a n,m ∈{0,1}} N×M Is a matrix of N rows and M columns, representing a possible slot allocation scheme: if time slot m is assigned to link n, a n,m =1, otherwise a n,m =0. The interference-free allocation matrix must satisfy the interference constraint:
step S7, establishing an optimization problem, abstracting the time slot allocation into a vertex coloring problem in a graph theory, and for a graph G (V, E) and a color set c, wherein V is the vertex set of the graph G and represents links in a network, c represents the available color set of the vertices, each color represents a time slot, E is an edge set and is determined by an interference constraint matrix I, if and only if I n,k When=1, there is an edge between two different vertices n, k e V, and the coloring condition corresponding to the effective slot allocation satisfying the interference constraint condition can be described as: when there is one edge between two vertices, the same color cannot be simultaneously colored. The coloring process is to assign a color c to each vertex V e V v The mapping process of E C ensures that the color is different from the color of its neighbor, and the mathematical expression is: r (G, C) = {<v,c>|(v∈V∩c∈C∩(<v i ,c i >∈R∩<v,v i >∈E→c≠c i )) }. Define color set c= [ C ] 1 ,c 2 ,…,c n ]For the set of available colors, the initialization is 0, if it is a certain vertex v i Dispensing color c i Then form a mapping pair<v i ,c i >At this time 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 the minimum required color number of c tot 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. This problem is solved if a solution can be found during the search and backtracking process; if all cases are traversed, the problem can be considered to be unresolved. Heuristic strategies are introduced, namely: in the current state, the vertex with the smallest value range is colored preferentially, and the more the colors of the neighbor nodes of one vertex are defined, the smaller the value range of the vertex is; if the value ranges are the same, the degree of the vertices is compared, and the vertex with the highest degree is colored preferentially.
The foregoing is only a preferred embodiment of the invention, it being noted that: it will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the principles of the present invention, and such modifications and adaptations are intended to be comprehended within the scope of the invention.
Claims (8)
1. A large-scale self-organizing network channel conflict avoidance method based on a conflict graph is characterized by comprising the following specific steps:
step S1, establishing a network topology;
s2, establishing a channel model, calculating interference and signal-to-interference-and-noise ratio, and analyzing a wireless channel model;
s3, generating a frequency hopping sequence, and solving conflicts among nodes of different networks;
s4, establishing an interference model;
s5, introducing a frequency hopping mode;
s6, establishing a mathematical model to solve channel conflicts in the network;
s7, establishing an optimization problem;
and S8, solving by adopting a graph coloring algorithm.
2. The method for avoiding channel collision in a large-scale ad hoc network based on a collision diagram according to claim 1, wherein in step S2, each of the routing sink node and the central master node supporting wireless transmission is regarded as a base station, and a lognormal shadow path loss model is adopted, and the 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 that the mean value is 0 and the variance is delta caused by shadow effectIs a random variable with a gaussian distribution,
order the
Is constant, PL (d) =k L d n ；
Let the receiving and transmitting nodes of a communication link be i and j respectively, and the transmitting power of node i be P i The power received by node j is
Setting the antennas to be all omni-directional antennas, and setting the antenna gain of the node i to be +.>
Channel fading gain->
Obeying the rice distribution, the noise is 0 as the mean value and sigma as the variance 2 Is an accumulated interference I of all neighboring nodes except the transmitting node I, the receiving end node j in the communication link (I, j) is interfered with n The method comprises the following steps:
the signal-to-interference-and-noise ratio received by the node j is:
3. the method for avoiding channel collision in large-scale ad hoc network based on collision diagram according to claim 2, wherein in step S3, a frequency hopping sequence is generated, collision between nodes of different networks is resolved, adjustment is performed according to the actual network situation, and if a single network supports data transmission of the network by using a part of channels, available channels are grouped and then distributed to different networks; if the single network is large in scale and all channels are needed to be used for supporting the data transmission of the network, the frequency hopping sequences between the adjacent networks need to be guaranteed to be orthogonal, and meanwhile, the frequency sets used by the adjacent networks are guaranteed to have no intersection in a certain time slot number, so that the situation that the adjacent networks just jump to the frequency to work after the node which does not end the data transmission occupies one channel for too long in a certain network is prevented, and interference between the networks is generated.
4. The method for avoiding channel collision in large-scale ad hoc network based on collision diagram according to claim 3, wherein in step S4, an interference model is built, the node position is not moved after the network node is networked, and the transmitting power of each node is fixed to be P t According to the transmission path given by the routing algorithm, a network topology graph G is established, which represents the routing path of data transmission, 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 path of data transmission to the next hop node, a conflict graph G' is established by analyzing conflicts existing in links, points in the graph represent one link in the topology graph, edges in the graph represent links represented by nodes at two ends of the edges generate conflicts, and the links need to be distributed to different channels.
5. The method for avoiding channel collision in large-scale ad hoc network based on collision diagram according to claim 4, wherein in step S5, a frequency hopping mode is introduced, the field network uses the frequency hopping mode to perform wireless communication, the channels used by the nodes in the whole network are the same and unchanged in one time slot, after the current time slot is finished, the nodes in the whole network can synchronously hop to the channels corresponding to the next time slot, the hopping rule of the channels is determined by the frequency hopping sequence generated during networking, but the situation that the receiving and transmitting node does not complete data transmission in one time slot occupying the current channel occurs, the receiving and transmitting node of the data which is not complete transmitted in the current time slot does not synchronously hop with other nodes in the network, but continues to occupy the current channel until the data transmission is completed, and the problem of channel allocation is converted into the problem of time slot allocation based on the frequency hopping mode.
6. The method for avoiding channel collision in a large-scale ad hoc network based on a collision map according to claim 5, wherein the specific flow of step S6 is as follows;
the process S6.1, the routing path obtained according to the routing algorithm may generate an adjacency matrix, adjacency matrix E: e= { E i,j |E i,j ∈{0,1}} N×N Is a matrix of N rows and N columns, and represents the routing relationship 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 of node i to node j, where node i is a transmitting node and node j is a receiving node;
flow S6.2, generating an interference matrix I according to a conflict graph calculated by the established interference model: i= { I n,k ,|I n,k ,∈{0,1}} N×N Is a matrix of N rows and N columns, indicating that the simultaneous use of the same channel by links N and k would cause interference if I n,k =1/0, meaning 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 a non-interference distribution matrix A: a= { a n,m |a n,m ∈{0,1}} N×M Is a matrix of N rows and M columns, representing a possible slot allocation scheme: if time slot m is assigned to link n, a n,m =1, otherwise a n,m =0, the interference-free allocation matrix must satisfy the interference constraint:
7. conflict graph-based large scale of claim 6A method for avoiding channel collision of a modular self-organizing network is characterized in that the step S7 is to establish an optimization problem, abstract the time slot allocation into a vertex coloring problem in a graph theory, and for a graph G (V, E) and a color set c, wherein V is the vertex set of the graph G, represents links in the network, c represents the available color set of the vertex, each color represents a time slot, E is an edge set, and is determined by an interference constraint matrix I, if and only if I n,k When=1, there is an edge between two different vertices n, k e V, and the coloring condition corresponding to the effective slot allocation satisfying the interference constraint condition can be described as: when an edge exists between two vertexes, the same color cannot be simultaneously colored, and the coloring process is to assign a color c to each vertex V epsilon V v The mapping process of E C ensures that the color is different from the color of its neighbor, and the mathematical expression is: r (G, C) = {<v,c>|(v∈V∩c∈C∩(<v i ,c i >∈R∩<v,v i >∈E→c≠c i ) Defining a color set c= [ C ] 1 ,c 2 ,…,c n ]For the set of available colors, the initialization is 0, if it is a certain vertex v i Dispensing color c i Then form a mapping pair<v i ,c i >At this time c i =1, the optimization objective is to color all links using the least number of colors for the links in the current network, i.e.:
obtaining the minimum required color number of c tot And a corresponding coloring scheme.
8. The method for avoiding channel collision of large-scale ad hoc network based on the collision map according to claim 7, wherein said step S8 uses a graph coloring algorithm to solve, and uses a backtracking method to traverse the search: this problem is solved if a solution can be found during the search and backtracking process; if all cases are traversed, the problem can be considered to be unresolved; heuristic strategies are introduced, namely: in the current state, the vertex with the smallest value range is colored preferentially, and the more the colors of the neighbor nodes of one vertex are defined, the smaller the value range of the vertex is; if the value ranges are the same, the degree of the vertices is compared, and the vertex with the highest degree is colored preferentially.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310313618.2A CN116321469A (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 CN116321469A (en) | 2023-03-28 | 2023-03-28 | Method for avoiding channel conflict of large-scale self-organizing network based on conflict graph |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116321469A true CN116321469A (en) | 2023-06-23 |
Family
ID=86822237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310313618.2A Pending CN116321469A (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) | CN116321469A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116828061A (en) * | 2023-08-18 | 2023-09-29 | 联桥科技有限公司 | Configuration method and system for power line carrier and wireless fusion communication |
-
2023
- 2023-03-28 CN CN202310313618.2A patent/CN116321469A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116828061A (en) * | 2023-08-18 | 2023-09-29 | 联桥科技有限公司 | Configuration method and system for power line carrier and wireless fusion communication |
| CN116828061B (en) * | 2023-08-18 | 2024-04-02 | 联桥科技有限公司 | Configuration method and system for power line carrier and wireless fusion communication |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Deng et al. | Resource allocation and interference management for opportunistic relaying in integrated mmWave/sub-6 GHz 5G networks | |
| Marina et al. | A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks | |
| Ozger et al. | Clustering in multi-channel cognitive radio ad hoc and sensor 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 | |
| KR100918399B1 (en) | Apparatus and method for communication in wireless sensor network | |
| CN116321469A (en) | Method for avoiding channel conflict of large-scale self-organizing network based on conflict graph | |
| Mansoor et al. | Spectrum aware cluster-based architecture for cognitive radio ad-hoc networks | |
| Rahman et al. | Integrating low-power wide-area networks in white spaces | |
| Sheu et al. | Location-free topology control protocol in wireless ad hoc networks | |
| CN102946627B (en) | On spectrum utility-synergy routing algorithm in cognitive radio systems | |
| Diab et al. | Overview on Multi-Channel Communications in Wireless Sensor Networks. | |
| Zhao et al. | Scalability and performance evaluation of hierarchical hybrid wireless networks | |
| Gong et al. | A multi-channel cooperative MIMO MAC protocol for wireless sensor networks | |
| Zhou et al. | Practical routing and channel assignment scheme for mesh networks with directional antennas | |
| Dai et al. | Effective Channel Assignment Based on Dynamic Source Routing in Cognitive Radio Networks. | |
| Mansoor et al. | A stable cluster-based architecture for cognitive radio ad-hoc networks | |
| Alazemi et al. | Fixed channel assignment algorithm for multi‐radio multi‐channel MESH networks | |
| Zareei et al. | Dynamic spectrum allocation for cognitive radio ad hoc network | |
| Lee et al. | An integrated multihop cellular data network | |
| CN103731835B (en) | Multiple input multiple output medium access control (MIMO MAC) protocol method for achieving singlecast and broadcast | |
| Jiang et al. | Smart antenna-based multi-hop highly-energy-efficient DSA approach to drone-assisted backhaul networks for 5G | |
| Rao et al. | Allocation of opportunistic spectrum in cognitive radio ad hoc networks | |
| Xin et al. | Gateway selection scheme for throughput optimization in multi-radio multi-channel wireless mesh networks | |
| EkbataniFard | Multi-channel medium access control protocols for wireless sensor networks: A survey |
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 |