WO2019041369A1

WO2019041369A1 - Relay automatic routing method and device

Info

Publication number: WO2019041369A1
Application number: PCT/CN2017/100742
Authority: WO
Inventors: 杜光东
Original assignee: 深圳市盛路物联通讯技术有限公司
Priority date: 2017-08-29
Filing date: 2017-09-06
Publication date: 2019-03-07
Also published as: CN107517486A

Abstract

Provided by the present invention are a relay automatic routing method and device. The method comprises: a gateway obtaining the number m of terminals of a damaged repeater, wherein m is a positive integer; the gateway obtaining the number of terminals of each adjacent repeater among n adjacent repeaters, wherein the distance between each adjacent repeater among the n adjacent repeaters and the damaged repeater is less than a distance threshold, and n is a positive integer greater than 0; and the gateway assigning the m terminals of the damaged repeater to the n adjacent repeaters according to the number of terminals of each adjacent repeater among the n adjacent repeaters. The described method may improve the reliability of a communication link.

Description

Relay automatic routing method and device

Technical field

The present invention relates to the field of communications, and in particular, to a relay automatic routing method and apparatus.

Background technique

In remote suburban environments, due to factors such as the terrain environment, the erection density of the tower is low, resulting in insufficient network coverage, or in some “blind spot” areas, due to destructive multipath interference. As a result, the "blind spot" area cannot transmit or receive signals normally. Even the material and structure of the building can greatly weaken the signal that can be normally transmitted and received normally, resulting in poor communication quality of the network. In order to solve the above problem, a repeater (RP) can be set in the network. The repeater can be used for bidirectional forwarding of signals between two network nodes. By copying, adjusting, amplifying, resending or forwarding data signals, the network coverage can be improved, the "blind spots" of network transmission can be overcome, and the network can be improved. Communication quality.

It has been found in the course of long-term practice by those skilled in the art that since the repeater is an important part of the entire communication link, if the repeater fails, the entire communication link is interrupted and the data cannot be transmitted normally.

Summary of the invention

The technical problem to be solved by the embodiments of the present invention is to provide a relay automatic routing method and apparatus, which can improve the reliability of a communication link.

In a first aspect, a relay automatic routing method is provided, including the following steps:

The gateway obtains the number m of terminals of the damaged repeater, where m is a positive integer;

The gateway acquires the number of terminals of each of the n neighboring repeaters, where The distance between each of the n neighboring repeaters and the damaged repeater is less than a distance threshold, and n is a positive integer greater than zero;

The gateway allocates m terminals of the damaged repeater to the n neighboring repeaters according to the number of terminals of each of the n neighboring repeaters.

Optionally, the number of terminals that the gateway obtains the damaged repeater is specifically:

The gateway acquires an access table of the damaged repeater;

The gateway counts the number of terminals of the damaged repeater according to the access table of the damaged repeater.

Optionally, before the obtaining, by the gateway, the number of terminals of each of the neighboring repeaters, the method further includes:

Obtaining, by the gateway, a topology table of the damaged repeater;

The gateway finds the n neighboring repeaters according to the topology table of the damaged repeater.

Optionally, the number of terminals that the gateway acquires each of the neighboring repeaters in the n neighboring repeaters is specifically:

The gateway acquires an access table of each of the n neighboring repeaters;

The gateway separately counts the number of terminals of each of the n neighboring repeaters according to an access table of each of the n neighboring repeaters.

Optionally, the gateway allocates the terminal of the damaged repeater to the n neighboring repeaters according to the number of the terminals of each of the n neighboring repeaters:

The gateway allocates the terminal of the damaged repeater to the n neighboring repeaters according to an allocation policy according to the number of terminals of each of the n neighboring repeaters.

Optionally, the n neighboring repeaters are the same device, or the n neighboring repeaters are different devices.

Optionally, the influencing factors of the allocation policy include at least one of: a signal strength between the neighboring repeater and the terminal device, a load capacity of the neighboring repeater, a current load of the neighboring repeater, Information security processing capabilities.

In a second aspect, a gateway is provided, including a first obtaining module, a second acquiring module, and an allocating module,

The first obtaining module is configured to acquire the number m of terminals of the damaged repeater, where m is a positive integer greater than zero;

The second obtaining module is configured to acquire the number of terminals of each of the n neighboring repeaters, wherein each of the n neighboring repeaters is in the vicinity of the damaged The distance of the relay is less than the distance threshold, and n is a positive integer;

The allocation module is configured to allocate m terminals of the damaged repeater to the n neighboring repeaters according to the number of terminals of each of the n neighboring repeaters.

Optionally, the first obtaining module includes a first acquiring unit and a first statistic unit,

The first obtaining unit is configured to acquire an access table of the damaged repeater;

The first statistic unit is configured to count the number of terminals of the damaged repeater according to the access table of the damaged repeater.

Optionally, the second obtaining module includes: a second acquiring unit and a searching unit,

The second obtaining unit is configured to acquire a topology table of the damaged repeater;

The searching unit finds the n neighboring repeaters according to the topology table of the damaged repeater.

Optionally, the second obtaining module further includes: a third acquiring unit and a second statistic unit,

The third obtaining unit is configured to acquire an access table of each of the n neighboring repeaters;

The second statistic unit is configured to separately count, according to an access table of each of the n neighboring repeaters, a terminal of each of the n neighboring repeaters Quantity.

Optionally, the allocating module is specifically configured to allocate, according to an allocation policy, the terminals of the damaged repeater to the n neighboring relays according to the number of terminals of each of the n neighboring repeaters. Device.

Optionally, the influencing factors of the allocation policy include at least one of: signal strength between the neighboring repeater and the terminal device, load capacity of the neighboring repeater, current load of the neighboring repeater, and information security. Processing capacity.

In a third aspect, a communication system is provided, including a gateway and a plurality of repeaters, wherein the gateway is respectively connected to a plurality of repeaters, and the repeater includes a damaged repeater and n adjacent repeaters, wherein The gateway is for performing the method of any of the first aspects.

In a fourth aspect, a computer readable storage medium storing program code for relaying automatic routing performed by a computing device is provided. The program code includes instructions for performing the method of any of the first aspects.

In a fifth aspect, a gateway is provided, comprising: a processor, a memory, a communication interface, and a bus; the processor, the memory, and the communication interface are connected by the bus and complete communication with each other; Storing executable program code; the processor running a program corresponding to the executable program code by reading executable program code stored in the memory for executing a relay automatic routing method; The method is the method of any of the first aspects.

The above invention obtains the number m of terminals of the damaged repeater and the number of terminals of the n adjacent repeaters connected to the damaged repeater when the damaged repeater fails, and according to the damaged repeater The number of terminals of each of the n neighboring repeaters connected to the repeater distributes the m terminals of the damaged repeater to n neighboring repeaters.

DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the prior art description will be briefly described below. Obviously, the following description The drawings in the drawings are only some of the embodiments of the present invention, and those skilled in the art can obtain other drawings according to the drawings without any creative work.

1 is a schematic diagram of a relay network connection relationship provided by the prior art;

2 is a schematic diagram of a relay automatic routing method according to an embodiment of the present invention;

3 is a schematic diagram of a gateway according to an embodiment of the present invention;

4 is a schematic diagram of another gateway according to an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of still another gateway according to an embodiment of the present invention.

Detailed ways

Before discussing the exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as a process or method depicted as a flowchart. Although the flowcharts describe various operations as a sequential process, many of the operations can be implemented in parallel, concurrently or concurrently. In addition, the order of operations can be rearranged. The process may be terminated when its operation is completed, but may also have additional steps not included in the figures. The processing may correspond to methods, functions, procedures, subroutines, subroutines, and the like.

The methods discussed below, some of which are illustrated by flowcharts, can be implemented in hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware or microcode, the program code or code segments to carry out the necessary tasks can be stored in a machine or computer readable medium, such as a storage medium. The processor(s) can perform the necessary tasks.

The specific structural and functional details disclosed are merely representative and are for the purpose of describing exemplary embodiments of the invention. The present invention may, however, be embodied in many alternative forms and should not be construed as being limited only to the embodiments set forth herein.

It should be understood that although the terms "first", "second", etc. may be used herein to describe each Units, but these units should not be limited by these terms. These terms are used only to distinguish one unit from another. For example, a first unit could be termed a second unit, and similarly a second unit could be termed a first unit, without departing from the scope of the exemplary embodiments. The term "and/or" used herein includes any and all combinations of one or more of the associated listed items.

