Network coverage verification method, communication device and storage medium

Abstract

The embodiment of the invention provides a network coverage verification method, a communication device and a storage medium, relates to the technical field of communication, and is used for improving the authenticity and effectiveness of network coverage verification. The network coverage verification method comprises the following steps: a first node sends a verification request to a second node in a communication system; the verification request is used for requesting to verify whether the network coverage information of the second node is valid; and receiving verification information of the second node sent by the fourth node, and sending the verification information to the third node.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a network coverage verification method, a communication device and a storage medium. Background Art

[0002] With the development of communication technology, the demand for network infrastructure deployment is also increasing. In order to avoid duplication of network infrastructure, reduce construction costs and improve construction efficiency, operators usually jointly build networks through co-construction and sharing. In co-construction and sharing networks, there is a problem of base station coverage verification.

[0003] Coverage verification is widely used in the field of communication transmission. Its purpose is to ensure that the network coverage quality meets certain current quality requirements to ensure user communication quality and user experience. However, based on the current coverage verification technology, there is a problem that the verification results are easy to tamper with, thus the authenticity and effectiveness of the coverage verification cannot be guaranteed. Summary of the invention

[0004] The present application provides a network coverage verification method, a communication device and a storage medium for improving the authenticity and effectiveness of network coverage verification.

[0005] In order to achieve the above purpose, this application adopts the following technical solutions:

[0006] In a first aspect, a network coverage verification method is provided, which is applied to a first node, and the method includes:

[0007] Sending a verification request to a second node in the communication system; the verification request is used to request verification of whether the network coverage information of the second node is valid;

[0008] receiving verification information of the second node sent by the fourth node;

[0009] Send verification information to the third node.

[0010] In a second aspect, a network coverage verification method is provided, which is applied to a second node, and the method includes:

[0011] Receiving a verification request sent by the first node; the verification request is used to request verification of whether the network coverage information of the second node is valid;

[0012] In response to the authentication request, a beacon signal is sent to the fourth node.

[0013] In a third aspect, a network coverage verification method is provided, which is applied to a third node, and the method includes:

[0014] Sending a verification initiation instruction to the first node; the verification initiation instruction is used to instruct the first node to send a verification request, and the verification request is used to request verification of whether the network coverage information of the second node is valid;

[0015] Receiving verification information sent by the first node;

[0016] It is determined whether the network coverage information of the second node is valid according to the verification information.

[0017] In a fourth aspect, a network coverage verification method is provided, which is applied to a fourth node, and the method includes:

[0018] receiving a beacon signal sent by a second node;

[0019] Based on the beacon signal, verification information is sent to the first node; the verification information includes measurement parameters of the beacon signal.

[0020] According to a fifth aspect, a communication device is provided, located at a first node, including:

[0021] A sending unit, configured to send a verification request to a second node in the communication system; the verification request is used to request verification of whether the network coverage information of the second node is valid;

[0022] A receiving unit, configured to receive verification information of the second node sent by the fourth node;

[0023] The sending unit is further used to send verification information to the third node.

[0024] In a sixth aspect, a communication device is provided, located at a second node, including:

[0025] A receiving unit, configured to receive a verification request sent by the first node; the verification request is used to request verification of whether the network coverage information of the second node is valid;

[0026] A sending unit is used to send a beacon signal to the fourth node in response to the verification request.

[0027] In a seventh aspect, a communication device is provided, located at a third node, including:

[0028] A sending unit, configured to send a verification initiation instruction to the first node; the verification initiation instruction is used to instruct the first node to send a verification request, and the verification request is used to request verification of whether the network coverage information of the second node is valid;

[0029] A receiving unit, configured to receive verification information sent by the first node;

[0030] The processing unit is used to determine whether the network coverage information of the second node is valid according to the verification information.

[0031] In an eighth aspect, a communication device is provided, applied to a fourth node, including:

[0032] A receiving unit, configured to receive a beacon signal sent by the second node;

[0033] The sending unit is used to send verification information to the first node based on the beacon signal; the verification information includes the measurement parameters of the beacon signal.

[0034] In a ninth aspect, a communication device is provided, comprising: a processor and a memory; the memory stores instructions executable by the processor; when the processor is configured to execute the instructions, the communication device implements any one of the methods provided in the first to fourth aspects above.

[0035] In a tenth aspect, a computer-readable storage medium is provided, which stores computer instructions. When the computer instructions are executed on a computer, the computer executes any one of the methods provided in the first to fourth aspects above.

[0036] In an eleventh aspect, a computer program product comprising computer instructions is provided. When the computer instructions are executed on a computer, the computer executes any one of the methods provided in the first to fourth aspects above.

[0037] In the embodiment of the present application, the method can be combined with blockchain technology to verify the network coverage of the nodes of the co-built and shared network through the challenge verification method in the blockchain. In this way, the authenticity and effectiveness of the network coverage information verification of each node can be improved. In addition, the present application does not require other external information in the verification process for the verification information, which can reduce the complexity of network coverage verification and the required overhead. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] The accompanying drawings are used to provide further understanding of the technical solution of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present application and do not constitute a limitation on the technical solution of the present application.

[0039] Figure 1 A schematic diagram of the architecture of a communication system provided in an embodiment of the present application;

[0040] Figure 2 A flowchart of a blockchain system provided in an embodiment of the present application;

[0041] Figure 3 A flowchart of a method for verifying network coverage provided in an embodiment of the present application;

[0042] Figure 4 A schematic diagram of a communication node provided in an embodiment of the present application;

[0043] Figure 5 A flowchart of another network coverage verification method provided in an embodiment of the present application;

[0044] Figure 6 A flowchart of another network coverage verification method provided in an embodiment of the present application;

[0045] Figure 7 A schematic diagram of the composition of a communication device provided in an embodiment of the present application;

[0046] Figure 8 A schematic diagram of another communication device provided in an embodiment of the present application;

[0047] Fig. 9 A schematic diagram of another communication device provided in an embodiment of the present application;

[0048] Fig.10 A schematic diagram of another communication device provided in an embodiment of the present application;

[0049] Fig.11 A schematic diagram of the structure of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

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

[0051] In the description of this application, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this article is merely a description of the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, "at least one" means one or more, and "plurality" means two or more. The words "first", "second", etc. do not limit the quantity and execution order, and the words "first", "second", etc. do not limit them to be different.

