Relay node recommendation method of near field network and related equipment

Abstract

The invention provides a relay node recommendation method of a near-field network and related equipment, and relates to the technical field of computers and communication. The method comprises the following steps: acquiring near-field network service information between user nodes and a relay node, wherein the user nodes comprise a first user node; obtaining a service quality index of the relay node for providing a near-field network service for the first user node; determining a first popularity index of the first user node to the relay node at a first moment according to the near-field network service information and the service quality index; generating relay node recommendation information for the first user node according to the first popularity index; and sending the relay node recommendation information to the first user node.

Description

Background Art

[0002] With the popularization of various smart terminals, massive access to wireless communications such as 5G (5th Generation Mobile Communication Technology) / 6G (6th Generation Mobile Communication Technology), explosive growth in data traffic and a surge in demand for communication capacity, how to elevate cellular frequency reuse to a new stage has become an important issue facing operators.

[0003] A near-area network refers to a network that connects multiple devices (including user nodes and relay nodes in this disclosure) through wireless communication technology within a certain range. It is a technology that allows terminals to directly communicate with each other through shared cell network resources without basic network facilities. It can improve the spectrum efficiency of the communication system, reduce terminal transmission power, and reduce battery consumption.

[0004] For example, Proximity Services (ProSe) provides a way to implement near-area networks. Through ProSe, multiple terminals (e.g., LTE (Long Term Evolution) terminals, 5G terminals, etc.) can directly communicate and share resources in a short distance to form a temporary, self-organizing network. This network can be temporary, self-organizing, and does not rely on fixed network infrastructure. Summary of the invention

[0005] An embodiment of the present disclosure provides a method for recommending relay nodes in a near area network, the method comprising: obtaining near area network service information between a user node and a relay node, the user node comprising a first user node; obtaining a service quality indicator of the near area network service provided by the relay node to the first user node; determining, based on the near area network service information and the service quality indicator, a first heat index of the first user node to the relay node at a first moment; generating relay node recommendation information for the first user node based on the first heat index; and sending the relay node recommendation information to the first user node.

[0006] The embodiment of the present disclosure provides a relay node recommendation device for a near area network, the relay node recommendation device for a near area network comprising: a communication module, used to obtain near area network service information between a user node and a relay node, the user node comprising a first user node; a processing module, used to obtain a service quality indicator of the near area network service provided by the relay node to the first user node; the processing module is further used to determine a first heat index of the first user node to the relay node at a first moment based on the near area network service information and the service quality indicator; the processing module is further used to generate relay node recommendation information for the first user node based on the first heat index; the communication module is further used to send the relay node recommendation information to the first user node.

[0007] An embodiment of the present disclosure provides a computer device, which includes: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the relay node recommendation method for a near area network in any embodiment of the present disclosure by executing the executable instructions.

[0008] An embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the method for recommending a relay node in a near area network in any embodiment of the present disclosure is implemented.

[0009] An embodiment of the present disclosure provides a computer program product, including a computer program, which, when executed by a processor, implements the method for recommending a relay node in a near area network in any embodiment of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 A schematic diagram of the overall architecture of a blockchain network in an embodiment of the present disclosure is shown.

[0011] Figure 2 A flow chart of a method for recommending a relay node in a near area network according to an embodiment of the present disclosure is shown.

[0012] Figure 3 A structural block diagram of a relay node recommendation device for a near area network according to an embodiment of the present disclosure is shown.

[0013] Figure 4 A structural block diagram of a relay node recommendation device in an embodiment of the present disclosure is shown.

[0014] Figure 5 A schematic diagram of the structure of a relay node recommendation system for a near area network in an embodiment of the present disclosure is shown.

[0015] Figure 6 A structural block diagram of a computer device in an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0016] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that the disclosure will be more comprehensive and complete and to fully convey the concepts of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0017] In addition, the accompanying drawings are only schematic diagrams of the present disclosure, and the same reference numerals in the drawings represent the same or similar parts, so their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities, which do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

[0018] In the present disclosure, at least one (item) can be described as one (item) or more (items), and more (items) can be two (items), three (items), four (items) or more (items), without limitation. " / " can indicate that the objects associated before and after are in an "or" relationship, for example, A / B can indicate A or B; "and / or" can be used to describe that there are three relationships between associated objects, for example, A and / or B can indicate: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In order to facilitate the description of the technical solution of the present disclosure, the words "first", "second", "A", or "B" can be used to distinguish technical features with the same or similar functions. The words "first", "second", "A", or "B" do not limit the quantity and execution order. Moreover, the words "first", "second", "A", or "B" do not necessarily limit them to be different. The words "exemplary" or "for example" are used to indicate examples, illustrations or descriptions, and any design described as "exemplary" or "for example" should not be interpreted as being more preferred or more advantageous than other design solutions. The use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way for easy understanding.

[0019] Figure 1 The overall architecture diagram of a blockchain network in the embodiment of the present disclosure is shown. Figure 1 As shown, the method provided by the embodiment of the present disclosure can be applied to the blockchain network 100, that is, the method provided by the embodiment of the present disclosure is implemented in the blockchain network 100. The blockchain network 100 includes a rating recommendation system 110, at least one relay node, and at least one user node. Figure 1 Three relay nodes (relay node 121, relay node 122, and relay node 123) are shown as an example, but the present disclosure does not limit the number of relay nodes, which can be one or more (two or more). Figure 1 Six user nodes are shown as an example, namely user nodes 131, 132, 133, 134, 135 and 136, but the present disclosure does not limit the number of user nodes.

