Capacity expansion method based on ad hoc network

Abstract

The invention belongs to the field of network topology, and discloses a capacity expansion method based on an ad-hoc network, which comprises the following steps of: taking a base station as a host, when the number of network nodes is mlt; when the maximum forwarding number of a single base station node is n, network data are forwarded to each network node in sequence according to the address list in the host; when the number of network nodes is mgt; and when the maximum forwarding number of a single base station node is n, a k-level forwarding strategy is adopted to sequentially forward network data to each network node. According to the method, the load balance of each node can be achieved in an automatic node distribution mode, and the maximum loss time of the node is optimal. And meanwhile, the capacity expansion, load balancing and self-organizing capabilities of a product network are improved, and the manual operation and maintenance cost is low.

Description

Technical Field

[0001] The invention belongs to the field of network topology, and in particular relates to a capacity expansion method based on a self-organizing network. Background Art

[0002] Networking between multiple wireless base stations can expand the communication range of wireless services, so the more wireless base stations there are, the larger the coverage of wireless communication. Base stations are connected through IP interconnection. IP interconnection services are mainly forwarded one by one in unicast mode through address lists. For the DMR communication protocol in the private network field, real-time and voice continuity must be guaranteed, that is, the data packet must be forwarded within 30ms between two frames of adjacent time slots to avoid affecting the transmission of the next frame of data. Therefore, the forwarding bottleneck of a single-level network node is 30ms, and this frame of data needs to be forwarded to as many base stations as possible within 30ms. Figure 1 As shown, when terminal A initiates a call, data is broadcast through nearby base station A, and base station A forwards the voice data to as many base stations as possible within 30ms (the number of forwardings depends on the performance of the base station, and the limit is usually 30 base stations).

[0003] At this time, the forwarding range of the first-level base station is the maximum communication range of the base station. If you need to expand the communication network range, you need to perform multi-level forwarding. Most of the current implementation solutions are achieved by designing and establishing a subnet host role, that is, establishing a subnet host role on the basis of the existing base station, and forwarding. Figure 2 shown.

[0004] The current DMR base station products on the market mainly use manual configuration to configure subnet hosts to achieve capacity expansion, and support a maximum of 2 levels of base station forwarding. Manual configuration and operation and maintenance have several problems:

[0005] 1. The failure of the host in the subnet will cause the failure of all sites under the subnet, and then the terminals under the subsites will be unable to communicate.

[0006] 2. Differentiating between subnet hosts will cause the subnet hosts to be under high load all the time, resulting in load imbalance.

[0007] 3. The number of manual configuration options increases, resulting in high operation and maintenance costs.

[0008] 4. Adding nodes to the existing network. If the current limit has been reached, it is necessary to break the existing network and reconsider the network form, which is time-consuming and labor-intensive. Summary of the invention

[0009] In order to enable the repeater IP interconnection product to have the ability to automatically select forwarding nodes, thereby achieving load balancing, adaptively expanding the capacity of single-layer networking nodes, improving the product's self-organizing ability, and reducing operation and maintenance costs, the present invention proposes a capacity expansion method based on self-organizing networks, which can automatically allocate nodes to achieve load balancing of each node, and the maximum node loss time is optimized. At the same time, it improves the product network's capacity expansion, load balancing, self-organizing ability, and low manual operation and maintenance costs.

[0010] To achieve the above object, the present invention adopts the following technical solution:

[0011] A capacity expansion method based on an ad hoc network comprises the following steps:

[0012] With the base station as the host, when the number of network nodes m < the maximum forwarding number n of a single base station node, network data is forwarded sequentially to each of the network nodes according to the address list in the host;

[0013] Taking the base station as the host, when the number of network nodes m> the maximum forwarding number n of a single base station node, a k-level forwarding strategy is adopted to sequentially forward network data to each of the network nodes.

[0014] Preferably, adopting a k-level forwarding strategy to sequentially forward network data to each of the network nodes includes:

