End-station cooperative wireless heterogeneous network global route generation method and system

Abstract

The invention provides an end-station cooperative wireless heterogeneous network global route generation method and system. Firstly, in a wireless heterogeneous network composed of 5G and an ad-hoc network, a terminal user carries out fusion network access, and network resource scheduling of the combined ad-hoc network and a 5G base station can be carried out, so that user requirements are met; then, the fusion of the 5G network and the Ad Hoc network is realized through a terminal side gateway discovery mechanism; and finally, on the basis of a hybrid routing protocol framework, table-driven routing and on-demand routing are combined by combining the characteristics of a 5G ad hoc network and an Ad hoc network, and a hybrid routing mechanism in which local switching at a terminal side and global diffusion at a base station side are combined is adopted. According to the mechanism, local topology information mastered by a terminal node is utilized, in combination with sensed factors such as loads of adjacent nodes, intra-domain link information is diffused in time, intra-domain routing is formed, and therefore unnecessary overhead caused by repeated path finding is avoided.

Description

Technical Field

[0001] The present invention belongs to the field of wireless communication technology, and in particular, relates to a method and system for generating global routing in a wireless heterogeneous network in collaboration with end stations. Background Art

[0002] The existing wireless network routing generation methods are mainly aimed at the research of self-organizing network routing protocols. According to the way each node in the self-organizing network establishes routing, it can be divided into active routing protocols, on-demand routing protocols and hybrid routing protocols. Active routing protocols mean that each node needs to actively maintain the consistent and latest routing information from itself to all other nodes in the network. On-demand routing protocols only perform routing discovery and create routes when the source node needs routing, that is, on-demand discovery. The hybrid routing protocol combines the ideas of the first two, and maintains the complete topology within a certain area through active routing protocols; for routing requirements outside this range, the on-demand routing protocol is used for routing discovery.

[0003] In the air-ground integrated wireless network scenario, communications are susceptible to interference from various electromagnetic signals. As the relative movement speed of communication units becomes faster, the multipath effect becomes more obvious, resulting in poor network coverage, difficult link connectivity, and drastic topology changes. It is difficult to achieve optimal coverage of the communication network by relying solely on ad hoc networks. Therefore, a hybrid network combining 5G and ad hoc network technology is used in air-ground nodes. By deeply integrating 5G and ad hoc network technology, wide-area coverage and precise enhancement of communication signals can be achieved in the air-ground integrated network scenario.

[0004] There are multiple links in the air-ground integrated hybrid network, and these links have significant differences in error rate, stability, and delay. Therefore, when selecting routes in this network, it is necessary to consider multiple factors and design an effective routing mechanism based on the characteristics of the air-ground integrated hybrid network: the routing mechanism should have strong network fault tolerance and robustness, be able to adapt to the dynamic changes of network topology, and maximize the use of system resources.

[0005] For the air-ground integrated network, each node exists not only as a terminal, but also as a node with routing capabilities in the network. However, traditional routing protocols are not suitable for air-ground integrated hybrid network scenarios, and it is necessary to redesign the routing protocols in the network. Compared with most traditional wireless communication networks, the main challenge faced in the routing generation method of air-ground integrated wireless networks comes from the high mobility between distributed nodes. Considering the complex and changeable network environment, highly mobile communication nodes, dynamically unevenly distributed communication services, low-stability network topology, and actual links with limited bandwidth in air-ground integrated scenarios, it is difficult to establish and maintain efficient and reliable multi-hop end-to-end transmission.

[0006] The patent document with publication number CN108307436A discloses a routing method based on a heterogeneous wireless self-organizing network, which includes a hybrid node discovery step for finding and updating the route to the hybrid node, and an HC-AODV routing design step, which involves the process of the source node generating a routing response and the node processing a routing request, aiming to optimize the network communication efficiency and reliability.

[0007] Therefore, it is necessary to design a network routing mechanism that combines 5G with self-organizing networks to improve the adaptability of routing to highly dynamically changing network topologies, reduce the complexity of routing discovery and establishment, reduce routing overhead, and be able to dynamically reconstruct routing according to the network environment. This is one of the key technologies to meet the practical application of wireless communication networks. Summary of the invention

[0008] In view of the defects in the prior art, the object of the present invention is to provide a method and system for generating global routes in a wireless heterogeneous network with terminal collaboration.

[0009] A method for generating global routing in a wireless heterogeneous network with terminal cooperation provided by the present invention includes:

[0010] Step S1: Allow the terminal side and the network side to access the wireless heterogeneous network composed of 5G and ad hoc network through the converged network;

[0011] Step S2: enabling the Ad Hoc network to access the wireless heterogeneous network;

[0012] Step S3: maintaining a local network topology information routing table within the wireless heterogeneous network area;

[0013] Step S4: outside the wireless heterogeneous network area, extending the routing table according to on-demand routing;

[0014] Step S5: establishing a wireless heterogeneous network global routing table based on the routing table and the wireless heterogeneous network;

[0015] Step S6: starting an autonomous decision-making mechanism according to the wireless heterogeneous network global routing table.

[0016] Preferably, in step S1:

[0017] The terminal side and the network side are enabled to collaboratively access the wireless heterogeneous network, and the network parameter information of the network side and the information interacted with the user of the terminal side are first transferred to the terminal side for processing, and then the terminal side is enabled to obtain a network selection scheme that meets the user's service requirements and QoS through a network selection algorithm based on network load balancing, and finally the network selection scheme is submitted to the network side for allocating network resources;

[0018] The step S1 comprises the steps of:

[0019] Step S101: a resource monitoring step, i.e., collecting the 5G network resources before accessing the base station, monitoring the information work on the network side and the terminal side, collecting preset information, and finally transferring the preset information to the terminal side for processing;

[0020] Step S102: Information collection step, i.e. the terminal side collects the network resources of the resource monitoring, and detects the relevant information of the end-to-end wireless network of the surrounding ad hoc network and the terminal's own state information, and dynamically adjusts the network scanning period of the terminal through the detection;

[0021] Step S103: a network selection step, that is, comprehensively considering the information collection, using a fuzzy neural network, and selecting a suitable wireless heterogeneous network from the candidate wireless heterogeneous networks;

[0022] Step S104, a network control step, performs group access control on the wireless heterogeneous network based on a dynamic priority algorithm.

[0023] Preferably, the step S2 comprises the steps of:

[0024] Step S201: instructing the gateway node to process the data packet, that is, after receiving the data packet, the gateway node can check whether there is routing information directly reaching the destination gateway node in the routing table;

[0025] Step S202: the gateway node is instructed to perform gateway discovery through an improved Hello message mechanism, and the gateway node waits for the Hello timer to time out before entering a process of sending a Hello or Hello_I message;