[0052] It should be noted that, in this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0053] Here, the relevant technical terms involved in this application are explained.

[0054] Blockchain is decentralized, flexible and secure.

[0055] A blockchain usually includes multiple blockchain nodes, and all blockchain nodes in the blockchain jointly maintain the data written in the blockchain ledger. Since writing / deleting / modifying data in a blockchain node requires consensus from all blockchains, the blockchain is a distributed database that is difficult to tamper with.

[0056] Generally speaking, blockchain has at least the following three characteristics: immutability, decentralization, and smart contracts.

[0057] The consensus algorithm is an algorithmic mechanism that enables each node in the blockchain system to reach a consensus. Since the blockchain is a distributed system, each node in it needs to reach a consensus to determine the node that executes the new block writing.

[0058] In order to improve the accuracy of network coverage verification, the embodiment of the present application provides a method for detecting network coverage, which specifically includes: the third node sends a verification initiation instruction to the first node; the first node sends a verification request to the second node in the communication system, and the verification request is used to request verification of whether the network coverage information of the second node is valid; the first node receives the verification information of the second node sent by the fourth node, and sends the verification information to the third node, and the third node determines whether the network coverage information of the second node is valid based on the verification information. In this way, in the embodiment of the present application, the method can be combined with blockchain technology to improve the authenticity and effectiveness of the network coverage information verification of each node.

[0059] The method provided in the embodiment of the present application can be applied to various communication systems. For example, the communication system can be a long term evolution (LTE) system, a fifth generation (5G) communication system, a Wi-Fi system, a third generation partnership project (3GPP) related communication system, a future evolution communication system (such as a sixth generation (6G) communication system, etc.), or a system integrating multiple systems, etc., without limitation. Figure 1 Taking the communication system 10 as an example, the method provided in the embodiment of the present application is described. Figure 1 It is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided in this application.

[0060] like Figure 1, which is a schematic diagram of the architecture of a communication system 10 provided in an embodiment of the present application. Figure 1 In the communication system 10, a plurality of communication nodes may be included, for example Figure 1 Communication node 101, communication node 102, communication node 103 and communication node 104 in.

[0061] Figure 1 The communication nodes in the network can provide wireless access services for terminals. Specifically, each network device corresponds to a service coverage area, and the terminal entering the area can communicate with the network device to receive the wireless access service provided by the network device. In some embodiments, the service coverage area may include one or more cells. For example, the service coverage area corresponding to the communication node 101 includes a first cell and a second cell. The first terminal accesses the network device 101 through the first cell, and the second terminal accesses the communication node 101 through the second cell.

[0062] The communication node provided in the embodiment of the present application can be any device with wireless transceiver function. For example, it is a base station or evolutionary base station (evolutional node B, eNB or eNodeB) in long-term evolution (LTE), long-term evolution advanced (LTEA), a base station device in a 5G network, or a base station in a future communication system, etc. The base station may include various macro base stations, micro base stations, home base stations, wireless remote, reconfigurable intelligent surfaces (RISs), routers, wireless fidelity (WIFI) devices or various access network devices such as primary cells and collaborative cells (secondary cells).

[0063] The terminal in the embodiment of the present application can be any device with wireless transceiver function. For example, the terminal is a handheld device with wireless communication function (such as a mobile phone or tablet computer, etc.), a vehicle-mounted device, a wearable device, a terminal or a computing device in an Internet of Things (IoT) system, etc. The terminal can also be called a terminal device, or a user equipment (UE), without limitation.

[0064] Understandably, Figure 1 The system architecture shown in the figure does not constitute a limitation on the embodiments of the present application, and it may include more or fewer components than shown in the figure, or a combination of certain components, or a different arrangement of components.

[0065] In some embodiments, the present application also provides a blockchain system, such as Figure 2 As shown, the blockchain system may include a coverage verification module, a neighborhood management module, and a blockchain basic module.

[0066] The blockchain system also includes a blockchain network, including multiple blockchain nodes. Figure 1 Each node or device in the communication system 10 shown can serve as a blockchain node in the blockchain network.

[0067] Blockchain nodes can publish information to the blockchain network. For example, a communication node is a base station. As the infrastructure of the communication network, the base station has a fixed geographical location and provides basic resources such as computing, storage, and network. The network coverage of the base station refers to the coverage of the network provided by the base station. In some embodiments, the blockchain node can issue a proof request to the blockchain network and broadcast the blockchain network to the entire network. The proof request includes the network coverage information of the base station and can also carry information such as the geographical location of the blockchain to verify its own network coverage information by broadcasting the proof request.

[0068] The embodiment of the present application can utilize the consensus (proof of coverage, PoC) mechanism of the blockchain to verify the network coverage information of the node through questioning (or challenge) and proof process. In the verification process, the blockchain node that needs to be in the blockchain network can serve as the challenger, challenged, consensus group and witness of the verification process. The following is explained with the first node as the challenger of the verification process, the second node as the challenged of the verification process, the third node as the consensus group in the verification process, and the fourth node as the witness of the verification process.

[0069] The first node, the second node, the third node and the fourth node are blockchain nodes in the blockchain network. Figure 1 Taking the communication system 10 in the example, the first node, the second node, the third node and the fourth node can be four communication nodes in the communication system 10, such as communication node 101, communication node 102, communication node 103 and communication node 104. In addition, the coverage verification module is used to implement the network coverage verification method provided in the embodiment of the present application, and completes the verification process of network coverage information through different nodes in the blockchain to obtain a verification result. In some embodiments, the coverage verification module can transmit information generated during the verification process to the blockchain basic module. For example, the identification of the verification process, the verification result, the time of completion of the verification, the identification of the first node, the identification of the second node, the identification of the fourth node, the location information of the fourth node, the number of fourth nodes that meet the verification requirements, and at least one of the measurement parameters obtained by measuring the beacon signal of the second node.

[0070] The embodiment of the present application can use the consensus (proof of coverage, PoC) mechanism of the blockchain to verify the network coverage information of the node through the inquiry (or challenge) and proof process. In the verification process, the first node is the challenger of the verification process, the second node is the challenged of the verification process, the third node is the consensus group in the verification process, and the fourth node is the witness of the verification process.