[0020] The rating recommendation system 110 can be implemented by any computer device such as a terminal and / or a server. The rating recommendation system 110 and the relay node can each initiate a registration request to the blockchain network 100, and after the registration request is passed, they become nodes in the blockchain network 100. Afterwards, if a user node wishes to form a local area network with a relay node, the user node can also initiate a registration request to the blockchain network 100, and after the registration request is passed, it becomes a node in the blockchain network 100.

[0021] When any user node initiates a connection request to a relay node, the relay node responds to the received connection request to provide a local network service to the corresponding user node, and the user node scores the relay node that provides local network services for it, an on-chain transaction will be triggered. After consensus is reached, these behavior data (which can be called local network service information between the user node and the relay node) are stored on the blockchain of the blockchain network to achieve on-chain storage. The scoring recommendation system 110 can obtain the stored local network service information from the blockchain network 100, calculate the current heat value (e.g., the first heat index) of the relay node at the current moment (e.g., the first moment) based on the obtained local network service information, thereby generating corresponding relay node recommendation information for each user node, and sending the generated relay node recommendation information to the corresponding user node through the blockchain network 100. After receiving the relay node recommendation information, the user node can select a suitable relay node according to the relay nodes included in the relay node recommendation information and their corresponding current heat values, and initiate a connection request to the selected relay node to provide the user node with near-field network services.

[0022] When a blockchain network is used to implement the method provided by the embodiment of the present disclosure, the solution provided by the embodiment of the present disclosure also involves blockchain technology, that is, a method for recommending relay nodes in a near-field network based on blockchain is provided.

[0023] The relay node and / or user node in the embodiments of the present disclosure may be any computer device, such as a terminal and / or a server. Among them, the terminal may also be referred to as a terminal device, a user equipment (User Equipment, UE), a mobile station, a mobile terminal, etc. The terminal can be widely used in various scenarios, for example, device-to-device (D2D), vehicle to everything (V2X) communication, machine-type communication (MTC), Internet of Things (IOT), virtual reality, augmented reality, industrial control, automatic driving, telemedicine, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal may be a mobile phone, a tablet computer, a computer with wireless transceiver function, a wearable device, a vehicle, a drone, a helicopter, an airplane, a ship, a robot, a mechanical arm, a smart home device, etc. The embodiments of the present disclosure do not limit the specific technology and specific device form adopted by the terminal.

[0024] The disclosed embodiment applies the relay node recommendation method of the near-area network to the blockchain network, thereby designing a distributed near-area network resource sharing solution based on blockchain, and proposing a near-area network resource recommendation model to improve the quality of the sharing environment.

[0025] Figure 2 A flow chart of a method for recommending a relay node in a near area network according to an embodiment of the present disclosure is shown. Figure 2 The method provided in the embodiment can be Figure 1 The score recommendation system 110 in FIG. 1 is executed, but the present disclosure is not limited thereto and can be executed by any computer device. Figure 2 As shown, the method provided by the embodiment of the present disclosure may include the following steps.

[0026] In S210, local area network service information between a user node and a relay node is obtained, and the user node includes a first user node.

[0027] The near area network service information in the embodiments of the present disclosure refers to any relevant information when a user node makes a request to a relay node and the relay node provides near area network resource sharing or near area network services to the user node.

[0028] In an exemplary embodiment, the near-area network service information includes historical connection information between the user node and the relay node, and rating information of the user node for the near-area network service provided by the relay node.

[0029] In the embodiments of the present disclosure, historical connection information refers to information such as the number, frequency, and time of connection requests made by a user node to a relay node, the connection time (which may include one or more of the connection duration, the time period for providing connection, and the time point) of the relay node providing a near-field network service to the user node, the number of historical connections, the connection distance, etc. The connection distance refers to the number of logical hops that the relay node goes through to provide a near-field network service to the user node.

[0030] In the embodiments of the present disclosure, the scoring information refers to any information related to the scoring index fed back by the user node to the relay node that provides the near-area network service to it, and may include, for example, the scoring index of the user node for the near-area network service provided by the relay node, and one or more other information such as the scoring mean and the scoring variance calculated based on the scoring index.

[0031] In an exemplary embodiment, the historical connection information includes the number of historical connections between the user node and the relay node; the scoring information includes a scoring index and a scoring average of the near-area network service provided by the user node to the relay node.

[0032] In the disclosed embodiment, the scoring index may include the scoring index given by all user nodes in the system to all relay nodes. The scoring mean may be obtained by averaging the scoring index given by a certain user node (e.g., user node 131) among all the user nodes to all relay nodes in the system, that is, there are as many user nodes as there are in the system, that is, each user node may have a corresponding scoring mean.

[0033] The first user node in the embodiment of the present disclosure may be any user node among all user nodes in the system, such as the above Figure 1 The user node 131 to 136 in the embodiment is any one of the user nodes 131 to 136. The following takes the first user node as the user node 132 as an example for explanation, but the present disclosure is not limited thereto.

[0034] In S220, a service quality indicator of the near area network service provided by the relay node to the first user node is obtained.

[0035] In the disclosed embodiment, the service quality index is used to measure the service quality of the near-area network service provided by each relay node in the system to the first user node. The higher the service quality, the higher the corresponding service quality index, and vice versa.

[0036] In an exemplary embodiment, obtaining a service quality indicator of the near area network service provided by the relay node to the first user node includes: obtaining the number of times the relay node is successfully connected to the first user node; obtaining the number of times the relay node successfully provides the near area network service to the first user node; obtaining a bandwidth performance indicator of the near area network service provided by the relay node to the first user node; obtaining first scoring information of the near area network service provided by the first user node to the relay node; and obtaining the service quality indicator based on the number of times the relay node is successfully connected to the first user node, the number of times the relay node successfully provides the near area network service to the first user node, the bandwidth performance indicator, and the first scoring information.