[0015] According to the number of network nodes m≤∑n k / k k , and k>1, the minimum k value is obtained;

[0016] Determine the maximum number of forwardings required for each network node according to the k value, e=n / k;

[0017] The network nodes are allocated according to the network nodes m and the maximum number of forwarding e required by each of the network nodes.

[0018] Preferably, the network node allocation includes:

[0019] Determine that the number of first-level forwarding network nodes is e, and randomly select e network nodes from the m network nodes and arrange them in order;

[0020] Determine the second-level forwarding nodes, and select e nodes from left to right for each of the e forwarding network nodes in the first level;

[0021] In this way, the k-th level forwarding node is determined by selecting s nodes from left to right in the k-th level nodes until all m nodes are used up.

[0022] Preferably, the initiator node S sends in the order of the first-level forwarding nodes, and sends the address information to be forwarded by each node to the next-level node at the same time;

[0023] After receiving the information, the receiving node decides whether it needs to be forwarded again based on the forwarding list. If necessary, it sends the message to the next level. The next level continues to make the same judgment based on the forwarding list until all packets are forwarded.

[0024] The beneficial effects of the present invention are as follows:

[0025] The present invention proposes a capacity expansion method based on self-organizing network, which can automatically allocate nodes to achieve load balancing of each node and optimize the maximum node loss time. At the same time, it improves the capacity expansion, load balancing, self-organizing ability and low manual operation and maintenance cost of the product network. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In order to more clearly illustrate the technical solution of the present invention, the following briefly introduces the drawings required for use in the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative labor:

[0027] Figure 1 This is a schematic diagram of conventional voice data broadcast forwarding;

[0028] Figure 2 It is a schematic diagram of the existing secondary base station forwarding;

[0029] Figure 3 A schematic diagram of the expansion achieved through conventional configuration for operation and maintenance personnel;

[0030] Figure 4 This is a schematic diagram of forwarding one by one under normal single-stage forwarding under a conventional forwarding strategy;

[0031] Figure 5 It is a schematic diagram of level 2 forwarding under the technical concept of the present invention;

[0032] Figure 6 It is a schematic diagram of three-level forwarding under the technical concept of the present invention;

[0033] Figure 7 A forwarding schematic diagram of the hierarchical strategy of the present invention;

[0034] Figure 8 It is a conventional networking solution;

[0035] Fig. 9 The network expansion configuration method of the present invention;

[0036] Fig.10 This is the forwarding path using the present invention. DETAILED DESCRIPTION

[0037] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0038] The purpose of the present invention is to enable the repeater IP interconnection product to have the ability to automatically select forwarding nodes, thereby achieving load balancing, adaptively expanding the capacity of single-layer networking nodes, improving the product self-organizing ability, and reducing operation and maintenance costs.

[0039] Mainly solve the problem:

[0040] 1. Solve the problem of high operation and maintenance costs. The master-slave distribution network is still used for all relay station distribution networks, so that all deployed devices do not need to change their existing network configuration information, ensuring simple network distribution and the lowest operation and maintenance costs.

[0041] 2. Solve the base station load balancing problem. Cancel the subnet master role. If the repeater wants to expand the communication range (that is, add a subnet), design a forwarding algorithm and select a slave from all the slaves as a forwarding node. The advantage of this is that there is no subnet master and the operation and maintenance personnel do not need to reconfigure the base station. In addition, by selecting one of the slaves as a forwarding node through the algorithm, it can avoid the load imbalance caused by the same node always being a forwarding node.

[0042] 3. Expand network capacity. This algorithm can maximize the network capacity while meeting the real-time communication requirements.