[0071] The neighboring cell management module is used to implement the automatic neighboring cell relationship processing function. It can specifically realize automatic discovery, identification and maintenance of the neighboring cell relationship of each cell, thereby reducing the burden of manually maintaining the neighboring cell list of the base station. Exemplarily, based on the automatic neighboring cell relationship processing function, it is possible to automatically discover neighboring cells and add, identify and delete mismatched redundant neighboring cells, and optimize neighboring cell attributes. The neighboring cell relationship table (NRT) of each cell can be maintained, in which each neighboring cell is identified by a target cell identity (TCI). The module can realize the discovery and maintenance of neighboring cell relationships based on the measurement reports of each base station, thereby realizing the automatic management of neighboring cell relationships. In addition, the module can also provide a basis for judging the verification results for the verification process of the network coverage information in the embodiment of the present application.

[0072] The blockchain basic module is used to record the data content generated during the challenge process. The blockchain basic module can control the security and reliability of the network coverage information verification process, so that the relevant information cannot be tampered with. The blockchain basic module can also control the frequency of network coverage information verification based on the blockchain block time. The blockchain basic module can record the information generated during the verification process. For example, the identification of the verification process, the verification result, the time of completion of the verification, the identification of the first node, the identification of the second node, the identification of the fourth node, the location information of the fourth node, the number of fourth nodes that meet the verification requirements, and at least one of the measurement parameters obtained by measuring the beacon signal of the second node.

[0073] The method provided by the present application is described in detail below in conjunction with the accompanying drawings of the specification.

[0074] The present application embodiment provides a method for verifying network coverage, such as Figure 3 As shown, the method comprises the following steps:

[0075] S101. A first node sends a verification request to a second node in a communication system, where the verification request is used to request verification of whether network coverage information of the second node is valid.

[0076] Correspondingly, the second node receives the verification request sent by the first node.

[0077] In some embodiments, the first node is a communication node that can be trusted for network coverage information in the communication system. Figure 4 As shown, the communication nodes in the communication system may include communication nodes whose network coverage information is credible, communication nodes to be verified, communication nodes that have failed verification, and communication nodes that have successfully verified.

[0078] It should be noted that the first node does not need to verify the network coverage information. By way of example, in actual applications, the first node can be a base station that operates stably for a long period of time, a base station with a reliable location, a publicly recognized trusted base station, a trusted base station set by a specific operator, etc.

[0079] In addition, the communication node to be verified is the communication node in the communication system that has not undergone network coverage information verification, the communication node that failed verification is the communication node whose last network coverage information verification result was invalid, and the communication node that successfully verified is the communication node whose last network coverage information verification result was valid.

[0080] In some embodiments, the first node may determine the second node from among a plurality of communication nodes in the communication system, and send a verification request to the second node.

[0081] The verification request may include at least one of an identifier of the first node, a digital summary of a public key of the first node, and a digital summary of the verification request.

[0082] The digital summary can convert a message of any length into a short message of fixed length. It is a ciphertext obtained by "summarizing" the plaintext to be encrypted into a string of fixed length (e.g., 128 bits) using a one-way hash function, also known as a digital fingerprint. In some embodiments, the first node can digitally encrypt the public key of the first node based on the hash algorithm to obtain a digital summary of the public key of the first node, and can also digitally encrypt the verification request to obtain a digital summary of the verification request.

[0083] In addition, the identifier of the first node is used to uniquely identify the first node. Exemplarily, the identifier of the first node may be an IP address, a name, a number in the communication system, an identity certificate, or other information that may refer to the first node.

[0084] In some embodiments, when the network coverage information of the second node needs to be verified, the first node may generate a key for the verification process, including a public key of the first node and a private key of the first node.

[0085] In some embodiments, the verification request may also be encrypted by the public key of the first node and / or the public key of the second node. Exemplarily, the first node may first encrypt the verification request by the public key of the first node and then by the public key of the second node.

[0086] It should be understood that the second node can generate a key, including a public key of the second node and a private key of the second node. Furthermore, before the first node sends a verification request to the second node, the public key of the second node can be obtained first.

[0087] Exemplarily, the above verification request can also be called a challenge data packet. When the challenger (first node) receives the verification initiation instruction, it can send an encrypted challenge data packet to the challenged (second node). In addition, the challenger (first node) and the challenged (second node) can also realize data transmission through the message mechanism of the blockchain, such as peer-to-peer (P2P) transmission mode, to improve data security.

[0088] In some embodiments, the second node may also decrypt the received verification request using the private key of the second node and / or the private key of the first node.

[0089] In one example, the second node decrypts the verification request using a private key of the second node.

[0090] In another example, the second node may first decrypt the verification request using the private key of the second node, and then decrypt the verification request using the private key of the first node.

[0091] In some embodiments, the second node is a base station that currently needs to verify whether the network coverage information is valid. In one example, the second node can be a communication node to be verified, a communication node that failed verification, and a communication node that succeeded verification in the communication system.

[0092] Thus, the first node can determine the second node from the communication nodes to be verified, the communication nodes that failed verification, and the communication nodes that succeeded verification in the communication system, and send a verification request to the second node.

[0093] In some embodiments, the first node may first obtain the verification priority of each communication node among the communication nodes to be verified, the communication nodes that failed verification, and the communication nodes that succeeded verification, and then determine the second node according to the verification priority of each communication node.

[0094] In one example, the verification priority of the communication node to be verified is higher than that of the communication node that failed verification, and the verification priority of the communication node that failed verification is higher than that of the communication node that succeeded verification. That is, the current first node is more likely to select the communication node to be verified as the second node than the communication node that failed verification, and the possibility of selecting the communication node that failed verification as the second node is higher than that of the communication node that succeeded verification.

[0095] In some embodiments, the verification priority of a successfully verified communication node is proportional to the duration of the last successful verification of the communication node.

[0096] It should be noted that after the network coverage information of a communication node is successfully verified, the longer the interval between the successful verification of the communication node, the lower the credibility of the verification result, that is, the lower the credibility of the network coverage information of the communication node, and thus, the communication node needs to verify the network coverage information again. Therefore, the verification priority of a successfully verified communication node is proportional to the interval between the last successful verification of the communication node.

[0097] In some embodiments, the verification priority of the communication node that failed verification is proportional to the interval length of the communication node's last successful verification. Similarly, after the communication node's network coverage information verification fails, the longer the interval length of the communication node's verification failure, the lower the credibility of its verification result, that is, the more the communication node needs to verify the network coverage information again.

[0098] In some embodiments, each communication node in the blockchain network may also have a credibility, and the credibility of the communication node is used to characterize the possibility of validity of the network coverage information of the communication node. Among them, the higher the credibility of the communication node, the lower the verification priority. It should be understood that the credibility of the communication node to be verified is lower than that of the communication node that failed the verification, and the credibility of the communication node that failed the verification is lower than that of the communication node that succeeded the verification, and the credibility of each communication node is also inversely proportional to the interval length of the last successful verification of the communication node. Exemplarily, a node management function module can be set in the blockchain system to dynamically maintain the credibility of each communication node, so that the verification process of network coverage information can be periodically initiated for the communication node.

[0099] It should be noted that in this blockchain network, the communication nodes selected for verification can be first verified based on the communication nodes with credible network coverage information, and then the network coverage of other communication nodes can be further verified through the inquiry (or challenge) and proof mechanism, and repeated iterations can be performed to verify the network coverage information of each of the communication nodes to be verified, the communication nodes that failed the verification, and the communication nodes that succeeded the verification. In addition, for nodes that take a long time to verify, re-verification can be performed. In this way, the verification and dynamic maintenance of the trust of each communication node in the communication system can be achieved. Furthermore, for small base stations in the campus network, real and effective network coverage information can be provided.

[0100] S102: The fourth node sends verification information of the second node to the first node.

[0101] Correspondingly, the first node receives the verification information of the second node sent by the fourth node.

[0102] In some embodiments, the second node may send a beacon signal to the fourth node in response to the verification request. Accordingly, the fourth node receives the beacon signal sent by the second node. Furthermore, the fourth node may send verification information of the second node to the first node.

[0103] In some embodiments, the fourth node may be a communication node whose network coverage information is credible in the communication system, or the fourth node may also be a communication node whose network coverage information is successfully verified in the communication system. The first node may be called a witness in the challenge process, and may witness or verify the challenge process (network coverage information verification process) based on the request of the challenged (second node).

[0104] In some embodiments, the number of the fourth nodes may be multiple. That is, the first node may receive verification information sent by multiple fourth nodes. Figure 5 As shown, the fourth node may include a fourth node 1, a fourth node 2...a fourth node n, where n is a positive integer. The second node may send a beacon signal to the fourth node 1, the fourth node 2...the fourth node n, respectively. Furthermore, the first node may receive verification information sent by the fourth node 1, the fourth node 2...the fourth node n, respectively, where n is a positive integer. In some embodiments, the first node and the fourth node may also realize data transmission through the message mechanism of the blockchain, for example, transmitting the verification information through a P2P transmission method to improve data security.

[0105] In some embodiments, the fourth node may be a communication node in the neighbor relationship list of the second node, that is, the fourth node belongs to a target cell in the neighbor area of ​​the second node. Exemplarily, it may be determined based on the neighbor area TCI of the second node.

[0106] In one example, after receiving the verification request sent by the first node, the second node can decrypt based on the private key of the first node and / or the private key of the second node, and in response to the verification request, the communication node (fourth node) in the neighbor relationship list sends a beacon signal, and then the fourth node can receive the beacon signal, and can measure the beacon signal to obtain the measurement parameter. In some embodiments, the second node can send the beacon signal by sending an air interface message.

[0107] It should be understood that when the first node first encrypts the verification request by the public key of the first node and then by the public key of the second node, when the second node receives the verification request, it can first decrypt it by the private key of the second node and then by the private key of the first node.

[0108] In some embodiments, the verification information may include measurement parameters obtained by measuring a beacon signal sent by the second node.

[0109] In some embodiments, the measurement parameter includes at least one of the following: reference signal receiving power (RSRP), received signal strength indicator

[0110] The data rate is the sum of the data rates of the wireless receiver and the quality of experience (QoE).

[0111] In some embodiments, the verification information may further include at least one of an identifier of the fourth node, location information of the fourth node, and a digital summary of the verification information.

[0112] The fourth node may digitally encrypt the verification information based on a hash algorithm to obtain a digital summary of the verification information. In addition, the identifier of the fourth node is used to uniquely identify the fourth node. Exemplarily, the identifier of the fourth node may be the IP address, name, number in the communication system, identity certificate, or other information that may refer to the fourth node.

[0113] In some embodiments, the fourth node may encrypt the verification information by the public key of the first node. It should be understood that the fourth node may receive the public key of the first node sent by the first node, and then, when sending the verification information, the verification information may be encrypted by the public key of the first node.

[0114] S103: The first node sends verification information to the third node.

[0115] Correspondingly, the third node can receive the verification information sent by the first node.

[0116] In some embodiments, the first node may decrypt the verification information sent by at least one fourth node using the private key of the first node, and then package the decrypted verification information sent by at least one fourth node and the private key of the first node to obtain a first data packet, and then send the first data packet to the third node.

[0117] In some embodiments, the third node may receive a first data packet sent by the first node, the first data packet including verification information and a private key of the first node. Furthermore, the third node may decrypt the verification information using the private key of the first node to obtain decrypted verification information.

[0118] In some embodiments, the verification information includes a measurement parameter obtained by the fourth node measuring the beacon signal of the second node. The measurement parameter includes at least one of the following: RSRP, RSSI, SINR, throughput, and QoE.

[0119] In some embodiments, the verification information may further include at least one of an identifier of the fourth node, location information of the fourth node, and a digital summary of the verification information.

[0120] In some embodiments, the third node may also determine whether the network coverage information of the second node is valid based on the verification information.

[0121] In some embodiments, the third node may determine that the network coverage information of the second node is valid if the verification information meets a preset condition. Furthermore, the third node may also determine the second node as a communication node that has been successfully verified.

[0122] Alternatively, the third node may determine that the network coverage information of the second node is invalid if the verification information does not meet a preset condition. Furthermore, the third node may also determine that the second node is a communication node that has failed verification.

[0123] In some embodiments, the preset condition is determined based on a network coverage quality parameter and / or a network coverage range parameter.