[0037] In an exemplary embodiment, the service quality indicator Q is calculated by the following formula:

[0038] Q=α C Q C +β R Q R +γ B Q B +δ S Q S (1)

[0039] Among them, Q C Indicates the number of times the relay node is successfully connected by the first user node (also called the number of connections), and is used to record the number of times a certain relay node (which can be any relay node among all relay nodes in the system, such as relay node 122) is successfully connected by the first user node, reflecting the frequency of use of the relay node by the first user node. R It indicates the number of times the relay node successfully provides the near area network service for the first user node, that is, the number of times the relay node successfully completes the near area network service for the first user node, which may also be called the number of reliable services.

[0040] Q in the above formula B The bandwidth performance index / bandwidth index is used to represent the average bandwidth quality provided by the relay node for the first user node, and to measure the service performance provided by the relay node for the first user node. For example, it can be calculated by the following formula:

[0041]

[0042] In the above formula, the theoretical maximum bandwidth refers to the theoretical maximum bandwidth when the relay node provides the near-area network service for the first user node, and the actual bandwidth refers to the bandwidth actually provided to the first user node when the relay node provides the near-area network service for the first user node.

[0043] In the above formula, Q S represents the first scoring information. The first scoring information can be calculated based on the m scoring indicators given by the first user node to the relay node that provides the near-field network service for it, and the average value of the m scoring indicators is calculated to calculate the standard deviation of the m scoring indicators. The service quality indicator is evaluated by combining the standard deviation, which can eliminate the scoring deviation of the first user node for the relay node. Wherein, m is a positive integer greater than or equal to 1.

[0044] For example, Q can be calculated according to the following formula S :

[0045]

[0046] In the above formula, R uj R represents the jth scoring index given by the first user node to the relay node, where j is a positive integer greater than or equal to 1 and less than or equal to m. uj Represents the average value of the m scoring indicators.

[0047] In the disclosed embodiment, α C , β R , γ B ,δ S Respectively represent Q C , Q R , Q B , Q S The weight coefficients are all positive numbers greater than 0 and less than 1. For example, the following formula can be satisfied:

[0048] α C +β R +γ B +δ S =1 (4)

[0049] In the disclosed embodiment, by introducing the service quality index Q of the near-field network service provided by different relay nodes for different user nodes (taking the first user node as an example above), each relay node is associated with the corresponding user node in the calculation of the first heat index, that is, for the same relay node at the same first moment, since the Qs of different user nodes for the same relay node are different, the first heat indexes of the same relay node for different user nodes at the same first moment may be different, so that different relay node recommendation information can be generated for different user nodes, making the relay node recommendation information more accurate and more targeted.

[0050] In S230, a first heat index of the first user node to the relay node at a first moment is determined according to the near area network service information and the service quality index.

[0051] In the disclosed embodiment, based on the local network service information between the user node and the relay node and the service quality index of the local network service provided by the relay node to the first user node, the connection temperature of each relay node to the first user node at the first moment can be calculated for the first user node, which can also be referred to as the first heat index or the first heat value or the current heat value. In the subsequent steps, the first heat indexes of different relay nodes for the first user node at the first moment can be compared to determine the relay node recommendation information for the first user node.

[0052] In an exemplary embodiment, a first heat index of the first user node to the relay node at a first moment is determined based on the near-area network service information and the service quality index, including: obtaining a second heat index of the first user node to the relay node at a second moment, the first moment being after the second moment; obtaining a time difference between the first moment and the second moment; determining a cooling coefficient of the first user node to the relay node based on the service quality index; and determining the first heat index based on the second heat index, the historical connection information, the scoring information, the time difference, and the cooling coefficient.

[0053] The second moment in the disclosed embodiment refers to the previous moment that occurred before the first moment. For example, if the first moment is assumed to be the current moment, and the current moment is represented by t, then the second moment may be the t-1 moment. At this time, the time difference between the first moment and the second moment may be a preset fixed time interval (the specific value may be set according to the actual scenario), that is, the near-domain network service information stored in the blockchain network may be pulled regularly, and the first heat index of each user node to each relay node may be regularly updated; it may also be a value that increases dynamically with the passage of time. Correspondingly, the calculation method of the second heat index may refer to the calculation method of the first heat index.

[0054] In other embodiments, the second moment may also be the initial moment when the relay node is online (for example, it has just been successfully registered in the blockchain network). In this case, the time difference between the first moment and the initial moment gradually increases with the passage of time. Correspondingly, the second heat index may be a preset initial heat value, or its initial heat value may be determined according to the parameters or performance of the relay node when it just came online.

[0055] In an exemplary embodiment, the cooling coefficient α of the first user node to the relay node is determined by the following formula:

[0056]

[0057] Wherein, Q represents a service quality indicator of the near area network service provided by the relay node to the first user node; λ represents a weight coefficient of the service quality indicator, and λ is a positive number greater than 0 and less than 1.

[0058] In the disclosed embodiment, the higher Q is, the smaller α is, which is used to measure the decay rate of the second heat index of the first user node to the relay node. The smaller α is, the slower the decay rate of the second heat index is. The higher the service quality index provided by the relay node to the first user node, the smaller the cooling coefficient α of the relay node relative to the first user node. In the network resource sharing system, for the first user node, the recommended ranking of the relay node in the relay node recommendation information decreases more slowly, thereby ensuring that high-quality relay nodes provide services to user nodes for a long time in priority, driving users to share network resources.

