CN112188501A - Channel allocation method considering transformer substation wireless relay networking - Google Patents

Channel allocation method considering transformer substation wireless relay networking Download PDF

Info

Publication number
CN112188501A
CN112188501A CN202010910951.8A CN202010910951A CN112188501A CN 112188501 A CN112188501 A CN 112188501A CN 202010910951 A CN202010910951 A CN 202010910951A CN 112188501 A CN112188501 A CN 112188501A
Authority
CN
China
Prior art keywords
wireless access
channel
access points
access point
allocated
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
Application number
CN202010910951.8A
Other languages
Chinese (zh)
Inventor
林睿
陆国生
田霖
陈保豪
朱一峰
刘淼
茹正辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Super High Transmission Co of China South Electric Net Co Ltd
Original Assignee
Super High Transmission Co of China South Electric Net Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Super High Transmission Co of China South Electric Net Co Ltd filed Critical Super High Transmission Co of China South Electric Net Co Ltd
Priority to CN202010910951.8A priority Critical patent/CN112188501A/en
Publication of CN112188501A publication Critical patent/CN112188501A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10Dynamic resource partitioning
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0231Traffic management, e.g. flow control or congestion control based on communication conditions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access, e.g. scheduled or random access
    • H04W74/002Transmission of channel access control information
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention provides a channel allocation method considering transformer substation wireless relay networking, which solves the problems that the networking mode of the existing transformer substation causes poor flexibility of power grid communication and the orthogonal frequency division multiple access technology used by a transformer substation wireless communication network cannot fully utilize channel resources, divides wireless access points into a set to be networked and a set of channels to be allocated based on the maximum communication distance of a central node, firstly selects relay points for the wireless access points in the set to be networked to form a distributed networking mode of transformer substation wireless relay networking, overcomes the defect of poor flexibility, secondly, combines power gain and channel matching values to judge the best matching channel, namely, based on the non-orthogonal frequency division multiple access technology, overcomes the defect that one channel only contains one wireless access point when the orthogonal frequency division multiple access technology is applied, and aims at not maximizing energy efficiency, the wireless access points contained in the channel are determined, so that the utilization rate of the channel is guaranteed, and the maximum energy efficiency is also guaranteed.

Description