[0124] The network coverage quality parameter includes a distance parameter between the second node and the fourth node and a measurement parameter obtained by measuring the beacon signal of the second node by the fourth node. The network coverage range parameter includes the number of fourth nodes of the target cell in the neighboring area of ​​the second node. And the measurement parameter includes at least one of the following: RSRP, RSSI, SINR, throughput and QoE.

[0125] Exemplarily, the preset condition may be determined by a combination of one or more parameters in the above-mentioned network coverage quality parameters and network coverage range parameters. For example, the preset condition may be that the network coverage quality parameters include that the distance between the second node and the fourth node is less than or equal to a preset distance threshold, the number of fourth nodes of the target cell in the neighboring area of ​​the second node is greater than or equal to 1, etc., and the preset condition is determined based on one of the above-mentioned network coverage quality parameters or network coverage range parameters. Alternatively, the number of fourth nodes of the target cell in the neighboring area of ​​the second node is greater than or equal to 1 and the received measurement value RSRP is greater than a preset RSRP threshold, etc., and the preset condition is determined based on a combination of multiple parameters in the above-mentioned network coverage quality parameters or network coverage range parameters.

[0126] In addition, the verification result can also be judged in other possible ways, such as performing multi-parameter comprehensive judgment through artificial intelligence algorithms.

[0127] In one example, in actual application, the trusted base station set by a specific operator of the consensus group (ie, the third node) can be taken as an example. The third node can select a trusted base station set by a specific operator as a challenger (ie, the first node), and the first node further sends a verification request to the second node. In this example, the relevant base station of a specific operator whose network coverage information has been successfully verified can also be used as a witness (ie, the fourth node). If there is a fourth node in the neighbor list TCI of the second node, the verification is successful.

[0128] In another example, the trusted base station set by a specific operator of the consensus group (ie, the third node) can be used as an example. The third node can select a trusted base station set by a specific operator as the challenger (ie, the first node), and the first node further sends a verification request to the second node. In this example, the relevant base station of the non-specific operator whose network coverage information has been successfully verified can be used as a witness (ie, the fourth node), so that the scope of coverage verification can be expanded through the relevant base stations of the non-specific operator.

[0129] Furthermore, if the verification fails due to the limitation that there are not enough nearby base stations that have successfully verified as witnesses (ie, the fourth node), or the location information is incorrect, the number of the fourth nodes that meet the verification requirements may be zero.

[0130] In some embodiments, the third node may record the verification result of the second node in a new block created by the third node in the blockchain. In addition, the third node may also record the verification completion time, verification initiation time, or other possible time points in the new block.

[0131] It should be noted that, when the verification is completed, the verification result of the second node can be "on-chained", that is, recorded in the new block created by the third node in the blockchain. Among them, for the case of successful verification or failed verification, the verification result needs to be "on-chained". In addition, the "on-chain" content can also include information generated during the verification process, such as the identification of the verification process, the time of completion of the verification, the identification of the first node, the identification of the second node, the identification of the fourth node, the location information of the fourth node, the number of fourth nodes that meet the verification requirements, and the measurement parameters obtained by measuring the beacon signal of the second node.

[0132] In some embodiments, if the verification is successful, each node of the parameter verification can obtain an incentive reward, and the incentive reward can be distributed based on a preset incentive ratio. For example, the first node can obtain an incentive reward of 1%, the second node can obtain an incentive reward of 12%, the third node can obtain an incentive reward of 30%, the fourth node can obtain an incentive reward of 6%, and other modules or nodes participating in this verification process can obtain the remaining 51% of the incentive reward.

[0133] In some embodiments, in the event of a verification failure, all nodes that verify the remaining parameters except the second node may receive an incentive reward, and the incentive reward may be allocated based on a preset incentive ratio.

[0134] In some embodiments, the fourth node may also record a preset incentive ratio in the new block.

[0135] Based on the method provided in the embodiment of the present application, the blockchain technology can be combined to verify the network coverage of the nodes of the co-built and shared network through the challenge verification method in the blockchain. In this way, the authenticity and effectiveness of the network coverage information verification of each node can be improved. In addition, the present application does not require other external information in the verification process for the verification information, which can reduce the complexity of network coverage verification and the required overhead.

[0136] In addition, when making a verification judgment on the verification information, the present application can use the neighboring cell maintenance relationship of the challenged cell and the measurement parameters of the beacon signal of the challenged cell as a judgment basis, thereby reducing the complexity of network coverage verification.

[0137] In some embodiments, Figure 6 As shown, before step S101, the network coverage verification method may further include the following steps:

[0138] S201. The third node sends a verification initiation instruction to the first node, where the verification initiation instruction is used to instruct the first node to send a verification request.

[0139] Correspondingly, the first node can receive the verification initiation instruction sent by the third node.

[0140] In some embodiments, the third node may also be a communication node whose network coverage information is credible in the communication system. In addition, the third node may determine the first node from the communication nodes whose network coverage information is credible in the communication system.

[0141] It should be noted that the embodiment of the present application can use the consensus mechanism of the blockchain to verify the network coverage information of the node through the inquiry (or challenge) and proof process. The third node mentioned above can also be called the consensus group of the process, and the first node, i.e., the challenger, can be selected in the communication system, and a verification initiation instruction is sent to the first node to initiate the inquiry (or challenge) and proof process of the network coverage information of the node in the blockchain.

[0142] When it is necessary to initiate a verification process of network coverage, a third node can be selected from communication nodes whose network coverage information is credible in the communication system by random selection. Exemplarily, based on the challenge mechanism of the blockchain network, the third node can also be called a consensus group, and the third node in each network coverage verification process can be different.

[0143] In some embodiments, the third node may determine the first node among the communication nodes whose network coverage information is credible in the communication system, and then send a verification initiation instruction to the first node to initiate a verification process for the network coverage information of the communication nodes in the communication system.

[0144] In some embodiments, the third node may also create an identifier of the verification process. Correspondingly, the verification initiation instruction may also include the identifier of the verification process.

[0145] The identifier of the verification process is used to uniquely identify the verification process. Exemplarily, the identifier of the verification process can be the node identifier or node information of the first node, the second node, the third node, and the fourth node involved, the verification initiation time, the verification completion time, or other information that can uniquely refer to the verification process.

[0146] In some embodiments, the third node may also create a new block in the blockchain network, that is, the third node may implement the "block generation" function of the blockchain, and the new block is used to record the information generated during the verification process. Exemplarily, the third node may create the new block when sending the verification initiation instruction, or the third node may also initiate the new block before sending the verification initiation instruction, which is not limited in this application.

[0147] It should be noted that for each verification of network coverage information, the third node in the verification process can create a new block to record the information generated in this network coverage information verification process.

[0148] In some embodiments, the information generated during the verification process includes: an identifier of the verification process, a verification result, a verification completion time, an identifier of the first node, an identifier of the second node, an identifier of the fourth node, location information of the fourth node, the number of fourth nodes that meet the verification requirements, and at least one of the measurement parameters obtained by measuring the beacon signal of the second node.

[0149] Exemplarily, the verification result may include that the network coverage information of the second node is successfully verified or that the network coverage information of the second node is failed. The fourth node that meets the verification requirement may be the fourth node in the neighbor relationship list of the second node.

[0150] The above mainly introduces the solution provided by the present application from the perspective of interaction between each node. It is understandable that each node, such as the first node, the second node, the third node or the fourth node, includes a hardware structure and / or software module corresponding to each function in order to realize the above functions. It should be easily appreciated by those skilled in the art that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present invention can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.

[0151] Figure 7 FIG. 1 is a schematic diagram showing the composition of a communication device provided in an embodiment of the present application. Figure 7 As shown, the communication device 70 is applied to a first node, and includes a sending unit 701 and a receiving unit 702. In some embodiments, the communication device 70 further includes a processing unit 703.

[0152] In some embodiments, the sending unit 701 is used to send a verification request to a second node in the communication system, and the verification request is used to request verification of whether the network coverage information of the second node is valid. The receiving unit 702 is used to receive the verification information of the second node sent by the fourth node. The sending unit 701 is also used to send the verification information to the third node.

[0153] In some embodiments, the verification request includes at least one of an identification of the first node, a digital digest of a public key of the first node, and a digital digest of the verification request.

[0154] In some embodiments, the verification request is encrypted by a public key of the first node and / or a public key of the second node.

[0155] In some embodiments, the verification information includes measurement parameters obtained by measuring a beacon signal sent by the second node.

[0156] In some embodiments, the measurement parameter includes at least one of the following: reference signal received power RSRP, received signal strength indication RSSI, signal to interference plus noise ratio SINR, throughput, and quality of experience QoE.

[0157] In some embodiments, the verification information further includes at least one of an identifier of the fourth node, location information of the fourth node, and a digital summary of the verification information.

[0158] In some embodiments, the verification information is encrypted by a public key of the first node.

[0159] In some embodiments, the receiving unit 702 is specifically configured to receive the verification information of the second node sent by the fourth node through a point-to-point transmission P2P mode.

[0160] In some embodiments, the second node includes a communication node to be verified, a communication node that fails verification, and a communication node that succeeds verification in the communication system.

[0161] In some embodiments, the receiving unit 702 is further configured to obtain the verification priority of each communication node among the communication nodes to be verified, the communication nodes that failed verification, and the communication nodes that succeeded verification. The processing unit 703 is configured to determine the second node according to the verification priority of each communication node.

[0162] In some embodiments, the verification priority of a communication node to be verified is higher than that of a communication node that failed verification, and the verification priority of a communication node that failed verification is higher than that of a communication node that succeeded verification.

[0163] In some embodiments, the verification priority of a successfully verified communication node is proportional to the duration of the last successful verification of the communication node.

[0164] In some embodiments, the receiving unit 702 is further used to receive a verification initiation instruction sent by a third node; the verification initiation instruction is used to instruct the first node to send a verification request.

[0165] In some embodiments, the first node is a communication node whose network coverage information is determined to be credible by the third node.

[0166] In some embodiments, the processing unit 703 is further configured to decrypt the verification information sent by the at least one fourth node using the private key of the first node, and to package the decrypted verification information sent by the at least one fourth node and the private key of the first node to obtain a first data packet. The sending unit 701 is specifically configured to send the first data packet to the third node.

[0167] For a more detailed description of the above-mentioned sending unit 701, receiving unit 702 and processing unit 703, as well as a more detailed description of each technical feature therein, and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding method embodiment part, which will not be repeated here.

[0168] Figure 8 FIG. 1 is a schematic diagram showing the composition of a communication device provided in an embodiment of the present application. Figure 8 As shown, the communication device 80 is applied to the second node, and includes a receiving unit 801 and a sending unit 802. In some embodiments, the communication device 80 further includes a processing unit 803.

[0169] In some embodiments, the receiving unit 801 is used to receive a verification request sent by a first node; the verification request is used to request verification of whether the network coverage information of the second node is valid. The sending unit 802 is used to send a beacon signal to a fourth node in response to the verification request.

[0170] In some embodiments, the processing unit 803 is configured to decrypt the verification request using a private key of the second node.

[0171] In some embodiments, the verification request includes at least one of an identification of the first node, a digital summary of a public key of the first node, and a digital summary of the verification request.

[0172] In some embodiments, the receiving unit 801 is further configured to obtain an incentive reward for the verification process based on an incentive ratio when the network coverage information of the second node is valid.

[0173] For a more detailed description of the above-mentioned receiving unit 801, sending unit 802 and processing unit 803, as well as a more detailed description of each technical feature therein, and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding method embodiment part, which will not be repeated here.

[0174] Fig. 9 FIG. 1 is a schematic diagram showing the composition of a communication device provided in an embodiment of the present application. Fig. 9 As shown, the communication device 90 is applied to a third node, and includes a sending unit 901 , a receiving unit 902 and a processing unit 903 .

[0175] In some embodiments, the sending unit 901 is used to send a verification initiation instruction to the first node; the verification initiation instruction is used to instruct the first node to send a verification request, and the verification request is used to request verification of whether the network coverage information of the second node is valid. The receiving unit 902 is used to receive the verification information sent by the first node. The processing unit 903 is used to determine whether the network coverage information of the second node is valid according to the verification information.

[0176] In some embodiments, the processing unit 903 is further configured to determine a first node among communication nodes whose network coverage information of the communication system is credible.

[0177] In some embodiments, the receiving unit 902 is specifically used to: receive a first data packet, where the first data packet includes verification information and a private key of the first node.

[0178] In some embodiments, the processing unit 903 is further configured to decrypt the verification information using the private key of the first node.

[0179] In some embodiments, the processing unit 903 is further configured to determine that the network coverage information of the second node is valid when the verification information satisfies a preset condition.

[0180] In some embodiments, the processing unit 903 is further configured to determine the second node as a communication node that has successfully been verified.

[0181] In some embodiments, the verification information includes measurement parameters obtained by the fourth node measuring the beacon signal of the second node.

[0182] In some embodiments, the preset condition is determined based on a network coverage quality parameter and / or a network coverage range parameter; wherein the network coverage quality parameter includes a distance parameter between the second node and the fourth node and a measurement parameter obtained by the fourth node measuring the beacon signal of the second node; the network coverage range parameter includes the number of fourth nodes of the target cell in the neighboring area of ​​the second node.

[0183] In some embodiments, the measurement parameter includes at least one of: RSRP, RSSI, SINR, throughput, and QoE.

[0184] In some embodiments, the processing unit 903 is also used to create a new block in the blockchain network, and the new block is used to record the information generated during the verification process.

[0185] In some embodiments, the processing unit 903 is further configured to record the verification result of the second node in a new block.

[0186] In some embodiments, the information generated during the verification process includes: an identifier of the verification process, a verification result, a verification completion time, an identifier of the first node, an identifier of the second node, an identifier of the fourth node, location information of the fourth node, the number of fourth nodes that meet the verification requirements, and at least one of the measurement parameters obtained by measuring the beacon signal of the second node.

[0187] For a more detailed description of the above-mentioned sending unit 901, receiving unit 902 and processing unit 903, as well as a more detailed description of each technical feature therein, and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding method embodiment part, which will not be repeated here.

[0188] Fig.10 FIG. 1 is a schematic diagram showing the composition of a communication device provided in an embodiment of the present application. Fig.10As shown, the communication device 100 is applied to a fourth node, and includes a receiving unit 1001 and a sending unit 1002. In some embodiments, the communication device 100 further includes a processing unit 1003.

[0189] In some embodiments, the receiving unit 1001 is configured to receive a beacon signal sent by the second node. The sending unit 1002 is configured to send verification information to the first node based on the beacon signal; the verification information includes measurement parameters of the beacon signal.

[0190] In some embodiments, the measurement parameters of the beacon signal include: one or more of a reference signal received power RSRP, a received signal strength indication RSSI, and a signal to interference plus noise ratio SINR obtained by measuring the beacon signal.

[0191] In some embodiments, the verification information further includes at least one of identification information of the fourth node, location information of the fourth node, and a digital summary of the verification information.

[0192] In some embodiments, the receiving unit 1001 is further used to receive the public key of the first node sent by the first node.

[0193] In some embodiments, the processing unit 1003 is configured to encrypt the verification information using a public key of the first node.

[0194] For a more detailed description of the above-mentioned receiving unit 1001, sending unit 1002 and processing unit 1003, as well as a more detailed description of each technical feature therein, and a description of the beneficial effects, etc., please refer to the above-mentioned corresponding method embodiment part, which will not be repeated here.

[0195] It should be noted that Figure 7-10 The units in the system may also be referred to as modules, for example, the sending unit may be referred to as a sending module. Figure 7-10 In the illustrated embodiment, the names of the various units may not be the names shown in the figure. For example, the sending unit may be called a communication unit, and the receiving unit may be called a communication unit.

[0196] Figure 7-10If each unit in the embodiment is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the methods of each embodiment of the present application. The storage medium for storing computer software products includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program codes.

[0197] In the case of implementing the functions of the above-mentioned integrated modules in the form of hardware, an embodiment of the present application provides a structural schematic diagram of a communication device, which may be the above-mentioned communication device 70, communication device 80, communication device 90 or communication device 100. Fig.11 As shown, the communication device 110 includes: a processor 1102 , a communication interface 1103 , and a bus 1104 . Optionally, the communication device 110 may also include a memory 1101 .

[0198] The processor 1102 may be a device that implements or executes various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor 1102 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of the present application. The processor 1102 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0199] The communication interface 1103 is used to connect with other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0200] The memory 1101 may be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program codes in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0201] As a possible implementation, the memory 1101 may exist independently of the processor 1102, and the memory 1101 may be connected to the processor 1102 via a bus 1104 to store instructions or program codes. When the processor 1102 calls and executes the instructions or program codes stored in the memory 1101, the information processing method determination method provided in the embodiment of the present application can be implemented.

[0202] In another possible implementation, the memory 1101 may also be integrated with the processor 1102 .

[0203] The bus 1104 may be an extended industry standard architecture (EISA) bus, etc. The bus 1104 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.11 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0204] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the equipment or device is divided into different functional modules to complete all or part of the functions described above.

[0205] The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above computer-readable storage medium. When the program is executed, it may include the processes of the above method embodiments. The computer-readable storage medium can be the memory or memory of any of the above embodiments. The above computer-readable storage medium can also be an external storage device of the above device or device, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above device or device. Further, the above computer-readable storage medium can also include both the internal storage unit of the above device or device and an external storage device. The above computer-readable storage medium is used to store the above computer program and other programs and data required by the above device or device. The above computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0206] An embodiment of the present application also provides a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any one of the methods provided in the above embodiments.

[0207] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art may understand and implement other changes to the disclosed embodiments by viewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "one" or "an" does not exclude multiple situations. A single processor or other unit can implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0208] Although the present application has been described in conjunction with specific features and embodiments thereof, it is obvious that various modifications and combinations may be made thereto without departing from the spirit and scope of the present application. Accordingly, this specification and the drawings are merely exemplary illustrations of the present application as defined by the appended claims, and are deemed to have covered any and all modifications, variations, combinations or equivalents within the scope of the present application. Obviously, those skilled in the art may make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

[0209] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A method for verifying network coverage, characterized in that: The method is applied to a first node in a communication system, and the method comprises: Sending a verification request to a second node in the communication system; the verification request is used to request verification of whether the network coverage information of the second node is valid; receiving verification information of the second node sent by the fourth node; The verification information is sent to the third node.

2. The method according to claim 1, characterized in that The verification request includes at least one of an identifier of the first node, a digital summary of a public key of the first node, and a digital summary of the verification request.