[0059] In an exemplary embodiment, the first heat index is determined based on the second heat index, the historical connection information, the scoring information, the time difference and the cooling coefficient, including: determining the first heat index based on the second heat index, the historical connection times, the scoring index and the average scoring value, the time difference and the cooling coefficient.

[0060] In an exemplary embodiment, the first heat index is determined based on the second heat index, the historical number of connections, the scoring index and the average scoring value, the time difference and the cooling coefficient, including: obtaining a first weight parameter of the historical number of connections, a second weight parameter of the scoring information and a balance parameter; determining the first heat index based on the second heat index, the historical number of connections and its first weight parameter, the scoring index and the average scoring value, the second weight parameter, the balance parameter, the time difference and the cooling coefficient.

[0061] In an exemplary embodiment, the first heat index is determined by the following formula:

[0062]

[0063] In the above formula, H t It represents the first heat value of the relay node at the first moment, that is, the node heat value at time t, reflecting the recommendation priority of the relay node.

[0064] In the above formula, H0 represents the second heat value of the relay node at the second moment. It can be the historical heat value of the relay node at the second moment. When the second moment is the initial moment when the relay node goes online, H0 represents the initial heat of the relay node, which can be calculated based on the historical behavior of the relay node (such as the score and connection volume when it goes online).

[0065] In the above formula, βlog(View M ) indicates the impact of the historical connection count or total historical connection count of the relay node on its popularity. M Represents the historical connection times or the total number of historical connections of the relay node. In the disclosed embodiment, the historical connection times or the total number of historical connections of each relay node are calculated logarithmically in order to prevent the connection rate of the popular relay node from having too great an impact on its first heat index. β represents the first weight parameter of the historical connection times, which is used to adjust the degree of influence of the total number of historical connections of the relay node on its first heat index.

[0066] In the above formula, e -αΔt Represents the natural cooling factor of the second heat index. The exponential term α represents the cooling coefficient of the relay node. The cooling coefficient α reflects the speed at which the second heat index of the relay node decays over time. Among them, the relay node that provides high-quality service or high service quality to the user node has a lower α value, and its corresponding second heat index decays more slowly.

[0067] Wherein, Δt represents the time difference between the first moment and the second moment, for example, the time difference between the current time and the previous moment.

[0068] In the above formula, Used to represent the contribution of the scoring index of all user nodes in the system to the first heat index of the relay node. The fairness of the scoring of the relay node is improved by subtracting the average score of each user node for all relay nodes in the system. n represents the number of user nodes that score the near-domain network services provided by the relay node, and n is an integer greater than or equal to 1. It should be noted that each user node in the embodiment of the present disclosure may correspond to one user. When different users log in to the same user node, it can be considered that they correspond to different user nodes. Therefore, the number of user nodes here may also refer to the number of users, that is, the number of users who have scored the near-domain network services provided by the relay node. γ represents the second weight parameter, which is used to adjust the degree of influence of the score on the first heat index of the relay node. R ui It represents the scoring index of the local area network service provided by the i-th user node to the relay node. i is an integer greater than or equal to 1 and less than or equal to n. Represents the average score of the i-th user node. We can obtain all the score indicators scored by the i-th user node for all relay nodes in the system, and then calculate the average to get It is used to eliminate the scoring bias of a single user node, eliminate the impact of different users' scoring habits, and ensure the fairness of the scoring.

[0069] In the embodiment of the present disclosure, δ represents the equilibrium parameter. -αΔt This may cause the first heat index to be close to zero. Adding a balance term or a balance parameter δ can ensure that the value of the first heat index is non-negative, so as to improve the stability of the heat index.

[0070] In the disclosed embodiments, β, γ, δ, and α are all positive numbers greater than 0 and less than 1. Each value can be determined based on actual tests. The values ​​of these weight parameters can be dynamically adjusted based on actual scenarios. In some embodiments, β+λ+γ=1.

[0071] The disclosed embodiment introduces an exponential model that decays over time and adjusts the cooling speed of different relay nodes through the cooling coefficient to ensure that the ranking of high-quality relay nodes decreases slowly. Logarithmic smoothing is used for the total number of historical connections of relay nodes to reduce the impact of excessive amplification of the total number of historical connections of popular relay nodes on the ranking. The scoring part introduces a scoring deviation (the difference from the scoring mean) to avoid unfair impacts on the results caused by different user scoring standards.

[0072] It is understandable that the calculation of the first heat index is not limited to the above formula, as long as it can reflect that the heat gradually decreases with the increase of time, the heat decay speed of the relay node with high service quality is relatively slow, the relay node with higher user rating has a greater heat value, and the relay node that has provided near-field network services to more user nodes in history has a greater heat value. In other embodiments, factors such as connection time and connection distance can also be introduced to calculate the first heat index.

[0073] In S240, relay node recommendation information is generated for the first user node according to the first popularity index.

[0074] In the disclosed embodiment, the above method can be used to calculate the first heat index of all relay nodes in the system for the first user node, compare the first heat indexes of different relay nodes, and recommend the best relay node list available for connection to the first user node, that is, generate relay node recommendation information, which can include each relay node and its corresponding first heat index, and arrange them in descending order according to the size of the first heat index. Alternatively, the relay node recommendation information includes a predetermined number or a predetermined percentage of relay nodes that are ranked first.

