CN113783588A - Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data - Google Patents
Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data Download PDFInfo
- Publication number
- CN113783588A CN113783588A CN202111336463.1A CN202111336463A CN113783588A CN 113783588 A CN113783588 A CN 113783588A CN 202111336463 A CN202111336463 A CN 202111336463A CN 113783588 A CN113783588 A CN 113783588A
- Authority
- CN
- China
- Prior art keywords
- relay
- signal
- selection area
- competition
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/022—Site diversity; Macro-diversity
- H04B7/026—Co-operative diversity, e.g. using fixed or mobile stations as relays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the application provides a method and a device for high-frequency acquisition opportunity relay dynamic routing of transformer area data, and relates to the technical field of wireless communication, wherein the method for high-frequency acquisition opportunity relay dynamic routing of the transformer area data comprises the following steps: firstly, acquiring a signal source position sent by a signal source, and acquiring a target position sent by a target; determining a relay selection area according to the source position and the destination position, and selecting the best relay in the relay selection area; then, a first signal sent by information source broadcasting is received through the optimal relay, and the first signal is amplified through the optimal relay to obtain a second signal; and finally, sending the second signal to the target through the optimal relay, so that the target combines the received first signal and the second signal by adopting a maximum ratio combining algorithm, and the optimal relay can be selected in real time in a network structure with huge number of nodes, thereby being beneficial to the effective implementation of cooperative communication.
Description
Technical Field
The application relates to the technical field of wireless communication, in particular to a method and a device for opportunistic relay dynamic routing of high-frequency acquisition of station area data.
Background
The selection of relays is a key issue in cooperative communication. Wherein the best relay is usually selected once coordinated. However, as the volume of network structures is increasing, how to select an optimal relay in real time and perform cooperative communication in a network structure with a large number of nodes becomes a huge problem.
Disclosure of Invention
An object of the embodiments of the present application is to provide a method and an apparatus for opportunistic relay dynamic routing for high-frequency acquisition of data in a distribution room, which can select an optimal relay in real time in a network structure with a large number of nodes, thereby facilitating effective implementation of cooperative communication.
The first aspect of the embodiments of the present application provides a method for opportunistic relay dynamic routing for high-frequency acquisition of data in a distribution room, including:
acquiring the position of an information source sent by the information source and acquiring the position of a target sent by a target;
determining a relay selection area according to the information source position and the target position, and selecting an optimal relay in the relay selection area;
receiving a first signal sent by the information source broadcast through the optimal relay, and amplifying the first signal through the optimal relay to obtain a second signal;
and sending the second signal to the destination through the optimal relay, so that the destination combines the received first signal and the second signal by adopting a maximum ratio combining algorithm.
In the implementation process, the position of the information source sent by the information source is firstly obtained, and the target position sent by the target is obtained; determining a relay selection area according to the source position and the destination position, and selecting the best relay in the relay selection area; then, a first signal sent by information source broadcasting is received through the optimal relay, and the first signal is amplified through the optimal relay to obtain a second signal; and finally, sending the second signal to the target through the optimal relay, so that the target combines the received first signal and the second signal by adopting a maximum ratio combining algorithm, and the optimal relay can be selected in real time in a network structure with huge number of nodes, thereby being beneficial to the effective implementation of cooperative communication.
Further, the step of determining a relay selection area according to the source location and the destination location, and selecting an optimal relay in the relay selection area includes:
calculating according to the information source position and the target position to obtain a transmission distance from the information source to the target and a midpoint position of a midpoint of a connecting line between the information source and the target;
determining a circular relay selection area by taking the midpoint position as a circle center and the transmitting distance as a diameter;
and carrying out relay layering competition in the relay selection area according to a preset layering algorithm, and selecting the best relay.
Further, the step of performing relay hierarchical competition in the relay selection area according to a preset hierarchical algorithm and selecting the best relay includes:
dividing the relay selection area into annular zones from inside to outside according to a preset layering algorithm to obtain a plurality of competitive annular zones; the competition annular belts are not mutually overlapped and are divided into a first annular belt, a second annular belt and a third annular belt;
performing relay competition in the first annular band through timers of all relays to obtain a first relay competition result;
when the best relay is not selected from the first relay competition results, performing relay competition in the second ring band through timers of all relays to obtain second relay competition results;
when the best relay is not selected from the second relay competition results, performing relay competition in the third annular band through timers of all relays to obtain a third relay competition result; and selecting the best relay from the third relay competition results.
Further, the outer diameter of the second annular band is twice the outer diameter of the first annular band, and the inner diameter of the second annular band is twice the inner diameter of the first annular band; the third annular band has an outer diameter that is twice an outer diameter of the second annular band and an inner diameter that is twice an inner diameter of the second annular band.
Further, the preset layering algorithm comprises an outer diameter calculation formula, an inner diameter calculation formula and a constraint formula, wherein,
the outer diameter calculation formula is as follows: rhoOuter cover=2m；
The inner diameter calculation formula is as follows: rhoInner part=2（m-1）；
The constraint formula is: dsd=2M；
M is used for representing the maximum layering times for layering the relay selection area;
m is used for representing the second layer for layering the relay selection area; m is a positive integer less than or equal to M;
dsdfor representing said signalling distance.
Further, the method further comprises:
acquiring preset channel gain sent by the target;
determining a relay selection area according to the source position and the destination position, and selecting the best relay in the relay selection area comprises the following steps:
and determining a relay selection area according to the information source position and the target position, and selecting the optimal relay with the relay channel gain larger than the preset channel gain in the relay selection area.
A second aspect of the embodiments of the present application provides a distribution room data high-frequency acquisition opportunistic relay dynamic routing apparatus, where the distribution room data high-frequency acquisition opportunistic relay dynamic routing apparatus includes:
the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring the position of an information source sent by the information source and acquiring the position of a target sent by the target;
a determining unit, configured to determine a relay selection area according to the source location and the destination location, and select an optimal relay in the relay selection area;
the processing unit is used for receiving a first signal sent by the information source broadcast through the optimal relay and amplifying the first signal through the optimal relay to obtain a second signal;
a transmitting unit, configured to transmit the second signal to the destination through the optimal relay, so that the destination combines the received first signal and the second signal by using a maximal ratio combining algorithm.
In the implementation process, the acquisition unit firstly acquires the position of the information source sent by the information source and acquires the target position sent by the target; the determining unit determines a relay selection area according to the source position and the destination position, and selects the best relay in the relay selection area; the processing unit receives a first signal sent by information source broadcasting through the optimal relay, and amplifies the first signal through the optimal relay to obtain a second signal; and finally, the sending unit sends the second signal to the target through the optimal relay, so that the target combines the received first signal and the second signal by adopting a maximum ratio combining algorithm, and the optimal relay can be selected in real time in a network structure with huge number of nodes, thereby being beneficial to the effective implementation of cooperative communication.
Further, the determining unit includes:
the calculating subunit is used for calculating according to the information source position and the target position to obtain a transmitting distance from the information source to the target and a midpoint position of a midpoint of a connecting line between the information source and the target;
the determining subunit is used for determining a circular relay selection area by taking the midpoint position as a circle center and the transmitting distance as a diameter;
and the competition subunit is used for carrying out relay hierarchical competition in the relay selection area according to a preset hierarchical algorithm and selecting the optimal relay.
A third aspect of the embodiments of the present application provides an electronic device, including a memory and a processor, where the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the method for high-frequency acquisition of opportunistic relay dynamic routing of data in a distribution room according to any one of the first aspect of the embodiments of the present application.
A fourth aspect of the present embodiment provides a computer-readable storage medium, which stores computer program instructions, where the computer program instructions, when read and executed by a processor, perform the method for high-frequency acquisition of opportunistic relay dynamic routing of data in a distribution room according to any one of the first aspect of the present embodiment.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments of the present application will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and that those skilled in the art can also obtain other related drawings based on the drawings without inventive efforts.
Fig. 1 is a schematic flow chart of a method for opportunistic relay dynamic routing for high-frequency acquisition of data in a distribution room according to an embodiment of the present application;
fig. 2 is a schematic flow chart of another opportunistic relay dynamic routing method for high-frequency acquisition of data in a distribution room according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a opportunistic relay dynamic routing apparatus for high-frequency acquisition of data in a distribution room according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of another opportunistic relay dynamic routing apparatus for high-frequency acquisition of data in a distribution room according to an embodiment of the present application;
fig. 5 is a diagram of a relay selection process provided in an embodiment of the present application;
fig. 6 is a data comparison diagram of a conventional networking algorithm and a dynamic routing algorithm using topology information according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only for distinguishing the description, and are not to be construed as indicating or implying relative importance.
In this embodiment, a dynamic routing strategy for a high-frequency acquisition opportunistic relay of data in a distribution area is provided, based on a distributed opportunistic relay transmission model, all nodes can be a PLC and a micropower wireless dual-mode terminal, and since a physical topology structure of the nodes can be acquired by using a PLC technology, a micropower wireless communication mechanism can share the location information, specifically, the method relates to an information source s, a destination d and a plurality of relays r, please refer to fig. 1, where fig. 1 is a schematic flow diagram of a dynamic routing method for a high-frequency acquisition opportunistic relay of data in a distribution area according to an embodiment of the present application. The opportunistic relay dynamic routing method for high-frequency acquisition of the data in the transformer area comprises the following steps:
s101, obtaining a source position sent by a source and obtaining a destination position sent by a destination.
In the embodiment of the application, the relay r monitors a request sending data packet sent by the information source s and a permission sending data packet sent by the destination, and determines the middle point of a connecting line of the information source s and the destination d as the theoretical optimal position of the relay r, wherein the request sending data packet comprises the position information (x) of the information source ss，ys) The data packet to be transmitted is allowed to include a channel gain | h of the link between the source and the destinationsd∣2Distance between source and destination is dsd。
In this embodiment, the request-To-Send packet may specifically be an RTS (request To Send) packet, and the Clear-To-Send packet may specifically be a CTS (Clear To Send).
In the embodiment of the present application, the theoretical optimal position is a circle center, a circular surface whose diameter is a distance between the signal source s and the target d may be determined as a relay selection area, and the relay selection area is divided into a plurality of competitive annular zones, where the competitive annular zones are not overlapped with each other.
S102, determining a relay selection area according to the source position and the destination position, and selecting the best relay in the relay selection area.
As an optional implementation manner, before determining a relay selection area according to the source position and the destination position and selecting the best relay in the relay selection area, a preset channel gain sent by a destination may also be obtained.
As a further optional implementation, determining a relay selection area according to the source location and the destination location, and selecting an optimal relay in the relay selection area may specifically include the following steps:
and determining a relay selection area according to the information source position and the target position, and selecting the optimal relay with the relay channel gain larger than the preset channel gain in the relay selection area.
As an optional implementation manner, the relay r in the competition annular band determines whether to start its own timer to participate in the competition in a specified competition period according to the feedback information of the destination node d, and selects the best relay in the competition; the signal transmitting node then distributes the signal evenly to the source s and the best relay.
In the foregoing embodiment, the signal sending node may specifically be a PLC and a micropower wireless dual-mode terminal, which is not limited in this embodiment of the present application.
S103, receiving a first signal sent by source broadcasting through the optimal relay, and amplifying the first signal through the optimal relay to obtain a second signal.
In the embodiment of the application, a first time hopping information source s broadcasts a transmission signal, and an optimal relay receives a signal; the second time-hopping best relay amplifies the signal and forwards it to destination d.
And S104, sending the second signal to the destination through the optimal relay, so that the destination adopts a maximum ratio combining algorithm to combine the received first signal and the second signal.
In the embodiment of the application, the destination d receives the signal sent by the information source s and the signal amplified by the optimal relay, and combines the signals by adopting a maximum ratio combining algorithm.
In the embodiment of the application, the dynamic routing strategy of the high-frequency acquisition opportunistic relay of the data in the distribution area comprises the steps of determining a theoretical optimal position, determining a relay selection area, dividing competitive annular zones, competing in the competitive annular zones and selecting an optimal relay, and sending information to a target by an information source and the optimal relay at the same time.
In the embodiment of the present application, the main body of the method may be a relay, and this embodiment is not limited in any way.
It can be seen that, by implementing the dynamic routing method for the opportunistic relay for acquiring the data in the transformer area at high frequency described in this embodiment, the optimal relay can be selected in real time in a network structure with a large number of nodes, thereby facilitating the effective implementation of cooperative communication.
Please refer to fig. 2, fig. 2 is a schematic flow chart of a method for opportunistic relay dynamic routing for high-frequency acquisition of distribution room data according to an embodiment of the present application. As shown in fig. 2, the opportunistic relay dynamic routing method for high-frequency acquisition of data in a distribution room includes:
s201, obtaining the source position sent by the source and obtaining the destination position sent by the destination.
S202, calculating according to the position of the information source and the position of the destination to obtain the transmission distance from the information source to the destination and the midpoint position of the midpoint of the connecting line between the information source and the destination.
In the embodiment of the present application, the transmission distance between the source s and the destination d is set as dsdThen, there is the following formula:
wherein (x)s，ys) Is the location of the source s, (x)d，yd) The location of destination d.
In the embodiment of the application, the midpoint position of the midpoint of the connecting line between the targets is the theoretical optimal position (x) of the single relay0，y0) Wherein:
as an optional implementation, determining a midpoint position of a midpoint of a connecting line between a source and a destination as a theoretical optimal position of a single relay specifically includes:
calculating the signaling distance d between the source s and the destination dsd；
Calculating the theoretical optimal position (x) of a single relay0，y0）。
In the above embodiment, the end position at the midpoint of the connection between the source s and the destination d is the best position for the single relay r to maximize the received signal-to-noise ratio of the destination d, the relay receives the CTS, measures the local instantaneous CSI (Channel State Information) of the relay-destination link, and shares | hsd∣2、dsdAnd (x)0，y0) And (4) information.
And S203, determining a circular relay selection area by taking the midpoint position as the circle center and the transmitting distance as the diameter.
In the embodiment of the present application, the relay selection area is (x)0，y0) As a center of a circle, dsdIs a circular surface with a diameter.
S204, dividing the relay selection area into annular zones from inside to outside according to a preset layering algorithm to obtain a plurality of competitive annular zones; the competing circular bands are not overlapped with each other, and the competing circular bands are divided into a first circular band, a second circular band and a third circular band.
As an alternative embodiment, the outer diameter of the second annular band is twice the outer diameter of the first annular band, and the inner diameter of the second annular band is twice the inner diameter of the first annular band; the outer diameter of the third annular band is twice the outer diameter of the second annular band and the inner diameter of the third annular band is twice the inner diameter of the second annular band.
As an alternative embodiment, the preset layering algorithm includes an outer diameter calculation formula, an inner diameter calculation formula, and a constraint formula, wherein,
the outer diameter calculation formula is as follows: rhoOuter cover=2m；
The inner diameter calculation formula is as follows: rhoInner part=2（m-1）；
The constraint formula is: dsd=2M；
M is used for representing the maximum layering times for layering the relay selection area;
m is used to represent the second level of layering relay selection areas; m is a positive integer less than or equal to M;
dsdfor indicating the signaling distance.
In the embodiment of the present application, the maximum number of times of dividing the competitive annular zone may be M (M =1,2, 3 …), and then the mth divided competitive annular zone SMHas a center of a circle of (x)0，y0) Outer diameter is rhomInner diameter of rho（m-1）Where ρ ismIn exponential increments, i.e. p(m-1)=2mρ(1)M =1,2 …, M-1, because
Is established, can be calculated
。
After step S204, the method further includes the following steps:
and S205, performing relay competition in the first ring band through the timers of all relays to obtain a first relay competition result.
And S206, when the best relay is not selected from the first relay competition results, carrying out relay competition in the second ring band through the timers of all relays to obtain a second relay competition result.
S207, when the best relay is not selected from the second relay competition results, carrying out relay competition in a third annular band through timers of all relays to obtain a third relay competition result; the best relay is selected from the third relay competition results.
In the embodiment of the application, the relay r in the competition annular band judges whether to start a timer of the relay r to participate in the competition in a specified competition period according to the feedback information of the destination node d, the best relay is selected by the competition, if no relay r is selected in the previous competition period, the outer diameter and the inner diameter of the current competition annular band are doubled, the current competition annular band is determined to be a new competition annular band, and the new competition annular band continues to compete for the relay.
Referring to fig. 5, fig. 5 is a diagram illustrating a relay selection process according to an embodiment of the present disclosure. As shown in FIG. 5, the position of each relay is set to (x)i，yi) The distance between the relay and the theoretical optimum position is
Then there is
；
When the initialization m =1, the initialization is carried out,
；
judging the sizes of M and M, and continuing when M is less than M;
in the embodiment of the present application, the relay ri(i =1,2, …, N) while satisfying ρ（m-1）＜di0≤ρmAnd Hi＞∣hsd∣2When the initial value of the start is TiIn which H isiIs about the instantaneous CSI measurement hsiAnd hidFunction of HiThere are two definitions of (1): one is the smaller of the source-to-relay channel gain and the relay-to-destination channel gain,
(ii) a The other is a harmonic mean of the source-to-relay channel gain and the relay-to-destination channel gain,
setting of timer initial value and HiIs inversely proportional, | hsd∣2The channel gain for both source and destination.
In the embodiment of the present application, the function of the timer can be set as
Wherein λ is time constant, | hsi∣2For the channel gain of source and relay, | hid∣2Channel gain for purposes and relays.
In the embodiment of the application, the relay which is exhausted by the timer in one competition period firstly is selected as the best relay, the best relay sends the code packet, other relays stop timing and back off, the value of M is increased by 1 after one competition period, and the relay is circulated again after being compared with the M again. The relay selection area is then divided into a number of competing annuli that do not overlap one another.
In the embodiment of the application, one-time competition period
Is a preset time value, affects the time consumed by the relay selection process, and is more than min { Ti }.
In the embodiment of the present application, by implementing the steps S204 to S207, the relay hierarchical competition can be performed in the relay selection area according to the preset hierarchical algorithm, and the optimal relay is selected.
In the embodiment of the present application, by implementing the steps S202 to S207, the relay selection area can be determined according to the source position and the destination position, and the best relay is selected from the relay selection area.
After step S207, the following steps are also included:
s208, receiving the first signal sent by the source broadcast through the optimal relay, and amplifying the first signal through the optimal relay to obtain a second signal.
And S209, sending the second signal to the destination through the optimal relay, so that the destination adopts a maximum ratio combining algorithm to combine the received first signal and the second signal.
Referring to fig. 6, fig. 6 is a data comparison diagram of a conventional networking algorithm and a dynamic routing algorithm using topology information according to an embodiment of the present application. As shown in fig. 6, the abscissa indicates the meter number and the ordinate indicates the path trial test. Aiming at the simulation comparison of a conventional networking algorithm and a dynamic routing algorithm adopting topological information, 491 system samples are selected, and the statistics is carried out on the path trial times based on the station area information and the phase information. As can be seen from the results, the number of attempts of the routing algorithm based on the topology information of the cell is significantly lower than that of the conventional networking method.
In the embodiment of the application, the method is applied to a micro-power wireless network, a PLC network based on CSMA access, an Ad-Hoc network and a wireless sensor network. The LARS scheme divides the relay selection area step by step according to the geographic information, and only allows the relay sending flag packet competition which simultaneously satisfies the conditions that the self two-hop channel is superior to the channel between the information source and the destination and the position is in the designated annular area to become the best, the average number of the competition relays is obviously reduced, thereby reducing the conflict probability, effectively solving the problem of the flag packet conflict of the distributed opportunistic relay communication system, and simultaneously ensuring the interrupt performance of the system requirement.
It can be seen that, by implementing the dynamic routing method for the opportunistic relay for acquiring the data in the transformer area at high frequency described in this embodiment, the optimal relay can be selected in real time in a network structure with a large number of nodes, thereby facilitating the effective implementation of cooperative communication.
Please refer to fig. 3, fig. 3 is a schematic structural diagram of an opportunistic relay dynamic routing apparatus for high-frequency acquisition of distribution room data according to an embodiment of the present application. As shown in fig. 3, the opportunistic relaying dynamic routing apparatus for high-frequency acquisition of data in a distribution room includes:
an obtaining unit 310, configured to obtain a source position sent by a source, and obtain a destination position sent by a destination;
a determining unit 320, configured to determine a relay selection area according to the source location and the destination location, and select an optimal relay in the relay selection area;
the processing unit 330 is configured to receive a first signal sent by a source broadcast through an optimal relay, and amplify the first signal through the optimal relay to obtain a second signal;
a transmitting unit 340, configured to transmit the second signal to the destination through the optimal relay, so that the destination combines the received first signal and the second signal by using a maximal ratio combining algorithm.
It can be seen that, by implementing the dynamic routing device for the opportunistic relay for acquiring the high-frequency station data described in this embodiment, the optimal relay can be selected in real time in a network structure with a large number of nodes, thereby facilitating the effective implementation of cooperative communication.
Referring to fig. 4, fig. 4 is a schematic structural diagram of a opportunistic relay dynamic routing apparatus for acquiring high frequency station data according to an embodiment of the present application. The station area data high-frequency acquisition opportunistic relay dynamic routing device shown in fig. 4 is obtained by optimizing the station area data high-frequency acquisition opportunistic relay dynamic routing device shown in fig. 3. As shown in fig. 4, the determining unit 320 includes:
the calculating subunit 321 is configured to calculate according to the source position and the destination position to obtain a transmission distance from the source to the destination and a midpoint position of a midpoint of a connection line between the source and the destination;
a determining subunit 322, configured to determine a circular relay selection area by using the midpoint position as a circle center and the signaling distance as a diameter;
the contention subunit 323 is configured to perform relay hierarchical contention in the relay selection area according to a preset hierarchical algorithm, and select an optimal relay.
As an alternative embodiment, the competition subunit 323 includes:
the first module is used for dividing the relay selection area into annular zones from inside to outside according to a preset layering algorithm to obtain a plurality of competitive annular zones; the competition annular belts are not mutually overlapped and are divided into a first annular belt, a second annular belt and a third annular belt;
a second module, configured to perform relay contention in the first endless belt through timers of all relays to obtain a first relay contention result;
a third module, configured to perform relay contention in the second ring band through timers of all relays to obtain a second relay contention result when the best relay is not selected from the first relay contention results;
a fourth module, configured to perform relay contention in a third ring band through timers of all relays when an optimal relay is not selected from the second relay contention results, so as to obtain a third relay contention result; the best relay is selected from the third relay competition results.
As an alternative embodiment, the outer diameter of the second annular band is twice the outer diameter of the first annular band, and the inner diameter of the second annular band is twice the inner diameter of the first annular band; the outer diameter of the third annular band is twice the outer diameter of the second annular band and the inner diameter of the third annular band is twice the inner diameter of the second annular band.
As an alternative embodiment, the preset layering algorithm includes an outer diameter calculation formula, an inner diameter calculation formula, and a constraint formula, wherein,
the outer diameter calculation formula is as follows: rhoOuter cover=2m；
The inner diameter calculation formula is as follows: rhoInner part=2（m-1）；
The constraint formula is: dsd=2M；
M is used for representing the maximum layering times for layering the relay selection area;
m is used to represent the second level of layering relay selection areas; m is a positive integer less than or equal to M;
dsdfor indicating the signaling distance.
As an optional implementation manner, the obtaining unit 310 is further configured to obtain a preset channel gain sent by a destination;
the determining unit 320 is specifically configured to determine a relay selection area according to the source position and the destination position, and select an optimal relay with a relay channel gain greater than a preset channel gain in the relay selection area.
It can be seen that, by implementing the dynamic routing device for the opportunistic relay for acquiring the high-frequency station data described in this embodiment, the optimal relay can be selected in real time in a network structure with a large number of nodes, thereby facilitating the effective implementation of cooperative communication.
The embodiment of the application provides electronic equipment, which comprises a memory and a processor, wherein the memory is used for storing a computer program, and the processor runs the computer program to enable the electronic equipment to execute any of the distribution room data high-frequency acquisition opportunistic relay dynamic routing methods in the embodiment of the application.
The embodiment of the application provides a computer-readable storage medium, which stores computer program instructions, and when the computer program instructions are read and run by a processor, the method for opportunistic relay dynamic routing of high-frequency acquisition of data in a distribution room is executed.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only an example of the present application and is not intended to limit the scope of the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application. It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Claims (10)
1. A high-frequency acquisition opportunity relay dynamic routing method for distribution room data is characterized by comprising the following steps:
acquiring the position of an information source sent by the information source and acquiring the position of a target sent by a target;
determining a relay selection area according to the information source position and the target position, and selecting an optimal relay in the relay selection area;
receiving a first signal sent by the information source broadcast through the optimal relay, and amplifying the first signal through the optimal relay to obtain a second signal;
and sending the second signal to the destination through the optimal relay, so that the destination combines the received first signal and the second signal by adopting a maximum ratio combining algorithm.
2. The method for dynamically routing the opportunistic relays for high-frequency acquisition of the data in the cell according to claim 1, wherein the step of determining a relay selection area according to the source position and the destination position, and selecting the best relay in the relay selection area comprises:
calculating according to the information source position and the target position to obtain a transmission distance from the information source to the target and a midpoint position of a midpoint of a connecting line between the information source and the target;
determining a circular relay selection area by taking the midpoint position as a circle center and the transmitting distance as a diameter;
and carrying out relay layering competition in the relay selection area according to a preset layering algorithm, and selecting the best relay.
3. The method for relay dynamic routing of high-frequency acquisition opportunity of distribution room data according to claim 2, wherein the step of performing relay hierarchical competition in the relay selection area according to a preset hierarchical algorithm and selecting the best relay comprises:
dividing the relay selection area into annular zones from inside to outside according to a preset layering algorithm to obtain a plurality of competitive annular zones; the competition annular belts are not mutually overlapped and are divided into a first annular belt, a second annular belt and a third annular belt;
performing relay competition in the first annular band through timers of all relays to obtain a first relay competition result;
when the best relay is not selected from the first relay competition results, performing relay competition in the second ring band through timers of all relays to obtain second relay competition results;
when the best relay is not selected from the second relay competition results, performing relay competition in the third annular band through timers of all relays to obtain a third relay competition result; and selecting the best relay from the third relay competition results.
4. The method for opportunistic relaying dynamic routing of data collected at high frequency from station area of claim 3, wherein the outer diameter of the second annular band is twice the outer diameter of the first annular band, and the inner diameter of the second annular band is twice the inner diameter of the first annular band; the third annular band has an outer diameter that is twice an outer diameter of the second annular band and an inner diameter that is twice an inner diameter of the second annular band.
5. The method for opportunistic relaying dynamic routing of data high frequency acquisition of a distribution room as claimed in claim 2, wherein the predetermined hierarchical algorithm comprises an outer diameter calculation formula, an inner diameter calculation formula and a constraint formula, wherein,
the outer diameter calculation formula is as follows: rhoOuter cover=2m；
The inner diameter calculation formula is as follows: rhoInner part=2（m-1）；
The constraint formula is: dsd=2M；
M is used for representing the maximum layering times for layering the relay selection area;
m is used for representing the second layer for layering the relay selection area; m is a positive integer less than or equal to M;
dsdfor representing said signalling distance.
6. The method for high-frequency acquisition opportunistic relaying dynamic routing of the cell data according to claim 1, further comprising:
acquiring preset channel gain sent by the target;
determining a relay selection area according to the source position and the destination position, and selecting the best relay in the relay selection area comprises the following steps:
and determining a relay selection area according to the information source position and the target position, and selecting the optimal relay with the relay channel gain larger than the preset channel gain in the relay selection area.
7. A high-frequency acquisition opportunity relay dynamic routing device for data in a transformer area is characterized by comprising:
the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring the position of an information source sent by the information source and acquiring the position of a target sent by the target;
a determining unit, configured to determine a relay selection area according to the source location and the destination location, and select an optimal relay in the relay selection area;
the processing unit is used for receiving a first signal sent by the information source broadcast through the optimal relay and amplifying the first signal through the optimal relay to obtain a second signal;
a transmitting unit, configured to transmit the second signal to the destination through the optimal relay, so that the destination combines the received first signal and the second signal by using a maximal ratio combining algorithm.
8. The high-frequency acquisition opportunity relay dynamic routing device for the station area data according to claim 7, wherein the determining unit comprises:
the calculating subunit is used for calculating according to the information source position and the target position to obtain a transmitting distance from the information source to the target and a midpoint position of a midpoint of a connecting line between the information source and the target;
the determining subunit is used for determining a circular relay selection area by taking the midpoint position as a circle center and the transmitting distance as a diameter;
and the competition subunit is used for carrying out relay hierarchical competition in the relay selection area according to a preset hierarchical algorithm and selecting the optimal relay.
9. An electronic device, characterized in that the electronic device comprises a memory for storing a computer program and a processor for executing the computer program to make the electronic device execute the high frequency acquisition opportunistic relaying dynamic routing method of the station area data of any one of claims 1 to 6.
10. A readable storage medium, wherein computer program instructions are stored in the readable storage medium, and when the computer program instructions are read and executed by a processor, the method for opportunistic relay dynamic routing of the high frequency acquisition of station data according to any one of claims 1 to 6 is executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111336463.1A CN113783588B (en) | 2021-11-12 | 2021-11-12 | Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111336463.1A CN113783588B (en) | 2021-11-12 | 2021-11-12 | Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113783588A true CN113783588A (en) | 2021-12-10 |
| CN113783588B CN113783588B (en) | 2022-02-08 |
Family
ID=78956959
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111336463.1A Active CN113783588B (en) | 2021-11-12 | 2021-11-12 | Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113783588B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101355409A (en) * | 2008-09-04 | 2009-01-28 | 北京邮电大学 | Method for implementing partner selection and collaboration transmission combining position information |
| CN103327558A (en) * | 2012-03-23 | 2013-09-25 | 北京新岸线移动多媒体技术有限公司 | Vehicular communication method and communication node |
| CN105933040A (en) * | 2016-04-06 | 2016-09-07 | 华侨大学 | Secure transmission method adopting information source and relay-combined transmitting antenna selection |
| CN107172678A (en) * | 2017-05-27 | 2017-09-15 | 河南科技大学 | Wireless sensor network geography information opportunistic routing protocol |
| CN108513265A (en) * | 2018-04-03 | 2018-09-07 | 赣南师范大学 | Opportunity synergy method of multicasting based on geographical location and channel status |
| CN110913366A (en) * | 2019-12-26 | 2020-03-24 | 湖北大学 | Relay deployment method supporting two-stage transmission of vehicle-mounted data |
-
2021
- 2021-11-12 CN CN202111336463.1A patent/CN113783588B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101355409A (en) * | 2008-09-04 | 2009-01-28 | 北京邮电大学 | Method for implementing partner selection and collaboration transmission combining position information |
| CN103327558A (en) * | 2012-03-23 | 2013-09-25 | 北京新岸线移动多媒体技术有限公司 | Vehicular communication method and communication node |
| CN105933040A (en) * | 2016-04-06 | 2016-09-07 | 华侨大学 | Secure transmission method adopting information source and relay-combined transmitting antenna selection |
| CN107172678A (en) * | 2017-05-27 | 2017-09-15 | 河南科技大学 | Wireless sensor network geography information opportunistic routing protocol |
| CN108513265A (en) * | 2018-04-03 | 2018-09-07 | 赣南师范大学 | Opportunity synergy method of multicasting based on geographical location and channel status |
| CN110913366A (en) * | 2019-12-26 | 2020-03-24 | 湖北大学 | Relay deployment method supporting two-stage transmission of vehicle-mounted data |
Non-Patent Citations (3)
| Title |
|---|
| JUANFEI SHI等: "《Power-efficient location-based cooperative routing in wireless networks》", 《2012 INTERNATIONAL CONFERENCE ON SYSTEMS AND INFORMATICS (ICSAI2012)》 * |
| 孙利娟等: "《协作中继节点选择的动态地理协作路由算法》", 《计算机工程与设计》 * |
| 张嵩等: "《基于中断概率的多跳混合协作地理路由算法》", 《电子与信息学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113783588B (en) | 2022-02-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6301491B2 (en) | Discovery based on extended trigger frame for neighbor awareness networks | |
| US11558299B2 (en) | Method for utilization-based traffic throttling in a wireless mesh network | |
| JP6585310B2 (en) | Proximity aware networking (NAN) data link multi-hop topology | |
| JP7289436B2 (en) | Beaconing in short wavelength wireless networks | |
| US7266085B2 (en) | Access and routing protocol for ad hoc network using synchronous collision resolution and node state dissemination | |
| US8320345B2 (en) | Radio communication method and radio communication device | |
| EP1882338B1 (en) | Distributed learning method for wireless mesh networks | |
| US7983230B1 (en) | Adaptive power and data rate control for ad-hoc mobile wireless systems | |
| JP5495724B2 (en) | Method and system for broadcasting alarm packets in a wireless multi-hop network consisting of a plurality of nodes | |
| US8750167B2 (en) | Transmit power control techniques for nodes in an ad-hoc network | |
| KR20060006583A (en) | Directional flooding method in wireless sensor networks | |
| KR20130113520A (en) | Methods and apparatuses for communicating in television white space (tvws) based on tvws enablement signal | |
| US20040266351A1 (en) | Method and apparatus for dynamic frequency selection in a wireless communications network | |
| Huang et al. | Vehicle density based forwarding protocol for safety message broadcast in VANET | |
| JP2013135437A (en) | System, device, and method for data collection | |
| JP2010119058A (en) | Transmitter and transmission method | |
| JP2006295442A (en) | Communication method and wireless terminal | |
| JP6007743B2 (en) | Multihop communication terminal, multihop communication system, and multihop communication method | |
| US20160192377A1 (en) | Adaptive edca adjustment for dynamic sensitivity control | |
| JP2008160723A (en) | Radio communication device and system | |
| CN113783588B (en) | Opportunistic relay dynamic routing method and device for high-frequency acquisition of transformer area data | |
| US9020557B2 (en) | Wireless communication apparatus and method for wireless communication | |
| Sett et al. | An overhearing based routing scheme for wireless sensor networks | |
| Eshet et al. | Randomly ranked mini slots for fair and efficient medium access control in ad hoc networks | |
| JP2016046648A (en) | Radio communication system, radio communication method, and radio communication device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |