Network coverage verification method, and communication apparatus and storage medium

Abstract

Provided in the embodiments of the present disclosure are a network coverage verification method, and a communication apparatus and a storage medium. The network coverage verification method comprises: a first node sending a verification request to a second node in a communication system, wherein 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 that is sent by a fourth node, and sending the verification information to a third node.

Description

Network coverage verification method, communication device and storage medium

[0001] This disclosure claims priority to Chinese patent application No. 202310927683.4, filed on July 25, 2023, the entire contents of which are incorporated herein by reference. Technical Field

[0002] The present disclosure relates to the field of communication technology, and in particular to a method for verifying network coverage, a communication device, and a storage medium. Background Art

[0003] With the advancement of communications technology, the demand for network infrastructure deployment is growing. To avoid duplication of network infrastructure, reduce construction costs, and improve efficiency, operators often collaborate on joint network construction through a shared network model. This shared network model presents the challenge of verifying base station coverage.

[0004] Summary of the Invention

[0005] This disclosure adopts the following technical solutions:

[0006] In a first aspect, a method for verifying network coverage is provided, applied to a first node, the method comprising:

[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 method for verifying network coverage is provided, which is applied to a second node, and the method includes:

[0011] 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;

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

[0013] In a third aspect, a method for verifying network coverage is provided, which is applied to a third node. 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 method for verifying network coverage 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] In a fifth aspect, a communication device is provided, located at a first node. The communication device includes:

[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 configured to send verification information to the third node.

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

[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] The sending unit is configured 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. The communication device includes:

[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 configured 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. The communication device includes:

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

[0033] The sending unit 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.

[0034] In the 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 is caused to execute any one of the methods provided in the first to fourth aspects above. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0038] FIG1 is a schematic diagram of the architecture of a communication system provided by an embodiment of the present disclosure.

[0039] FIG2 is a flow chart of a blockchain system provided by an embodiment of the present disclosure.

[0040] FIG3 is a flow chart of a method for verifying network coverage provided in an embodiment of the present disclosure.

[0041] FIG4 is a schematic diagram of a communication node provided in an embodiment of the present disclosure.

[0042] FIG5 is a flow chart of another method for verifying network coverage provided by an embodiment of the present disclosure.

[0043] FIG6 is a flow chart of another method for verifying network coverage provided by an embodiment of the present disclosure.

[0044] FIG7 is a schematic diagram showing the composition of a communication device provided in an embodiment of the present disclosure.

[0045] FIG8 is a schematic diagram showing the composition of another communication device provided in an embodiment of the present disclosure.

[0046] FIG9 is a schematic diagram showing the composition of another communication device provided in an embodiment of the present disclosure.

[0047] FIG10 is a schematic diagram showing the composition of another communication device provided in an embodiment of the present disclosure.

[0048] FIG11 is a schematic structural diagram of a communication device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

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

[0050] In the description of the present disclosure, 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 there can be three relationships. For example, A and / or B can mean: only A, only B, and A and B. In addition, "at least one" means one or more, and "a plurality" means two or more. Words such as "first" and "second" do not limit the quantity and execution order, and words such as "first" and "second" do not necessarily limit them to be different.

[0051] It should be noted that in this disclosure, words such as "exemplarily" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described in this disclosure as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplarily" or "for example" is intended to present the relevant concepts in a concrete manner.

[0052] Here, the relevant technical terms involved in this disclosure are explained.

[0053] Blockchain technology is the core technology behind digital cryptocurrency systems, represented by Bitcoin. Blockchain is decentralized, flexible, and secure.

[0054] A blockchain typically consists of multiple nodes, all of which work together to maintain the data written to the blockchain ledger. Because writing, deleting, and modifying data within a blockchain node requires consensus across the entire blockchain, a blockchain is a distributed database that is difficult to tamper with.

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

[0056] The consensus algorithm is the mechanism that enables each node in the blockchain system to reach a consensus. Because the blockchain is a distributed system, each node must reach a consensus to determine the node that will execute the new block write.

[0057] In order to improve the accuracy of network coverage verification, the embodiment of the present disclosure provides a method for detecting network coverage, which may include: a third node sends a verification initiation instruction to a first node; the first node sends a verification request to a second node in the communication system, the verification request being 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 a fourth node, and sends the verification information to a 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 disclosure, the method can be combined with blockchain technology to improve the authenticity and effectiveness of the network coverage information verification of each node.

[0058] The method provided by the embodiment of the present disclosure 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., which is not limited in this document. The method provided by the embodiment of the present disclosure is described below using the communication system 10 shown in Figure 1 as an example. Figure 1 is only a schematic diagram and does not constitute a limitation on the applicable scenarios of the technical solution provided by the present disclosure.

[0059] As shown in Figure 1, a schematic diagram of the architecture of a communication system 10 provided in an embodiment of the present disclosure is shown. In Figure 1, the communication system 10 may include multiple communication nodes, such as communication node 101, communication node 102, communication node 103, and communication node 104 in Figure 1.

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

[0061] The communication node provided in the embodiments of the present disclosure may be any device with wireless transceiver functions. For example, it may be a base station or an evolved base station (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. The base station may include various macro base stations, micro base stations, home base stations, wireless remote stations, reconfigurable intelligent surfaces (RISs), routers, wireless fidelity (WIFI) devices, or various access network devices such as primary cells and collaborative cells (secondary cells).

[0062] The terminal in the embodiments of the present disclosure can be any device with wireless transceiver capabilities. For example, the terminal is a handheld device with wireless communication capabilities (such as a mobile phone or tablet), an in-vehicle device, a wearable device, a terminal in an Internet of Things (IoT) system, or a computing device. The terminal may also be referred to as a terminal device or user equipment (UE), which is not limited herein.

[0063] It is understandable that the system architecture shown in FIG1 does not constitute a limitation on the embodiments of the present disclosure, and it may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0064] In some embodiments, the present disclosure also provides a blockchain system, as shown in FIG2 , which may include a coverage verification module, a neighborhood management module, and a blockchain basic module.

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

[0066] Blockchain nodes can publish information to the blockchain network. For example, a base station, as the infrastructure of a communication network, has a fixed geographic location and provides basic resources such as computing, storage, and networking. The network coverage of a base station refers to the coverage of the network provided by the base station. In some embodiments, a blockchain node can issue a certification request to the blockchain network and broadcast it to the entire blockchain network. The certification request includes the base station's network coverage information and may also include information such as the blockchain's geographic location, thereby verifying its own network coverage information through the broadcast certification request.

[0067] The disclosed embodiments can utilize the consensus (proof of coverage, PoC) mechanism of the blockchain to verify the network coverage information of the node through a questioning (or challenge) and proof process. In this verification process, the blockchain nodes that need to be in the blockchain network can serve as the challenger, challenged, consensus group, and witness of the verification process. The following description uses 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.

[0068] The first node, the second node, the third node, and the fourth node are blockchain nodes in the blockchain network. Furthermore, taking the communication system 10 in FIG1 as an example, the first node, the second node, the third node, and the fourth node may be four communication nodes in the communication system 10, such as communication node 101, communication node 102, communication node 103, and communication node 104. Furthermore, the coverage verification module is used to implement the network coverage verification method provided in the embodiments of the present disclosure, completing the network coverage information verification process through different nodes in the blockchain to obtain a verification result. In some embodiments, the coverage verification module may transmit information generated during the verification process to the blockchain basic module. For example, information such as 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.

[0069] The disclosed embodiments can utilize the blockchain's proof of coverage (PoC) mechanism to verify a node's network coverage information through a process of questioning (or challenging) and proving. In this verification process, the first node is the challenger, the second node is the challenged, the third node is the consensus group, and the fourth node is the witness.

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

[0071] The blockchain basic module is used to record the data generated during the challenge process. The blockchain basic module ensures the security and reliability of the network coverage information verification process, ensuring 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 information generated during the verification process, such as the verification process identifier, verification results, verification completion time, the identifier of the first node, the identifier of the second node, the identifier 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.

[0072] The method provided by the present disclosure is described below with reference to the accompanying drawings.

[0073] The present disclosure provides a method for verifying network coverage, as shown in FIG3 , which includes the following steps:

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

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

[0076] In some embodiments, the first node is a communication node that can be trusted for network coverage information in the communication system. For example, as shown in FIG4 , the communication nodes in the communication system may include communication nodes with trusted network coverage information, communication nodes to be verified, communication nodes that failed verification, and communication nodes that successfully verified.

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

[0078] 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.

[0079] 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.

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

[0081] A digital digest can convert a message of any length into a short message of fixed length. It uses a one-way hash function to "digest" the plaintext to be encrypted into a ciphertext string of fixed length (e.g., 128 bits), also known as a digital fingerprint. In some embodiments, the first node can digitally encrypt its public key using a hash algorithm to obtain a digital digest of the first node's public key. It can also digitally encrypt a verification request to obtain a digital digest of the verification request.

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

[0083] 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.

[0084] In some embodiments, the verification request may be encrypted using the public key of the first node and / or the public key of the second node. For example, the first node may first encrypt the verification request using the public key of the first node and then encrypt it using the public key of the second node.

[0085] 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.

[0086] For example, the verification request can also be referred to as a challenge packet. Upon receiving the verification initiation instruction, the challenger (first node) can send an encrypted challenge packet to the challenged (second node). Furthermore, data transmission between the challenger (first node) and the challenged (second node) can be achieved through a blockchain messaging mechanism, such as peer-to-peer (P2P) transmission, to enhance data security.

[0087] In some embodiments, the second node may further decrypt the received verification request using the second node's private key and / or the first node's private key.

[0088] In one example, the second node decrypts the verification request using the second node's private key.

[0089] 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.

[0090] 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.

[0091] 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.

[0092] 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 based on the verification priority of each communication node.

[0093] In one example, 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 successfully verified. In other words, 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 is more likely to select the communication node that failed verification as the second node than the communication node that successfully verified.

[0094] 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.

[0095] It should be noted that after a communication node's network coverage information is successfully verified, the longer the interval between successful verifications, the less reliable the verification result, and therefore the less reliable the communication node's network coverage information. Consequently, the communication node needs to verify its network coverage information again. Therefore, the verification priority of a successfully verified communication node is proportional to the interval between the node's last successful verification.

[0096] In some embodiments, the verification priority of a communication node that fails verification is proportional to the duration between the communication node's last successful verification. Similarly, after a communication node fails network coverage information verification, the longer the duration between previous verification failures, the less reliable the verification result, meaning the more likely the communication node needs to re-verify its network coverage information.

[0097] In some embodiments, each communication node in a blockchain network may also have a credibility, which is used to characterize the likelihood that the network coverage information of the communication node is valid. The higher the credibility of a communication node, the lower its verification priority. It should be understood that the credibility of a communication node to be verified is lower than that of a communication node that failed verification, and the credibility of a communication node that failed verification is lower than that of a communication node that successfully verified. In addition, the credibility of each communication node is inversely proportional to the duration of the last successful verification of the communication node. Exemplarily, a node management function module can be set up in the blockchain system to dynamically maintain the credibility of each communication node, so that the network coverage information verification process can be periodically initiated for the communication node.

[0098] It should be noted that in this blockchain network, a communication node that is trusted based on network coverage information can first verify the communication node it selects to be verified. Then, through this inquiry (or challenge) and proof mechanism, the network coverage of other communication nodes can be further verified. This iteration allows verification of network coverage information for each of the communication nodes to be verified, the communication nodes that failed verification, and the communication nodes that successfully verified. Furthermore, for nodes that take a long time to verify, re-verification can be performed. In this way, dynamic maintenance of the verification and trustworthiness 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.

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

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

[0101] 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.

[0102] 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 be a communication node whose network coverage information has been successfully verified in the communication system. The fourth node may be referred to as a witness in the challenge process and may witness or verify the challenge process (network coverage information verification process) based on a request from the challenged (second node).

[0103] In some embodiments, there may be multiple fourth nodes. That is, the first node may receive verification information sent by multiple fourth nodes. As shown in Figure 5, the fourth nodes may include fourth node 1, fourth node 2, ..., fourth node n, where n is a positive integer. The second node may send beacon signals to fourth node 1, fourth node 2, ..., fourth node n, respectively. Furthermore, the first node may receive verification information sent by fourth node 1, fourth node 2, ..., fourth node n, respectively, where n is a positive integer. In some embodiments, the first node and the fourth node may also implement data transmission through the blockchain's message mechanism, for example, transmitting the verification information through P2P transmission to enhance data security.

[0104] 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 neighboring area of ​​the second node. Exemplarily, the fourth node may be determined based on the neighboring area TCI of the second node.

[0105] 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, send a beacon signal to the communication node (fourth node) in the neighbor relationship list, and then the fourth node can receive the beacon signal and 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.

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

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

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

[0109] 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.

[0110] The fourth node may digitally encrypt the verification information based on a hash algorithm to obtain a digital digest of the verification information. Furthermore, the fourth node identifier is used to uniquely identify the fourth node. For example, the fourth node identifier may be the fourth node's IP address, name, number within the communication system, identity certificate, or other information that can identify the fourth node.

[0111] In some embodiments, the fourth node may encrypt the verification information using 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 further, when sending the verification information, may encrypt the verification information using the public key of the first node.

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

[0113] Accordingly, the third node can receive the verification information sent by the first node.

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

[0115] 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 the private key of the first node. The third node may then decrypt the verification information using the private key of the first node to obtain decrypted verification information.

[0116] 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.

[0117] 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.

[0118] 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.

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

[0120] 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.

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

[0122] 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 belonging to the target cell in the neighboring area of ​​the second node. Furthermore, the measurement parameter includes at least one of the following: RSRP, RSSI, SINR, throughput, and QoE.

[0123] Exemplarily, the preset condition may be determined by a combination of one or more parameters in the above-mentioned network coverage quality parameter and the network coverage range parameter. For example, the preset condition may be 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 parameter in the above-mentioned network coverage quality parameter or the network coverage range parameter. Alternatively, the preset condition may be that 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 parameter or the network coverage range parameter.

[0124] In addition, the judgment of the verification results can also be achieved in other possible ways, such as performing multi-parameter comprehensive judgment through artificial intelligence algorithms.

[0125] In one example, in actual application, the consensus group (i.e., the third node) can select a trusted base station set by a specific operator as an example. The third node can select a trusted base station set by a specific operator as the challenger (i.e., 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 specific operator whose network coverage information has been successfully verified can also be used as a witness (i.e., the fourth node). If there is a fourth node in the neighbor list TCI of the second node, the verification is successful.

[0126] In another example, the consensus group (i.e., the third node) can select a trusted base station set by a specific operator as an example. The third node can select a trusted base station set by a specific operator as the challenger (i.e., 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 non-specific operator whose network coverage information has been successfully verified can be used as a witness (i.e., the fourth node). In this way, the scope of coverage verification can be expanded through the relevant base stations of the non-specific operator.

[0127] Furthermore, if there are not enough nearby base stations that have successfully verified as witnesses (i.e., fourth nodes), or if the location information is incorrect, verification fails. In this case, the number of fourth nodes that meet the verification requirements may be zero.

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

[0129] It should be noted that, upon completion of verification, the verification results of the second node can be “uploaded” to the blockchain, meaning recorded in a new block created by the third node in the blockchain. Whether the verification is successful or unsuccessful, the verification results must be “uploaded” to the blockchain. Furthermore, the “uploaded” content may also include information generated during the verification process, such as the verification process identifier, verification completion time, the identifier of the first node, the identifier of the second node, the identifier of the fourth node, the location information of the fourth node, the number of fourth nodes that meet the verification requirements, and measurement parameters obtained by measuring the beacon signal of the second node.

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

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

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

[0133] Based on the methods provided by the embodiments of this disclosure, blockchain technology can be combined to verify network coverage for nodes in a co-built and shared network through challenge verification within the blockchain. This can improve the authenticity and effectiveness of network coverage information verification for each node. Furthermore, the present disclosure eliminates the need for additional external information during the verification process, reducing the complexity and overhead of network coverage verification.

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

[0135] In some embodiments, as shown in FIG6 , before step S101 , the network coverage verification method may further include the following steps:

[0136] 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.

[0137] Accordingly, the first node may receive the verification initiation instruction sent by the third node.

[0138] In some embodiments, the third node may also be a communication node whose network coverage information is trustworthy in the communication system. Furthermore, the third node may determine the first node from among the communication nodes whose network coverage information is trustworthy in the communication system.

[0139] It should be noted that the disclosed embodiments can utilize the consensus mechanism of the blockchain to verify the network coverage information of the node through a query (or challenge) and proof process. The third node mentioned above can also be called the consensus group of this process. It can select the first node, also known as the challenger, in the communication system and send a verification initiation instruction to the first node to initiate the query (or challenge) and proof process of the node's network coverage information in the blockchain.

[0140] When a network coverage verification process needs to be initiated, a third node can be randomly selected from communication nodes in the communication system whose network coverage information is trustworthy. For example, based on the challenge mechanism of the blockchain network, the third node can also be called a consensus group, and the third node can be different for each network coverage verification process.

[0141] 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.

[0142] In some embodiments, the third node may also create an identifier for the verification process. Accordingly, the verification initiation instruction may also include the identifier for the verification process.

[0143] The identifier of the verification process is used to uniquely identify this verification process. For example, 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.

[0144] In some embodiments, the third node may also create a new block in the blockchain network, that is, the third node may implement the blockchain's "block generation" function. This new block is used to record the information generated during the verification process. For example, the third node may create the new block when sending a verification initiation instruction, or the third node may initiate the new block before sending the verification initiation instruction, although this disclosure is not limited to this.

[0145] 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.

[0146] In some embodiments, the information generated during the verification process includes: an identifier of the verification process, verification results, 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.

[0147] For example, the verification result may include success or failure of verification of the network coverage information of the second node. The fourth node that meets the verification requirement may be the fourth node in the neighbor relationship list of the second node.

[0148] The above mainly introduces the solution provided by the present disclosure from the perspective of the 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 the execution of each function in order to realize the above functions. It should be easy for those skilled in the art to realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in a hardware or computer software driven hardware manner 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 be beyond the scope of the present disclosure.

[0149] FIG7 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure. As shown in FIG7 , 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.

[0150] In some embodiments, a sending unit 701 is configured to send a verification request to a second node in a communication system, the verification request being configured to verify whether the network coverage information of the second node is valid. A receiving unit 702 is configured to receive verification information of the second node sent by a fourth node. The sending unit 701 is further configured to send the verification information to a third node.

[0151] 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.

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

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

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

[0155] 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.

[0156] In some embodiments, the verification information is encrypted using the public key of the first node.

[0157] In some embodiments, the receiving unit 702 may be configured to receive verification information of the second node sent by the fourth node via a point-to-point transmission (P2P) manner.

[0158] 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.

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

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

[0161] 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.

[0162] In some embodiments, the receiving unit 702 is further configured 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.

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

[0164] 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 with the private key of the first node to obtain a first data packet. The sending unit 701 may be configured to send the first data packet to the third node.

[0165] 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 and will not be repeated here.

[0166] FIG8 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure. As shown in FIG8 , the communication device 80 is applied to a 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.

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

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

[0169] 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.

[0170] 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.

[0171] 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 and will not be repeated here.

[0172] FIG9 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure. As shown in FIG9 , 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 .

[0173] In some embodiments, a sending unit 901 is configured to send a verification initiation instruction to a first node; the verification initiation instruction is configured to instruct the first node to send a verification request, wherein the verification request is configured to verify whether the network coverage information of the second node is valid. A receiving unit 902 is configured to receive the verification information sent by the first node. A processing unit 903 is configured to determine whether the network coverage information of the second node is valid based on the verification information.

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

[0175] In some embodiments, the receiving unit 902 may be configured to: receive a first data packet, where the first data packet includes verification information and a private key of the first node.

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

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

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

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

[0180] 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.

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

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

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

[0184] In some embodiments, the information generated during the verification process includes: an identifier of the verification process, verification results, 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.

[0185] 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 and a description of the beneficial effects, please refer to the above-mentioned corresponding method embodiment part, which will not be repeated here.

[0186] FIG10 is a schematic diagram showing the composition of a communication device provided by an embodiment of the present disclosure. As shown in FIG10 , 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.

[0187] 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.

[0188] 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 indicator RSSI, and a signal to interference plus noise ratio SINR obtained by measuring the beacon signal.

[0189] 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.

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

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

[0192] 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 and a description of the beneficial effects, please refer to the above-mentioned corresponding method embodiment part, which will not be repeated here.

[0193] It should be noted that the units in Figures 7 to 10 may also be referred to as modules. For example, the sending unit may be referred to as a sending module. In addition, in the embodiments shown in Figures 7 to 10, the names of the units may not be those shown in the figures. For example, the sending unit may be referred to as a communication unit, and the receiving unit may be referred to as a communication unit.

[0194] If the various units in Figures 7 to 10 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present disclosure 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 for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the various embodiments of the present disclosure. The storage medium for storing computer software products includes: various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

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

[0196] Processor 1102 may be a logical block, module, or circuit that implements or executes the various examples described in conjunction with the present disclosure. 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 device, a transistor logic device, a hardware component, or any combination thereof. Processor 1102 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, or a combination of a DSP and a microprocessor.

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

[0198] The memory 1101 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device 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 code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.

[0199] As a possible implementation, the memory 1101 may exist independently of the processor 1102. 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 method provided in the embodiment of the present disclosure can be implemented.

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

[0201] Bus 1104 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 1104 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG11 shows only one thick line, but this does not mean that there is only one bus or only one type of bus.

[0202] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and conciseness of the description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be allocated to be completed by 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.

[0203] The present disclosure also provides a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium). All or part of the processes in the above-mentioned method embodiments can be completed by computer instructions to the relevant hardware, and the program can be stored in the above-mentioned computer-readable storage medium. When the program is executed, it can include the processes of the above-mentioned method embodiments. The computer-readable storage medium can be the memory of the device or apparatus of any of the aforementioned embodiments. The above-mentioned computer-readable storage medium can also be an external storage device of the above-mentioned device or apparatus, 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-mentioned device or apparatus. Further, the above-mentioned computer-readable storage medium can also include both the internal storage unit of the above-mentioned device or apparatus and an external storage device. The above-mentioned computer-readable storage medium is used to store the above-mentioned computer program and other programs and data required by the above-mentioned device or apparatus. The above-mentioned computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0204] The embodiments of the present disclosure further provide 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.

[0205] Although the present disclosure is described herein in conjunction with various embodiments, in the process of implementing the disclosure for which protection is sought, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing 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 components. A single processor or other unit may 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.

[0206] Although the present disclosure has been described with reference to specific features and embodiments thereof, it will be apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present disclosure. Accordingly, this specification and the drawings are merely illustrative of the present disclosure as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. It will be apparent that those skilled in the art may make various modifications and variations to the present disclosure without departing from the spirit and scope of the present disclosure. Thus, the present disclosure is intended to encompass such modifications and variations as would fall within the scope of the claims of the present disclosure and their equivalents.

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

Claims

1. A method for verifying network coverage, the method being applied to a first node in a communication system, the method comprising: 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, wherein: 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, wherein: 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, wherein: 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, wherein: 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, wherein: 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, wherein: The verification information is encrypted by the public key of the first node.

8. The method according to claim 1, wherein: 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, wherein: 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, further comprising: 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, wherein: The verification priority of the communication node to be verified is higher than the verification priority of the communication node that failed verification, and the verification priority of the communication node that failed verification is higher than the verification priority of the communication node that succeeded verification.

12. The method according to claim 10, wherein: 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, further comprising: 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, wherein: 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, wherein: 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, the method being applied to a third node in a communication system, the method comprising: 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, where 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, further comprising: 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, wherein: 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, further comprising: The verification information is decrypted using the private key of the first node.

20. The method according to claim 16, wherein: 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, further comprising: The second node is determined as a communication node that has successfully been verified.

22. The method according to claim 20, wherein: 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, wherein: 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, wherein: 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.

25. The method of claim 20, further comprising: 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, further comprising: The verification result of the second node is recorded in the new block.

27. The method according to claim 26, wherein: 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, the method being applied to a second node of a communication system, the method comprising: 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, further comprising: The verification request is decrypted using the private key of the second node.

30. The method of claim 29, wherein: 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 of claim 28, further comprising: 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, the method being applied to a fourth node of a communication system, the method comprising: receiving a beacon signal sent by a second node; Based on the beacon signal, sending verification information to the first node; The verification information includes measurement parameters of the beacon signal.

33. The method of claim 32, wherein: 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 of claim 32, wherein: 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 of claim 32, further comprising: Receive the public key of the first node sent by the first node.

36. The method of claim 35, further comprising: The verification information is encrypted using the public key of the first node.

37. A communication device, comprising: 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, wherein: 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