[0075] The method provided by the embodiment of the present disclosure dynamically updates the connection temperature of each user node, that is, the first heat index of each relay node for each user node, over time. According to the continuously updated behavior between the user node and the relay node, the best relay node list generated for each user node is recalculated.

[0076] The method provided by the embodiment of the present disclosure provides a dynamically changing recommended ranking of relay nodes for network resource sharing. At any time, the relay nodes participating in network resource sharing have a current heat value, and the relay nodes with higher current heat values ​​have higher rankings in the recommendation list (i.e., relay node recommendation information). If a user node in a near-domain network connects to, gives a favorable comment, or otherwise interacts positively with a service node / relay node, the current heat value of the service node / relay node will be correspondingly increased by a certain amount, and the order of arrangement in the recommendation list will change dynamically. As time goes by, the current heat values ​​of all service nodes will gradually cool down according to the time they go online, and the corresponding recommended ranking will change to the back. The speed at which the relay node changes during the cooling process is jointly determined by the initial temperature (e.g., the second heat index), the node interaction behavior (e.g., the user node connects to the relay node, the user node gives a score to the relay node, etc.), and time.

[0077] In S250, the relay node recommendation information is sent to the first user node.

[0078] In the disclosed embodiment, a list of the best relay nodes available for connection is dynamically recommended to a user or a user node (here taking the first user node as an example), thereby ensuring the quality of the communication network resources obtained by the user or the user node and improving the network service experience of the user or the user node.

[0079] The method provided by the embodiment of the present disclosure can not only ensure that the popularity of the latest service nodes can be improved, but also ensure that the service nodes with high browsing volume and high service scores can be ranked high in the system by introducing the total historical connection amount of the relay node, the rating information of the user node on the relay node, etc. to influence the recommended ranking of the relay node. On the one hand, through the exponential decay of the heat value, the natural loss of the recommended heat of the relay node is simulated, so that the recommended heat has dynamic adaptability, and the popular relay node is prevented from occupying the top of the recommendation list for a long time, thereby improving the fairness of the recommendation mechanism. On the other hand, the behavior between the user node and the relay node (such as connection, rating, etc.) is mapped to the increment of heat, providing a behavior-driven heat update method, so that the recommended ranking of the relay node can reflect user feedback in real time, improve the accuracy of the recommendation and user satisfaction. At the same time, the embodiment of the present disclosure also performs multi-dimensional optimization, and dynamically adjusts the cooling coefficient in combination with multi-dimensional indicators such as the number of connections and ratings, to ensure that the ranking of high-quality nodes decreases more slowly and encourage high-quality services.

[0080] The D2D communication mode in the near-field network in related technologies can improve the capacity of the communication system through frequency reuse, but its application in vertical industries is limited. Because it lacks an effective incentive mechanism to drive resource sharing between devices, the scalability and sustainability of the solution are poor. There are also security risks such as fake service node attacks. In a non-trust or weak trust environment, it is impossible to achieve fair, reliable, and high-quality communication network resource sharing.

[0081] In an exemplary embodiment, the method is performed by a recommendation node. The method also includes: the recommendation node initiates a registration request to the blockchain network to become a node in the blockchain network. The recommendation node in the embodiment of the present disclosure can be Figure 1 After registering with the rating recommendation system, you become a node in the blockchain network.

[0082] The relay node and the user node are both nodes in the blockchain network; the near-field network service information is stored in the blockchain network, and the recommendation node obtains the near-field network service information from the blockchain network; the recommendation node sends the relay node recommendation information to the first user node through the blockchain network. When the user node wishes to connect to the relay node, it first registers in the blockchain network.

[0083] For example, the rating recommendation system, relay nodes, and user nodes can be authenticated as legitimate users through information such as mobile phone numbers, obtain a public and private key belonging to the node, and complete registration.

[0084] The disclosed embodiment designs a distributed near-field network resource sharing solution based on blockchain, provides a new near-field network resource recommendation mode, and improves the quality of the sharing environment.

[0085] Terminal (e.g. mobile phone) users can apply and register to become service nodes on the chain, directly share network resources (e.g. 5G network resources) with other mobile terminals (i.e. user nodes), and provide near-field network services. By recording user behaviors such as the connection between user nodes and service nodes and the ratings of service nodes by user nodes, and introducing them into the recommendation function of service nodes, the recommended ranking of relay nodes in the system is dynamically adjusted, and high-quality service nodes (i.e. relay nodes with relatively high first heat index) are elected to form a highly reliable blockchain consensus network, ensuring that popular nodes with high service quality are ranked high, and users are encouraged to participate in network resource sharing. For example, based on the first heat node of each service node, the node group that dominates the consensus can be elected or voted.

[0086] At the same time, it can prevent low-quality relay nodes from outputting services for a long time, and drive users to share high-quality network resources. It can recommend the best relay node list for user nodes to connect to in real time, ensure the quality of communication network resources obtained by users, and improve the network service experience of user nodes.

[0087] After a relay node is registered in the blockchain network, it becomes a node in the blockchain network. When a user node connects to the relay node and / or a user node gives a rating to the relay node, it triggers the node in the blockchain network to initiate an on-chain transaction, and after consensus is reached, the data is stored in the blockchain.

[0088] In the disclosed embodiment, in the near-field network, all data such as the connection and score between the user node and the relay node are used as transaction data. After consensus is reached through the blockchain consensus network, they are stored in the blockchain, which can prevent the data from being tampered with and the service node from being attacked, and provide higher credibility.