[0026] Step S203: Instruct the gateway node to receive the Hello or Hello_I message and create new routing information;

[0027] Step S204: Select a gateway step. If the new routing information is better than the original gateway node to gateway node route, create or update a default route to the gateway node, wherein the better is determined based on the number of hops to reach the gateway node, and the number of hops information is already included in the Hello or Hello_I message.

[0028] Preferably, the step S3 comprises the steps of:

[0029] Step S301: link detection step, i.e., link detection based on the Hello mechanism, each gateway node performs a two-way confirmation process by periodically exchanging Hello messages, wherein the two-way confirmation process verifies that the link is a two-way symmetric link, and the gateway node can adaptively adjust the Hello period according to the dynamics of the neighbor relationship;

[0030] Step S302: neighbor discovery step, that is, each gateway node can obtain a single-hop neighbor relationship according to the information database of the link detection step;

[0031] Step S303: a local routing table generation step, which can calculate and generate a local routing table within the wireless heterogeneous network area within a range of one hop to two hops according to the single-hop neighbor relationship of the gateway node.

[0032] The step S4 comprises the steps of:

[0033] Step S401: starting the on-demand routing discovery step and generating an on-demand routing message;

[0034] Step S402: discarding repeated routing request messages in the on-demand routing message;

[0035] Step S403: processing request message step;

[0036] Step S404: discarding duplicate reply routing messages in the on-demand routing message;

[0037] Step S405: updating the routing table;

[0038] The step S5 comprises the steps of:

[0039] Step S501: forming a routing table through routing management coordination of neighbor management and on-demand routing;

[0040] Step S502: Generate a wireless heterogeneous network global routing table according to the access user information collected by the routing table;

[0041] Step S503: Instruct the network layer in the wireless heterogeneous network global routing table to provide a routing interface;

[0042] The step S6 comprises the steps of:

[0043] Step S601: selecting path information for a routing request according to the number of hops of the routing entry and the load of the next hop node, wherein the selected path information includes a two-hop routing decision and an on-demand routing decision;

[0044] Step S602: Search the routing table according to the target address of the path message.

[0045] A terminal-coordinated wireless heterogeneous network global routing generation system provided by the present invention includes:

[0046] Module M1: enables the terminal side and the network side to access the wireless heterogeneous network composed of 5G and ad hoc network through the converged network;

[0047] Module M2: enables Ad Hoc network to access 5G network;

[0048] Module M3: maintaining a local network topology information routing table within the wireless heterogeneous network area;

[0049] Module M4: extending the routing table according to on-demand routing outside the wireless heterogeneous network area;

[0050] Module M5: establishing a wireless heterogeneous network global routing table based on the wireless heterogeneous network;

[0051] Module M6: Enable the routing table and the wireless heterogeneous network global routing to start autonomous decision-making.

[0052] Preferably, in the module M1:

[0053] The terminal side and the network side are enabled to collaboratively access the wireless heterogeneous network, and the network parameter information of the network side and the information interacted with the user of the terminal side are first transferred to the terminal side for processing, and then the terminal side is enabled to obtain a network selection scheme that meets the user's service requirements and QoS through a network selection algorithm based on network load balancing, and finally the network selection scheme is submitted to the network side for allocating network resources;

[0054] The module M1 includes the following modules:

[0055] Module M101: resource monitoring module, i.e., collecting the 5G network resources before accessing the base station, monitoring the information work on the network side and the terminal side, collecting preset information, and finally transferring the preset information to the terminal side for processing;

[0056] Module M102: information collection module, i.e. the terminal side collects the network resources of the resource monitoring, and detects the relevant information of the end-to-end wireless network of the surrounding ad hoc network and the status information of the terminal itself, and dynamically adjusts the network scanning period of the terminal through the detection;

[0057] Module M103: a network selection module, that is, comprehensively considering the information collection, using a fuzzy neural network, and selecting a suitable wireless heterogeneous network from the candidate wireless heterogeneous networks;

[0058] Module M104, a network control module, performs group access control on the wireless heterogeneous network based on a dynamic priority algorithm.

[0059] Preferably, the module M2 comprises the following modules:

[0060] Module M201: instructing the gateway node to process the data packet, that is, after receiving the data packet, the gateway node can check whether there is routing information directly reaching the destination gateway node in the routing table;

[0061] Module M202: enabling the gateway node to perform gateway discovery through the improved Hello message system, and the gateway node enters the process of sending a Hello or Hello_I message after waiting for the Hello timer to time out;

[0062] Module M203: instructing the gateway node to receive the Hello or Hello_I message and create new routing information;

[0063] Module M204: select a gateway module. If the new routing information is better than the original gateway node to gateway node route, create or update the default route to the gateway node, wherein the better judgment basis is the number of hops to reach the gateway node, and the number of hops information is included in the Hello or Hello_I message.

[0064] Preferably, the module M3 comprises the following modules:

[0065] Module M301: link detection module, i.e., link detection based on the Hello system. Each gateway node performs a two-way confirmation process by periodically exchanging Hello messages, wherein the two-way confirmation process verifies that the link is a two-way symmetric link. The gateway node can adaptively adjust the Hello period according to the dynamics of the neighbor relationship.

[0066] Module M302: neighbor discovery module, that is, each gateway node can obtain a single-hop neighbor relationship according to the information database of its link detection module;

[0067] Module M303: A local routing table generation module, which can calculate a local routing table within a wireless heterogeneous network area within a range of one hop to two hops according to the single-hop neighbor relationship of the gateway node.

[0068] The module M4 includes the following modules:

[0069] Module M401: Start the on-demand routing discovery module and generate an on-demand routing message;

[0070] Module M402: discarding repeated routing request messages in the on-demand routing message;

[0071] Module M403: request message processing module;

[0072] Module M404: discarding duplicate reply routing messages in the on-demand routing message;

[0073] Module M405: Update routing table module;

[0074] The module M5 comprises the following modules:

[0075] Module M501: forms a routing table through routing management coordination of neighbor management and on-demand routing;

[0076] Module M502: Generate a wireless heterogeneous network global routing table based on the access user information collected by the routing table,

[0077] Module M503: Instruct the network layer in the wireless heterogeneous network global routing table to provide a routing interface;

[0078] The module M6 comprises the following modules:

[0079] Module M601: Select path information for the routing request according to the number of hops of the routing entry and the load of the next hop node, wherein the selected path information includes a two-hop routing decision and an on-demand routing decision;

[0080] Module M602: Search the routing table according to the target address of the path message.