[0043] Operation and maintenance personnel routinely configure capacity expansion Figure 3 As shown in the figure, the original bottleneck is that there are at most N slaves. Currently, according to the self-organizing network algorithm, the number of repeaters can be further expanded. From the product perspective, it is equivalent to simply expanding the slaves to achieve the purpose of continuing to increase network capacity. If the maximum number of forwardings for a single base station node is n (its forwarding address list is A1, A2.........An), then the conventional forwarding strategy is as follows Figure 4 As shown, in single-stage forwarding, the messages are forwarded one by one (forwarding order, from left to right, level k=1), and the longest time it takes for the device with the address An to finally receive the message is T=n×Δt.

[0044] The basic idea of ​​the present invention is as follows Figure 5As shown in the figure, divide n into n / 2. The address list of node S is (A1, A2... An / 2). Then use A1 (address list: B1, B2.... Bn / 2) to forward the other n / 2 devices. At this time, it can be seen that the devices after An / 2 originally have received the message earlier than before. Moreover, A2, A3... can continue to be used to forward additional devices to achieve the purpose of capacity expansion.

[0045] Furthermore, as Figure 6 shown, the forwarding strategy level is 3 levels (forwarding order, from left to right, level k = 3). Divide n into three parts and use (A1, A2.... An / 3, B1, B2...... Bn / 3, H1,.... Hn / 3) to complete the task with a total forwarding number of n. Then the other branches can achieve capacity expansion, and its maximum expandable number is as Figure 6 calculated.

[0046] Furthermore, the forwarding level can be continuously increased. Divide n into k parts, and by analogy, the value of the level k = 4, 5, 6....

[0047] From the above forwarding paths, it can be concluded that the time loss of each layer of nodes increases sequentially from left to right. Under the premise of the shortest link, maximizing the allocation of addresses to the left will result in greater time loss benefits.

[0048] Based on the above idea, the specific implementation method of the present invention is as follows:

[0049] 1. Assume that the maximum forwarding address of the device is as above Figure 4 shown as n. When the number of network nodes increases beyond n (represented by m, m > n), at this time, without using the subnet host role, directly configure the extra m - n nodes according to the slave role (thus achieving the purpose of canceling the subnet host). According to the original method, it cannot be forwarded because it exceeds the maximum forwarding limit of a single device at a single level.

[0050] 2. Adopt a hierarchical strategy to implement the automatic selection of secondary or more - level forwarding nodes. The implementation strategy is as Figure 7 shown. Taking a single node (such as node S in the above figure) sending voice as an example, its implementation strategy is as follows:

[0051] 1) For P2P networking, each node knows the addresses of all nodes;

[0052] 2) Assume that there are m addresses to be forwarded in the address list;

[0053] 3) When m < n, forward in the order of the address list;

[0054] 4) When m > n, adopt a hierarchical forwarding algorithm to design the optimal path;

[0055] 5) Determine the forwarding level k according to the size of m, and according to m≤∑n k / k k ,k>1 to get the smallest k;

[0056] 6) Determine the maximum number of forwardings required by each node based on the size of k, e = n / k;

[0057] 7) Allocate nodes according to m and e;

[0058] Determine that there are e first-level forwarding nodes, and randomly select e nodes from the m address nodes and arrange them in order;

[0059] Determine the second-level forwarding nodes, and select e nodes from left to right for each of the e forwarding nodes in the first level;

[0060] …

[0061] Determine the k-th level forwarding node, and select s nodes from the k-th level nodes from left to right in sequence until all m nodes are divided. The last node may not be divided into less than e nodes;

[0062] 8) The initiator node S sends the message in the order of the first-level forwarding nodes, and sends the address information of each node to be forwarded to the next-level node;

[0063] 9) After receiving the information, the receiving node decides whether it needs to be forwarded again based on the forwarding list. If necessary, it sends the message to the next level. The next level continues to make the same judgment based on the forwarding list until all packets are forwarded.

[0064] By using the technology of the present invention, compared with the conventional networking forwarding strategy, the following comparison can be made:

[0065] 1. Comparison from the perspective of operation and maintenance costs