3. The method according to claim 1, characterized in that The verification request is encrypted by the public key of the first node and / or the public key of the second node.

4. The method according to claim 1, characterized in that: The verification information includes a measurement parameter obtained by measuring a beacon signal sent by the second node.

5. The method according to claim 4, characterized in that The measurement parameters include at least one of the following: Reference signal received power RSRP, received signal strength indication RSSI, signal to interference plus noise ratio SINR, throughput and quality of experience QoE.

6. The method according to claim 4, characterized in that The verification information further includes at least one of an identifier of the fourth node, location information of the fourth node, and a digital summary of the verification information.

7. The method according to claim 1, characterized in that The verification information is encrypted by the public key of the first node.

8. The method according to claim 1, characterized in that The receiving verification information of the second node sent by the fourth node includes: The verification information of the second node is received by the fourth node through a point-to-point transmission (P2P) mode.

9. The method according to claim 1, characterized in that: The second nodes include communication nodes to be verified, communication nodes that failed verification, and communication nodes that succeeded verification in the communication system.

10. The method according to claim 9, characterized in that The method further comprises: Obtaining the verification priority of each of the communication nodes to be verified, the communication nodes that failed verification, and the communication nodes that succeeded verification; The second node is determined according to the verification priorities of the respective communication nodes.

11. The method according to claim 10, characterized in that The verification priority of the communication node to be verified is higher than that of the communication node that failed verification, and the verification priority of the communication node that failed verification is higher than that of the communication node that succeeded verification.

12. The method according to claim 10, characterized in that The verification priority of the successfully verified communication node is proportional to the duration of the last successful verification of the communication node.

13. The method according to claim 1, characterized in that The method further comprises: Receive a verification initiation instruction sent by the third node; the verification initiation instruction is used to instruct the first node to send the verification request.

14. The method according to claim 13, characterized in that The first node is a communication node whose network coverage information determined by the third node is credible.

15. The method according to claim 1, characterized in that The sending the verification information to the third node includes: decrypting verification information sent by at least one fourth node using the private key of the first node; Packing the decrypted verification information sent by the at least one fourth node and the private key of the first node to obtain a first data packet; The first data packet is sent to the third node.

16. A method for verifying network coverage, characterized in that: The method is applied to a third node in a communication system, and the method includes: Sending a verification initiation instruction to the first node; the verification initiation instruction is used to instruct the first node to send a verification request, and the verification request is used to request verification of whether the network coverage information of the second node is valid; Receiving verification information sent by the first node; Determine whether the network coverage information of the second node is valid according to the verification information.

17. The method according to claim 16, characterized in that The method further comprises: The first node is determined among communication nodes whose network coverage information of the communication system is credible.

18. The method according to claim 16, characterized in that The receiving the verification information sent by the first node includes: A first data packet is received, wherein the first data packet includes the verification information and a private key of the first node.

19. The method according to claim 18, characterized in that The method further comprises: The verification information is decrypted using the private key of the first node.

20. The method according to claim 16, characterized in that The determining, according to the verification information, whether the network coverage information of the second node is valid includes: When the verification information satisfies a preset condition, it is determined that the network coverage information of the second node is valid.

21. The method according to claim 20, characterized in that The method further comprises: The second node is determined as a communication node that has successfully been verified.

22. The method according to claim 20, characterized in that The verification information includes measurement parameters obtained by the fourth node measuring the beacon signal of the second node.

23. The method according to claim 20, characterized in that The preset condition is determined based on a network coverage quality parameter and / or a network coverage range parameter; Among them, the network coverage quality parameter includes the distance parameter between the second node and the fourth node and the measurement parameter obtained by the fourth node measuring the beacon signal of the second node; the network coverage range parameter includes the number of fourth nodes in the target cell in the neighboring area of ​​the second node.

24. The method according to claim 23, characterized in that The measurement parameters include at least one of the following: RSRP, RSSI, SINR, throughput, and QoE.

25. The method according to claim 20, characterized in that The method further comprises: A new block is created in the blockchain network, and the new block is used to record the information generated during the verification process.

26. The method according to claim 25, characterized in that The method further comprises: The verification result of the second node is recorded in the new block.

27. The method according to claim 26, characterized in that The information generated during the verification process includes: the identification of the verification process, the verification result, the verification completion time, the identification of the first node, the identification of the second node, the identification of the fourth node, the location information of the fourth node, the number of fourth nodes that meet the verification requirements, and at least one of the measurement parameters obtained by measuring the beacon signal of the second node.

28. A network coverage verification method, characterized in that: The method is applied to a second node in a communication system, and the method comprises: receiving a verification request sent by the first node; the verification request is used to request verification of whether the network coverage information of the second node is valid; In response to the authentication request, a beacon signal is sent to the fourth node.

29. The method according to claim 28, characterized in that The method further comprises: The verification request is decrypted using the private key of the second node.

30. The method according to claim 29, characterized in that The verification request includes at least one of an identifier of the first node, a digital summary of a public key of the first node, and a digital summary of the verification request.

31. The method according to claim 28, characterized in that The method further comprises: When the network coverage information of the second node is valid, an incentive reward for the verification process is obtained based on the incentive ratio.

32. A network coverage verification method, characterized in that: The method is applied to a fourth node of a communication system, and the method comprises: receiving a beacon signal sent by a second node; Based on the beacon signal, verification information is sent to the first node; the verification information includes measurement parameters of the beacon signal.

33. The method according to claim 32, characterized in that The measurement parameters of the beacon signal include: one or more of a reference signal received power RSRP, a received signal strength indicator RSSI, and a signal to interference plus noise ratio SINR obtained by measuring the beacon signal.

34. The method according to claim 32, characterized in that The verification information further includes at least one of an identifier of the fourth node, location information of the fourth node, and a digital summary of the verification information.

35. The method according to claim 32, characterized in that The method further comprises: Receive the public key of the first node sent by the first node.

36. The method according to claim 35, characterized in that The method further comprises: The verification information is encrypted using the public key of the first node.

37. A communication device, characterized in that: include: Memory and processor; Memory and processor coupling; The memory is used to store instructions executable by the processor; When the processor executes the instructions, the method according to any one of claims 1 to 36 is performed.

38. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a communication device, the communication device is caused to perform the method according to any one of claims 1 to 36.

Images