[0089] In the disclosed embodiment, the decentralized incentive mechanism based on blockchain can be organically combined with the recommendation method. The decentralized incentive mechanism provided can use smart contracts to record the service behavior of each service node and issue on-chain rewards (such as tokens and points) to high-quality service nodes. High-quality service nodes are elected by voting or scoring to join the blockchain consensus network for the consensus of the blockchain network. After the consensus is reached, the batch of transaction data is stored in the blockchain to improve the reliability of the network.

[0090] In the disclosed embodiment, on the one hand, the above-mentioned recommendation method is used to comprehensively rank high-quality service nodes, thereby encouraging more users to participate in network resource sharing and provide high-quality services. The shared network system dynamically recommends a list of the best service nodes that can be connected to the user node, improves the user's network service experience, and further realizes fair, reliable, and high-quality communication network resource sharing. On the other hand, the above-mentioned recommendation method is combined with an incentive mechanism. The recommendation method dynamically adjusts the popularity and ranking of the service node, which directly affects the resource allocation and incentive distribution of the service node. If the service node provides high-quality services, it can obtain a higher ranking through the above-mentioned method, thereby reaching more users and obtaining more incentives. At the same time, all user behaviors and node states are recorded in the blockchain to prevent scoring cheating and node forgery, providing security. And the consensus mechanism can ensure the fairness of the recommendation ranking and avoid single-point control.

[0091] The disclosed embodiments can be used for 5G network optimization. In large-scale events (such as concerts, sports events, etc.), dense users lead to network congestion. The method provided by the disclosed embodiments can be directly applied to scenarios such as large-scale events (such as concerts) where the operator's return on investment is low and the near-field network D2D mode needs to be used to achieve frequency reuse. Driving frequency resource reuse through the blockchain incentive mechanism can effectively improve the venue network service experience. Use this solution to dynamically recommend high-quality service nodes, increase spectrum reuse rate, and alleviate the pressure on the main network. The blockchain-based incentive mechanism promotes equipment to share resources and establish a low-cost temporary communication infrastructure.

[0092] For example, the method provided in the embodiments of the present disclosure can be applied to the capacity improvement of 5G communication systems, and use blockchain smart contracts, consensus mechanisms, etc. to drive the establishment of large-scale, low-cost, and scalable near-domain network infrastructure to serve 5G Internet of Things, Industrial Internet, Mobile Internet, etc. The solution provided in the embodiments of the present disclosure is a universal method.

[0093] For another example, the method provided by the embodiment of the present disclosure can be applied to the Internet of Things and Industrial Internet scenarios. In the Industrial Internet scenario, the communication requirements between devices are complex and there is a lack of flexible resource scheduling mechanisms. The solution provided by the embodiment of the present disclosure can dynamically recommend highly trusted device nodes, achieve efficient resource allocation, and reduce data delays and transmission failure rates. At the same time, decentralized security guarantees ensure the integrity and privacy of data communications.

[0094] For another example, the method provided in the embodiment of the present disclosure can be applied to improve the mobile Internet experience. In the related art, users have a poor experience in high-density areas (such as subways and shopping malls). The solution provided in the embodiment of the present disclosure can provide real-time optimal node connection services and dynamically optimize the user experience. It also supports users to contribute idle resources through smart contracts to form a resource sharing ecosystem.

[0095] The method provided by the embodiment of the present disclosure encourages more users to participate in network resource sharing and provide high-quality services by comprehensively ranking high-quality service nodes. The shared network system dynamically recommends a list of the best service nodes that can be connected to the user node, thereby improving the user's network service experience. By improving the trust between weakly trusted near-domain network nodes, fair, reliable, and high-quality communication network resource sharing can be achieved in a non-trusted and weakly trusted environment. By protecting the legitimate rights and interests of more users, encouraging more users to become service nodes and share communication network resources, the spectrum utilization rate can be greatly improved. Near-domain sharing based on blockchain can effectively defend against traditional Trojan attacks, hacker attacks, relay attacks, and other behaviors that damage the health of the system, improve the robustness of the system, and increase the enthusiasm and fairness of users in participating in the reuse of near-domain network resources.

[0096] Figure 3 FIG. 2 is a block diagram showing a structure of a relay node recommendation device for a near area network in an embodiment of the present disclosure. Figure 3 As shown, the relay node recommendation device 300 for a near area network provided by an embodiment of the present disclosure may include a communication module 310 and a processing module 320 .

[0097] The communication module 310 is used to obtain local area network service information between a user node and a relay node, wherein the user node includes a first user node.

[0098] The processing module 320 is used to obtain a service quality indicator of the near area network service provided by the relay node to the first user node.

[0099] The processing module 320 is further configured to determine a first heat index of the first user node to the relay node at a first moment according to the near area network service information and the service quality index.

[0100] The processing module 320 is further configured to generate relay node recommendation information for the first user node according to the first heat index.

[0101] The communication module 310 is further configured to send the relay node recommendation information to the first user node.

[0102] Figure 3 For other contents of the embodiment, reference can be made to other embodiments mentioned above and will not be repeated here.

[0103] Figure 4 FIG. 2 shows a structural block diagram of a relay node recommendation device according to an embodiment of the present disclosure. Figure 4 As shown, the relay node recommendation device 400 provided in the embodiment of the present disclosure may include a relay node recommendation module 410, an interaction module 420 and a blockchain storage module 430.