[0081] According to a terminal station cooperative device provided by the present invention, the terminal station cooperative wireless heterogeneous network global route generation method is adopted to generate routes.

[0082] According to a wireless heterogeneous network device provided by the present invention, the terminal station-coordinated wireless heterogeneous network global route generation method is used to generate routes.

[0083] Compared with the prior art, the present invention has the following beneficial effects:

[0084] 1. The architecture based on the collaboration between the terminal user side and the network side can reduce the burden on the network side and improve the overall processing power and computing efficiency of the system. In a wireless heterogeneous network environment, since all terminals become components of the system, the processing power of all devices in the entire system is fully utilized, thereby achieving collaboration between the network side and the terminal user side.

[0085] 2. In 5G networks and Ad Hoc networks, the Ad Hoc access to 5G network solution based on the gateway discovery mechanism realizes the wireless heterogeneous network integration of 5G networks and Ad Hoc networks through an improved gateway discovery protocol and a gateway selection algorithm based on hop count.

[0086] 3. Based on the hybrid routing protocol framework, combined with the characteristics of 5G and self-organizing networks, table-driven routing and on-demand routing are combined, and a hybrid routing mechanism combining local exchange and global diffusion is adopted to realize the generation of global routing tables and routing management of wireless heterogeneous networks, optimize routing path selection, and reduce latency. BRIEF DESCRIPTION OF THE DRAWINGS

[0087] Other features, objects and advantages of the present invention will become more apparent from the detailed description of non-limiting embodiments made with reference to the following drawings:

[0088] Figure 1 A schematic diagram of a heterogeneous network resource management architecture for collaboration between the user side and the network side;

[0089] Figure 2 A schematic diagram of the architecture of the global routing generation method for 5G combined with self-organizing networks;

[0090] Figure 3 A schematic diagram of the pre-decision process for network selection algorithm;

[0091] Figure 4 Provide a schematic diagram of the control flow for user acceptance;

[0092] Figure 5 Schematic diagram of gateway selection algorithm based on hop count;

[0093] Figure 6 The figure is a flow chart of the routing algorithm.

[0094] The figure shows:

[0095] GW stands for gateway device;

[0096] Node represents a node device. DETAILED DESCRIPTION

[0097] The present invention is described in detail below in conjunction with specific embodiments. The following embodiments will help those skilled in the art to further understand the present invention, but are not intended to limit the present invention in any form. It should be noted that, for those of ordinary skill in the art, several changes and improvements can also be made without departing from the concept of the present invention. These all belong to the protection scope of the present invention.

[0098] The present invention proposes a method for generating global routing in a wireless heterogeneous network with end station collaboration, comprising the following contents:

[0099] First, in the wireless heterogeneous network composed of 5G and ad hoc networks, terminal users can access the converged network and carry out network resource scheduling of joint ad hoc networks and 5G base stations. The network parameter information on the network side and the information interacting with the terminal user side are transferred to the terminal user side for processing. Strategies are used to derive network selection solutions that meet user business needs and QoS, so as to determine specific solutions for business diversion and resource allocation.

[0100] Then, the integration of 5G and Ad Hoc networks is achieved through the terminal-side gateway discovery mechanism. When the mobile terminal cannot connect directly to the base station, the terminal side can use the gateway function provided by the mobile terminal directly connected to the base station in the end-to-end self-organizing network subnet to connect to the base station and the core network through a multi-hop connection. Therefore, a gateway discovery mechanism is added to the terminal-side Ad Hoc network.

[0101] Among them, the above-mentioned gateway discovery mechanism is an improved gateway discovery mechanism method based on the Hello message. This improved method makes full use of the Hello message mechanism in the routing protocol. While ensuring the maintenance of local routing information in the Ad Hoc network, the gateway discovery function is expanded, effectively reducing the network load.

[0102] Finally, the present invention is based on the hybrid routing protocol framework, such as Figure 2 As shown in the figure, combining the characteristics of 5G self-organizing network and Ad hoc network, combining table-driven routing and on-demand routing, adopting a hybrid routing mechanism that combines local switching on the terminal side with global diffusion on the base station side, using the local topology information mastered by the terminal node, and combining factors such as the perceived load of adjacent nodes, the intra-domain link information is promptly diffused to form intra-domain routing, optimizing the selection of forwarding paths in local areas, and performing fast forwarding; the base station side adopts a directed diffusion method, by adding an inter-domain expired route caching mechanism, making full use of existing routing information and avoiding unnecessary overhead caused by repeated path finding.

[0103] Among them, based on the routing mechanism coordinated between the terminal and the base station, the topology information within the local two-hop range is maintained through the Hello mechanism, and the on-demand routing mechanism is combined to establish on-demand self-organizing network routing entries, and then the 5G terminal routing table connected to the base station side is formed to form a global routing table, thereby providing routing for business data. Compared with active routing, this hybrid routing mechanism is less affected by topology changes and can reduce routing maintenance costs; compared with reactive routing, this mechanism has a relatively fast forwarding speed.

[0104] The present invention will be described in more detail below.

[0105] A method for generating global routing in a wireless heterogeneous network with terminal cooperation provided by the present invention specifically comprises the following steps:

[0106] Step S1, that is, the terminal user side and the network side cooperate to access heterogeneous network resources. First, the network parameter information of the network side and the information interacted with the terminal user side are transferred to the terminal user side for processing. The terminal user side first uses the network selection algorithm based on network load balancing to obtain a network selection scheme that meets the user's service requirements and QoS, and finally submits it to the network side based on the priority group admission control algorithm to allocate network resources;

[0107] The step S1 specifically comprises:

[0108] Step S101, pre-access resource monitoring. Before accessing the base station, collect 5G access network resources, monitor the information on the 5G network side and the terminal side, collect time-varying information such as network available bandwidth, RSS, network energy consumption, network load, and user service requirements, service time, service arrival rate, preferences, and other preset information, and transfer them to the terminal user side for processing;

[0109] Step S102, terminal side information collection. The terminal side collects 5G network information sent by the base station, and detects the relevant information of the surrounding end-to-end self-organizing wireless network and the terminal's own status information, including the network's signal strength, remaining available bandwidth, network load status, terminal movement speed, location information, etc., which can not only reduce unnecessary network scanning times and save terminal energy, but also detect the surrounding available wireless networks in time, and use the network signal strength and terminal movement speed as the basis to dynamically adjust the terminal's network scanning cycle;

[0110] The above-mentioned dynamic adjustment of the network scanning period of the terminal includes the following contents:

[0111] First, based on the mobility of the terminal, the moving speed of the terminal is considered as a factor affecting the network scanning period. As the moving speed increases, the network scanning period is reduced so that new available wireless networks can be monitored by the terminal in time.