The terminology used herein is for the purpose of describing the particular embodiments, The singular forms "a", "an", It is also to be understood that the terms "comprising" and """ Other features, integers, steps, operations, units, components, and/or combinations thereof.

It should also be noted that in some alternative implementations, the functions/acts noted may occur in a different order than that illustrated in the drawings. For example, two figures shown in succession may in fact be executed substantially concurrently or sometimes in the reverse order, depending on the function/acts involved.

The invention is further described in detail below with reference to the accompanying drawings.

For ease of understanding, prior to the introduction of the present invention, the architecture of a prior art relay network is first introduced. As shown in FIG. 1, the prior art relay network includes a terminal 111, a repeater 112, and a gateway 113. The terminal may have different representations according to different situations. For example, the terminal may specifically be: a mobile phone, a tablet computer, a computer, etc., of course, it may also include other devices with networking functions, such as smart TV, smart air conditioner, and smart device. Kettle or other smart device. The repeater belongs to the same-frequency amplifying device, and refers to a radio transmitting and transferring device that plays a signal enhancement in the process of wireless communication transmission. The repeater is divided according to the communication system, and may be a GSM repeater or a CDMA repeater. 3G repeaters, 4G repeaters can even be future 5G repeaters and so on. Gateway 113 is also called an inter-network connector. The protocol converter, the gateway on the transport layer to achieve network interconnection, can serve as a conversion task for two networks with different high-level protocols, thereby realizing the interconnection of two networks with different high-level protocols.

When the terminal needs to transmit data to the network of other protocols through the gateway, in order to obtain higher link capacity and better coverage, one or more repeaters may be added between the gateway and the terminal to be responsible for the data. One or more forwardings are performed, that is, the data has to go through multiple hops to reach the terminal. Taking a simpler two-hop relay as an example, a "gateway-terminal" link is split into two links: "gateway-repeater" and "repeater-terminal", so that one can have a poor quality. The link is replaced by two better quality links for higher link capacity and better coverage. At the same time, for the terminal, the communication between the terminal and the repeater belongs to Device to Device (D2D) communication, and the power consumed by data transmission between the two is low. That is to say, the terminal communicates with the gateway through the relay of the repeater, which reduces the transmission power during data transmission.

The repeater acts as the only connection device between the gateway and the terminal. When there is a problem with the repeater, communication between the terminal accessing the repeater and the gateway will be interrupted.

It can be understood that the wireless connection manner between the terminal and the repeater, and the wireless connection manner between the repeater and the gateway include but are not limited to: Bluetooth, WIFI, zigbee, 3G, 4G, and future 5G.

It should be noted that the terminal 111 can communicate with the repeater 112 through the downlink and the uplink. The downlink (or forward link) refers to the communication link from the repeater 112 to the terminal 111, and the uplink (or reverse link) refers to the communication link from the terminal 111 to the repeater 112. In the LTE/LTE-A scheme, SC-FDMA (Single-Carrier Frequency-Division Multiple Access)/OFDM (Orthogonal Frequency Division Multiple Access) is used for the uplink/downlink carriers. And CP (Cyclic Prefix cyclic prefix). In the 5G standard, for example, the uplink and downlink carriers can be unified, that is, both uplink and downlink adopt OFDM and CP.

In order to solve the above problem, an embodiment of the present invention provides a relay automatic routing method, where the method includes the following steps:

210: The gateway obtains the number m of terminals of the damaged repeater, where m is a positive integer greater than zero.

In the embodiment of the present invention, when the terminal is unable to communicate with the damaged repeater, the terminal may feed back the identifier of the damaged repeater to the gateway, so that the gateway obtains the damaged repeater and cannot communicate, and records the Loss in the access table of the repeater. Alternatively, the gateway connects to different repeaters through different ports, and the gateway communicates with the repeater. If the gateway finds that it cannot communicate with the repeater through a certain port, the gateway determines that the corresponding repeater of the port is The damaged repeater records the identity of the damaged repeater in the access list of the damaged repeater. In addition, if the communication rate between the terminal and the repeater is less than a preset threshold, the repeater can also be considered a damaged repeater.

In the embodiment of the present invention, an access table of the damaged repeater is stored in the gateway, and an identifier of the terminal accessing the damaged repeater is recorded in the access table. The gateway reads the access list of the damaged repeater, and counts the number m of terminals connected to the damaged repeater according to the number of identifiers of the terminals recorded in the access table. Among them, the damaged repeater is a repeater that has a fault and cannot work normally.

The above terminals may have different manifestations depending on different situations, and a terminal (for example, a cellular phone or a smart phone) may utilize a wireless communication system to transmit and receive data for two-way communication. The terminal may include a transmitter for data transmission and a receiver for data reception. For data transmission, the transmitter can modulate the transmit local oscillator (LO) signal with data to obtain a modulated radio frequency (RF) signal, and amplify the modulated RF signal to obtain an output RF signal having an appropriate transmit power level. And transmitting the output RF signal to the base station via the antenna. For data reception, the receiver can obtain the received RF signal via an antenna, amplify and downconvert the received RF signal with the received LO signal, and process the downconverted signal to recover the data transmitted by the base station. Terminal 11 can support communication with multiple wireless systems of different radio access technologies (RATs) (eg LTE/TE-A and NR). Each wireless system may have certain characteristics and requirements to efficiently support simultaneous communication of wireless systems utilizing different RATs. A wireless user equipment may also be referred to as a User Equipment (UE), a mobile station, a terminal, an access terminal, a subscriber unit, a station, and the like. Wireless user equipment can be cellular phones, smart phones, tablet computers, wireless modems, personal digital assistants (PDAs), handheld devices, laptop computers, smartbooks, netbooks, cordless phones, wireless local loop (WLL) sites, Bluetooth Equipment, and so on. In today's high-speed development of smart homes and wearable devices, terminals can also be other devices with networking capabilities, such as smart lights, smart TVs, smart cleaning devices, smart sleep devices, intelligent monitoring devices, etc. The form of performance can be various, for example, for a smart electric lamp, including but not limited to: a smart table lamp, a smart ceiling lamp, a smart wall lamp, etc., for example, for a smart TV, it can be a Samsung smart TV, of course It can also be a Sharp smart TV. For example, for a smart cleaning device, it can be a smart sweeping robot. Of course, it can also include a smart vacuum cleaner, a smart garbage processor, etc., for example, for a smart sleep device, For the smart mattress, the smart sofa, and the like, for example, for the smart monitoring device, it may be an intelligent sphygmomanometer, a smart thermometer, etc., and the present invention does not limit the specific form, the number or the kind of the terminal. The terminal may be capable of communicating with the wireless system and may also be capable of receiving signals from a broadcast station, satellites in one or more Global Navigation Satellite Systems (GNSS), and the like. Terminal 11 may support one or more RATs for wireless communication, such as GSM, WCDMA, cdma2000, LTE/LTE-A, 802.11, and the like. The terms "radio access technology", "RAT", "radio technology", "air interface" and "standard" are often used interchangeably.

In the embodiment of the present invention, the identifier of the terminal may be an International Mobile Equipment Identity (IMEI) of the terminal, or may be a MAC address of the terminal, or may be another device that enables the gateway to identify the terminal. Identification information, no restrictions here.

It can be understood that the repeater may be a relay station, or may be a relay device that has a device to device (D2D) communication connection with the terminal device. The D2D pass The letter connection can be: Wi-Fi (Wireless Fidelity), Bluetooth, Zigbee, and Long Term Evolution (LTE) based D2D communication connection and the like.

220: The gateway acquires the number of terminals of each of the n neighboring repeaters.

In the embodiment of the present invention, the topology table of the damaged repeater is stored in the gateway, wherein the topology table records the connection relationship between the damaged repeater and the neighboring repeater. The gateway can find the n neighboring repeaters of the damaged repeater by looking up the topology table of the damaged repeater. Then, the gateway separately obtains an access table of each of the neighboring repeaters of the n neighboring repeaters, and then separately counts n neighboring nodes according to the access table of each of the neighboring repeaters. The number of terminals in each of the relays in the relay (see the description in step 1 for details).

It can be understood that the distance between each adjacent repeater of the n adjacent repeaters and the damaged repeater is less than the distance threshold, and n is a positive integer, that is, the neighboring repeater is geographically adjacent to the damage. And a terminal accessing the damaged repeater can communicate with at least one of the n neighboring repeaters. The n neighboring repeaters may be the same type of relay device or different types of relay devices. For example, n neighboring repeaters may all be relay stations, and n neighboring repeaters may include relay stations, relay devices, and the like, respectively.

It can be understood that the identifier of the damaged repeater in the topology table is associated with the identifier of the neighboring repeater and stored as one row in the topology table, indicating that there is a connection relationship between the damaged repeater and the neighboring repeater. . The identifier of the damaged repeater and the identifier of the neighboring repeater may be a Radio Network Temporary Identity (RNTI) of the relay device, or may be a MAC address of the relay device, or may be other capable The gateway is configured to identify the identification information of the relay device, and no limitation is made herein.

230: The gateway allocates m terminals of the damaged repeater to the n neighboring repeaters according to the number of terminals of each of the n neighboring repeaters.

In the embodiment of the present invention, the damaged repeater has a fault and cannot be connected to the terminal of the damaged repeater (for the sake of simplicity, the terminal collectively referred to as the damaged repeater in the article) and the gateway. The communication provides a service. At this time, the terminal connected to the damaged repeater needs to be switched to the adjacent repeater of the damaged repeater, and the switched terminal can communicate with the gateway through the adjacent repeater. . The distance between each of the n neighboring repeaters and the damaged repeater is less than the distance threshold.

In an actual application, the gateway allocates m terminals of the damaged repeater to the n neighboring repeaters according to the allocation policy, including the following steps:

(1) n neighboring repeaters report their own measurement results to the gateway.

In a specific embodiment, the n neighboring repeaters report their own measurement results to the gateway through uplink control signaling. In an embodiment, the neighboring repeater can report its own measurement result to the gateway through an uplink control signaling; in another embodiment, the neighboring repeater can use multiple uplink control signaling that carries the measurement result. The gateway reports its own measurement result to prevent the gateway from receiving the measurement result because the channel condition is relatively poor. The neighboring repeater repeatedly sends the uplink control signaling carrying the measurement result to ensure that the gateway can receive the measurement result. Measurement results.

In a specific embodiment, the measurement results include: signal strength between the neighboring repeater and the terminal device, load capacity of the neighboring repeater (eg, data buffering capability, remaining power, etc.), current load of the adjacent repeater Quantity, information security processing (encryption and decryption) capabilities, and more.

(2) The gateway determines the allocation strategy based on the measurement results.

In a specific embodiment, the allocation policy can be set in advance. The allocation policy may be a load balancing policy, or a policy that the user needs to customize according to actual usage requirements. When set, the allocation policy can follow the following rules: strong signal strength between adjacent repeaters and terminal devices, strong load capacity of adjacent repeaters, less current load of adjacent repeaters, and information security processing capability. Strong neighboring repeaters are assigned to more terminals, and conversely, the signal strength between the neighboring repeater and the terminal device is weak, the load capacity of the neighboring repeaters is weak, and the current neighboring repeater is currently negative. Neighboring repeaters with more load and weaker information security processing capabilities are allocated to fewer terminals.

(3) The gateway sends the allocation policy to the terminal.

In a specific embodiment, the gateway sends an allocation policy to the terminal by using downlink control signaling. In an embodiment, the gateway may send an allocation policy to the terminal by using one downlink control signaling. In another embodiment, the gateway may send an allocation policy to the terminal by using multiple downlink control signaling that carries the allocation policy. The terminal does not receive the allocation policy because the channel condition is relatively poor. The gateway repeatedly transmits the downlink control signaling carrying the allocation policy to ensure that the terminal can receive the allocation policy.

(4) The terminal accesses the corresponding neighboring repeater according to the received allocation policy.

It can be understood that, in addition to assigning the terminal to the neighboring repeater according to the allocation policy, the gateway can evenly allocate m terminals of the damaged repeater to n neighboring repeaters, that is, n neighbors. Any one of the relays in the relay will be assigned to m/n terminals.

The adjacent repeater can be a backup device of the damaged device. (1) The adjacent repeater does not normally carry any bearer forwarding service, and the neighboring repeater only serves as a backup for the damaged device, and will be damaged when the damaged device fails. The forwarding service carried by the device is transferred to the neighboring repeater, and the neighboring repeater only bears the forwarding service transferred by the damaged device. (2) The neighboring repeater also carries other forwarding services. When the damaged device fails, the forwarding service carried by the damaged device is transferred to the adjacent repeater, and the adjacent repeater simultaneously bears the transfer of the damaged device. Forward traffic and other forwarding services.

The foregoing describes the method of the embodiment of the present invention in detail. In the following, in order to facilitate the implementation of the above solution of the embodiment of the present invention, correspondingly, the related device for implementing the above solution is provided below.

Referring to FIG. 3, FIG. 3 is a schematic structural diagram of a relay automatic routing apparatus according to an embodiment of the present invention. The relay automatic routing device 30 of this embodiment includes: a first acquiring module 310, and a second acquiring Module 320 and allocation module 330.

The first obtaining module 310 is configured to acquire the number m of terminals of the damaged repeater, where m is a positive integer.

The second obtaining module 320 is configured to acquire the number of m terminals of each of the n neighboring repeaters, wherein each of the n neighboring repeaters and the neighboring The distance of the damaged repeater is less than the distance threshold, and n is a positive integer greater than zero.

The allocating module 330 is configured to allocate the terminal of the damaged repeater to the n neighboring repeaters according to the number of terminals of each of the n neighboring repeaters.

The step 210 in the method embodiment shown in FIG. 2 may be performed by the first obtaining module 310. The step 220 in the method embodiment shown in FIG. 2 may be performed by the second obtaining module 320. The method embodiment shown in FIG. The step 230 can be performed by the distribution module 330. For details, please refer to FIG. 2 and related embodiments, and details are not described herein again.

Referring to FIG. 4, FIG. 4 is a schematic structural diagram of a gateway according to an embodiment of the present invention. The gateway of this embodiment is further optimized for the gateway shown in FIG. 3. The gateway of this embodiment is different from the gateway shown in FIG. 3 in that the first acquiring module 310 includes a first acquiring unit 311 and a a statistic unit 312,

The first obtaining unit 311 is configured to acquire an access table of the damaged repeater;

The first statistic unit 312 is configured to count the number of terminals of the damaged repeater according to the access table of the damaged repeater.

Optionally, the second obtaining module 320 includes: a second obtaining unit 321 and a searching unit 322.

The second obtaining unit 321 is configured to acquire a topology table of the damaged repeater.

The searching unit 322 finds the n neighboring relays according to the topology table of the damaged repeater. Device.

Optionally, the second obtaining module further includes: a third obtaining unit 323 and a second statistics unit 324,

The third obtaining unit 323 is configured to acquire an access table of each of the n neighboring repeaters;

The second statistic unit 324 is configured to separately count, according to an access table of each of the n neighboring repeaters, a terminal of each of the n neighboring repeaters. quantity.

Optionally, the allocating module 330 is specifically configured to allocate the terminal of the damaged repeater to the n neighbors according to an allocation policy according to the number of terminals of each of the n neighboring repeaters. Relay.

Referring to FIG. 5, FIG. 5 is a schematic structural diagram of a gateway according to an embodiment of the present invention. The gateway of this embodiment includes: at least one processor 501, a communication interface 502, a user interface 503, and a memory 504. The processor 501, the communication interface 502, the user interface 503, and the memory 504 can be connected by using a bus or other manner. Take the connection through the bus 505 as an example. among them,

The processor 501 can be a general purpose processor, such as a Central Processing Unit (CPU).

Communication interface 502 can be a wired interface (e.g., an Ethernet interface) or a wireless interface (e.g., a cellular network interface or a wireless local area network interface) for communicating with other electronic devices or websites. In the embodiment of the present invention, the communication interface 502 is specifically configured to recommend the target recommendation object to the user of the electronic device.

The user interface 503 may specifically be a touch panel, including a touch screen and a touch screen, for detecting an operation instruction on the touch panel, and the user interface 503 may also be a physical button or a mouse. The user interface 603 can also be a display screen for outputting, displaying images or data.

The memory 504 can include a volatile memory (Volatile Memory), such as random access memory. Memory access memory (RAM); memory may also include non-volatile memory (Non-Volatile Memory), such as read-only memory (ROM), flash memory (Flash Memory), hard disk (Hard Disk Drive (HDD) or Solid State Drive (SSD); the memory 504 may also include a combination of the above types of memories. The memory 504 is configured to store a set of program codes, and the processor 501 is configured to call the program code stored in the memory 504 to perform the following operations:

Obtaining the number m of terminals of the damaged repeater, where m is a positive integer;

Obtaining a number of terminals of each of the n neighboring repeaters, wherein a distance between each of the n neighboring repeaters and the damaged repeater is less than a distance threshold , n is a positive integer greater than zero;

The m terminals of the damaged repeater are allocated to the n neighboring repeaters according to the number of terminals of each of the n neighboring repeaters.

Optionally, obtaining an access table of the damaged repeater;

The number of terminals of the damaged repeater is counted according to the access table of the damaged repeater.

Optionally, acquiring a topology table of the damaged repeater;

Finding the n neighboring repeaters according to the topology table of the damaged repeater.

Optionally, acquiring an access table of each of the n neighboring repeaters;

Counting the number of terminals of each of the n neighboring repeaters according to an access table of each of the n neighboring repeaters.

Optionally, the terminal of the damaged repeater is allocated to the n neighboring repeaters according to an allocation policy according to the number of terminals of each of the n neighboring repeaters.

The above invention obtains the number m of terminals of the damaged repeater and the number of terminals of the n adjacent repeaters connected to the damaged repeater when the damaged repeater fails, and according to the damaged repeater Connection The number of terminals of each of the n neighboring repeaters adjacent to the repeater distributes the m terminals of the damaged repeater to n neighboring repeaters.

One of ordinary skill in the art can understand that all or part of the process of implementing the foregoing embodiments can be completed by a computer program to instruct related hardware, and the program can be stored in a computer readable storage medium. When executed, the flow of an embodiment of the methods as described above may be included. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

The above disclosure is only a preferred embodiment of the present invention, and of course, the scope of the present invention is not limited thereto, and those skilled in the art can understand all or part of the process of implementing the above embodiments, and according to the present invention. The equivalent changes required are still within the scope of the invention.

Claims

A relay automatic routing method, comprising the following steps:

The gateway obtains the number m of terminals of the damaged repeater, where m is a positive integer greater than zero;

The gateway acquires the number of terminals of each of the n neighboring repeaters, wherein the distance between each of the n neighboring repeaters and the damaged repeater is Less than the distance threshold, n is a positive integer;

The gateway allocates m terminals of the damaged repeater to the n neighboring repeaters according to the number of terminals of each of the n neighboring repeaters.
The method according to claim 1, wherein the number of terminals that the gateway acquires the damaged repeater is specifically:

The gateway acquires an access table of the damaged repeater;

The gateway counts the number of terminals of the damaged repeater according to the access table of the damaged repeater.
The method according to claim 1, wherein before the gateway acquires the number of terminals of each of the neighboring repeaters of the n neighboring repeaters, the method further includes:

Obtaining, by the gateway, a topology table of the damaged repeater;

The gateway finds the n neighboring repeaters according to the topology table of the damaged repeater.
The method according to claim 3, wherein the number of terminals that the gateway acquires each of the n neighboring repeaters is specifically:

The gateway acquires an access table of each of the n neighboring repeaters;

The gateway separately counts the number of terminals of each of the n neighboring repeaters according to an access table of each of the n neighboring repeaters.
The method according to claim 1, wherein said gateway allocates terminals of damaged repeaters to said n neighbors according to the number of terminals of each of said n neighboring repeaters The repeater is specifically:

The gateway allocates the terminal of the damaged repeater to the n neighboring repeaters according to an allocation policy according to the number of terminals of each of the n neighboring repeaters.
A gateway, comprising: a first acquiring module, a second acquiring module, and an allocating module,

The first obtaining module is configured to acquire the number m of terminals of the damaged repeater, where m is a positive integer;

The second obtaining module is configured to acquire the number of m terminals of each of the n neighboring repeaters, wherein each of the n neighboring repeaters is adjacent to the receiver The distance of the loss repeater is less than the distance threshold, and n is a positive integer greater than zero;

The allocation module is configured to allocate a terminal of the damaged repeater to the n neighboring repeaters according to the number of terminals of each of the n neighboring repeaters.
The device according to claim 6, wherein the first obtaining module comprises a first acquiring unit and a first counting unit,

The first obtaining unit is configured to acquire an access table of the damaged repeater;

The first statistic unit is configured to count the number of terminals of the damaged repeater according to the access table of the damaged repeater.
The device according to claim 6, wherein the second obtaining module comprises: a second acquiring unit and a searching unit,

The second obtaining unit is configured to acquire a topology table of the damaged repeater;

The searching unit finds the n neighboring repeaters according to the topology table of the damaged repeater.
The apparatus according to claim 8, wherein the second obtaining module further comprises: a third obtaining unit and a second counting unit,

The third obtaining unit is configured to acquire an access table of each of the n neighboring repeaters;

The second statistic unit is configured to separately count, according to an access table of each of the n neighboring repeaters, a terminal of each of the n neighboring repeaters Quantity.
The apparatus according to claim 6, wherein the allocating module is specifically configured to: according to the number of terminals of each of the n neighboring repeaters, the terminal of the damaged repeater according to an allocation policy Assigned to the n neighboring repeaters.