[0104] The relay node recommendation module 410 may include a communication module 411, a data processing module 412, and a node sorting module 413. Figure 1 In other embodiments, a single node may be added to be responsible for the relay node recommendation function, that is, to implement the above recommendation method. The function of the communication module 411 can be the same as Figure 3 The communication module 310 in the embodiment has the same function. The data processing module 412 and the node sorting module 413 can be located at Figure 3 The processing module 320 in the embodiment. That is, the data processing module 412 can be used to determine the first heat index of the first user node to the relay node at the first moment according to the near-field network service information and the service quality index. The node sorting module 413 can be used to generate relay node recommendation information for the first user node according to the first heat index.

[0105] The interaction module 420 may include a node registration module 421 and a node behavior data recording module 422. The interaction module 420 may exist in each node in the blockchain network 100, that is, each node may initiate a registration request to the blockchain network 100 through the node registration module 421. After each node successfully registers on the blockchain network 100, it may record the local area network service information between the user node and the relay node through the node behavior data recording module 422.

[0106] The blockchain storage module 430 can store node historical behaviors, services, etc. in the form of a database and / or data files. In the disclosed embodiment, the database stores service quality indicators, scoring information, popularity information (such as the second popularity index), and other data that need to be efficiently queried, and the data file stores large-scale data such as logs, etc. Frequently operated data is placed in the database, while archived or cold data is stored in the file system to reduce the database load.

[0107] In the disclosed embodiment, the blockchain storage module 430 may also exist in each node in the blockchain network 100. For example, all data may be stored in a relay node, and other nodes may choose to store all data or lightweight data.

[0108] Figure 5 FIG. 2 is a schematic diagram showing a structure of a relay node recommendation system for a near-area network in an embodiment of the present disclosure. Figure 5 As shown, the relay node recommendation system 500 of the near-area network provided by the embodiment of the present disclosure may include a data display device 510, a data service device 520, a storage device 530, a blockchain network 540 and a management platform 550. The blockchain network 540 here may be equivalent to the above Figure 1 Blockchain network in 100.

[0109] The data display device 510 may display part or all of the data involved in the embodiments of the present disclosure through one or more of APP (application), webpage and / or PC (Personal Computer).

[0110] The data service device 520 can be used for data collection, heat calculation, dynamic update, providing recommendation algorithm, implementing routing forwarding and abnormality detection. The data service device 520 may include a relay node 521. The relay node 521 can be used for resource forwarding, data recording, log generation, quality monitoring, network monitoring and routing management. The relay node 521 can be equivalent to any one of the above-mentioned relay nodes 121, 122 or 123.

[0111] The storage device 530 may be implemented by one or more of MongoDB, Redis, Kafka, and ES (short for Elasticsearch).

[0112] The blockchain network 540 can be used to provide consensus mechanisms, smart contracts, incentive mechanisms, and key management.

[0113] The data service device 520 , the storage device 530 , and the blockchain network 540 can communicate with the management platform 550 through the external interface 560 .

[0114] The management platform 550 can be used for configuration management, log storage, system monitoring, data analysis and user management.

[0115] Furthermore, an embodiment of the present disclosure further provides a computer device, comprising: a processor; and a memory for storing executable instructions of the processor, wherein the processor is configured to execute the method described in any embodiment of the present disclosure by executing the executable instructions.

[0116] Furthermore, an embodiment of the present disclosure also provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the method described in any embodiment of the present disclosure is implemented.

[0117] Furthermore, an embodiment of the present disclosure also provides a computer program product, which includes a computer program. When the computer program is run, it executes the method described in any embodiment of the present disclosure, or executes the method described in any embodiment of the present disclosure, or executes the method described in any embodiment of the present disclosure.

[0118] Refer to the following Figure 6 hereinafter, a computer device 600 according to this embodiment of the present disclosure is described. Figure 6 The computer device 600 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0119] like Figure 6 As shown, the computer device 600 is in the form of a general-purpose computing device. The components of the computer device 600 may include, but are not limited to: at least one processing unit 610 (for example, its function may be the same as the above-mentioned processing module 320), at least one storage unit 620, and a bus 630 connecting different system components (including the storage unit 620 and the processing unit 610).

[0120] The storage unit 620 stores program codes, which can be executed by the processing unit 610, so that the processing unit 610 executes the steps described in the above “Exemplary Method” section of this specification according to various exemplary embodiments of the present disclosure.

[0121] The storage unit 620 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 6201 and / or a cache memory unit 6202 , and may further include a read-only memory unit (ROM) 6203 .

[0122] The storage unit 620 may also include a program / utility 6204 having a set (at least one) of program modules 6205, such program modules 6205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0123] Bus 630 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0124] The computer device 600 may also communicate with one or more external devices 640 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the computer device 600, and / or communicate with any device that enables the computer device 600 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 650. Furthermore, the computer device 600 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 660. As shown, the network adapter 660 communicates with other modules of the computer device 600 via a bus 630. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the computer device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0125] It should be noted that the above modules / units as part of the device can be executed in a computer system such as a set of computer executable instructions.

[0126] Those skilled in the art will appreciate that various aspects of the present disclosure may be implemented as systems, methods or program products. Therefore, various aspects of the present disclosure may be specifically implemented in the following forms, namely: complete hardware implementation, complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as "circuits", "modules" or "systems".

[0127] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.

[0128] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart may be implemented as a computer program product, which includes: a computer program, which implements the above-mentioned relay node recommendation method for a near area network when executed by a processor.

[0129] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, which may be a readable signal medium or a readable storage medium. The computer-readable storage medium stores a program product capable of implementing the above-mentioned method of the present disclosure. In some possible implementations, various aspects of the present disclosure may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal / network device, the program code is used to cause the terminal / network device to execute the steps described in the above “Exemplary Method” section of this specification according to various exemplary implementations of the present disclosure.

[0130] More specific examples of computer-readable storage media in the present disclosure may include, but are not limited to, an electrical connection having one or more conductors, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0131] In the present disclosure, a computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, wherein a readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A readable signal medium may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0132] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the appended claims.

Claims

1. A method for recommending relay nodes in a near-area network, characterized in that: include: Acquire local area network service information between a user node and a relay node, wherein the user node includes a first user node; Obtaining a service quality indicator of a near-area network service provided by the relay node to the first user node; Determining, according to the near area network service information and the service quality indicator, a first heat index of the first user node to the relay node at a first moment; Generating relay node recommendation information for the first user node according to the first heat index; The relay node recommendation information is sent to the first user node.

2. The method according to claim 1, characterized in that The near-area network service information includes historical connection information between the user node and the relay node, and rating information of the user node for the near-area network service provided by the relay node; Wherein, determining, according to the near area network service information and the service quality indicator, a first heat index of the first user node to the relay node at a first moment includes: Obtaining a second heat index of the first user node to the relay node at a second moment, the first moment being after the second moment; Obtaining a time difference between the first moment and the second moment; Determining a cooling coefficient of the first user node to the relay node according to the service quality indicator; The first heat index is determined according to the second heat index, the historical connection information, the rating information, the time difference, and the cooling coefficient.

3. The method according to claim 2, characterized in that The historical connection information includes the number of historical connections between the user node and the relay node; the scoring information includes the scoring index and the scoring mean of the local area network service provided by the user node to the relay node; The step of determining the first heat index according to the second heat index, the historical connection information, the rating information, the time difference, and the cooling coefficient includes: The first heat index is determined according to the second heat index, the number of historical connections, the scoring index and the scoring average, the time difference and the cooling coefficient.

4. The method according to claim 3, characterized in that Determining the first heat index according to the second heat index, the number of historical connections, the scoring index and the scoring mean, the time difference and the cooling coefficient includes: Obtaining a first weight parameter of the number of historical connections, a second weight parameter of the scoring information, and a balance parameter; The first heat index is determined according to the second heat index, the number of historical connections and its first weight parameter, the scoring index and the scoring mean, the second weight parameter, the balance parameter, the time difference and the cooling coefficient.

5. The method according to claim 4, characterized in that The first heat index is determined by the following formula: H t H0 represents the first heat value of the relay node at the first moment; H1 represents the second heat value of the relay node at the second moment; M represents the number of historical connections of the relay node; β represents the first weight parameter of the number of historical connections; α represents the cooling coefficient of the relay node; Δt represents the time difference between the first moment and the second moment; n represents the number of user nodes that score the local area network service provided by the relay node, and n is an integer greater than or equal to 1; γ represents the second weight parameter; R ui represents the scoring index of the i-th user node for the relay node, where i is an integer greater than or equal to 1 and less than or equal to n; represents the mean score of the i-th user node; δ represents the balance parameter; β, γ, δ, and α are all positive numbers greater than 0 and less than 1.

6. The method according to claim 2, characterized in that The cooling coefficient of the first user node to the relay node is determined by the following formula: Wherein, Q represents a service quality indicator of the near area network service provided by the relay node to the first user node; λ represents a weight coefficient of the service quality indicator, and λ is a positive number greater than 0 and less than 1.

7. The method according to claim 1, characterized in that Acquiring a service quality indicator of the near area network service provided by the relay node to the first user node includes: Obtaining the number of times the relay node is successfully connected by the first user node; Obtaining the number of times the relay node successfully provides a near-area network service for the first user node; Obtaining a bandwidth performance indicator of a near-area network service provided by the relay node to the first user node; Acquire first scoring information of the near-area network service provided by the first user node to the relay node; The service quality indicator is obtained according to the number of times the relay node is successfully connected to by the first user node, the number of times the relay node successfully provides near-area network services for the first user node, the bandwidth performance indicator and the first scoring information.

8. The method according to claim 7, characterized in that The service quality indicator Q is calculated by the following formula: Q=a C Q C +b R Q R +g B Q B +d S Q S Among them, Q C The number of times the relay node is successfully connected by the first user node; Q R Indicates the number of times the relay node successfully provides the near-field network service for the first user node; Q B represents the bandwidth performance index; Q S represents the first scoring information; α C , β R , γ B , δ S Respectively represent Q C , Q R , Q B , Q S The weight coefficients are all positive numbers greater than 0 and less than 1.

9. The method according to claim 1, characterized in that: The method is performed by a recommendation node; the method further comprises: The recommended node initiates a registration request to the blockchain network to become a node in the blockchain network; Among them, the relay node and the user node are both nodes in the blockchain network; the near-field network service information is stored in the blockchain network, and the recommendation node obtains the near-field network service information from the blockchain network; the recommendation node sends the relay node recommendation information to the first user node through the blockchain network.

10. A relay node recommendation device for a near area network, characterized in that: include: A communication module, used to obtain local area network service information between a user node and a relay node, wherein the user node includes a first user node; A processing module, configured to obtain a service quality indicator of the near area network service provided by the relay node to the first user node; The processing module is further used to determine a first heat index of the first user node to the relay node at a first moment according to the near area network service information and the service quality index; The processing module is further configured to generate relay node recommendation information for the first user node according to the first heat index; The communication module is further used to send the relay node recommendation information to the first user node.

11. A computer device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to perform the method of any one of claims 1 to 8 by executing the executable instructions.

12. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

13. A computer program product, comprising a computer program, which executes the method according to any one of claims 1 to 9 when the computer program is executed.

Images