[0112] Secondly, based on the current access network status, analyze the signal strength of the current access network received by the terminal. The smaller the signal strength, the worse the current access network status is, and it is necessary to switch to a better network. Therefore, the network scanning cycle is reduced and the scanning is accelerated.

[0113] Among them, the dynamic scanning period T cur The calculation method is as follows:

[0114]

[0115] Among them, T cur Represents the dynamic scanning period, T max Indicates the maximum network scanning period, T min Indicates the minimum network scanning period, RSScur Indicates the signal strength of the current access network received by the terminal, RSS th Indicates the signal strength threshold for the terminal to access the network, V cur Indicates the current moving speed of the terminal, V max Indicates the maximum terminal moving speed, and st indicates the constraint.

[0116] Step S103, network selection on the terminal user side. Comprehensively consider the network's signal strength, available bandwidth, user's moving speed, location and other information, and use fuzzy neural networks to select a suitable target network from the candidate networks. When the 5G network is unobstructed, 5G is accessed first. When 5G access fails, the end-to-end self-organizing network is accessed. When the difference between the target network performance and the original access network performance is small, the switching selection of the access network is controlled by introducing a small threshold method to avoid unnecessary switching;

[0117] Among them, the fuzzy neural network indicates that the available bandwidth of the candidate k-th network is used as the pre-decision parameter of the fuzzy neural network, such as Figure 3 As shown, if the user requires bandwidth B T Less than the remaining available bandwidth B of the kth network k , it is determined that the kth network cannot be used as the target switching network, otherwise RSS k , B k , ΔP k , V input fuzzy neural network module to further confirm the kth network and calculate F k The value of is used to select the final target network. k Indicates the signal strength of the kth network received by the terminal, B k represents the remaining available bandwidth of the kth network, ΔP k represents the distance between the user's current location and the kth network, V represents the user's moving speed, and F k It represents the possibility value of the terminal accessing the kth network calculated by the fuzzy neural network.

[0118] The neural network training process is divided into two stages. The first stage is the offline stage. The terminal user side measures the RSS of each wireless network and selects the wireless network with the highest RSS as the target network. If the RSS of the measured candidate network is higher than the RSS of the current access network (RSS new >RSS cur ), the terminal switches to the wireless network with the highest RSS to obtain training samples; then, supervised learning is used to train the fuzzy neural network and determine the membership function center c ab , the width of the membership function σ ab and the weighted value w aThe initial value of RSS new Represented as RSS of alternative networks, RSS cur Represents the RSS of the current access network.

[0119] Then comes the reinforcement stage. At the tth moment, the user's fitness for the network is y k (t) is expressed as follows:

[0120] y k (t) = exp(-t k ) (2)

[0121] in,

[0122] y k (t) represents the user's fitness for the kth network at the tth moment;

[0123] t k It is represented as the duration of the user’s most recent service in the kth network at the tth moment, and the reinforcement learning signal e k (t) is expressed as:

[0124] e k (t) = y k (t)-y* (3)

[0125] Among them, e k (t) represents the signal of the kth network of reinforcement learning at the tth moment, y * It is expressed as the user's expected fitness for the network.

[0126] Target error function E k (t) is expressed as:

[0127]

[0128] Among them, E k (t) represents the target error of the kth network at the tth moment.

[0129] In the network selection decision stage on the user side, the possibility F of the terminal accessing the kth network is obtained according to the fuzzy neural network calculation. k To select the final switching target network, F k The value range is [0,1].

[0130]

[0131] in,

[0132] F max It is expressed as the maximum value of the current intervention network;

[0133] argmax represents the function for finding the maximum value;

[0134] M represents the number of networks;

[0135] F k It is represented by the probability value of the terminal accessing the kth network calculated by the fuzzy neural network;

[0136] F best Indicates the optimal value of the current access network;

[0137] F cur represents the output value of the current access network, and δ represents a small threshold to avoid slight changes in the network environment.

[0138] In formula (6), the output value of the current access network is F cur , if F max =F cur or (F max / F cur )≤δ, the terminal stays in the current access network, otherwise select F max The corresponding network is the access network, and network switching is performed;

[0139] Step S104, network-side admission control. Based on the dynamic priority algorithm, group access control is performed on users. First, the initial priority is set according to the type of user and service; then, the service priority is dynamically adjusted according to the urgency of service demand and its residual value density, and it is stipulated that high-priority services can preempt network resources of low-priority services under certain conditions. At the same time, network scheduling conditions are set to avoid repeated scheduling during the dynamic adjustment of service priorities.

[0140] The above dynamic priority algorithm includes the following contents:

[0141] First, the residual value density RVD of the business. If the i-th business has executed s i Unit time, the theoretical execution unit time of the i-th business is S i , 0 i i , then RVD i (s i ) is expressed as:

[0142]

[0143] in,

[0144] RVD i (s i ) indicates that the i-th business has executed s i The density of surplus value produced per unit of time; ​​

[0145] s i It is expressed as the number of execution time of the i-th business;

[0146] V i Expressed as the value of the ith business;

[0147] IV i (s i ) indicates that the i-th business has executed s i The immediate value generated per unit of time;

[0148] S i It is expressed as the number of theoretical execution unit time of the i-th business;

[0149] It is expressed as the p-th power of the theoretical service time of the ith business;

[0150] It is expressed as the actual service time of the i-th business and the speed of change of the random value to the power of p;

[0151] p represents a parameter for adjusting the speed of immediate value change. When p = 1, RVD i (s i ) is expressed as:

[0152]

[0153] in,

[0154] Represents the average value density of the ith business, that is, the value V of the ith business i The ratio of the theoretical execution time of the i-th business to the number of unit times.

[0155] RVD i (s i ) i The increase is expressed as:

[0156]

[0157] The larger the value of the superscript p, the greater the RVD i (s i ) value, the larger the RVD i (s i ) is used to adjust the priority of the business.

[0158] Secondly, at time tδ i (t) is:

[0159]

[0160] in,

[0161] δ i (t) represents the urgency of executing the i-th business at time t, and t represents the time;

[0162] q represents a parameter for adjusting the intensity of business execution, which can affect the urgency of business execution;

[0163] Superscript It is represented by the execution intensity of the ith business at time t, and its value range is (0,1];

[0164] Superscript d i Represents the deadline of the i-th business.

[0165] Assume that at time t, DyPr(T i )for:

[0166]

[0167] in,

[0168] DyPr(T i ) represents the dynamic priority of the i-th service at time t;

[0169] T i Represented as the i-th business at time t;

[0170] RVD i (t) is represented by the surplus value density of the i-th business at time t.