[0066] Conventional solution: According to the principle that the total number of forwardings does not exceed n, the role of the slaves B1...B(nk) is changed to the subnet master and k slaves are extended under it (in the extreme case, it is assumed that Bn-k is changed to the subnet master extension), such as Figure 8 shown.

[0067] This plan: Fig. 9 As shown, without changing any slave roles, slaves are directly added, and the forwarding strategy is used to randomly select nodes for forwarding, which saves the step of configuring the subnet host and saves a lot of manpower costs.

[0068] 2. Comparison of load balancing and communication loss time efficiency

[0069] Assume that host s initiates a call. At this time:

[0070] Conventional solution: It is sent in a fixed direction. The maximum loss time for S to reach Ck is T1 = T (when forwarding one by one, it takes n - 1 machines to forward before reaching Ck, so the total time is T). According to the DMR time slot of 30 ms, that is, T = 30 ms. Assuming K = 10 and n = 30, the time required for the host S to forward to Ck is T1 = 30 ms.

[0071] This solution: As Fig.10 shown, the worst case for S to reach the node Ck is that S passes through B1 and then forwards to Ck with the maximum loss time of T2 = (k + 1) * (T / n). It is agreed that k + 1 < n, so (k + 1)(T / n) < T. Therefore, according to the DMR time slot of 30 ms, that is, T = 30 ms. Assuming K = 10 and n = 30, the loss time is T2 = 11 ms. Using the automatic networking solution can ensure a smaller maximum loss time.

[0072] 3. Comparison of the number of network configuration expansions

[0073] Conventional solution: Use a subnet host to expand the network. Currently, the maximum forwarding capacity of the device forwarding device is n = 30. There were originally at most 3 subnet hosts and only two-level networking was possible. The total number of devices is N = 30 + 3 * 30 + 1 = 121.

[0074] This solution: Currently, the maximum forwarding capacity of the device forwarding device is n = 30. Without modifying the original one-level networking, when using the two-level forwarding of this algorithm, the maximum number of nodes that can be forwarded is 240. When using the three-level forwarding algorithm, the maximum number of nodes that can be forwarded is 1,110, which can meet the networking requirements.

[0075] The embodiments described above are only descriptions of the preferred embodiments of the present invention and do not limit the scope of the present invention. Without departing from the design spirit of the present invention, various deformations and improvements made by those of ordinary skill in the art to the technical solutions of the present invention should fall within the protection scope determined by the claims of the present invention.

Claims

1. A capacity expansion method based on a self-organizing network, characterized in that: The steps include: With the base station as the host, when the number of network nodes m < the maximum forwarding number n of a single base station node, network data is forwarded sequentially to each of the network nodes according to the address list in the host; Taking the base station as the host, when the number of network nodes m> the maximum forwarding number n of a single base station node, a k-level forwarding strategy is adopted to sequentially forward network data to each of the network nodes.

2. The method according to claim 1, characterized in that Adopting a k-level forwarding strategy to sequentially forward network data to each of the network nodes includes: According to the number of network nodes m≤∑n k / k k , and k>1, the minimum k value is obtained; Determine the maximum number of forwardings required for each network node according to the k value, e=n / k; The network nodes are allocated according to the network nodes m and the maximum number of forwarding e required by each of the network nodes.

3. The method according to claim 2, characterized in that Network node allocation includes: Determine that the number of first-level forwarding network nodes is e, and randomly select e network nodes from the m network nodes and arrange them in order; Determine the second-level forwarding nodes, and select e nodes from left to right for each of the e forwarding network nodes in the first level; In this way, the k-th level forwarding node is determined by selecting s nodes from left to right in the k-th level nodes until all m nodes are used up.

4. The method according to claim 3, characterized in that The initiator node S sends the message in the order of the first-level forwarding nodes, and sends the address information of each node to be forwarded to the next-level node at the same time; After receiving the information, the receiving node decides whether it needs to be forwarded again based on the forwarding list. If necessary, it sends the message to the next level. The next level continues to make the same judgment based on the forwarding list until all packets are forwarded.

Images