Channel allocation method considering transformer substation wireless relay networking
Technical Field
The invention relates to the technical field of wireless communication of transformer substations, in particular to a channel allocation method considering transformer substation wireless relay networking.
Background
With the development of wireless networks of substations, wireless communication research in the field of communication for substations has become popular, but even today, due to the complexity and specificity of the power grid environment, our knowledge of substations is still very limited.
The wireless network communication of the transformer substation mainly depends on power grid communication, and the power grid communication has the characteristics of high energy consumption, low transmission rate, long time delay and the like, so that the transformer substation is faced with many challenges. Due to the complex transformer substation condition, once the problem of the power grid communication occurs, the problem is difficult to be solved in time, so that the realization of the high efficiency and reliability of the transformer substation network and the high performance of the power grid communication are difficult, and therefore, a more effective transformer substation networking method needs to be designed to improve the reliability, the rapidity and the convenience of the transformer substation network communication connection.
At present, most of substation networking modes are central networking, so that the power grid communication range has certain limitation, and the power grid communication widely uses an orthogonal frequency division multiple access technology, for example, chinese patent No. CN101384077A, 3.11.2009, discloses a relay station selection and sub-channel allocation method in an orthogonal frequency division multiple access system, so that selection of a relay station for communication connection between a UT and a BS is realized, and allocation of sub-channels in a relay link and an access link is completed.
Disclosure of Invention
The invention provides a channel allocation method considering substation wireless relay networking, aiming at solving the problems that the grid communication flexibility is poor due to the networking mode of the existing substation, and channel resources of the grid communication cannot be fully utilized due to the orthogonal frequency division multiple access technology used by the substation wireless communication network.
In order to achieve the technical effects, the technical scheme of the invention is as follows:
a channel allocation method considering substation wireless relay networking at least comprises the following steps:
s1, setting the maximum communication distance of a central node as D, and respectively recording the distance D between any one wireless access point i of n wireless access points in a wireless network of a transformer substation and the central nodeiForm a distance set d, d ═ d { (d)1,d2,…,di,…,dn},i=1,2,i,…,n;
S2, judging diWhether the criterion is met:
did is less than or equal to D, if yes, the wireless access points meeting the standard are classified into a channel set M to be distributed, otherwise, the wireless access points are classified into a network set N to be networked;
s3, respectively calculating the distance between each wireless access point in the set N to be networked and all wireless access points in the channel set M to be distributed, and determining the relay point of each wireless access point in the set N to be networked;
s4, setting and initializing a channel matching list SMatch(k) Unmatched list SUnMatchA channel set K and a channel matching value b, b being 0, where K is {1, 2., K }, where K denotes an index of a channel K in the channel set K;
s5, traversing and solving each channel of the wireless access point of each unallocated channel in the channel set M to be allocated in the channel set KChannel matching value b corresponding to upper power gainm,kM represents the number of the wireless access points supposed to be allocated to the channel k in the channel set M to be allocated; combining power gain and channel matching value bm,kPreliminarily determining a channel matching list S matched with the wireless access point of each unallocated channel in the channel set M to be allocatedMatch(k) A channel of (1);
s6, judging matching to a channel matching list SMatch(k) Whether the number w of wireless access points per channel satisfies: w is less than or equal to 2, if yes, a channel matching list S allocated by each wireless access point in the channel set M to be allocated is finally determinedMatch(k) A channel of (1); otherwise, go to step S7;
s7, channel matching list S for matched wireless access pointsMatch(k) Selecting two wireless access points with the maximum energy efficiency on each channel as the matched wireless access points of each channel;
s8, updating the channel matching list SMatch(k) And unmatched list SUnMatch
S9, judging whether all the unallocated wireless access points in the channel set M to be allocated have allocated channels or not, if so, ending; otherwise, the execution returns to step S5.
Here, based on the maximum communication distance D of the central node, N wireless access points in the wireless network of the substation are divided into a to-be-networked set N far away from the central node and a to-be-allocated channel set M near the central node, the wireless access points of the to-be-networked set N exceeding the maximum communication distance D are not directly communicated with the central node, and a wireless access point needs to be selected from the near to-be-allocated channel set M as a relay point for distributed wireless relay networking, so that the flexibility of power grid communication is improved, while the channel may be in direct communication with the central node, the radio access node of the set M of channels to be allocated waits for channel allocation, and, in addition, in the aspect of channel allocation, two wireless access points with the largest energy efficiency on each channel are selected, and the defect that only one wireless access point is accommodated in one channel when the orthogonal frequency division multiple access technology is applied is overcome based on the non-orthogonal frequency division multiple access technology.
Preferably, all the wireless access points in the channel set M to be allocated are communicated with the central node through allocated channels, and each wireless access point in the channel set N to be networked is communicated with the central node through a relay point.
Preferably, the step S3 determines the relay point of each wireless access point in the set N to be networked as follows:
s31, setting the number of the wireless access points in the set N to be networked as v, and setting N as { N ═ N }1,N2,…,Nh,…,NvAnd the number of the wireless access points in the channel set M to be distributed is t, and M is equal to { M ═ M }1,M2,…,Mg,…,MtH and g respectively represent the label of any wireless access point in the set N to be networked or any wireless access point in the set M to be distributed;
s32, respectively calculating the distance between each wireless access point in the v wireless access points in the set N to be networked and the t wireless access points in the set M to be distributed, wherein any one wireless access point N in the set N to be networkedhThe distances between the channel set M and t wireless access points to be distributed form a set NdhgComprises the following steps:
Ndhg={NMd1,NMd2,…,NMdh,…,NMdt};
wherein, NMdhRepresents any wireless access point N in the set N to be networkedhThe distance from any wireless access point g in the channel set M to be allocated;
s33, obtaining a set NdhgMinimum value N indhmin
Ndhgmin=min{NMd1,NMd2,…,NMdt};
S34, judging NdhgminWhether the wireless access point in the corresponding channel set M to be distributed is divided by the wireless access point N in the set N to be networked or nothOther wireless access points are selected, if yes, N is carried outdhgminThe corresponding wireless access point in the channel set M to be allocated is removed from the channel set M to be allocated, and the step S33 is returned; otherwise, N isdhgminCorresponding toThe wireless access point in the channel set M to be distributed is used as the wireless access point N in the set N to be networkedhThe relay point of (1).
Here, since the wireless access points in the set N to be networked have a sequential order of selecting relay points from the set M of channels to be allocated, to avoid repeated selection, the wireless access points in the set M of channels to be allocated, which have been selected by other wireless access points, are removed from the set M of channels to be allocated.
Preferably, the formula for respectively calculating the distance between each of the v wireless access points in the set N to be networked and t wireless access points in the set M to be assigned in step S3 satisfies:
Figure BDA0002663248980000031
wherein, NMdhgRepresents the distance, x, between any one wireless access point h in the v wireless access points in the set N to be networked and any wireless access point g in the set M to be distributedh、yhRespectively representing the abscissa and the ordinate of any one wireless access point h in the v wireless access points of the set N to be networked; x is the number ofg、ygRespectively representing the abscissa and the ordinate of any one wireless access point g in the set M of channels to be allocated.
Preferably, the channel matching list SMatch(k) Is initialized to null, unmatched list SUnMatchIs initialized for all unassigned wireless access points in the set M of channels to be assigned.
Here, a channel matching list SMatch(k) At the content initialization time, all the unassigned wireless access points in the set M of channels to be assigned are unassigned channels, and therefore the channel matching list SMatch(k) Is empty when initialized, and the corresponding unmatched list SUnMatchIs initialized for all unassigned wireless access points in the set M of channels to be assigned.
Preferably, the channel matching value b corresponding to the power gain of each channel in step S5m,kIs solved byThe formula is as follows:
Figure BDA0002663248980000041
wherein, M represents the general reference number of the wireless access point of each unallocated channel in the channel set M to be allocated, K represents the K channel in the channel set K, and the wireless access point M is allocated to the channel K; hm,kRepresents the power gain of the wireless access point m on the k channel, and argmax represents the maximum function.
Preferably, after step S6, step S7 is preceded by: the wireless access points in the set M of channels to be allocated, for which it has been finally determined that channels are allocated, never match the list SUnMatchIs removed.
Preferably, the process of step S7 is:
s71, matching the channel to a channel matching list SMatch(k) The wireless access points of each channel form a set R, R ═ R1,r2,…,rz},rzRepresenting matches to a channel match list SMatch(k) Z represents a match to the channel match list SMatch(k) The number of wireless access points of each channel, z is more than 2;
s72, combining the wireless access points in the set R in pairs to form z (z-1) and/or a judgment unit2For wireless access point Sq
S73. finding z (z-1) </or >2For wireless access point SqEnergy efficiency E (S) corresponding to each pair of wireless access pointsq) Determining z (z-1) </>2Centering a pair of wireless access points S with the highest energy efficiencyqmax,E(Sqmax)=max{E(Sq) A pair of wireless access points S with the maximum energy efficiency on each channelqmaxAs the wireless access point for which allocation is ultimately determined.
Here, the normal matching is given to the channel matching list SMatch(k) The maximum number w of wireless access points of each channel is two, and the number of wireless access points does not exceed two, and when the number of wireless access points exceeds two, the wireless access points are matched with a channel matching list SMatch(k) In each channel of the radio systemThe wireless access points in the access point set R are combined in pairs, the aim of maximizing energy efficiency is fulfilled, the wireless access points contained in the channel can meet the maximum energy efficiency, the utilization rate of the channel is guaranteed, and the maximum energy efficiency is also guaranteed.
Preferably, the power of all the wireless access points in the set R is evenly distributed, and each channel is matched with the pair of wireless access points S with the largest energy efficiencyqmaxThen, the pair of wireless access points S with the maximum energy-removing effect is not matched any moreqmaxA wireless access point.
Compared with the prior art, the technical scheme of the invention has the beneficial effects that:
the invention provides a channel allocation method considering a wireless relay networking of a transformer substation, which divides wireless access points in a wireless network of the transformer substation into a set to be networked far away from a central node and a set to be allocated channels near the central node based on the maximum communication distance of the central node, firstly selects relay points for the wireless access points in the set to be networked far away from the central node to form a distributed networking mode of the wireless relay networking of the transformer substation, overcomes the defect of poor flexibility of the existing networking mode of the transformer substation, considers the wireless relay networking of the transformer substation, judges the channel most matched with the wireless access points in the set to be allocated channels by combining power gain and channel matching values, overcomes the defect that one channel only contains one wireless access point when an orthogonal frequency division multiple access technology is applied based on the non-orthogonal frequency division multiple access technology, and aims at not maximizing energy efficiency, the wireless access point accommodated by the channel is the wireless access point capable of meeting the maximum energy efficiency, so that the utilization rate of the channel is ensured, and the maximum energy efficiency is also ensured.
Drawings
Fig. 1 is a schematic flow chart illustrating a channel allocation method considering substation wireless relay networking according to an embodiment of the present invention;
fig. 2 is a diagram illustrating a communication connection between a central node and a wireless access point in a wireless network of a substation according to an embodiment of the present invention.
Detailed Description
The drawings are for illustrative purposes only and are not to be construed as limiting the patent;
for better illustration of the present embodiment, certain parts of the drawings may be omitted, enlarged or reduced, and do not represent actual dimensions;
it will be understood by those skilled in the art that certain well-known descriptions of the figures may be omitted.
The technical solution of the present invention is further described below with reference to the accompanying drawings and examples.
Example 1
A flow chart of a channel allocation method considering substation wireless relay networking as shown in fig. 1 is shown, and referring to fig. 1, the method includes:
s1, setting the maximum communication distance of a central node as D, and respectively recording the distance D between any one wireless access point i of n wireless access points in a wireless network of a transformer substation and the central nodeiForm a distance set d, d ═ d { (d)1,d2,…,di,…,d n1,2, i, …, n; referring to fig. 2, reference numeral 1 shown in fig. 2 is a central node, reference numeral 2 is a wireless access point, fig. 2 includes a central node and 9 wireless access points, and the radius of a circle corresponding to fig. 2 is the maximum communication distance of the central node, which is D, with the central node as the center of a circle;
s2, judging diWhether the criterion is met:
did is less than or equal to D, if yes, the wireless access points meeting the standard are classified into a channel set M to be distributed, otherwise, the wireless access points are classified into a network set N to be networked;
referring to fig. 2, with a center node as a circle center, distances between 7 wireless access points inside a circle with a radius of D and the center node do not exceed D, the wireless access points are classified into a channel set M to be allocated, distances between two wireless access points outside the circle and the center node are greater than D, the wireless access points are classified into a channel set N to be networked, all the wireless access points in the channel set M to be allocated are communicated with the center node through allocated channels, and each wireless access point in the channel set N to be networked is communicated with the center node through a relay point;
s3, respectively calculating the distance between each wireless access point in the set N to be networked of the graph 2 and all wireless access points in the channel set M to be distributed, and determining the relay point of each wireless access point in the set N to be networked;
step S3 is to determine the relay point of each wireless access point in the set N to be networked as follows:
s31, setting the number of the wireless access points in the set N to be networked as v, and setting N as { N ═ N }1,N2,…,Nh,…,NvV is 2 in this example; the number of the wireless access points in the channel set M to be distributed is t, M ═ M1,M2,…,Mg,…,MtT is 7 in this embodiment; h and g respectively represent the label of any wireless access point in the set N to be networked or any wireless access point in the set M to be distributed;
s32, respectively calculating the distance between each wireless access point in two wireless access points in a set N to be networked and t wireless access points in a set M to be distributed, wherein any one wireless access point N in the set N to be networkedhThe distances between the channel set M and t wireless access points to be distributed form a set NdhgComprises the following steps:
Ndhg={NMd1,NMd2,…,NMdh,…,NMdt};
wherein, NMdhRepresents any wireless access point N in the set N to be networkedhThe distance from any wireless access point g in the channel set M to be allocated; respectively calculating the distance formula between each wireless access point in the v wireless access points in the set N to be networked and t wireless access points in the set M to be distributed, wherein the distance formula satisfies the following conditions:
Figure BDA0002663248980000061
wherein, NMdhgRepresents the distance, x, between any one wireless access point h in the v wireless access points in the set N to be networked and any wireless access point g in the set M to be distributedh、yhRespectively representing sets N to be networkedThe abscissa and the ordinate of any one h of the v wireless access points; x is the number ofg、ygRespectively representing the abscissa and the ordinate of any wireless access point g in the channel set M to be distributed;
s33, obtaining a set NdhgMinimum value N indhmin
Ndhgmin=min{NMd1,NMd2,…,NMdt};
S34, judging NdhgminWhether the wireless access point in the corresponding channel set M to be distributed is divided by the wireless access point N in the set N to be networked or nothOther wireless access points are selected, if yes, N is carried outdhgminThe corresponding wireless access point in the channel set M to be allocated is removed from the channel set M to be allocated, and the step S33 is returned; otherwise, N isdhgminThe corresponding wireless access point in the channel set M to be distributed is used as the wireless access point N in the set N to be networkedhNamely, in the implementation operation, if the wireless access point in the channel set M to be allocated corresponding to the wireless access point in the set N to be networked is divided by the wireless access point N in the set N to be networkedhThe distances between other wireless access points, namely other wireless access points and the wireless access point of this time, and the same wireless access point in the channel set M to be distributed are all minimum, and the later matched wireless access point can not take the same wireless access point in the channel set M to be distributed as a relay point any more according to the principle of precedence, so that the selected relay point is directly removed from the channel set M to be distributed in order to avoid repeatability;
s4, setting and initializing a channel matching list SMatch(k) Unmatched list SUnMatchA channel set K and a channel matching value b, b being 0, where K is {1, 2., K }, where K denotes an index of a channel K in the channel set K;
in the present embodiment, since the channel matches list SMatch(k) At the content initialization time, all the unassigned wireless access points in the channel set M to be assigned are unassigned channels, so that the channel matching list SMatch(k) Is initialized to null, and relatively notMatching list SUnMatchWhen initializing the content, the wireless access points are all unallocated in the channel set M to be allocated;
s5, traversing and solving a channel matching value b corresponding to the power gain of each wireless access point of each unallocated channel in the channel set M to be allocated on each channel in the channel set Km,kM represents the number of the wireless access points supposed to be allocated to the channel k in the channel set M to be allocated; combining power gain and channel matching value bm,kPreliminarily determining a channel matching list S matched with the wireless access point of each unallocated channel in the channel set M to be allocatedMatch(k) A channel of (1); the channel matching value b corresponding to the power gain of each channel in step S5m,kThe solving formula of (2) is as follows:
Figure BDA0002663248980000071
wherein, M represents the general reference number of the wireless access point of each unallocated channel in the channel set M to be allocated, K represents the K channel in the channel set K, and the wireless access point M is allocated to the channel K; hm,kRepresents the power gain of the wireless access point m on the k channel, and argmax represents the maximum function.
S6, judging matching to a channel matching list SMatch(k) Whether the number w of wireless access points per channel satisfies: w is less than or equal to 2, if yes, a channel matching list S allocated by each wireless access point in the channel set M to be allocated is finally determinedMatch(k) A channel of (1); otherwise, go to step S7;
s7, channel matching list S for matched wireless access pointsMatch(k) Selecting two wireless access points with the maximum energy efficiency on each channel as the matched wireless access points of each channel;
the process of step S7 is:
s71, matching the channel to a channel matching list SMatch(k) The wireless access points of each channel form a set R, R ═ R1,r2,…,rz},rzRepresenting matches to a channel match list SMatch(k) Z represents a match to the channel match list SMatch(k) The number of wireless access points of each channel, z is more than 2;
s72, combining the wireless access points in the set R in pairs to form z (z-1) and/or a judgment unit2For wireless access point Sq
S73. finding z (z-1) </or >2For wireless access point SqEnergy efficiency E (S) corresponding to each pair of wireless access pointsq) Determining z (z-1) </>2Centering a pair of wireless access points S with the highest energy efficiencyqmax,E(Sqmax)=max{E(Sq) A pair of wireless access points S with the maximum energy efficiency on each channelqmaxAs the wireless access point for which allocation is ultimately determined.
The premise of taking the maximum energy efficiency as a target is that the power of all the wireless access points in the set R is evenly distributed, and a pair of wireless access points S with the maximum energy efficiency is matched on each channelqmaxThen, the pair of wireless access points S with the maximum energy-removing effect is not matched any moreqmaxA wireless access point;
s8, updating the channel matching list SMatch(k) And unmatched list SUnMatch
S9, judging whether all the unallocated wireless access points in the channel set M to be allocated have allocated channels or not, if so, ending; otherwise, the execution returns to step S5.
In this embodiment, after step S6, step S7 is preceded by: the wireless access points in the set M of channels to be allocated, for which it has been finally determined that channels are allocated, never match the list SUnMatchIs removed.
The positional relationships depicted in the drawings are for illustrative purposes only and are not to be construed as limiting the present patent;
it should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.

Claims (10)

1. A channel allocation method considering substation wireless relay networking is characterized by at least comprising the following steps:
s1, setting the maximum communication distance of a central node as D, and respectively recording the distance D between any one wireless access point i of n wireless access points in a wireless network of a transformer substation and the central nodeiForm a distance set d, d ═ d { (d)1,d2,…,di,…,dn},i=1,2,i,…,n;
S2, judging diWhether the criterion is met:
did is less than or equal to D, if yes, the wireless access points meeting the standard are classified into a channel set M to be distributed, otherwise, the wireless access points are classified into a network set N to be networked;
s3, respectively calculating the distance between each wireless access point in the set N to be networked and all wireless access points in the channel set M to be distributed, and determining the relay point of each wireless access point in the set N to be networked;
s4, setting and initializing a channel matching list SMatch(k) Unmatched list SUnMatchA channel set K and a channel matching value b, b being 0, where K is {1, 2., K }, where K denotes an index of a channel K in the channel set K;
s5, traversing and solving a channel matching value b corresponding to the power gain of each wireless access point of each unallocated channel in the channel set M to be allocated on each channel in the channel set Km,kM represents the number of the wireless access points supposed to be allocated to the channel k in the channel set M to be allocated; combining power gain and channel matching value bm,kPreliminarily determining a channel matching list S matched with the wireless access point of each unallocated channel in the channel set M to be allocatedMatch(k) A channel of (1);
s6, judging matching to a channel matching list SMatch(k) In each channel of the radio systemWhether the number w of entry points satisfies: w is less than or equal to 2, if yes, a channel matching list S allocated by each wireless access point in the channel set M to be allocated is finally determinedMatch(k) A channel of (1); otherwise, go to step S7;
s7, channel matching list S for matched wireless access pointsMatch(k) Selecting two wireless access points with the maximum energy efficiency on each channel as the matched wireless access points of each channel;
s8, updating the channel matching list SMatch(k) And unmatched list SUnMatch
S9, judging whether all the unallocated wireless access points in the channel set M to be allocated have allocated channels or not, if so, ending; otherwise, the execution returns to step S5.
2. The channel allocation method considering substation wireless relay networking according to claim 1, wherein all wireless access points in the to-be-allocated channel set M are communicated with the central node through allocated channels, and each wireless access point in the to-be-networked set N is communicated with the central node through a relay point.
3. The channel allocation method considering substation wireless relay networking according to claim 2, wherein the step S3 determines the relay point of each wireless access point in the set N to be networked as follows:
s31, setting the number of the wireless access points in the set N to be networked as v, and setting N as { N ═ N }1,N2,…,Nh,…,NvAnd the number of the wireless access points in the channel set M to be distributed is t, and M is equal to { M ═ M }1,M2,…,Mg,…,MtH and g respectively represent the label of any wireless access point in the set N to be networked or any wireless access point in the set M to be distributed;
s32, respectively calculating the distance between each wireless access point in the v wireless access points in the set N to be networked and the t wireless access points in the channel set M to be distributed, wherein any one wireless access point in the set N to be networked isPoint NhThe distances between the channel set M and t wireless access points to be distributed form a set NdhgComprises the following steps:
Ndhg={NMd1,NMd2,…,NMdh,…,NMdt};
wherein, NMdhRepresents any wireless access point N in the set N to be networkedhThe distance from any wireless access point g in the channel set M to be allocated;
s33, obtaining a set NdhgMinimum value N indhmin
Ndhgmin=min{NMd1,NMd2,…,NMdt};
S34, judging NdhgminWhether the wireless access point in the corresponding channel set M to be distributed is divided by the wireless access point N in the set N to be networked or nothOther wireless access points are selected, if yes, N is carried outdhgminThe corresponding wireless access point in the channel set M to be allocated is removed from the channel set M to be allocated, and the step S33 is returned; otherwise, N isdhgminThe corresponding wireless access point in the channel set M to be distributed is used as the wireless access point N in the set N to be networkedhThe relay point of (1).
4. The channel allocation method considering substation wireless relay networking according to claim 3, wherein the step S3 is implemented by calculating a distance formula between each of the v wireless access points in the set N to be networked and t wireless access points in the set M to be allocated according to the following formula:
Figure FDA0002663248970000021
wherein, NMdhgRepresents the distance, x, between any one wireless access point h in the v wireless access points in the set N to be networked and any wireless access point g in the set M to be distributedh、yhRespectively representing the abscissa and the ordinate of any one wireless access point h in the v wireless access points of the set N to be networkedCoordinates; x is the number ofg、ygRespectively representing the abscissa and the ordinate of any one wireless access point g in the set M of channels to be allocated.
5. The channel allocation method considering substation wireless relay networking according to claim 1, wherein the channel matching list S isMatch(k) Is initialized to null, unmatched list SUnMatchIs initialized for all unassigned wireless access points in the set M of channels to be assigned.
6. The channel allocation method for substation wireless communication networking according to claim 4, wherein the channel matching value b corresponding to the power gain of each channel in step S5m,kThe solving formula of (2) is as follows:
Figure FDA0002663248970000031
wherein, M represents the general reference number of the wireless access point of each unallocated channel in the channel set M to be allocated, K represents the K channel in the channel set K, and the wireless access point M is allocated to the channel K; hm,kRepresents the power gain of the wireless access point m on the k channel, and argmax represents the maximum function.
7. The method for allocating channels considering substation wireless relay networking according to claim 6, wherein after step S6, step S7 further comprises: the wireless access points in the set M of channels to be allocated, for which it has been finally determined that channels are allocated, never match the list SUnMatchIs removed.
8. The channel allocation method considering substation wireless relay networking according to claim 7, wherein the step S7 is performed by:
s71, matching the channel to a channel matching list SMatch(k) The wireless access points of each channel form a set R, R ═ R1,r2,…,rz},rzRepresenting matches to a channel match list SMatch(k) Z represents a match to the channel match list SMatch(k) The number of wireless access points of each channel, z is more than 2;
s72, combining the wireless access points in the set R pairwise to form z (z-1)/2 pairs of wireless access points Sq
S73, obtaining z (z-1)/2 pairs of wireless access points SqEnergy efficiency E (S) corresponding to each pair of wireless access pointsq) Determining a pair of wireless access points S with the maximum energy efficiency in the z (z-1)/2 pairsqmax,E(Sqmax)=max{E(Sq) A pair of wireless access points S with the maximum energy efficiency on each channelqmaxAs the wireless access point for which allocation is ultimately determined.
9. The method of claim 8, wherein the power of all wireless access points in set R is distributed evenly.
10. The method for allocating channels considering substation wireless relay networking according to claim 8, wherein a pair of wireless access points S with the highest energy efficiency are matched on each channelqmaxThen, the pair of wireless access points S with the maximum energy-removing effect is not matched any moreqmaxA wireless access point.
CN202010910951.8A 2020-09-02 2020-09-02 Channel allocation method considering transformer substation wireless relay networking Pending CN112188501A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010910951.8A CN112188501A (en) 2020-09-02 2020-09-02 Channel allocation method considering transformer substation wireless relay networking

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010910951.8A CN112188501A (en) 2020-09-02 2020-09-02 Channel allocation method considering transformer substation wireless relay networking

Publications (1)

Publication Number Publication Date
CN112188501A true CN112188501A (en) 2021-01-05

Family

ID=73925572

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010910951.8A Pending CN112188501A (en) 2020-09-02 2020-09-02 Channel allocation method considering transformer substation wireless relay networking

Country Status (1)

Country Link
CN (1) CN112188501A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105896741A (en) * 2016-05-30 2016-08-24 东南大学 Wireless power transmission system power efficiency optimization method based on matching efficiency set element exhaustion method
JP2018046446A (en) * 2016-09-15 2018-03-22 日本電気株式会社 Radio communication control device, radio communication system, preamble sequence distribution method, and program
US20190281487A1 (en) * 2017-11-17 2019-09-12 Huawei Technologies Co., Ltd. System and Method for Channel Measurement and Interference Measurement in Wireless Network
US20200037254A1 (en) * 2016-09-28 2020-01-30 Idac Holdings, Inc. Uplink Power Control

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105896741A (en) * 2016-05-30 2016-08-24 东南大学 Wireless power transmission system power efficiency optimization method based on matching efficiency set element exhaustion method
JP2018046446A (en) * 2016-09-15 2018-03-22 日本電気株式会社 Radio communication control device, radio communication system, preamble sequence distribution method, and program
US20200037254A1 (en) * 2016-09-28 2020-01-30 Idac Holdings, Inc. Uplink Power Control
US20190281487A1 (en) * 2017-11-17 2019-09-12 Huawei Technologies Co., Ltd. System and Method for Channel Measurement and Interference Measurement in Wireless Network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
RYOULHEE KWAK: "Performance Analysis for OFDMA Downlink Relay Systems: Relay Gain and Fairness", 《IEEE COMMUNICATIONS SOCIETY》 *
孟洛明;孙康;韦磊;郭少勇;徐思雅;: "一种面向电力无线专网的虚拟资源优化分配机制", 电子与信息学报, no. 07 *
徐周斌;: "基于IEEE802.11的无线局域网构建", 舰船电子工程, no. 06 *

Similar Documents

Publication Publication Date Title
Liu et al. NOMA-based resource allocation for cluster-based cognitive industrial internet of things
CN107947878B (en) Cognitive radio power distribution method based on energy efficiency and spectrum efficiency joint optimization
CN108650689B (en) Energy efficiency optimization method of wireless energy-carrying communication system based on NOMA downlink
CN108462950B (en) NOMA-based D2D communication combined sub-channel and power distribution method
CN104105158B (en) A kind of relay selection method based on D2D trunking traffics
CN103220788B (en) Method, node and the access point that node is grouped
CN108834112B (en) NOMA-based relay-assisted D2D communication system power distribution method
CN108391317B (en) Resource allocation method and system for D2D communication in cellular network
CN104507168B (en) Recognize the distribution topology control method of Ad Hoc networks
CN105813129A (en) Resource allocation method based on D2D clustering
CN104796990B (en) D2D resource allocation methods based on Power Control in honeycomb heterogeneous network
CN111586646B (en) Resource allocation method for D2D communication combining uplink and downlink channels in cellular network
CN108064077B (en) The power distribution method of full duplex D2D in cellular network
CN109861728B (en) Joint multi-relay selection and time slot resource allocation method for large-scale MIMO system
CN106792764B (en) Wireless base station planning method for power distribution terminal communication access network
CN109451571A (en) A kind of federated resource distribution method in NOMA relay system
CN108848045B (en) D2D communication interference management method based on joint interference alignment and power optimization
CN109451569A (en) A kind of resource allocation methods wirelessly taken in energy heterogeneous network
CN108462975B (en) Power and time joint distribution method in D2D wireless power supply communication network
CN107172706A (en) It is a kind of to be distributed and Poewr control method based on the combined wireless resource that D2D communicates
CN112261662B (en) Transmission method for improving energy efficiency of NOMA cooperative communication system
CN112188635B (en) D2D communication resource allocation method for improving graph coloring
CN106912059B (en) Cognitive relay network joint relay selection and resource allocation method supporting mutual information accumulation
CN108347761A (en) Power distribution method in CRN and its application in wisdom traffic network
Arnob et al. Dual-order resource allocation in 5G H-CRAN using matching theory and ant colony optimization algorithm

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