[0171] Since the service priority is alternating during the calculation of dynamic priority, network resources are repeatedly occupied, resulting in service interruption and affecting user experience. To avoid repeated scheduling during the dynamic adjustment of service priority, the network scheduling coefficient β (β ≥ 1) is set. For example, when two services T a and T b When network resource preemption occurs, the service T in service state A , the business T in the waiting state b , the preemption conditions between them are:

[0172]

[0173] in,

[0174] DyPr(T b ) indicates the business T in waiting state b Dynamic priority of

[0175] DyPr(T a ) indicates the service in service state T a Dynamic priority of

[0176] T b Indicates a business in a waiting state;

[0177] T a Represents a business in service state;

[0178] β represents the network scheduling coefficient;

[0179] Indicates business T a The average value density of

[0180] Indicates business T b The average value density of

[0181] p represents the parameter for adjusting the speed of instant value change;

[0182] q represents a parameter for adjusting the intensity of business execution, which can affect the urgency of business execution;

[0183] Superscript Represented as business T b The execution strength, fraction S b Represented as business T b The theoretical execution time of the fraction D b Represented as business T b of free time.

[0184] T is allowed if and only if the preemption condition is met. b Seize T a network resources to avoid service interruptions caused by repeated scheduling.

[0185] If the bandwidth required by the current user at time t is B i (t) is greater than the remaining available bandwidth C(t) of the 5G network. In other words, when B i When (t)>C(t), it will cause 5G network access or switching blocking. Define P block (t) is the blocking rate of access or switching at time t, expressed as:

[0186]

[0187] in,

[0188] P block (t) represents the blocking rate of access or switching at time t;

[0189] B i (t) represents the current user T at time t i Required bandwidth;

[0190] C(t) represents the remaining available bandwidth of the 5G network at time t.

[0191] For example, at time t, the bandwidth required by the services waiting in the queue in the current network is B(t), and the number of users in the current network is M. * (t), set the target blocking rate constraint value P block_th =0.01. If C(t)≥B(t), all services are directly accessed or switched to the 5G network; otherwise, P is calculated. block (t) Whether P is satisfied block (t)≤P block_th , if this condition is met, then let M * (t) increments by 1, where M * (t) represents the number of users at the tth moment, M * (t) = increment by 1, indicating the number of users added at the tth moment, and M is calculated. * (t) is the number of network accesses or handoffs that the 5G network can accept. The number of users allowed under the target blocking rate constraint is obtained. * (t), only the corresponding M in the queue * (t) users access or switch to the 5G network, and the remaining users are connected through the end-to-end self-organizing network, thereby avoiding network congestion. In addition, the priority of 5G network resources on the base station side is higher than that of the end-to-end self-organizing network. When the 5G network resources are good, the high-priority user requests will be connected to 5G. When 5G access fails, the end-to-end self-organizing network will be accessed. The specific user admission control flow chart is as follows Figure 4 shown.

[0192] Step S2, i.e., accessing the Ad Hoc network to the 5G network based on the improved gateway discovery mechanism. In the integration of the Ad Hoc network and the 5G network, when the mobile terminal cannot directly connect to the base station, it is necessary to use the gateway function provided by the mobile terminal in the subnet that can directly connect to the base station to connect to the 5G base station and the core network in multiple hops;

[0193] The step S2 specifically includes:

[0194] Step S201, the node processes the data packet. After receiving the data packet, the node first checks whether there is routing information in the routing table that directly reaches the destination node. If there is such routing information, the data packet is directly sent to the destination node; if there is no such routing information, the data packet will be cached until the node obtains the routing information of the gateway node. In the process of putting the node into the cache, it is necessary to check whether the cache has overflowed. If the cache overflows, the data packet is discarded;

[0195] Step S202, the node performs gateway discovery through the improved Hello message mechanism. The node needs to wait for the Hello timer to time out before entering the sending process. If the current node is a gateway node, then after the Hello timer times out, the node will set the I-flag, hop count (set to zero), and the address of the gateway node in the Hello message to construct a new Hello_I message; if the current node is not a gateway node, the node checks whether the Hello message contains the I-flag identifier. If not, it sends a regular Hello message. If so, it sets the I-flag, hop count (set to the number of hops to the gateway node), and the address of the gateway node in the Hello message to construct a new Hello_I message. The Hello-I message is the same as the Hello message, and it also needs to wait until the Hello timer times out before it can be sent. After sending the Hello or Hello_I message, the node waits for the next Hello timer to time out;

[0196] Step S203, the node receives a Hello or Hello_I message and creates new routing information. After receiving a Hello or Hello_I message, the node updates the routing information to the source node, and then checks which type of Hello message (Hello or Hello_I) it is based on whether there is an I-flag in the message. If it is a Hello_I message, create or update the routing information to the gateway node;

[0197] Step S204, select the best gateway. If the routing information is better than the original node-to-gateway route, create or update the default route to the gateway node. The basis for the determination in the present invention is the number of hops to the gateway node, and the information of the number of hops is included in the Hello_I message.

[0198] Step S3, i.e., maintaining the routing table of the local network topology information in the wireless heterogeneous network area. Based on the concept of the hybrid routing protocol, a table is maintained at each node, which stores the local link information and the link status information from the node to the adjacent node. The table is driven within the local area to ensure that the service interaction is completed quickly within the local area;

[0199] The step 3 specifically comprises:

[0200] Step S301, link detection based on the Hello mechanism. Each node performs two-way confirmation by regularly exchanging Hello messages. When a node sends a Hello message, the content in the local link information table becomes the content of the Hello message. When a node receives a Hello message, it updates its local link information database;

[0201] The above two-way confirmation includes the following:

[0202] Each node performs bidirectional confirmation by periodically exchanging Hello messages to verify that the link is a bidirectional symmetric link.

[0203] The node can adaptively adjust the Hello cycle according to the dynamics of its neighbor relationship. When the neighbor relationship changes rapidly and dynamically, the cycle of exchanging Hello messages is shortened; when the neighbor relationship changes slowly, the cycle of exchanging Hello messages is increased. With the adaptive Hello cycle method, the node can quickly detect topology changes and immediately update its neighbor relationship when the topology changes dramatically. After the topology structure is stable, the overhead of the Hello mechanism can be reduced.

[0204] Each node is based on the topological stability coefficient D neigh Adaptively adjust the Hello cycle. Nodes regularly maintain the topology stability coefficient D with an initial value of 0. neigh , and record the changes in the node's one-hop neighbor table and two-hop neighbor table during the sliding period. If a node adds or loses a one-hop neighbor, the dynamics increases by 2; when a node adds or loses a two-hop neighbor, the dynamics increases by 1. According to the stability coefficient of the neighbor relationship, the degree of change in the neighbor relationship can be divided into three types: stable, slight fluctuations, and drastic changes, and the corresponding Hello broadcast period T Hello for:

[0205]

[0206] in,

[0207] T Hello It is represented as Hello broadcast cycle;

[0208] T base It is expressed as the base cycle;

[0209] D neigh It is expressed as the topological stability coefficient;

[0210] d represents the non-zero threshold of the fluctuation degree.

[0211] When a node sends a Hello message, the content in the local link information table becomes the content of the Hello message. When a node receives a Hello message, it updates its local link information database;

[0212] Step S302, neighbor discovery. Each node can know its one-hop neighbor relationship based on its local link information database. When a node receives a Hello message from its one-hop neighbor node, it will calculate the two-hop neighbors of the node based on the one-hop neighbor information of its one-hop neighbor node, and delete the one-hop neighbor that was originally the node itself;

[0213] Step S303: Generate a local routing table. According to the one-hop and two-hop neighbor tables of the node, a local routing table within the wireless heterogeneous network area within a two-hop range can be calculated.

[0214] Step S4, i.e., extending the routing table by on-demand routing outside the wireless heterogeneous network area. For service data whose destination node is outside the area, it is necessary to initiate on-demand routing discovery and establish a route to the destination node;

[0215] The step 4 specifically comprises:

[0216] Step S401, generating an on-demand routing message. After starting on-demand routing discovery, the addresses of the local node and the destination node are written into the request message, and then the routing management message encapsulating the request message is broadcast;

[0217] Step S402, discard duplicate routing request messages. When a node receives a request message, if the node has processed the same request message (same message sequence number), the request message is directly discarded; if the sending node of the request message is not a symmetric single-hop adjacent node of the node, the message is discarded and no further processing is performed;

[0218] Step S403, request message processing. The node that receives the request message first records the reverse routing information in the on-demand routing set, and then determines whether the destination address in the request message is the address of the local node. If so, the node sends a unicast on-demand routing response reply message to the sending interface of the request message. On the contrary, if the destination address in the request message is not the address of the local node, the reverse routing information will be recorded in the on-demand routing set first, and the request message will continue to be broadcast;

[0219] Step S404, discard duplicate reply routing messages. When a node receives a reply message, if the node has processed the same reply message (same message sequence number), it directly discards the reply message; if the sending node of the reply message is not a single-hop symmetric neighbor of the node, the message must be discarded and no further processing is performed;

[0220] Step S405, updating the routing table. If the destination address of the reply message is the address of the current node, the routing table is recalculated without any further processing; otherwise, the reply message is forwarded according to the reverse routing information.

[0221] Step S5, i.e. generating a global routing table;

[0222] The step 5 specifically comprises:

[0223] Step S501, based on the routing table and according to the access user information provided by the 5G base station side, a wireless heterogeneous network global routing table is generated, and a routing interface is provided to the network layer.

[0224] Step S6: autonomous decision making on global routing in wireless heterogeneous networks.

[0225] The step 6 specifically comprises:

[0226] Step S601, select the optimal path for the routing request according to the number of hops of the routing entry and the load of the next hop node. Search the routing table according to the target address of the message. If there is a route to the destination address in the routing table, return the valid route and end the routing query; otherwise, initiate an on-demand routing request and the data message enters the data message cache queue.

[0227] The selection of the optimal path includes the following:

[0228] ① Routing decision within two hops

[0229] For one-hop routing requests, direct routing is sufficient.

[0230] For two-hop routing requests, routing selection is mainly based on the load of the next-hop node and the routing quality, that is, nodes with lower load and better end-to-end link quality are given priority for routing.

[0231] ② On-demand routing decision

[0232] The on-demand routing decision is based on a comprehensive evaluation of the load, remaining energy, local topology stability and overall link quality of the next-hop node, and is made public through the Hello mechanism. The load information is the occupancy rate of the node's sending queue and cache queue; the node's remaining energy is the ratio of its remaining energy to the node's total energy. If the node's remaining energy exceeds the remaining energy threshold, the node is unavailable.

[0233] The on-demand routing decision scores the load, remaining energy, local topology stability and link quality of the next-hop node and then sums them up to get the total score of the route. Finally, the route with the highest total score is selected.

[0234] The routing algorithm process is as follows: Figure 6As shown. When a node sends a routing request, it first finds all available routes. If there is only one route, it forwards directly according to that route. If there are multiple routes, the four items of each route are scored. The scoring method for the next-hop load and the remaining energy is: score when the load is lower than the load threshold, otherwise no score. Score when the node's remaining energy is higher than the energy threshold, otherwise deduct points. The scoring method for the route link quality is: rank the link quality of each route, and the higher the ranking, the higher the score. The scoring method for the local topological stability is: rank the local topological stability of the next-hop node of each route, and the higher the ranking, the higher the score. Finally, the four scores are summed up to get the total score of the route, and the route with the highest total score is selected for forwarding.

[0235] The present invention also provides a terminal-coordinated wireless heterogeneous network global routing generation system, which can be implemented by executing the process steps of a terminal-coordinated wireless heterogeneous network global routing generation method, that is, those skilled in the art can understand the terminal-coordinated wireless heterogeneous network global routing generation method as a preferred implementation of the terminal-coordinated wireless heterogeneous network global routing generation system.

[0236] A terminal-coordinated wireless heterogeneous network global routing generation system provided by the present invention includes:

[0237] Module M1: enables the terminal side and the network side to access the wireless heterogeneous network composed of 5G and ad hoc network through the converged network;

[0238] Module M2: enables Ad Hoc network to access 5G network;

[0239] Module M3: maintaining a local network topology information routing table within the wireless heterogeneous network area;

[0240] Module M4: outside the wireless heterogeneous network area, establishing on-demand route discovery and routing to a destination node according to service data of an on-demand route extension routing table;

[0241] Module M5: establishing a wireless heterogeneous network global routing table based on the wireless heterogeneous network;

[0242] Module M6: Enable the wireless heterogeneous network global routing to start autonomous decision-making.

[0243] Specifically, in the module M1:

[0244] The terminal side and the network side are made to collaboratively access the wireless heterogeneous network, firstly, the network parameter information of the network side and the information interacted with the user of the terminal side are transferred to the terminal side for processing, and then the terminal side is made to obtain a network selection scheme that meets the user service requirements and QoS through a network selection algorithm based on network load balancing, and finally the network selection scheme is submitted to the priority-based group admission control algorithm of the network side to allocate network resources;

[0245] Specifically, the module M1 includes:

[0246] Module M101: resource monitoring module, i.e., collecting the 5G network resources before accessing the base station, monitoring the information work on the network side and the terminal side, collecting preset information, and finally transferring the preset information to the terminal side for processing;

[0247] Module M102: information collection module, i.e. the terminal side collects the network resources of the resource monitoring, and detects the relevant information of the end-to-end wireless network of the surrounding ad hoc network and the status information of the terminal itself, and dynamically adjusts the network scanning period of the terminal through the detection;

[0248] Module M103: a network selection module, that is, comprehensively considering the information collection, using a fuzzy neural network, and selecting a suitable wireless heterogeneous network from the candidate wireless heterogeneous networks;

[0249] Module M104, a network control module, performs group access control on the wireless heterogeneous network based on a dynamic priority algorithm.

[0250] Specifically, the module M2 includes:

[0251] Module M201: instructing the gateway node to process the data packet, that is, after receiving the data packet, the gateway node can check whether there is routing information directly reaching the destination gateway node in the routing table;

[0252] Module M202: enabling the gateway node to perform gateway discovery through the improved Hello message system, and the gateway node enters the process of sending a Hello or Hello_I message after waiting for the Hello timer to time out;

[0253] Module M203: instructing the gateway node to receive the Hello or Hello_I message and create new routing information;

[0254] Module M204: select a gateway module. If the new routing information is better than the original gateway node to gateway node route, create or update the default route to the gateway node, wherein the better judgment basis is the number of hops to reach the gateway node, and the number of hops information is included in the Hello or Hello_I message.

[0255] The module M3 includes the following modules:

[0256] Module M301: link detection module, i.e., link detection based on the Hello system. Each gateway node performs a two-way confirmation process by periodically exchanging Hello messages, wherein the two-way confirmation process verifies that the link is a two-way symmetric link. The gateway node can adaptively adjust the Hello period according to the dynamics of the neighbor relationship.

[0257] Module M302: neighbor discovery module, that is, each gateway node can obtain a single-hop neighbor relationship according to the information database of its link detection module;

[0258] Module M303: A local routing table generation module, which can calculate a local routing table within a wireless heterogeneous network area within a range of one hop to two hops according to the single-hop neighbor relationship of the gateway node.

[0259] The module M4 includes the following modules:

[0260] Module M401: Start the on-demand routing discovery module and generate an on-demand routing message;

[0261] Module M402: discarding repeated routing request messages in the on-demand routing message;

[0262] Module M403: request message processing module;

[0263] Module M404: discarding duplicate reply routing messages in the on-demand routing message;

[0264] Module M405: Update routing table module.

[0265] The module M5 comprises the following modules:

[0266] Module M501: forms a routing table through routing management coordination of neighbor management and on-demand routing;

[0267] Module M502: Generate a wireless heterogeneous network global routing table based on the access user information collected by the routing table,

[0268] Module M503: enables the network layer in the wireless heterogeneous network global routing table to provide a routing interface.

[0269] The module M6 comprises the following modules:

[0270] Module M601: Select path information for the routing request according to the number of hops of the routing entry and the load of the next hop node, wherein the selected path information includes a two-hop routing decision and an on-demand routing decision;

[0271] Module M602: Search the routing table according to the target address of the path message.

[0272] The present invention also provides a terminal station cooperative device, which works by adopting the terminal station cooperative wireless heterogeneous network global routing generation method.

[0273] The present invention also provides a wireless heterogeneous network device, which works by adopting the terminal-station-coordinated wireless heterogeneous network global routing generation method.

[0274] Those skilled in the art know that, in addition to realizing the system and its various devices, modules, and units provided by the present invention in a purely computer-readable program code, it is entirely possible to realize the same functions in the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers by logically programming the method steps. Therefore, the system and its various devices, modules, and units provided by the present invention can be considered as a hardware component, and the devices, modules, and units included therein for realizing various functions can also be regarded as structures within the hardware component; the devices, modules, and units for realizing various functions can also be regarded as both software modules for realizing the method and structures within the hardware component.

[0275] The above describes the specific embodiments of the present invention. It should be understood that the present invention is not limited to the above specific embodiments, and those skilled in the art can make various changes or modifications within the scope of the claims, which does not affect the essence of the present invention. In the absence of conflict, the embodiments of the present application and the features in the embodiments can be combined with each other arbitrarily.

Claims

1. A method for generating global routing in a wireless heterogeneous network with end-station collaboration, characterized in that: include: Step S1: Allow the terminal side and the network side to access the wireless heterogeneous network composed of 5G and ad hoc network through the converged network; Step S2: enabling the Ad Hoc network to access the wireless heterogeneous network; Step S3: maintaining a local network topology information routing table within the wireless heterogeneous network area; Step S4: outside the wireless heterogeneous network area, extending the routing table according to on-demand routing; Step S5: establishing a wireless heterogeneous network global routing table based on the routing table and the wireless heterogeneous network; Step S6: starting an autonomous decision-making mechanism according to the wireless heterogeneous network global routing table.

2. The method for generating global routing in a wireless heterogeneous network with end-station collaboration according to claim 1, characterized in that: In step S1: The terminal side and the network side are enabled to collaboratively access the wireless heterogeneous network, firstly, the network parameter information of the network side and the information interacted with the user of the terminal side are transferred to the terminal side for processing, then the terminal side is enabled to obtain a network selection scheme that meets the user service requirements and QoS through a network selection algorithm based on network load balancing, and finally the network selection scheme is submitted to the network side for allocating network resources; The step S1 comprises the steps of: Step S101: a resource monitoring step, i.e., collecting the 5G network resources before accessing the base station, monitoring the information work on the network side and the terminal side, collecting preset information, and finally transferring the preset information to the terminal side for processing; Step S102: Information collection step, i.e. the terminal side collects the network resources of the resource monitoring, and detects the relevant information of the end-to-end wireless network of the surrounding ad hoc network and the terminal's own state information, and dynamically adjusts the network scanning period of the terminal through the detection; Step S103: a network selection step, that is, comprehensively considering the information collection, using a fuzzy neural network, and selecting a suitable wireless heterogeneous network from the candidate wireless heterogeneous networks; Step S104, a network control step, performs group access control on the wireless heterogeneous network based on a dynamic priority algorithm.

3. The method for generating global routing in a wireless heterogeneous network with end-station collaboration according to claim 1, characterized in that: The step S2 comprises the steps of: Step S201: instructing the gateway node to process the data packet, that is, after receiving the data packet, the gateway node can check whether there is routing information directly reaching the destination gateway node in the routing table; Step S202: the gateway node is instructed to perform gateway discovery through an improved Hello message mechanism, and the gateway node waits for the Hello timer to time out before entering a process of sending a Hello or Hello_I message; Step S203: Instruct the gateway node to receive the Hello or Hello_I message and create new routing information; Step S204: Select a gateway step. If the new routing information is better than the original gateway node to gateway node route, create or update a default route to the gateway node, wherein the better is determined based on the number of hops to reach the gateway node, and the number of hops information is already included in the Hello or Hello_I message.

4. The method for generating global routing in a wireless heterogeneous network with end-station collaboration according to claim 1, characterized in that: The step S3 comprises the steps of: Step S301: link detection step, i.e., link detection based on the Hello mechanism, each gateway node performs a two-way confirmation process by periodically exchanging Hello messages, wherein the two-way confirmation process verifies that the link is a two-way symmetric link, and the gateway node can adaptively adjust the Hello period according to the dynamics of the neighbor relationship; Step S302: neighbor discovery step, that is, each gateway node can obtain a single-hop neighbor relationship according to the information database of the link detection step; Step S303: a local routing table generation step, which can calculate and generate a local routing table within the wireless heterogeneous network area within a range of one hop to two hops according to the single-hop neighbor relationship of the gateway node. The step S4 comprises the steps of: Step S401: starting the on-demand routing discovery step and generating an on-demand routing message; Step S402: discarding repeated routing request messages in the on-demand routing message; Step S403: processing request message step; Step S404: discarding duplicate reply routing messages in the on-demand routing message; Step S405: updating the routing table; The step S5 comprises the steps of: Step S501: forming a routing table through routing management coordination of neighbor management and on-demand routing; Step S502: Generate a wireless heterogeneous network global routing table according to the access user information collected by the routing table; Step S503: Instruct the network layer in the wireless heterogeneous network global routing table to provide a routing interface; The step S6 comprises the steps of: Step S601: selecting path information for a routing request according to the number of hops of the routing entry and the load of the next hop node, wherein the selected path information includes a two-hop routing decision and an on-demand routing decision; Step S602: Search the routing table according to the target address of the path message.

5. A wireless heterogeneous network global routing generation system with end-station collaboration, characterized in that: include: Module M1: enables the terminal side and the network side to access the wireless heterogeneous network consisting of 5G and ad hoc networks through a converged network; Module M2: enables Ad Hoc network to access 5G network; Module M3: maintaining a local network topology information routing table within the wireless heterogeneous network area; Module M4: extending the routing table according to on-demand routing outside the wireless heterogeneous network area; Module M5: establishing a wireless heterogeneous network global routing table based on the wireless heterogeneous network; Module M6: Enable the routing table and the wireless heterogeneous network global routing to start autonomous decision-making.

6. The terminal-coordinated wireless heterogeneous network global routing generation system according to claim 5, characterized in that: In the module M1: The terminal side and the network side are enabled to collaboratively access the wireless heterogeneous network, firstly, the network parameter information of the network side and the information interacted with the user of the terminal side are transferred to the terminal side for processing, then the terminal side is enabled to obtain a network selection scheme that meets the user service requirements and QoS through a network selection algorithm based on network load balancing, and finally the network selection scheme is submitted to the network side for allocating network resources; The module M1 includes the following modules: Module M101: resource monitoring module, i.e., collecting the 5G network resources before accessing the base station, monitoring the information work on the network side and the terminal side, collecting preset information, and finally transferring the preset information to the terminal side for processing; Module M102: information collection module, i.e. the terminal side collects the network resources of the resource monitoring, and detects the relevant information of the end-to-end wireless network of the surrounding ad hoc network and the status information of the terminal itself, and dynamically adjusts the network scanning period of the terminal through the detection; Module M103: a network selection module, that is, comprehensively considering the information collection, using a fuzzy neural network, and selecting a suitable wireless heterogeneous network from the candidate wireless heterogeneous networks; Module M104, a network control module, performs group access control on the wireless heterogeneous network based on a dynamic priority algorithm.

7. The terminal-coordinated wireless heterogeneous network global routing generation system according to claim 5, characterized in that: The module M2 includes the following modules: Module M201: instructing the gateway node to process the data packet, that is, after receiving the data packet, the gateway node can check whether there is routing information directly reaching the destination gateway node in the routing table; Module M202: enabling the gateway node to perform gateway discovery through the improved Hello message system, and the gateway node enters the process of sending a Hello or Hello_I message after waiting for the Hello timer to time out; Module M203: instructing the gateway node to receive the Hello or Hello_I message and create new routing information; Module M204: select a gateway module. If the new routing information is better than the original gateway node to gateway node route, create or update the default route to the gateway node, wherein the better judgment basis is the number of hops to reach the gateway node, and the number of hops information is included in the Hello or Hello_I message.

8. The terminal-coordinated wireless heterogeneous network global routing generation system according to claim 5, characterized in that: The module M3 includes the following modules: Module M301: link detection module, i.e., link detection based on the Hello system. Each gateway node performs a two-way confirmation process by periodically exchanging Hello messages, wherein the two-way confirmation process verifies that the link is a two-way symmetric link. The gateway node can adaptively adjust the Hello period according to the dynamics of the neighbor relationship. Module M302: neighbor discovery module, that is, each gateway node can obtain a single-hop neighbor relationship according to the information database of its link detection module; Module M303: A local routing table generation module, which can calculate a local routing table within a wireless heterogeneous network area within a range of one hop to two hops according to the single-hop neighbor relationship of the gateway node. The module M4 includes the following modules: Module M401: Start the on-demand routing discovery module and generate an on-demand routing message; Module M402: discarding repeated routing request messages in the on-demand routing message; Module M403: request message processing module; Module M404: discarding duplicate reply routing messages in the on-demand routing message; Module M405: Update routing table module; The module M5 comprises the following modules: Module M501: forms a routing table through routing management coordination of neighbor management and on-demand routing; Module M502: Generate a wireless heterogeneous network global routing table based on the access user information collected by the routing table, Module M503: Instruct the network layer in the wireless heterogeneous network global routing table to provide a routing interface; The module M6 comprises the following modules: Module M601: Select path information for the routing request according to the number of hops of the routing entry and the load of the next hop node, wherein the selected path information includes a two-hop routing decision and an on-demand routing decision; Module M602: Search the routing table according to the target address of the path message.

9. A terminal cooperation device, characterized in that: The method for generating global routes in a wireless heterogeneous network with terminal cooperation as described in any one of claims 1 to 4 is used to generate routes.

10. A wireless heterogeneous network device, characterized in that: The method for generating global routes in a wireless heterogeneous network with terminal cooperation as described in any one of claims 1 to 4 is used to generate routes.

Images