WO2020125398A1 - 极大覆盖分群方法、装置及网络节点 - Google Patents

极大覆盖分群方法、装置及网络节点 Download PDF

Info

Publication number
WO2020125398A1
WO2020125398A1 PCT/CN2019/122630 CN2019122630W WO2020125398A1 WO 2020125398 A1 WO2020125398 A1 WO 2020125398A1 CN 2019122630 W CN2019122630 W CN 2019122630W WO 2020125398 A1 WO2020125398 A1 WO 2020125398A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
coverage
information
broadcast
ranging
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2019/122630
Other languages
English (en)
French (fr)
Inventor
李忠孝
刘刚
王金乐
方婧华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Academy of Telecommunications Technology CATT
Original Assignee
China Academy of Telecommunications Technology CATT
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Academy of Telecommunications Technology CATT filed Critical China Academy of Telecommunications Technology CATT
Publication of WO2020125398A1 publication Critical patent/WO2020125398A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S11/00—Systems for determining distance or velocity not using reflection or reradiation
    • G01S11/02—Systems for determining distance or velocity not using reflection or reradiation using radio waves
    • G01S11/06—Systems for determining distance or velocity not using reflection or reradiation using radio waves using intensity measurements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the present disclosure relates to the field of communication technology, and in particular to a method, device and network node for extreme coverage grouping.
  • the wireless ad hoc network integrates technologies such as mobile wireless communication and computer network. It can quickly and automatically network without relying on the preset communication infrastructure. It has self-organizing, self-healing, centerless, and multi-hop routing. And high invulnerability and other characteristics, suitable for sudden, temporary emergency communication occasions. Using the multi-hop forwarding and self-organization features of the Adhoc network can improve the maintenance flexibility and robustness of the network organization.
  • planar Adhoc network has poor scalability.
  • An effective method to solve the scalability problem of the ad hoc network is to build a hierarchical network topology through grouping.
  • the basic idea of grouping is to divide the network nodes into several groups according to geographical proximity. Groups provide a small logical organization for the network, making the network easy to manage.
  • the set of nodes in the group can share channel resources, and the group can facilitate the spatial multiplexing of time slots and spreading codes, thereby improving channel throughput.
  • the important node forming the network grouping structure is the cluster-head, which is responsible for establishing the grouping and maintaining the network topology.
  • the set of group heads is called a dominating set (Dominating Set, DS), which communicates between groups through a direct view (LOS) link or gateway (Gateway) forwarding, and the set of interconnected dominant nodes is also called a connected dominating set ( Connected Dominated Set (CDS).
  • Dominating Set DS
  • LOS direct view
  • Gateway gateway
  • CDS Connected Dominated Set
  • the problem of minimum connected dominating set is a non-deterministic (NP-hard) problem.
  • Ad hoc network grouping uses heuristic algorithm for grouping. According to the different principles of group leader selection, it can be divided into minimum ID priority, maximum connection priority, and maximum weight priority algorithm.
  • minimum ID first algorithm the node with a smaller ID is more likely to be called a group leader than other nodes, and the algorithm lacks fairness.
  • the maximum connection priority algorithm uses the connection degree as a heuristic to select the first node of the group, and the load balance is poor. It cannot comprehensively consider the needs of the network in terms of stability and scalability.
  • the weight-based clustering algorithm comprehensively considers the stability factors of the system such as the node degree and mobility of the system to ensure more reliable performance of the network. The selection of weights is extremely subjective, which reduces the practicality of the algorithm.
  • the grouping technology in the related art usually assumes that each node in the network has the same communication coverage and cannot distinguish the communication capabilities of the nodes.
  • the generated grouping structure can only cover a limited communication distance and cannot be applied to the wireless heterogeneity formed by multiple types of nodes The internet.
  • the purpose of the present disclosure is to provide a method, device and network node for maximum coverage grouping to solve the grouping problem of wireless heterogeneous networks formed by multiple types of nodes in the related art.
  • an embodiment of the present disclosure provides a method of maximum coverage grouping, which is applied to the first node of an ad hoc network and includes:
  • a group head node is selected to form a maximum coverage sub-group.
  • the method before the coverage capability information of the first node is determined and broadcast, the method further includes:
  • the ranging information at least includes: a ranging signal;
  • the coverage status information of the first node and the second node broadcasted by the second node based on the ranging information at least including: the relative distance between the second node and the first node and the second node and the first node Link status indication between nodes.
  • determining the coverage capability information of the first node including;
  • the coverage capability information of the first node is determined.
  • the determining the coverage capability information of the first node according to the coverage status information of the first node and the second node broadcast by the second node includes:
  • the coverage capability information of the first node is determined.
  • determining coverage weights of the second node relative to the first node respectively includes:
  • the first formula is:
  • CW uv is the coverage weight of the second node relative to the first node
  • DRC uv is the relative distance between the second node and the first node
  • LQI uv is the link status indicator between the second node and the first node
  • W 1 and w 2 are the influencing factors of the coverage weights.
  • the coverage capability information includes: coverage capability value;
  • the determining coverage information of the first node according to the coverage weight includes:
  • the maximum adjacency coverage criterion determine the maximum coverage weight value as the coverage capability value of the first node
  • the coverage weights are integrated, and the integrated value obtained by integration is determined as the coverage capability value of the first node.
  • the determining coverage information of the first node includes:
  • the first node's coverage capability information is determined according to the first node's coverage status information for the second node, the first node's node remaining energy indicator, and the first node's node intention.
  • the acquiring the coverage status information of the first node for the second node broadcasted by the second node based on the ranging information includes:
  • P is an integer greater than or equal to 1.
  • the termination condition of the P-hop broadcast mechanism includes any of the following:
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • selecting the group leader node according to the coverage capability information of the first node and the coverage capability information of the second node includes:
  • the coverage capability information of the first node and the coverage capability information of the second node select the node with the largest coverage capability as the candidate group leader node;
  • the alternative indication information is used To instruct the first node to select the candidate group head node as the candidate group head; P is an integer greater than or equal to 1;
  • the node selected as the candidate group head node with the highest number of times is the group head node.
  • the method further includes:
  • a group head confirmation message is sent to the nodes that select the first node as the group head node; where the first node and the node that selects the first node as the group head node form a maximum coverage subgroup.
  • An embodiment of the present disclosure also provides a method for maximal coverage grouping, which is applied to the second node of the ad hoc network and includes:
  • the ranging information at least includes: a ranging signal
  • the coverage status information of the first node to the second node is determined.
  • the coverage status information at least includes: the relative distance between the second node and the first node and the distance between the second node and the first node Link status indication;
  • determining the coverage status information of the first node to the second node according to the ranging information includes:
  • DRC uv is the relative distance between the second node and the first node
  • Dist(u,v) is the absolute distance between the second node and the first node
  • D o is the standard coverage distance, which is used to normalize the absolute distance Chemical operation
  • the filter calculation formula of the sliding filter is:
  • LQI uv (n) is the link status indicator between the second node and the first node; k is the order of the sliding filter; n is the discrete time point; i is the sampling time point of the sliding filter.
  • broadcasting the coverage status information of the first node to the second node includes:
  • a P-hop broadcast mechanism is used to forward the coverage status information through at most P intermediate nodes; where P is an integer greater than or equal to 1;
  • the termination condition of the P-hop broadcast mechanism includes any of the following:
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • An embodiment of the present disclosure also provides a network node.
  • the network node is a first node of an ad hoc network.
  • the network node includes: a transceiver, a memory, a processor, and stored on the memory.
  • a program running on a processor, the processor is used to determine coverage capability information of the first node;
  • the transceiver is used to broadcast coverage information of the first node; acquiring coverage information of the second node broadcast by the second node;
  • the processor is further configured to select a group head node according to the coverage capability information of the first node and the coverage capability information of the second node to form a maximum coverage sub-group.
  • the transceiver is also used for:
  • the ranging information at least includes: a ranging signal;
  • the coverage status information of the first node and the second node broadcasted by the second node based on the ranging information at least including: the relative distance between the second node and the first node and the second node and the first node Link status indication between nodes.
  • the processor is also used for:
  • the coverage capability information of the first node is determined.
  • the processor is also used for:
  • the coverage capability information of the first node is determined.
  • the processor is also used for:
  • the first formula is:
  • CW uv is the coverage weight of the second node relative to the first node
  • DRC uv is the relative distance between the second node and the first node
  • LQI uv is the link status indicator between the second node and the first node
  • W 1 and w 2 are the influencing factors of the coverage weights.
  • the coverage capability information includes: coverage capability value;
  • the processor is also used to:
  • the maximum adjacency coverage criterion determine the maximum coverage weight value as the coverage capability value of the first node
  • the coverage weights are integrated, and the integrated value obtained by integration is determined as the coverage capability value of the first node.
  • the processor is also used for:
  • the first node's coverage capability information is determined according to the first node's coverage status information for the second node, the first node's node remaining energy indicator, and the first node's node intention.
  • the transceiver is also used for:
  • P is an integer greater than or equal to 1.
  • the termination condition of the P-hop broadcast mechanism includes any of the following:
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • the processor is also used for:
  • the coverage capability information of the first node and the coverage capability information of the second node select the node with the largest coverage capability as the candidate group leader node;
  • the alternative indication information is used To instruct the first node to select the candidate group head node as the candidate group head; P is an integer greater than or equal to 1;
  • the node selected as the candidate group head node with the highest number of times is the group head node.
  • the processor is also used to:
  • a group head confirmation message is sent to the nodes that select the first node as the group head node; where the first node and the node that selects the first node as the group head node form a maximum coverage subgroup.
  • An embodiment of the present disclosure also provides a device for maximum coverage grouping, which is applied to the first node of an ad hoc network and includes:
  • a first broadcasting module used to determine and broadcast the coverage information of the first node
  • a second information acquisition module configured to acquire coverage information of the second node broadcast by the second node
  • the grouping module is used to select a group head node according to the coverage capability information of the first node and the coverage capability information of the second node to form a maximum coverage grouping.
  • An embodiment of the present disclosure also provides a network node.
  • the network node is a second node of an ad hoc network.
  • the network node includes: a transceiver, a memory, a processor, and stored on the memory and can be processed in the A program running on the device, the transceiver is used to receive ranging information broadcast by the first node, and the ranging information includes at least a ranging signal;
  • the processor is used to read the program in the memory and perform the following process: according to the ranging information, determine the coverage status information of the first node to the second node, the coverage status information includes at least: the second node and the first Node relative distance of the node and link status indication between the second node and the first node;
  • the transceiver is also used to broadcast the coverage status information of the first node to the second node.
  • the processor is also used for:
  • DRC uv is the relative distance between the second node and the first node
  • Dist(u,v) is the absolute distance between the second node and the first node
  • D o is the standard coverage distance, which is used to normalize the absolute distance Chemical operation
  • the filter calculation formula of the sliding filter is:
  • LQI uv (n) is the link status indicator between the second node and the first node; k is the order of the sliding filter; n is the discrete time point; i is the sampling time point of the sliding filter.
  • the transceiver is also used for:
  • a P-hop broadcast mechanism is used to forward the coverage status information through at most P intermediate nodes; where P is an integer greater than or equal to 1;
  • the termination condition of the P-hop broadcast mechanism includes any of the following:
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • An embodiment of the present disclosure also provides a device for maximum coverage grouping, which is applied to the second node of the ad hoc network and includes:
  • the first receiving module is configured to receive ranging information broadcast by the first node, and the ranging information at least includes: a ranging signal;
  • a second determining module configured to determine the coverage status information of the first node with respect to the second node according to the ranging information, the coverage status information at least including: the relative distance between the second node and the first node and the second node Link status indication with the first node;
  • the second broadcast module is used to broadcast the coverage status information of the first node to the second node.
  • Embodiments of the present disclosure also provide a computer-readable storage medium that stores a computer program on the computer-readable storage medium, and when the computer program is executed by a processor, implements the steps of the above-described maximum coverage grouping method.
  • the group head node with the maximum coverage is selected through the exchange of the coverage status information of the nodes and the calculation of the coverage capability information, and then the wireless backbone network with the maximum coverage with the least hop is formed In order to realize the effective use of the nodes with high communication capabilities in the wireless heterogeneous network, and realize the optimal grouping of the wireless heterogeneous network.
  • FIG. 1 shows one of the schematic flowcharts of the steps of the maximum coverage grouping method provided by an embodiment of the present disclosure
  • FIG. 2 shows a second schematic flowchart of the steps of the maximum coverage grouping method provided by an embodiment of the present disclosure
  • FIG. 3 shows a step flowchart of a specific example of a maximum coverage grouping method provided by an embodiment of the present disclosure
  • FIG. 4 shows a schematic structural diagram of a network node provided by an embodiment of the present disclosure
  • FIG. 5 shows one of the structural schematic diagrams of the maximum coverage grouping device provided by the embodiment of the present disclosure
  • FIG. 6 shows a second structural schematic diagram of a maximum coverage grouping device provided by an embodiment of the present disclosure.
  • an embodiment of the present disclosure provides a maximum coverage grouping method, which is applied to the first node of an ad hoc network and includes:
  • Step 11 Determine and broadcast the coverage information of the first node
  • Step 12 Obtain the coverage capability information of the second node broadcast by the second node. It should be noted that the second node determines the coverage capability information of the second node in the same manner as the first node. The following describes the first node as an example No more details about the manner in which the second node determines the coverage capability information.
  • Step 13 According to the coverage capability information of the first node and the coverage capability information of the second node, a group head node is selected to form a maximum coverage sub-group.
  • the first node is any on-network node in the ad hoc network
  • the second node is a neighbor node of the first node
  • the first node has at least one neighbor node, that is, the second node is specifically at least one node , Broadcast communication between the first node and the second node.
  • the maximum coverage grouping method provided by the embodiment of the present disclosure is specifically a coverage-first grouping method, which can solve the problem of generating a connectivity dominating set of a heterogeneous interconnection network.
  • the ad hoc network involved in the embodiments of the present disclosure is an ad hoc network including multiple types of nodes; wherein, for example, the multiple types of nodes may be: ground vehicle nodes, ground walking nodes, and lift-off nodes.
  • a wireless backbone network is formed by selecting a node with maximum coverage capability as a group head and a backbone network node, which can provide a wide range of communication coverage with as few hops as possible; at the same time, a maximum coverage group head can provide Multi-hop coverage within the group effectively increases the node capacity within the group.
  • the method provided by the embodiment of the present disclosure further includes:
  • the ranging information is broadcasted periodically or based on an event trigger mechanism.
  • the ranging information at least includes: ranging signals; the ranging information may further include: a node ID number of the first node and other extended information.
  • the coverage status information Acquiring the coverage status information of the first node and the second node broadcasted by the second node based on the ranging information, the coverage status information at least including: the relative distance between the second node and the first node and the second node and the first node Link status indication between nodes.
  • the coverage status information may further include: the node ID number of the second node.
  • the above steps constitute the neighbor discovery process of the first node.
  • the neighbor state information table maintained by the node tends to be stable.
  • the neighbor state information table includes: coverage state information broadcast by multiple second nodes. For example, as shown in Table 1 is the neighbor state information table.
  • Node ID number 1 Node relative distance Link status indication
  • Node ID number 2 Node relative distance Link status indication ... ... ...
  • Node ID number n Node relative distance Link status indication
  • Ad-hoc networks use periodic or event-triggered mechanisms to broadcast coverage status information for other nodes to perform neighbor cell discovery and neighbor cell status information maintenance. Wherein, each node in the network of the ad hoc network can obtain coverage status information based on the measurement of the ranging information of other nodes.
  • the event trigger mechanism includes any of the following: node activation, node passivation, link activation, and link interruption.
  • the coverage state information includes at least: a distance between the second node and the first node (Distance of Relative Coverage, DRC), and a link state indicator (Link Quality) Indicator between the second node and the first node (LQI).
  • the coverage status information may further include: the node ID number of the second node.
  • step 11 in the above embodiment of the present disclosure includes:
  • the coverage capability information of the first node is determined.
  • the second node In order to complete the coverage estimation of the first node (also called the sending node), the second node (also called the receiving node) needs to feed back the node's relative distance and link status indication to the first node, but the weak coverage ability The second node may not be able to directly implement feedback information transmission using line-of-sight communication.
  • the acquiring the coverage status information of the first node for the second node broadcasted by the second node based on the ranging information includes:
  • P is an integer greater than or equal to 1.
  • line-of-sight communication means is directly used to directly feed back coverage state information to the first node, and no description will be made here.
  • the P-hop broadcast mechanism in the embodiment of the present disclosure adopts the principle of limited flooding, and uses the destination node ID number (Dest ID, namely the ID number of the first node) and TTL as the P-hop broadcast termination conditions, that is, the P-hop broadcast mechanism Termination conditions include any of the following:
  • the ID of the forwarded node is equal to the ID of the first node
  • Time-to-live is decremented by 1 as the step size according to the number of forwarding hops.
  • TTL is decremented by 1 as the step size according to the number of forwarding hops.
  • the above P-hop broadcast mechanism uses the principle of limiting flooding, which can prevent the broadcast storm problem caused by a large-scale multi-hop broadcast, and can also record the optimal multi-hop path from the receiving node to the sending node during the multi-hop transmission process. This simplifies the process of establishing multi-hop routes for nodes within the group.
  • the determining the coverage capability information of the first node according to the coverage status information of the first node and the second node broadcast by the second node includes:
  • the coverage capability information of the first node is determined.
  • the first node may calculate the coverage weight (CW) of each second node relative to the first node.
  • the calculation method is as follows: according to the coverage status information, determining the coverage weight of the second node relative to the first node includes:
  • the first formula is:
  • CW uv is the coverage weight of the second node relative to the first node
  • DRC uv is the relative distance between the second node and the first node
  • LQI uv is the link status indicator between the second node and the first node
  • W 1 and w 2 are the influencing factors of the coverage weights.
  • v ⁇ N(u) indicates that node v (ie, the second node) is any neighboring node of node u (ie, the first node); lg(LQI uv ) is the coverage quality of the second node.
  • the second node's coverage weight set ⁇ CW uv ⁇ can be used to estimate the coverage capability (CCu) of the first node, which is used to effectively characterize the coverage capability of the first node.
  • the embodiments of the present disclosure provide two coverage capacity estimation criteria: maximum adjacency coverage criterion and maximum connected coverage criterion.
  • the coverage capability information includes: a coverage capability value; and determining the coverage capability information of the first node according to the coverage weight value includes:
  • determining coverage information of the first node in step 11 includes:
  • the first node's coverage capability information is determined according to the first node's coverage status information for the second node, the first node's node remaining energy indicator, and the first node's node intention.
  • the node's coverage capacity estimation may also consider factors such as node residual energy indicator (Residual Energy Indicator, REI) and node willingness (Willingness), and adopt a linear weighting method for comprehensive estimation, so as to be more comprehensive
  • REI residual Energy indicator
  • the remaining energy indicator (REI) can be used to indicate the remaining energy in the form of an absolute value or a percentage.
  • step 13 includes:
  • the coverage capability information of the first node and the coverage capability information of the second node select the node with the largest coverage capability as the candidate group leader node;
  • the alternative indication information is used To instruct the first node to select the candidate group head node as the candidate group head; P is an integer greater than or equal to 1;
  • the node selected as the candidate group head node with the highest number of times is the group head node.
  • the nodes on the network After the nodes on the network complete their own estimation of their coverage capabilities, the nodes broadcast their own coverage capabilities, and each node adopts a distributed algorithm to select the group leader node.
  • the node After the selection of the candidate group head node is completed, the node broadcasts the selected group head node to the surrounding nodes, and uses the P-hop broadcast mechanism to broadcast the group leader candidate information until the candidate group head node is reached. Within the P-hop range, the candidate group head node that receives the most recommendations is called the group head node.
  • the method further includes:
  • a group head confirmation message is sent to the nodes that select the first node as the group head node; where the first node and the node that selects the first node as the group head node form a maximum coverage subgroup.
  • the group head node After a certain node is selected as the group head node, the group head node confirms its own group head identity through a single-hop broadcast mechanism. At the same time, other nodes within its coverage area are confirmed as ordinary nodes within its cluster. For example, if node u's neighbor node v selects node u as the group leader, then node v will broadcast the message of selecting node u to the network. After node u receives this message, it knows that node v has selected itself as the group First, then node u will unicast to node v group leader confirmation message.
  • nodes at the intersection of multiple maximum coverage groupings declare their gateway roles.
  • the topological connection between the group heads and gateways that greatly cover the sub-groups forms a backbone network.
  • the above wireless backbone network can achieve a very wide range of communication coverage with as few hops as possible.
  • the above embodiments of the present disclosure select the group head node with the largest coverage through the exchange of the coverage state information of the nodes and the calculation of the coverage capability information, and then form a wireless backbone network with the greatest coverage with the least hops, thereby realizing a wireless heterogeneous network
  • the effective use of the nodes with high communication capability realizes the optimal grouping of wireless heterogeneous networks.
  • an embodiment of the present disclosure also provides a maximum coverage grouping method, which is applied to the second node of the ad hoc network and includes:
  • Step 21 Receive ranging information broadcast by the first node.
  • the ranging information includes at least a ranging signal; the ranging information may further include: a node ID number of the first node and other extended information.
  • Step 22 According to the ranging information, determine the coverage status information of the first node to the second node, the coverage status information at least includes: the relative distance between the second node and the first node and the second node and the first node Link status indication; coverage status information may also include: the node ID number of the second node.
  • Step 23 Broadcast the coverage status information of the first node to the second node.
  • Table 2 is an example of the format of the ranging information.
  • the maximum coverage grouping method provided by the embodiment of the present disclosure is specifically a coverage-first grouping method, which can solve the problem of generating a connectivity dominating set of a heterogeneous interconnection network.
  • the ad hoc network involved in the embodiments of the present disclosure is an ad hoc network including multiple types of nodes; wherein, for example, the multiple types of nodes may be: ground vehicle nodes, ground walking nodes, and lift-off nodes.
  • the second node is any on-network node in the ad hoc network
  • the first node is a neighboring node of the first node
  • the first node and the second node communicate via broadcast.
  • the nodes in the ad hoc network broadcast their measurements to obtain coverage status information for other nodes to perform neighbor cell discovery and neighbor cell status information maintenance.
  • each node in the network of the ad hoc network can obtain coverage status information based on the measurement of the ranging information of other nodes.
  • step 22 includes:
  • DRC uv is the relative distance between the second node and the first node
  • Dist(u,v) is the absolute distance between the second node and the first node
  • D o is the standard coverage distance, which is used to normalize the absolute distance operation
  • D o values may be performed (e.g. 1km), absolute distance normalization operation according to the design specifications.
  • the filter calculation formula of the sliding filter is:
  • LQI uv (n) is the link status indicator between the second node and the first node; k is the order of the sliding filter; n is the discrete time point; i is the sampling time point of the sliding filter.
  • the calculation of the above DRC uv and LQI uv (n) does not limit the order, for example, the node that receives the broadcast of the coverage status information of the neighboring node first measures the quality of the received signal (RSSI), and uses the sliding filtering method to perform Link quality calculation (LQI); then use some kind of one-way ranging technology (such as DOR) adapted to the ranging signal to measure the distance between nodes, and then analyze other fields of node status information, including node ID number and other extensions information.
  • RSSI quality of the received signal
  • LQI Link quality calculation
  • Link State Indication is used to characterize the link quality over a period of time.
  • Algorithms such as moving average and median filtering can be used to filter the RSSI of the received signal strength indicator to form a stable prediction of the link state.
  • step 23 includes:
  • a P-hop broadcast mechanism is used to forward the coverage status information through at most P intermediate nodes; where P is an integer greater than or equal to 1;
  • the P-hop broadcast mechanism in the embodiment of the present disclosure adopts the principle of limited flooding, and uses the destination node ID number (Dest ID, namely the ID number of the first node) and TTL as the P-hop broadcast termination conditions, that is, the P-hop broadcast mechanism Termination conditions include any of the following:
  • the ID of the forwarded node is equal to the ID of the first node
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • line-of-sight communication means is directly used to directly feed back coverage state information to the first node, and no description will be made here.
  • the above P-hop broadcast mechanism uses the principle of limiting flooding, which can prevent the broadcast storm problem caused by a large-scale multi-hop broadcast, and can also record the optimal multi-hop path from the receiving node to the sending node during the multi-hop transmission process. This simplifies the process of establishing multi-hop routes for nodes within the group.
  • the above-mentioned embodiments of the present disclosure assist other nodes to complete the coverage capacity estimation through the exchange of the coverage status information of the nodes, so as to realize the effective utilization of the nodes with high communication capabilities in the wireless heterogeneous network and realize the optimal wireless heterogeneous network Grouping.
  • a typical ad hoc network scenario is composed of several ground vehicle nodes, ground walking nodes, and lift-off nodes. These three types of nodes have different communication coverage capabilities, computing capabilities, and energy supply capabilities, forming a wireless heterogeneity.
  • the internet Affected by the energy supply capability, the communication coverage capability of the ground vehicle node is stronger than that of the ground walking node; affected by the channel fading conditions, the communication coverage capability of the lift-off node is stronger than the above two types of ground nodes.
  • the maximum coverage grouping method uses the following steps to perform grouping calculation:
  • Step 31 All on-network nodes in the ad hoc network, including ground vehicle nodes, ground walking nodes, and lift-off nodes, periodically broadcast their ID and ranging signals to the single-hop outward, such as time-stamped Radio frequency RF signal (based on TDOA ranging principle), which is used for unidirectional distance measurement between each receiving node and sending node.
  • ID and ranging signals such as time-stamped Radio frequency RF signal (based on TDOA ranging principle), which is used for unidirectional distance measurement between each receiving node and sending node.
  • the ranging signal and the communication signal have the same coverage, it is required that the ranging signal and the communication signal have the same frequency, have the same transmission power and the same receiving sensitivity.
  • Dist (u, v) represents the absolute distance between node u and node v
  • t d is the time difference between the distance measurement signal transmission and reception
  • c is the electromagnetic wave propagation speed, usually taken as the speed of light.
  • DRC uv is the relative distance between node u and node v; Dist(u, v) is the absolute distance between the second node and the first node; D o is the standard coverage distance.
  • the received signal strength indicator (RSSI) is selected to characterize the link quality (LQI) between the nodes.
  • RSSI received signal strength indicator
  • LQI link quality
  • RSSI n , RSSI n-1 , and RSSI n-2 are buffers of the received signal strength indication current value and the previous two measured values, respectively.
  • Step 35 After completing the calculation of the relative distance DRC uv and link quality LQI uv (n) between node u and node v, each receiving node v feeds back the above two coverage status information to the sending node u for sending node u Coverage capacity estimation.
  • the status information feedback of the receiving node v cannot always be directly transmitted to the lift-off node. At this time, it may be considered to use the "P-hop broadcast mechanism" described in this application, and the state information is fed back to the lift-off node in a relay manner by limiting the flooding method.
  • the P-hop broadcast mechanism refers to the range in which the state feedback information can be transferred to within 3 hops at most.
  • Set the TTL value of the body feedback information to 3, and every time it is forwarded, the TTL value is decremented in steps of 1. If the feedback information reaches the destination node, the delivery is terminated; if it does not reach the destination node, and the TTL is less than 1, the delivery is terminated to avoid broadcast storms caused by flooding of the entire network.
  • the above steps 31 to 35 are continuously performed in a periodic manner or an event response manner, and are used for neighbor discovery between nodes and maintenance of neighbor node status information.
  • Step 36 based on the above neighbor node state information, the coverage weight (CW) of each neighbor node relative to the local node can be calculated, and the calculation method is as follows:
  • CW uv is the coverage weight of the second node relative to the first node
  • DRC uv is the relative distance between the second node and the first node
  • LQI uv is the link status indicator between the second node and the first node
  • W 1 and w 2 are the influencing factors of the coverage weights.
  • v ⁇ N(u) indicates that node v (ie, the second node) is any neighboring node of node u (ie, the first node); lg(LQI uv ) is the coverage quality of the second node.
  • Step 37 Select the principle of maximum adjacency coverage, and select the maximum value of the coverage weight set ⁇ CW uv ⁇ to characterize the coverage capability of the local node u.
  • the calculation method is as follows:
  • the coverage distances of ground walk nodes, ground vehicle nodes, and lift-off nodes are 10 km, 30 km, and 150 km, respectively.
  • the estimated coverage capabilities of typical ground walk nodes, ground vehicle nodes, and lift-off nodes are 2.8, 4.4, and 14, respectively.
  • the node After the alternative group head selection is completed, the node broadcasts its own group head selection to the surrounding nodes, and uses the k-hop broadcast mechanism to broadcast the group head candidate information until it reaches the alternative group head. Within the range of k hops, the candidate group leader that receives the most recommendation becomes the group leader node.
  • Step 39 After being selected as the group leader, the group leader node confirms its identity of the group leader through a single-hop broadcast mechanism. At the same time, other nodes within its coverage area are confirmed as ordinary nodes within its cluster.
  • step 40 similar to other clustering algorithms, multiple nodes at the intersection of maximum coverage clustering groups declare their gateway roles. At this time, the topological connection between the group heads and gateways that greatly cover the sub-groups forms a backbone network.
  • the above wireless backbone network can achieve a very wide range of communication coverage with as few hops as possible.
  • the maximum coverage grouping method provided by the above embodiments of the present disclosure can solve the problem of multi-hop grouping in wireless heterogeneous networks, provide a wireless backbone network topology structure with high coverage capabilities, and are suitable for networking where multiple types of nodes exist Scenario;
  • the maximum coverage grouping method selects the maximum coverage capability node as the group leader and backbone network node to form a wireless backbone network that can provide a very wide range of communication coverage with as few hops as possible; at the same time, the maximum coverage group First, it can provide multi-hop coverage in the group, effectively increasing the capacity of the nodes in the group; further, the maximum coverage grouping method, through the limited range of multi-hop broadcasting method for coverage status feedback, can be calculated in the process of group calculation Multi-hop routing within the group saves the cost of discovery and maintenance of multi-hop routing within the group; and the maximum coverage grouping method is compatible.
  • the link quality factor is not considered and the coverage distance of the nodes is the same, the method of this method The grouping effect is equivalent to the
  • an embodiment of the present disclosure further provides a network node.
  • the network node is a first node of an ad hoc network.
  • the network node includes: a transceiver 400, a memory 410, a processor 400, and stored in the A program on the memory 410 that can run on the processor 400, and the processor 400 is used to determine coverage capability information of the first node;
  • the transceiver 420 is used for broadcasting coverage information of the first node; acquiring coverage information of the second node broadcast by the second node;
  • the processor 400 is further configured to select a group head node according to the coverage capability information of the first node and the coverage capability information of the second node to form a maximum coverage sub-group.
  • the transceiver 420 is further used to:
  • the ranging information at least includes: a ranging signal;
  • the coverage status information of the first node and the second node broadcasted by the second node based on the ranging information at least including: the relative distance between the second node and the first node and the second node and the first node Link status indication between nodes.
  • the processor 400 is further used to:
  • the coverage capability information of the first node is determined.
  • the processor 400 is further used to:
  • the coverage capability information of the first node is determined.
  • the processor 400 is further used to:
  • the first formula is:
  • CW uv is the coverage weight of the second node relative to the first node
  • DRC uv is the relative distance between the second node and the first node
  • LQI uv is the link status indicator between the second node and the first node
  • W 1 and w 2 are the influencing factors of the coverage weights.
  • the coverage capability information includes: a coverage capability value
  • the processor 400 is also used to:
  • the maximum adjacency coverage criterion determine the maximum coverage weight value as the coverage capability value of the first node
  • the coverage weights are integrated, and the integrated value obtained by integration is determined as the coverage capability value of the first node.
  • the processor 400 is further used to:
  • the first node's coverage capability information is determined according to the first node's coverage status information for the second node, the first node's node remaining energy indicator, and the first node's node intention.
  • the transceiver 420 is further used to:
  • P is an integer greater than or equal to 1.
  • the termination condition of the P-hop broadcast mechanism includes any one of the following:
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • the processor 400 is further used to:
  • the coverage capability information of the first node and the coverage capability information of the second node select the node with the largest coverage capability as the candidate group leader node;
  • the alternative indication information is used To instruct the first node to select the candidate group head node as the candidate group head; P is an integer greater than or equal to 1;
  • the node selected as the candidate group head node with the highest number of times is the group head node.
  • the processor 400 is further used to:
  • a group head confirmation message is sent to the nodes that select the first node as the group head node; where the first node and the node that selects the first node as the group head node form a maximum coverage subgroup.
  • the above embodiments of the present disclosure select the group head node with the largest coverage through the exchange of the coverage state information of the nodes and the calculation of the coverage capability information, and then form a wireless backbone network with the greatest coverage with the least hops, thereby realizing a wireless heterogeneous network
  • the effective use of the nodes with high communication capability realizes the optimal grouping of wireless heterogeneous networks.
  • the network node provided by the embodiment of the present disclosure is a network node capable of performing the above-mentioned maximum coverage grouping method, then all the embodiments of the above-mentioned maximum coverage grouping method are applicable to the network node, and all can achieve the same or Similar beneficial effects.
  • an embodiment of the present disclosure also provides a device for maximum coverage grouping, which is applied to the first node of an ad hoc network and includes:
  • the first broadcast module 51 is used to determine and broadcast the coverage capability information of the first node
  • the second information obtaining module 52 is used to obtain coverage information of the second node broadcast by the second node;
  • the grouping module 53 is configured to select a group head node according to the coverage capability information of the first node and the coverage capability information of the second node to form a maximum coverage grouping.
  • the device further includes:
  • the third broadcast module is used to broadcast ranging information periodically or based on an event trigger mechanism, the ranging information at least includes: a ranging signal;
  • the first information acquiring module is configured to acquire the coverage status information of the first node and the second node broadcasted by the second node based on the ranging information, where the coverage status information includes at least: the second node is opposite to the node of the first node Distance and link status indication between the second node and the first node.
  • the first broadcast module includes:
  • the first submodule is configured to determine the coverage capability information of the first node according to the coverage status information of the first node and the second node broadcast by the second node.
  • the first submodule includes:
  • the first unit is used to determine the coverage weight of the second node relative to the first node according to the coverage status information
  • the second unit is used to determine the coverage capability information of the first node according to the coverage weight.
  • the first unit is further used to:
  • the first formula is:
  • CW uv is the coverage weight of the second node relative to the first node
  • DRC uv is the relative distance between the second node and the first node
  • LQI uv is the link status indicator between the second node and the first node
  • W 1 and w 2 are the influencing factors of the coverage weights.
  • the coverage capability information includes: a coverage capability value
  • the second unit is further used to:
  • the maximum adjacency coverage criterion determine the maximum coverage weight value as the coverage capability value of the first node
  • the coverage weights are integrated, and the integrated value obtained by integration is determined as the coverage capability value of the first node.
  • the first broadcast module includes:
  • the second sub-module is used to determine the first node's coverage capability information according to the first node's coverage status information for the second node, the first node's node remaining energy indicator, and the first node's node intention.
  • the first submodule includes:
  • the third unit is used to receive the coverage status information forwarded by the second node through the P-hop broadcast mechanism through at most P intermediate nodes;
  • P is an integer greater than or equal to 1.
  • the termination condition of the P-hop broadcast mechanism includes any one of the following:
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • the grouping module includes:
  • a third submodule configured to select the node with the largest coverage capability as the candidate group leader node based on the coverage capability information of the first node and the coverage capability information of the second node;
  • the fourth sub-module is used to broadcast the alternative group head node selected by the first node, and uses the P-hop broadcast mechanism to forward the alternative indication information through at most P intermediate nodes until the alternative indication information reaches the alternative group head node,
  • the candidate indication information is used to instruct the first node to select the candidate group head node as the candidate group head; P is an integer greater than or equal to 1;
  • a fifth submodule configured to receive the candidate group leader node selected by the second node and broadcast by the second node;
  • the sixth submodule is used to determine that the node selected as the candidate group head node with the highest number of times is the group head node.
  • the third sub-module is used for, if the first node is selected as the group leader node, the device further includes:
  • the group head confirmation module is used to send a group head confirmation message to the nodes that select the first node as the group head node; wherein, the first node and the node that selects the first node as the group head node form a maximum coverage Grouping.
  • the above embodiments of the present disclosure select the group head node with the largest coverage through the exchange of the coverage state information of the nodes and the calculation of the coverage capability information, and then form a wireless backbone network with the greatest coverage with the least hops, thereby realizing a wireless heterogeneous network
  • the effective use of the nodes with high communication capability realizes the optimal grouping of wireless heterogeneous networks.
  • the maximum coverage grouping device provided by the embodiment of the present disclosure is a maximum coverage grouping device capable of performing the above-mentioned maximum coverage grouping method, then all the embodiments of the above-mentioned maximum coverage grouping method are applicable to the maximum coverage Grouping devices, and all can achieve the same or similar beneficial effects.
  • Embodiments of the present disclosure also provide a computer-readable storage medium that stores a computer program on the computer-readable storage medium, and when the computer program is executed by a processor, implements various processes of the embodiment of the method for maximum coverage grouping as described above And can achieve the same technical effect, in order to avoid repetition, no more details here.
  • the computer-readable storage medium such as read-only memory (Read-Only Memory, ROM for short), random access memory (Random Access Memory, RAM for short), magnetic disk or optical disk, etc.
  • an embodiment of the present disclosure also provides a network node.
  • the network node is a second node of an ad hoc network.
  • the network node includes: a transceiver 420, a memory 410, a processor 400, and stored in the A program on the memory 410 and executable on the processor 400, the transceiver 420 is used to receive ranging information broadcast by the first node, and the ranging information includes at least a ranging signal;
  • the processor 400 is used to read the program in the memory and perform the following process: according to the ranging information, determine the coverage status information of the first node to the second node, the coverage status information includes at least: the second node and The relative distance between the first node and the link status indication between the second node and the first node;
  • the transceiver 420 is also used to broadcast the coverage status information of the first node to the second node.
  • the processor 400 is further used to:
  • DRC uv is the relative distance between the second node and the first node
  • Dist(u,v) is the absolute distance between the second node and the first node
  • D o is the standard coverage distance, which is used to normalize the absolute distance Chemical operation
  • the filter calculation formula of the sliding filter is:
  • LQI uv (n) is the link status indicator between the second node and the first node; k is the order of the sliding filter; n is the discrete time point; i is the sampling time point of the sliding filter.
  • the transceiver 420 is further used to:
  • a P-hop broadcast mechanism is used to forward the coverage status information through at most P intermediate nodes; where P is an integer greater than or equal to 1;
  • the termination condition of the P-hop broadcast mechanism includes any of the following:
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • the above-mentioned embodiments of the present disclosure assist other nodes to complete the coverage capacity estimation through the exchange of the coverage status information of the nodes, so as to realize the effective utilization of the nodes with high communication capabilities in the wireless heterogeneous network and realize the optimal wireless heterogeneous network Grouping.
  • the network node provided by the embodiment of the present disclosure is a network node capable of performing the above-mentioned maximum coverage grouping method, then all the embodiments of the above-mentioned maximum coverage grouping method are applicable to the network node, and all can achieve the same or Similar beneficial effects.
  • an embodiment of the present disclosure also provides a device for maximum coverage grouping, which is applied to the second node of the ad hoc network and includes:
  • the first receiving module 61 is configured to receive ranging information broadcast by the first node, and the ranging information at least includes: a ranging signal;
  • the second determining module 62 is configured to determine the coverage status information of the first node with respect to the second node according to the ranging information, the coverage status information at least includes: the relative distance between the second node and the first node and the second Link status indication between the node and the first node;
  • the second broadcast module 63 is used to broadcast the coverage status information of the first node to the second node.
  • the second determination module includes:
  • An eighth submodule configured to determine the relative distance between the second node and the first node according to the ranging information and the second formula
  • DRC uv is the relative distance between the second node and the first node
  • Dist(u,v) is the absolute distance between the second node and the first node
  • D o is the standard coverage distance, which is used to normalize the absolute distance Chemical operation
  • the ninth sub-module is used to measure the RSSI of the received signal strength according to the ranging information, and filter the RSSI using a sliding filter to calculate the link status indicator between the second node and the first node;
  • the filter calculation formula of the sliding filter is:
  • LQI uv (n) is the link status indicator between the second node and the first node; k is the order of the sliding filter; n is the discrete time point; i is the sampling time point of the sliding filter.
  • the second broadcast module includes:
  • a broadcast sub-module for forwarding the coverage status information through at most P intermediate nodes using a P-hop broadcast mechanism; where P is an integer greater than or equal to 1;
  • the termination condition of the P-hop broadcast mechanism includes any of the following:
  • the time-to-live TTL is decremented in steps of 1 according to the number of forwarding hops.
  • TTL is equal to 0
  • the broadcast is terminated; the initial value of TTL is equal to P.
  • the above-mentioned embodiments of the present disclosure assist other nodes to complete the coverage capacity estimation through the exchange of the coverage status information of the nodes, so as to realize the effective utilization of the nodes with high communication capabilities in the wireless heterogeneous network and realize the optimal wireless heterogeneous network Grouping.
  • the maximum coverage grouping device provided by the embodiment of the present disclosure is a maximum coverage grouping device capable of performing the above-mentioned maximum coverage grouping method, then all the embodiments of the above-mentioned maximum coverage grouping method are applicable to the maximum coverage Grouping devices, and all can achieve the same or similar beneficial effects.
  • Embodiments of the present disclosure also provide a computer-readable storage medium that stores a computer program on the computer-readable storage medium, and when the computer program is executed by a processor, implements various processes of the embodiment of the method for maximum coverage grouping as described above And can achieve the same technical effect, in order to avoid repetition, no more details here.
  • the computer-readable storage medium such as read-only memory (Read-Only Memory, ROM for short), random access memory (Random Access Memory, RAM for short), magnetic disk or optical disk, etc.
  • the methods in the above embodiments can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware, but in many cases the former is better Implementation.
  • the technical solution of the present disclosure can be embodied in the form of a software product in essence or part that contributes to the existing technology, and the computer software product is stored in a storage medium (such as ROM/RAM, magnetic disk,
  • the CD-ROM includes several instructions to enable a terminal (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in various embodiments of the present disclosure.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本公开提供一种极大覆盖分群方法、装置及网络节点，该方法包括：确定并广播第一节点的覆盖能力信息；获取第二节点广播的所述第二节点的覆盖能力信息；根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。

Description

极大覆盖分群方法、装置及网络节点
相关申请的交叉引用
本申请主张在2018年12月20日在中国提交的中国专利申请号No.201811565895.8的优先权，其全部内容通过引用包含于此。
技术领域
本公开涉及通信技术领域，尤其是一种极大覆盖分群方法、装置及网络节点。
背景技术
无线自组网(即Ad hoc网络)综合了移动无线通信和计算机网络等技术，无须依赖预设的通信基础设施就可以快速自动组网，具有自组织、自愈合、无中心、多跳路由和高抗毁性等特点，适合于突发、临时性的应急通信场合。利用Ad hoc网络的多跳转发和自组织特性可以提高网络组织的维护灵活性和健壮性。
但是平面Ad hoc网络的可扩展性差，解决自组网可扩展性问题的一个有效方法是通过分群构建层次化的网络拓扑结构，分群的基本思想是按照地理邻近关系将网络节点分为若干个群组，给网络提供规模较小的逻辑组织，使网络易于管理。分群内的节点集可以共享信道资源，分群间则便于实现时隙和扩频码的空间复用，从而提高信道吞吐量。形成网络分群结构的重要节点是群首(Cluster-Head)，它们负责建立分群和维护网络拓扑。群首的集合称为支配集(Dominating Set，DS)，它们之间通过直视(LOS)链路或网关(Gateway)转发实现群间通信，互相连通的支配节点集又称为连通支配集(Connected Dominated Set，CDS)。
最小连通支配集问题是一个非确定性(NP-hard)问题，自组网分群生成都采用启发式算法进行分群划分。根据群首选择原则的不同，可分为最小ID优先、最大连接度优先、最大权值优先算法等。最小ID优先算法中，ID较小的节点称为群首的可能性远高于其他节点，算法缺乏公平性。最大连接度 优先算法以连接度作为启发选择群首节点，负载均衡都较差，不能综合考虑网络在稳定性、扩展性等方面的需求。基于权重的分群算法综合考虑系统的节点度、移动性等多种增强群结构稳定性因素，可以保证网络具有更可靠的性能，权重的选取具有极大主观性，降低了算法的实用性。
相关技术中的分群技术通常假定网络中的各节点具有相同的通信覆盖范围，无法区分节点的通信能力，生成的分群结构只能覆盖有限的通信距离，不能适用于多类型节点形成的无线异构网络。
发明内容
本公开的目的在于提供一种极大覆盖分群方法、装置及网络节点，以解决相关技术中多类型节点形成的无线异构网络的分群问题。
为了解决上述问题，本公开实施例提供一种极大覆盖分群方法，应用于自组网的第一节点，包括：
确定并广播第一节点的覆盖能力信息；
获取第二节点广播的所述第二节点的覆盖能力信息；
根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
其中，所述确定并广播第一节点的覆盖能力信息之前，所述方法还包括：
周期性或基于事件触发机制广播测距信息，所述测距信息至少包括：测距信号；
获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示。
其中，确定第一节点的覆盖能力信息，包括；
根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息。
其中，所述根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息，包括：
根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值；
根据所述覆盖权值，确定第一节点的覆盖能力信息。
其中，根据所述覆盖状态信息，确定第二节点分别相对于第一节点的覆盖权值，包括：
根据第二节点的覆盖状态信息以及第一公式，确定第二节点相对于第一节点的覆盖权值；其中，
第一公式为：
CW uv＝w 1*DRC uv+w 2*lg(LQI uv)；
其中，CW uv为第二节点相对于第一节点的覆盖权值；DRC uv为第二节点与第一节点的节点相对距离；LQI uv为第二节点与第一节点之间的链路状态指示；w 1、w 2为覆盖权值的影响因子。
其中，所述覆盖能力信息包括：覆盖能力值；
所述根据所述覆盖权值，确定第一节点的覆盖能力信息，包括：
根据最大邻接覆盖准则，确定最大的覆盖权值为所述第一节点的覆盖能力值；
或者，
根据最大连通覆盖准则，整合覆盖权值，确定整合得到的综合值为所述第一节点的覆盖能力值。
其中，所述确定第一节点的覆盖能力信息，包括：
根据所述第一节点对于第二节点的覆盖状态信息、第一节点的节点剩余能量指示、第一节点的节点意愿，确定第一节点的覆盖能力信息。
其中，所述获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，包括：
接收第二节点采用P跳广播机制通过最多P个中间节点转发的覆盖状态信息；
其中，P为大于或者等于1的整数。
其中，P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
其中，所述根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，包括：
根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择覆盖能力最大的节点为备选群首节点；
广播第一节点选择的备选群首节点，并采用P跳广播机制通过最多P个中间节点转发备选指示信息直到所述备选指示信息到达备选群首节点，所述备选指示信息用于指示第一节点选择所述备选群首节点作为备选群首；P为大于或者等于1的整数；
接收第二节点广播的所述第二节点选择的备选群首节点；
确定被选择为备选群首节点次数最多的节点为群首节点。
其中，若第一节点被选择为群首节点，所述方法还包括：
向选择所述第一节点为群首节点的节点分别发送群首确认消息；其中，第一节点以及选择所述第一节点为群首节点的节点组成一个极大覆盖分群。
本公开实施例还提供一种极大覆盖分群方法，应用于自组网的第二节点，包括：
接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；
根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示；
广播第一节点对于第二节点的覆盖状态信息。
其中，所述根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，包括：
根据所述测距信息以及第二公式，确定第二节点与第一节点的节点相对距离；
其中，第二公式为：
DRC uv＝Dist(u,v)/D o；
DRC uv为第二节点与第一节点的节点相对距离；Dist(u,v)为第二节点和第一节点之间的绝对距离；D o为标准覆盖距离，用于对绝对距离进行归一化 操作；
根据所述测距信息测量接收信号的强度指示RSSI，并采用滑动滤波器对RSSI进行滤波，计算第二节点与第一节点之间的链路状态指示；
其中，滑动滤波器的滤波计算公式为：
Figure PCTCN2019122630-appb-000001
LQI uv(n)为第二节点与第一节点之间的链路状态指示；k为滑动滤波器的阶数；n为离散时间点；i为滑动滤波器的采样时间点。
其中，所述广播第一节点对于第二节点的覆盖状态信息，包括：
采用P跳广播机制通过最多P个中间节点转发所述覆盖状态信息；其中，P为大于或者等于1的整数；
所述P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
本公开实施例还提供了一种网络节点，所述网络节点为自组网的第一节点，所述网络节点包括：收发机、存储器、处理器及存储在所述存储器上并可在所述处理器上运行的程序，所述处理器用于确定第一节点的覆盖能力信息；
所述收发机用于广播第一节点的覆盖能力信息；获取第二节点广播的所述第二节点的覆盖能力信息；
所述处理器还用于：根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
其中，所述收发机还用于：
周期性或基于事件触发机制广播测距信息，所述测距信息至少包括：测距信号；
获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示。
其中，所述处理器还用于：
根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息。
其中，所述处理器还用于：
根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值；
根据所述覆盖权值，确定第一节点的覆盖能力信息。
其中，所述处理器还用于：
根据第二节点的覆盖状态信息以及第一公式，确定第二节点相对于第一节点的覆盖权值；其中，
第一公式为：
CW uv＝w 1*DRC uv+w 2*lg(LQI uv)；
其中，CW uv为第二节点相对于第一节点的覆盖权值；DRC uv为第二节点与第一节点的节点相对距离；LQI uv为第二节点与第一节点之间的链路状态指示；w 1、w 2为覆盖权值的影响因子。
其中，所述覆盖能力信息包括：覆盖能力值；
所述处理器还用于：
根据最大邻接覆盖准则，确定最大的覆盖权值为所述第一节点的覆盖能力值；
或者，
根据最大连通覆盖准则，整合覆盖权值，确定整合得到的综合值为所述第一节点的覆盖能力值。
其中，所述处理器还用于：
根据所述第一节点对于第二节点的覆盖状态信息、第一节点的节点剩余能量指示、第一节点的节点意愿，确定第一节点的覆盖能力信息。
其中，所述收发机还用于：
接收第二节点采用P跳广播机制通过最多P个中间节点转发的覆盖状态信息；
其中，P为大于或者等于1的整数。
其中，P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
其中，所述处理器还用于：
根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择覆盖能力最大的节点为备选群首节点；
广播第一节点选择的备选群首节点，并采用P跳广播机制通过最多P个中间节点转发备选指示信息直到所述备选指示信息到达备选群首节点，所述备选指示信息用于指示第一节点选择所述备选群首节点作为备选群首；P为大于或者等于1的整数；
接收第二节点广播的所述第二节点选择的备选群首节点；
确定被选择为备选群首节点次数最多的节点为群首节点。
其中，若第一节点被选择为群首节点，所述处理器还用于：
向选择所述第一节点为群首节点的节点分别发送群首确认消息；其中，第一节点以及选择所述第一节点为群首节点的节点组成一个极大覆盖分群。
本公开实施例还提供一种极大覆盖分群装置，应用于自组网的第一节点，包括：
第一广播模块，用于确定并广播第一节点的覆盖能力信息；
第二信息获取模块，用于获取第二节点广播的所述第二节点的覆盖能力信息；
分群模块，用于根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
本公开实施例还提供一种网络节点，所述网络节点为自组网的第二节点，所述网络节点包括：收发机、存储器、处理器及存储在所述存储器上并可在所述处理器上运行的程序，所述收发机用于接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；
所述处理器用于读取存储器中的程序，执行下列过程：根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链 路状态指示；
所述收发机还用于：广播第一节点对于第二节点的覆盖状态信息。
其中，所述处理器还用于：
根据所述测距信息以及第二公式，确定第二节点与第一节点的节点相对距离；
其中，第二公式为：
DRC uv＝Dist(u,v)/D o；
DRC uv为第二节点与第一节点的节点相对距离；Dist(u,v)为第二节点和第一节点之间的绝对距离；D o为标准覆盖距离，用于对绝对距离进行归一化操作；
根据所述测距信息测量接收信号的强度指示RSSI，并采用滑动滤波器对RSSI进行滤波，计算第二节点与第一节点之间的链路状态指示；
其中，滑动滤波器的滤波计算公式为：
Figure PCTCN2019122630-appb-000002
LQI uv(n)为第二节点与第一节点之间的链路状态指示；k为滑动滤波器的阶数；n为离散时间点；i为滑动滤波器的采样时间点。
其中，所述收发机还用于：
采用P跳广播机制通过最多P个中间节点转发所述覆盖状态信息；其中，P为大于或者等于1的整数；
所述P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
本公开实施例还提供一种极大覆盖分群装置，应用于自组网的第二节点，包括：
第一接收模块，用于接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；
第二确定模块，用于根据所述测距信息，确定第一节点对于第二节点的 覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示；
第二广播模块，用于广播第一节点对于第二节点的覆盖状态信息。
本公开实施例还提供一种计算机可读存储介质，所述计算机可读存储介质上存储计算机程序，所述计算机程序被处理器执行时实现如上所述的极大覆盖分群方法的步骤。
本公开的上述技术方案至少具有如下有益效果：
本公开实施例的极大覆盖分群方法、装置及网络节点中，通过节点的覆盖状态信息交换和覆盖能力信息计算，选择出最大覆盖的群首节点，进而组成最少跳极大覆盖的无线骨干网，从而实现无线异构网络中的高通信能力节点的有效利用，实现无线异构网络的最佳分群。
附图说明
图1表示本公开实施例提供的极大覆盖分群方法的步骤流程示意图之一；
图2表示本公开实施例提供的极大覆盖分群方法的步骤流程示意图之二；
图3表示本公开实施例提供的极大覆盖分群方法的具体示例的步骤流程图；
图4表示本公开实施例提供的网络节点的结构示意图；
图5表示本公开实施例提供的极大覆盖分群装置的结构示意图之一；
图6表示本公开实施例提供的极大覆盖分群装置的结构示意图之二。
具体实施方式
为使本公开要解决的技术问题、技术方案和优点更加清楚，下面将结合附图及具体实施例进行详细描述。
如图1所示，本公开实施例提供一种极大覆盖分群方法，应用于自组网的第一节点，包括：
步骤11，确定并广播第一节点的覆盖能力信息；
步骤12，获取第二节点广播的所述第二节点的覆盖能力信息；需要说明的是，第二节点确定其覆盖能力信息的方式与第一节点相同，下面均以第一 节点为例进行描述，不再赘述第二节点确定覆盖能力信息的方式。
步骤13，根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
本公开实施例中，第一节点为自组网中的任意一个在网节点，第二节点为第一节点的邻节点，第一节点具有至少一个邻节点，即第二节点具体为至少一个节点，第一节点与第二节点之间通过广播通信。
本公开实施例提供的极大覆盖分群方法具体为基于覆盖优先的分群方法，可以解决异构互连网络的连通支配集生成问题。可选的，本公开实施例涉及的自组网为包括多种类型节点的自组网；其中，例如多种类型节点可以为：地面车载节点、地面步行节点、升空节点等。
本公开实施例中通过选择极大覆盖能力节点担任群首和骨干网节点，形成的无线骨干网，能够以尽量少的跳数提供极大范围的通信覆盖；同时，极大覆盖群首能够提供群内的多跳覆盖，有效增加群内的节点容量。
作为一个可选实施例，步骤11之前，本公开实施例提供的方法还包括：
周期性或基于事件触发机制广播测距信息，所述测距信息至少包括：测距信号；测距信息还可以包括：第一节点的节点ID号及其他扩展信息。
获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示。覆盖状态信息还可以包括：第二节点的节点ID号。
上述步骤构成了第一节点的邻居发现过程，经过一段时间的邻居发现，节点维护的邻居状态信息表趋于稳定。不完全地，邻居状态信息表包括：多个第二节点广播的覆盖状态信息。例如，如表1所示为邻居状态信息表。
表1
节点ID号1 节点相对距离 链路状态指示
节点ID号2 节点相对距离 链路状态指示
…… …… ……
节点ID号n 节点相对距离 链路状态指示
自组网的在网节点采用周期性或事件触发机制广播覆盖状态信息，供其他节点进行邻区发现和邻区状态信息维护。其中，自组网的每个在网节点均可以基于其他节点的测距信息测量得到覆盖状态信息。事件触发机制包括下述任一一种：节点激活、节点钝化、链路激活、链路中断。
覆盖状态信息至少包括：第二节点与第一节点的节点相对距离(Distance of Relative Coverage，DRC)、第二节点与第一节点之间的链路状态指示(Link Quality Indicator，LQI)。覆盖状态信息还可以包括：第二节点的节点ID号。
承接上例，本公开的上述实施例中步骤11包括；
根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息。
为了完成第一节点(也可称为发送节点)的覆盖能力估算，第二节点(也可称为接收节点)需将节点相对距离及链路状态指示反馈给第一节点，但覆盖能力弱的第二节点可能无法采用视距通信手段直接实现反馈信息传送。为此，本公开的上述实施例中，所述获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，包括：
接收第二节点采用P跳广播机制通过最多P个中间节点转发的覆盖状态信息；
其中，P为大于或者等于1的整数。
需要说明的是，对于覆盖能力强的节点，则直接采用视距通信手段直接向第一节点反馈覆盖状态信息，在此不展开说明。
本公开实施例中的P跳广播机制采用限制洪泛原则，采用目的节点ID号(Dest ID，即第一节点的ID号)和TTL两个参数作为P跳广播终止条件，即P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点(例如，转发到达的节点ID等于第一节点的ID)，终止广播；
存活时间TTL(Time To Live)根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
上述P跳广播机制采用限制洪泛原则，可以防止大范围的多跳广播所造成的广播暴问题，同时也能在多跳转发过程中，记录接收节点到发送节点的 最佳多跳路径，从而简化群内节点多跳路由的建立过程。
作为一个可选实施例，所述根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息，包括：
根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值；
根据所述覆盖权值，确定第一节点的覆盖能力信息。
本公开实施例中，基于多个第二节点的覆盖状态信息，第一节点可以计算各第二节点相对第一节点的覆盖权值(Coverage Weight，CW)。计算方法如下：根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值，包括：
根据第二节点的覆盖状态信息以及第一公式，确定第二节点相对于第一节点的覆盖权值；其中，
第一公式为：
CW uv＝w 1*DRC uv+w 2*lg(LQI uv)；
其中，CW uv为第二节点相对于第一节点的覆盖权值；DRC uv为第二节点与第一节点的节点相对距离；LQI uv为第二节点与第一节点之间的链路状态指示；w 1、w 2为覆盖权值的影响因子。其中，v∈N(u)指示节点v(即第二节点)为节点u(即第一节点)的任一邻节点；lg(LQI uv)为第二节点的覆盖质量。
在一定的估算准则下，可以通过第二节点覆盖权值集合{CW uv}进行第一节点的覆盖能力(Coverage Capability，CCu)估算，用于有效表征第一节点的覆盖能力。本公开实施例提供两种覆盖能力估算准则：最大邻接覆盖准则和最大连通覆盖准则。
可选的，所述覆盖能力信息包括：覆盖能力值；所述根据所述覆盖权值，确定第一节点的覆盖能力信息，包括：
根据最大邻接覆盖准则，确定最大的覆盖权值(第二节点覆盖权值集合{CW uv}中最大的覆盖权值)为所述第一节点的覆盖能力值；即CC u＝Max{CW uv},v∈N(u)；其中，{CW uv}为第二节点的覆盖权值集合，v∈N(u)指示节点v(即第二节点)为节点u(即第一节点)的任一邻节点。
或者，
根据最大连通覆盖准则，整合覆盖权值(整合第二节点覆盖权值集合{CW uv})，确定整合得到的综合值为所述第一节点的覆盖能力值；即CC u＝∑ vCW uv,v∈N(u)；其中，CW uv为第二节点相对于第一节点的覆盖权值；v∈N(u)指示节点v(即第二节点)为节点u(即第一节点)的任一邻节点。
作为另一个可选实施例，步骤11中确定第一节点的覆盖能力信息，包括：
根据所述第一节点对于第二节点的覆盖状态信息、第一节点的节点剩余能量指示、第一节点的节点意愿，确定第一节点的覆盖能力信息。
本公开的上述实施例中，节点的覆盖能力估算中还可以考虑节点剩余能量指示(Residual Energy Indicator，REI)和节点意愿(Willingness)等因素，采用线性加权的方式进行综合估算，从而能够更全面评估节点适合担任群首角色的能力。其中，剩余能量指示(REI)可以采用绝对值或百分比的方式用于指示能量的剩余。
作为一个可选实施例，步骤13包括：
根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择覆盖能力最大的节点为备选群首节点；
广播第一节点选择的备选群首节点，并采用P跳广播机制通过最多P个中间节点转发备选指示信息直到所述备选指示信息到达备选群首节点，所述备选指示信息用于指示第一节点选择所述备选群首节点作为备选群首；P为大于或者等于1的整数；
接收第二节点广播的所述第二节点选择的备选群首节点；
确定被选择为备选群首节点次数最多的节点为群首节点。
自组网的在网节点完成自身的覆盖能力估算后，节点向外广播自己的覆盖能力值，各节点采用分布式算法进行群首节点选择。
首先，各节点选择邻节点集合(即多个第二节点)和本节点中覆盖能力最大的节点作为备选群首，即CH can(u)＝Max(CC v∪CC u),v∈N(u)；其中，CH can(u)为备选群首，CC u为第一节点的覆盖能力，CC v为第二节点的覆盖能力；v∈N(u)指示节点v(即第二节点)为节点u(即第一节点)的任一邻节点。
备选群首节点选择完毕后，节点向周围的节点广播自身选择的备选群首 节点，并采用P跳广播机制进行群首备选信息的广播，直到达到备选群首节点。在P跳范围内，获得最多举荐的备选群首节点称为群首节点。
进一步的，若第一节点被选择为群首节点，所述方法还包括：
向选择所述第一节点为群首节点的节点分别发送群首确认消息；其中，第一节点以及选择所述第一节点为群首节点的节点组成一个极大覆盖分群。
本公开实施例中，某一节点被选为群首节点后，群首节点通过单跳广播机制对自己的群首身份进行确认。同时，处于其覆盖区域内的其他节点确认成为其分群内的普通节点。例如，节点u的邻居节点v选择了节点u为群首，那么节点v会将选择节点u这个消息广播到网络中，节点u收到这条消息后，就知道了节点v选择了自己为群首，那么节点u就会单播给节点v群首确认的消息。
进一步的，形成极大覆盖分群之后，与其他分群算法类似，处在多个极大覆盖分群交集的节点声明自己的网关角色。此时，多个极大覆盖分群的群首及网关之间的拓扑连接形成了骨干网。
由于极大覆盖分群的群首可以覆盖超越普通节点的多跳距离，上述无线骨干网能够以尽量少的跳数实现极大范围的通信覆盖。
综上，本公开的上述实施例通过节点的覆盖状态信息交换和覆盖能力信息计算，选择出最大覆盖的群首节点，进而组成最少跳极大覆盖的无线骨干网，从而实现无线异构网络中的高通信能力节点的有效利用，实现无线异构网络的最佳分群。
如图2所示，本公开实施例还提供一种极大覆盖分群方法，应用于自组网的第二节点，包括：
步骤21，接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；测距信息还可以包括：第一节点的节点ID号及其他扩展信息。
步骤22，根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示；覆盖状态信息还可以包括：第二节点的节点ID号。
步骤23，广播第一节点对于第二节点的覆盖状态信息。
例如，如表2所示为测距信息的格式示例。
表2
测距信号 节点ID号 扩展信息
本公开实施例提供的极大覆盖分群方法具体为基于覆盖优先的分群方法，可以解决异构互连网络的连通支配集生成问题。可选的，本公开实施例涉及的自组网为包括多种类型节点的自组网；其中，例如多种类型节点可以为：地面车载节点、地面步行节点、升空节点等。
本公开实施例中，第二节点为自组网中的任意一个在网节点，第一节点为第一节点的邻节点，第一节点与第二节点之间通过广播通信。
自组网的在网节点广播其测量得到覆盖状态信息，供其他节点进行邻区发现和邻区状态信息维护。其中，自组网的每个在网节点均可以基于其他节点的测距信息测量得到覆盖状态信息。
作为一个实施例，步骤22包括：
根据所述测距信息以及第二公式，确定第二节点与第一节点的节点相对距离；
其中，第二公式为：
DRC uv＝Dist(u,v)/D o；
DRC uv为第二节点与第一节点的节点相对距离；Dist(u,v)为第二节点和第一节点之间的绝对距离；D o为标准覆盖距离，用于对绝对距离进行归一化操作；D o可以根据设计指标进行取值(如1km)，对绝对距离进行归一化操作。
根据所述测距信息测量接收信号的强度指示RSSI，并采用滑动滤波器对RSSI进行滤波，计算第二节点与第一节点之间的链路状态指示；
其中，滑动滤波器的滤波计算公式为：
Figure PCTCN2019122630-appb-000003
LQI uv(n)为第二节点与第一节点之间的链路状态指示；k为滑动滤波器的阶数；n为离散时间点；i为滑动滤波器的采样时间点。
需要说明的是，上述DRC uv和LQI uv(n)的计算不限定其前后顺序，例如 接收到相邻节点覆盖状态信息广播的节点首先测量接收信号的质量(RSSI)，并采用滑动滤波方法进行链路质量计算(LQI)；然后采用某种与测距信号适配的单向测距技术(如DOR)进行节点间距离测定，进而解析节点状态信息的其它字段，包括节点ID号和其它扩展信息。
链路状态指示(LQI)用于表征一段时间内的链路质量，可以采用滑动平均、中值滤波等算法对接收信号的强度指示RSSI进行滤波，从而形成对链路状态的稳定性预测。
为了完成第一节点(也可称为发送节点)的覆盖能力估算，第二节点(也可称为接收节点)需将节点相对距离及链路状态指示反馈给第一节点，但覆盖能力弱的第二节点可能无法采用视距通信手段直接实现反馈信息传送。为此，本公开的上述实施例中，步骤23包括：
采用P跳广播机制通过最多P个中间节点转发所述覆盖状态信息；其中，P为大于或者等于1的整数；
本公开实施例中的P跳广播机制采用限制洪泛原则，采用目的节点ID号(Dest ID，即第一节点的ID号)和TTL两个参数作为P跳广播终止条件，即P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点(例如，转发到达的节点ID等于第一节点的ID)，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
需要说明的是，对于覆盖能力强的节点，则直接采用视距通信手段直接向第一节点反馈覆盖状态信息，在此不展开说明。
上述P跳广播机制采用限制洪泛原则，可以防止大范围的多跳广播所造成的广播暴问题，同时也能在多跳转发过程中，记录接收节点到发送节点的最佳多跳路径，从而简化群内节点多跳路由的建立过程。
综上，本公开的上述实施例通过节点的覆盖状态信息交换以辅助其他节点完成覆盖能力的估算，从而实现无线异构网络中的高通信能力节点的有效利用，实现无线异构网络的最佳分群。
不失一般性，本公开实施例提供的极大覆盖分群方法的一种具体实施例 如下所述：
一种典型的自组网场景由若干个地面车载节点、地面步行节点、升空节点组成，这3种类型节点的通信覆盖能力、计算能力和能量供应能力各有不同，形成一种无线异构网络。受能量供应能力影响，地面车载节点的通信覆盖能力强于地面步行节点；受信道衰落条件影响，升空节点的通信覆盖能力强于上述两类地面节点。
为了选择出覆盖能力更强的节点担任群首，并用尽量少的节点形成最大覆盖的无线骨干网，如图3所示，本公开实施例提供的极大覆盖分群方法采用如下步骤进行分群计算：
步骤31，自组网中的所有在网节点，包括地面车载节点、地面步行节点、升空节点在内，周期性地向外单跳广播自身的ID和测距信号，如带有时间标签的射频RF信号(基于TDOA测距原理)，该测距信号用于各接收节点与发送节点之间的单向距离测算。
为了保证测距信号与通信信号具有同样的覆盖范围，要求测距信号与通信信号同频，具有同样的发射功率和同样的接收灵敏度。
步骤32，接收到测距信号后，各接收节点基于TDOA测距原理进行单向距离测算如下：Dist(u,v)＝t d*c；
其中，Dist(u,v)表示节点u与节点v之间的绝对距离，t d为测距信号发送和接收的时间差；c为电磁波传播速度，通常取为光速。
步骤33，取D 0＝10km，对绝对距离进行归一化，节点u与节点v之间的相对距离计算如下：DRC uv＝Dist(u,v)/D o；
其中，DRC uv为节点u与节点v的节点相对距离；Dist(u,v)为第二节点和第一节点之间的绝对距离；D o为标准覆盖距离。
步骤34，选取接收信号的强度指示(RSSI)来表征节点之间的链路质量(LQI)，为了抑制信号强度不稳定带来的估计误差，选取k阶滑动滤波器对k步内的RSSI进行滤波。
取k＝3，节点u与节点v之间的链路质量指示(LQI)计算如下：
Figure PCTCN2019122630-appb-000004
其中，RSSI n、RSSI n-1、RSSI n-2分别为接收信号强度指示当前值和前两次测量值的缓存。
步骤35，在完成节点u与节点v之间的相对距离DRC uv和链路质量LQI uv(n)测算后，各接收节点v将上述两项覆盖状态信息反馈给发送节点u，用于发送节点u的覆盖能力估算。
考虑到地面节点的覆盖能力有限，接收节点v的状态信息反馈并不是总能直接传递到升空节点。此时，可以考虑采用本申请所述“P跳广播机制”，通过限制洪泛方法将状态信息以中继方式反馈给升空节点。
取P＝3，P跳广播机制指的是状态反馈信息最大能传递到3跳之内的范围。设定状体反馈信息的TTL值为3，每转发1次，TTL值以1为步长进行递减。反馈信息若抵达目的节点，则终止传递；若未抵达目的节点，且TTL＜1，则终止继续传递，避免全网洪泛带来广播暴问题。
上述步骤31～35以周期方式或事件响应的方式持续地进行，用于节点间的邻居发现和邻节点状态信息维护。
步骤36，基于上述邻节点状态信息，可以计算各邻节点相对本节点的覆盖权值(Coverage Weight，CW)，计算方法如下：
CW uv＝w 1*DRC uv+w 2*lg(LQI uv)；
其中，CW uv为第二节点相对于第一节点的覆盖权值；DRC uv为第二节点与第一节点的节点相对距离；LQI uv为第二节点与第一节点之间的链路状态指示；w 1、w 2为覆盖权值的影响因子。其中，v∈N(u)指示节点v(即第二节点)为节点u(即第一节点)的任一邻节点；lg(LQI uv)为第二节点的覆盖质量。
步骤37，选取最大邻接覆盖原则，通过选择覆盖权值集合{CW uv}的最大值，来表征本节点u的覆盖能力，计算方法如下：
CC u＝Max{CW uv},v∈N(u)；
典型地，地面步行节点、地面车载节点、升空节点的覆盖距离分别为10km、30km、150km。取w 1＝0.8，w 2＝0.2，LQI uv＝100，则典型的地面步行节点、地面车载节点、升空节点的覆盖能力估算值分别为2.8、4.4、14。
上述节点覆盖能力的差异，可以用于选择最佳群首，实现极大覆盖。
步骤38，在完成覆盖能力估算后，节点向外广播自己的覆盖能力值，各节点采用分布式算法进行群首选择。节点选择邻节点集合中覆盖能力最大的节点作为备选群首，即CH can(u)＝Max(CC v∪CC u),v∈N(u)；
备选群首选择完毕后，节点向周围的节点广播自身的群首选择，并采用k跳广播机制进行群首备选信息的广播，直到到达备选群首。在k跳范围内，获得最多举荐的备选群首成为群首节点。
步骤39，被选为群首后，群首节点通过单跳广播机制对自己的群首身份进行确认。同时，处于其覆盖区域内的其他节点确认成为其分群内的普通节点。
步骤40，与其他分群算法类似，处在多个极大覆盖分群交集的节点声明自己的网关角色。此时，多个极大覆盖分群的群首及网关之间的拓扑连接形成了骨干网。
由于极大覆盖分群的群首可以覆盖超越普通节点的多跳距离，上述无线骨干网能够以尽量少的跳数实现极大范围的通信覆盖。
综上，本公开的上述实施例提供的极大覆盖分群方法能够解决无线异构网中的多跳分群问题，提供高覆盖能力的无线骨干网拓扑结构，适用于存在多种类型节点的组网场景；该极大覆盖分群方法通过选择极大覆盖能力节点担任群首和骨干网节点，形成的无线骨干网，能够以尽量少的跳数提供极大范围的通信覆盖；同时，极大覆盖群首能够提供群内的多跳覆盖，有效增加群内的节点容量；进一步的，该极大覆盖分群方法，通过限制范围的多跳广播方法进行覆盖状态反馈，能够在分群计算的过程中，计算群内多跳路由，节省了群内多跳路由发现和维护的开销；且该极大覆盖分群方法具备兼容性，在不考虑链路质量因素，且节点的覆盖距离相同时，则本方法的分群效果等同于最大连通度(MaxDegree)分群算法，适用于普通的无线自组网分群场景。
如图4所示，本公开实施例还提供一种网络节点，所述网络节点为自组网的第一节点，所述网络节点包括：收发机400、存储器410、处理器400及存储在所述存储器410上并可在所述处理器400上运行的程序，所述处理器400用于确定第一节点的覆盖能力信息；
所述收发机420用于广播第一节点的覆盖能力信息；获取第二节点广播的所述第二节点的覆盖能力信息；
所述处理器400还用于：根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
可选的，本公开的上述实施例中，所述收发机420还用于：
周期性或基于事件触发机制广播测距信息，所述测距信息至少包括：测距信号；
获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示。
可选的，本公开的上述实施例中，所述处理器400还用于：
根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息。
可选的，本公开的上述实施例中，所述处理器400还用于：
根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值；
根据所述覆盖权值，确定第一节点的覆盖能力信息。
可选的，本公开的上述实施例中，所述处理器400还用于：
根据第二节点的覆盖状态信息以及第一公式，确定第二节点相对于第一节点的覆盖权值；其中，
第一公式为：
CW uv＝w 1*DRC uv+w 2*lg(LQI uv)；
其中，CW uv为第二节点相对于第一节点的覆盖权值；DRC uv为第二节点与第一节点的节点相对距离；LQI uv为第二节点与第一节点之间的链路状态指示；w 1、w 2为覆盖权值的影响因子。
可选的，本公开的上述实施例中，所述覆盖能力信息包括：覆盖能力值；
所述处理器400还用于：
根据最大邻接覆盖准则，确定最大的覆盖权值为所述第一节点的覆盖能力值；
或者，
根据最大连通覆盖准则，整合覆盖权值，确定整合得到的综合值为所述第一节点的覆盖能力值。
可选的，本公开的上述实施例中，所述处理器400还用于：
根据所述第一节点对于第二节点的覆盖状态信息、第一节点的节点剩余能量指示、第一节点的节点意愿，确定第一节点的覆盖能力信息。
可选的，本公开的上述实施例中，所述收发机420还用于：
接收第二节点采用P跳广播机制通过最多P个中间节点转发的覆盖状态信息；
其中，P为大于或者等于1的整数。
可选的，本公开的上述实施例中，P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
可选的，本公开的上述实施例中，所述处理器400还用于：
根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择覆盖能力最大的节点为备选群首节点；
广播第一节点选择的备选群首节点，并采用P跳广播机制通过最多P个中间节点转发备选指示信息直到所述备选指示信息到达备选群首节点，所述备选指示信息用于指示第一节点选择所述备选群首节点作为备选群首；P为大于或者等于1的整数；
接收第二节点广播的所述第二节点选择的备选群首节点；
确定被选择为备选群首节点次数最多的节点为群首节点。
可选的，本公开的上述实施例中，若第一节点被选择为群首节点，所述处理器400还用于：
向选择所述第一节点为群首节点的节点分别发送群首确认消息；其中，第一节点以及选择所述第一节点为群首节点的节点组成一个极大覆盖分群。
综上，本公开的上述实施例通过节点的覆盖状态信息交换和覆盖能力信息计算，选择出最大覆盖的群首节点，进而组成最少跳极大覆盖的无线骨干 网，从而实现无线异构网络中的高通信能力节点的有效利用，实现无线异构网络的最佳分群。
需要说明的是，本公开实施例提供的网络节点是能够执行上述极大覆盖分群方法的网络节点，则上述极大覆盖分群方法的所有实施例均适用于该网络节点，且均能达到相同或相似的有益效果。
如图5所示，本公开实施例还提供一种极大覆盖分群装置，应用于自组网的第一节点，包括：
第一广播模块51，用于确定并广播第一节点的覆盖能力信息；
第二信息获取模块52，用于获取第二节点广播的所述第二节点的覆盖能力信息；
分群模块53，用于根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
可选的，本公开的上述实施例中，所述装置还包括：
第三广播模块，用于周期性或基于事件触发机制广播测距信息，所述测距信息至少包括：测距信号；
第一信息获取模块，用于获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示。
可选的，本公开的上述实施例中，第一广播模块包括；
第一子模块，用于根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息。
可选的，本公开的上述实施例中，所述第一子模块包括：
第一单元，用于根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值；
第二单元，用于根据所述覆盖权值，确定第一节点的覆盖能力信息。
可选的，本公开的上述实施例中，所述第一单元进一步用于：
根据第二节点的覆盖状态信息以及第一公式，确定第二节点相对于第一节点的覆盖权值；其中，
第一公式为：
CW uv＝w 1*DRC uv+w 2*lg(LQI uv)；
其中，CW uv为第二节点相对于第一节点的覆盖权值；DRC uv为第二节点与第一节点的节点相对距离；LQI uv为第二节点与第一节点之间的链路状态指示；w 1、w 2为覆盖权值的影响因子。
可选的，本公开的上述实施例中，所述覆盖能力信息包括：覆盖能力值；
所述第二单元进一步用于：
根据最大邻接覆盖准则，确定最大的覆盖权值为所述第一节点的覆盖能力值；
或者，
根据最大连通覆盖准则，整合覆盖权值，确定整合得到的综合值为所述第一节点的覆盖能力值。
可选的，本公开的上述实施例中，所述第一广播模块包括：
第二子模块，用于根据所述第一节点对于第二节点的覆盖状态信息、第一节点的节点剩余能量指示、第一节点的节点意愿，确定第一节点的覆盖能力信息。
可选的，本公开的上述实施例中，所述第一子模块包括：
第三单元，用于接收第二节点采用P跳广播机制通过最多P个中间节点转发的覆盖状态信息；
其中，P为大于或者等于1的整数。
可选的，本公开的上述实施例中，P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
可选的，本公开的上述实施例中，所述分群模块包括：
第三子模块，用于根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择覆盖能力最大的节点为备选群首节点；
第四子模块，用于广播第一节点选择的备选群首节点，并采用P跳广播机制通过最多P个中间节点转发备选指示信息直到所述备选指示信息到达备 选群首节点，所述备选指示信息用于指示第一节点选择所述备选群首节点作为备选群首；P为大于或者等于1的整数；
第五子模块，用于接收第二节点广播的所述第二节点选择的备选群首节点；
第六子模块，用于确定被选择为备选群首节点次数最多的节点为群首节点。
第三子模块，用于，若第一节点被选择为群首节点，所述装置还包括：
群首确认模块，用于向选择所述第一节点为群首节点的节点分别发送群首确认消息；其中，第一节点以及选择所述第一节点为群首节点的节点组成一个极大覆盖分群。
综上，本公开的上述实施例通过节点的覆盖状态信息交换和覆盖能力信息计算，选择出最大覆盖的群首节点，进而组成最少跳极大覆盖的无线骨干网，从而实现无线异构网络中的高通信能力节点的有效利用，实现无线异构网络的最佳分群。
需要说明的是，本公开实施例提供的极大覆盖分群装置是能够执行上述极大覆盖分群方法的极大覆盖分群装置，则上述极大覆盖分群方法的所有实施例均适用于该极大覆盖分群装置，且均能达到相同或相似的有益效果。
本公开实施例还提供一种计算机可读存储介质，所述计算机可读存储介质上存储计算机程序，所述计算机程序被处理器执行时实现如上所述的极大覆盖分群方法实施例的各个过程，且能达到相同的技术效果，为避免重复，这里不再赘述。其中，所述的计算机可读存储介质，如只读存储器(Read-Only Memory，简称ROM)、随机存取存储器(Random Access Memory，简称RAM)、磁碟或者光盘等。
如图4所示，本公开实施例还提供一种网络节点，所述网络节点为自组网的第二节点，所述网络节点包括：收发机420、存储器410、处理器400及存储在所述存储器410上并可在所述处理器400上运行的程序，所述收发机420用于接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；
所述处理器400用于读取存储器中的程序，执行下列过程：根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至 少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示；
所述收发机420还用于：广播第一节点对于第二节点的覆盖状态信息。
可选的，本公开的上述实施例中，所述处理器400还用于：
根据所述测距信息以及第二公式，确定第二节点与第一节点的节点相对距离；
其中，第二公式为：
DRC uv＝Dist(u,v)/D o；
DRC uv为第二节点与第一节点的节点相对距离；Dist(u,v)为第二节点和第一节点之间的绝对距离；D o为标准覆盖距离，用于对绝对距离进行归一化操作；
根据所述测距信息测量接收信号的强度指示RSSI，并采用滑动滤波器对RSSI进行滤波，计算第二节点与第一节点之间的链路状态指示；
其中，滑动滤波器的滤波计算公式为：
Figure PCTCN2019122630-appb-000005
LQI uv(n)为第二节点与第一节点之间的链路状态指示；k为滑动滤波器的阶数；n为离散时间点；i为滑动滤波器的采样时间点。
可选的，本公开的上述实施例中，所述收发机420还用于：
采用P跳广播机制通过最多P个中间节点转发所述覆盖状态信息；其中，P为大于或者等于1的整数；
所述P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
综上，本公开的上述实施例通过节点的覆盖状态信息交换以辅助其他节点完成覆盖能力的估算，从而实现无线异构网络中的高通信能力节点的有效利用，实现无线异构网络的最佳分群。
需要说明的是，本公开实施例提供的网络节点是能够执行上述极大覆盖 分群方法的网络节点，则上述极大覆盖分群方法的所有实施例均适用于该网络节点，且均能达到相同或相似的有益效果。
如图6所示，本公开实施例还提供一种极大覆盖分群装置，应用于自组网的第二节点，包括：
第一接收模块61，用于接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；
第二确定模块62，用于根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示；
第二广播模块63，用于广播第一节点对于第二节点的覆盖状态信息。
可选的，本公开的上述实施例中，第二确定模块包括：
第八子模块，用于根据所述测距信息以及第二公式，确定第二节点与第一节点的节点相对距离；
其中，第二公式为：
DRC uv＝Dist(u,v)/D o；
DRC uv为第二节点与第一节点的节点相对距离；Dist(u,v)为第二节点和第一节点之间的绝对距离；D o为标准覆盖距离，用于对绝对距离进行归一化操作；
第九子模块，用于根据所述测距信息测量接收信号的强度指示RSSI，并采用滑动滤波器对RSSI进行滤波，计算第二节点与第一节点之间的链路状态指示；
其中，滑动滤波器的滤波计算公式为：
Figure PCTCN2019122630-appb-000006
LQI uv(n)为第二节点与第一节点之间的链路状态指示；k为滑动滤波器的阶数；n为离散时间点；i为滑动滤波器的采样时间点。
可选的，本公开的上述实施例中，所述第二广播模块包括：
广播子模块，用于采用P跳广播机制通过最多P个中间节点转发所述覆盖状态信息；其中，P为大于或者等于1的整数；
所述P跳广播机制的终止条件包括下述任意一个：
转发到达所述第一节点，终止广播；
存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
综上，本公开的上述实施例通过节点的覆盖状态信息交换以辅助其他节点完成覆盖能力的估算，从而实现无线异构网络中的高通信能力节点的有效利用，实现无线异构网络的最佳分群。
需要说明的是，本公开实施例提供的极大覆盖分群装置是能够执行上述极大覆盖分群方法的极大覆盖分群装置，则上述极大覆盖分群方法的所有实施例均适用于该极大覆盖分群装置，且均能达到相同或相似的有益效果。
本公开实施例还提供一种计算机可读存储介质，所述计算机可读存储介质上存储计算机程序，所述计算机程序被处理器执行时实现如上所述的极大覆盖分群方法实施例的各个过程，且能达到相同的技术效果，为避免重复，这里不再赘述。其中，所述的计算机可读存储介质，如只读存储器(Read-Only Memory，简称ROM)、随机存取存储器(Random Access Memory，简称RAM)、磁碟或者光盘等。
需要说明的是，在本文中，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者装置不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者装置所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括该要素的过程、方法、物品或者装置中还存在另外的相同要素。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到上述实施例方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端(可以是手机，计算机，服务器，空调器，或者网络设备等)执行本公开各个实施例所述的方法。
上面结合附图对本公开的实施例进行了描述，但是本公开并不局限于上述的具体实施方式，上述的具体实施方式仅仅是示意性的，而不是限制性的，本领域的普通技术人员在本公开的启示下，在不脱离本公开宗旨和权利要求所保护的范围情况下，还可做出很多形式，均属于本公开的保护之内。
以上所述是本公开的可选实施方式，应当指出，对于本技术领域的普通技术人员来说，在不脱离本公开所述原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也应视为本公开的保护范围。

Claims (31)

  1. 一种极大覆盖分群方法，应用于自组网的第一节点，包括：
    确定并广播第一节点的覆盖能力信息；
    获取第二节点广播的所述第二节点的覆盖能力信息；
    根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
  2. 根据权利要求1所述的方法，在所述确定并广播第一节点的覆盖能力信息之前，所述方法还包括：
    周期性或基于事件触发机制广播测距信息，所述测距信息至少包括：测距信号；
    获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示。
  3. 根据权利要求2所述的方法，其中，确定第一节点的覆盖能力信息，包括；
    根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息。
  4. 根据权利要求3所述的方法，其中，所述根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息，包括：
    根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值；
    根据所述覆盖权值，确定第一节点的覆盖能力信息。
  5. 根据权利要求4所述的方法，其中，根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值，包括：
    根据第二节点的覆盖状态信息以及第一公式，确定第二节点相对于第一节点的覆盖权值；其中，
    第一公式为：
    CW uv＝w 1*DRC uv+w 2*lg(LQI uv)；
    其中，CW uv为第二节点相对于第一节点的覆盖权值；DRC uv为第二节点 与第一节点的节点相对距离；LQI uv为第二节点与第一节点之间的链路状态指示；w 1、w 2为覆盖权值的影响因子。
  6. 根据权利要求4所述的方法，其中，所述覆盖能力信息包括：覆盖能力值；
    所述根据所述覆盖权值，确定第一节点的覆盖能力信息，包括：
    根据最大邻接覆盖准则，确定最大的覆盖权值为所述第一节点的覆盖能力值；
    或者，
    根据最大连通覆盖准则，整合覆盖权值，确定整合得到的综合值为所述第一节点的覆盖能力值。
  7. 根据权利要求1所述的方法，其中，所述确定第一节点的覆盖能力信息，包括：
    根据所述第一节点对于第二节点的覆盖状态信息、第一节点的节点剩余能量指示、第一节点的节点意愿，确定第一节点的覆盖能力信息。
  8. 根据权利要求2所述的方法，其中，所述获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，包括：
    接收第二节点采用P跳广播机制通过最多P个中间节点转发的覆盖状态信息；
    其中，P为大于或者等于1的整数。
  9. 根据权利要求8所述的方法，其中，P跳广播机制的终止条件包括下述任意一个：
    转发到达所述第一节点，终止广播；
    存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
  10. 根据权利要求1所述的方法，其中，所述根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，包括：
    根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择覆盖能力最大的节点为备选群首节点；
    广播第一节点选择的备选群首节点，并采用P跳广播机制通过最多P个 中间节点转发备选指示信息直到所述备选指示信息到达备选群首节点，所述备选指示信息用于指示第一节点选择所述备选群首节点作为备选群首；P为大于或者等于1的整数；
    接收第二节点广播的所述第二节点选择的备选群首节点；
    确定被选择为备选群首节点次数最多的节点为群首节点。
  11. 根据权利要求10所述的方法，其中，若第一节点被选择为群首节点，所述方法还包括：
    向选择所述第一节点为群首节点的节点分别发送群首确认消息；其中，第一节点以及选择所述第一节点为群首节点的节点组成一个极大覆盖分群。
  12. 一种极大覆盖分群方法，应用于自组网的第二节点，包括：
    接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；
    根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示；
    广播第一节点对于第二节点的覆盖状态信息。
  13. 根据权利要求12所述的方法，其中，所述根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，包括：
    根据所述测距信息以及第二公式，确定第二节点与第一节点的节点相对距离；
    其中，第二公式为：
    DRC uv＝Dist(u,v)/D o；
    DRC uv为第二节点与第一节点的节点相对距离；Dist(u,v)为第二节点和第一节点之间的绝对距离；D o为标准覆盖距离，用于对绝对距离进行归一化操作；
    根据所述测距信息测量接收信号的强度指示RSSI，并采用滑动滤波器对RSSI进行滤波，计算第二节点与第一节点之间的链路状态指示；
    其中，滑动滤波器的滤波计算公式为：
    Figure PCTCN2019122630-appb-100001
    LQI uv(n)为第二节点与第一节点之间的链路状态指示；k为滑动滤波器的阶数；n为离散时间点；i为滑动滤波器的采样时间点。
  14. 根据权利要求12所述的方法，其中，所述广播第一节点对于第二节点的覆盖状态信息，包括：
    采用P跳广播机制通过最多P个中间节点转发所述覆盖状态信息；其中，P为大于或者等于1的整数；
    所述P跳广播机制的终止条件包括下述任意一个：
    转发到达所述第一节点，终止广播；
    存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
  15. 一种网络节点，所述网络节点为自组网的第一节点，所述网络节点包括：收发机、存储器、处理器及存储在所述存储器上并可在所述处理器上运行的程序；其中，所述处理器用于确定第一节点的覆盖能力信息；
    所述收发机用于广播第一节点的覆盖能力信息；获取第二节点广播的所述第二节点的覆盖能力信息；
    所述处理器还用于：根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
  16. 根据权利要求15所述的网络节点，其中，所述收发机还用于：
    周期性或基于事件触发机制广播测距信息，所述测距信息至少包括：测距信号；
    获取第二节点基于所述测距信息广播的第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示。
  17. 根据权利要求16所述的网络节点，其中，所述处理器还用于：
    根据第二节点广播的第一节点对于第二节点的覆盖状态信息，确定第一节点的覆盖能力信息。
  18. 根据权利要求17所述的网络节点，其中，所述处理器还用于：
    根据所述覆盖状态信息，确定第二节点相对于第一节点的覆盖权值；
    根据所述覆盖权值，确定第一节点的覆盖能力信息。
  19. 根据权利要求18所述的网络节点，其中，所述处理器还用于：
    根据第二节点的覆盖状态信息以及第一公式，确定第二节点相对于第一节点的覆盖权值；其中，
    第一公式为：
    CW uv＝w 1*DRC uv+w 2*lg(LQI uv)；
    其中，CW uv为第二节点相对于第一节点的覆盖权值；DRC uv为第二节点与第一节点的节点相对距离；LQI uv为第二节点与第一节点之间的链路状态指示；w 1、w 2为覆盖权值的影响因子。
  20. 根据权利要求18所述的网络节点，其中，所述覆盖能力信息包括：覆盖能力值；
    所述处理器还用于：
    根据最大邻接覆盖准则，确定最大的覆盖权值为所述第一节点的覆盖能力值；
    或者，
    根据最大连通覆盖准则，整合覆盖权值，确定整合得到的综合值为所述第一节点的覆盖能力值。
  21. 根据权利要求15所述的网络节点，其中，所述处理器还用于：
    根据所述第一节点对于第二节点的覆盖状态信息、第一节点的节点剩余能量指示、第一节点的节点意愿，确定第一节点的覆盖能力信息。
  22. 根据权利要求16所述的网络节点，其中，所述收发机还用于：
    接收第二节点采用P跳广播机制通过最多P个中间节点转发的覆盖状态信息；
    其中，P为大于或者等于1的整数。
  23. 根据权利要求22所述的网络节点，其中，P跳广播机制的终止条件包括下述任意一个：
    转发到达所述第一节点，终止广播；
    存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
  24. 根据权利要求15所述的网络节点，其中，所述处理器还用于：
    根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择覆盖能力最大的节点为备选群首节点；
    广播第一节点选择的备选群首节点，并采用P跳广播机制通过最多P个中间节点转发备选指示信息直到所述备选指示信息到达备选群首节点，所述备选指示信息用于指示第一节点选择所述备选群首节点作为备选群首；P为大于或者等于1的整数；
    接收第二节点广播的所述第二节点选择的备选群首节点；
    确定被选择为备选群首节点次数最多的节点为群首节点。
  25. 根据权利要求24所述的网络节点，其中，若第一节点被选择为群首节点，所述处理器还用于：
    向选择所述第一节点为群首节点的节点分别发送群首确认消息；其中，第一节点以及选择所述第一节点为群首节点的节点组成一个极大覆盖分群。
  26. 一种极大覆盖分群装置，应用于自组网的第一节点，包括：
    第一广播模块，用于确定并广播第一节点的覆盖能力信息；
    第二信息获取模块，用于获取第二节点广播的所述第二节点的覆盖能力信息；
    分群模块，用于根据所述第一节点的覆盖能力信息和所述第二节点的覆盖能力信息，选择群首节点，组成极大覆盖分群。
  27. 一种网络节点，所述网络节点为自组网的第二节点，所述网络节点包括：收发机、存储器、处理器及存储在所述存储器上并可在所述处理器上运行的程序；其中，所述收发机用于接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；
    所述处理器用于读取存储器中的程序，执行下列过程：根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示；
    所述收发机还用于：广播第一节点对于第二节点的覆盖状态信息。
  28. 根据权利要求27所述的网络节点，其中，所述处理器还用于：
    根据所述测距信息以及第二公式，确定第二节点与第一节点的节点相对 距离；
    其中，第二公式为：
    DRC uv＝Dist(u,v)/D o；
    DRC uv为第二节点与第一节点的节点相对距离；Dist(u,v)为第二节点和第一节点之间的绝对距离；D o为标准覆盖距离，用于对绝对距离进行归一化操作；
    根据所述测距信息测量接收信号的强度指示RSSI，并采用滑动滤波器对RSSI进行滤波，计算第二节点与第一节点之间的链路状态指示；
    其中，滑动滤波器的滤波计算公式为：
    Figure PCTCN2019122630-appb-100002
    LQI uv(n)为第二节点与第一节点之间的链路状态指示；k为滑动滤波器的阶数；n为离散时间点；i为滑动滤波器的采样时间点。
  29. 根据权利要求27所述的网络节点，其中，所述收发机还用于：
    采用P跳广播机制通过最多P个中间节点转发所述覆盖状态信息；其中，P为大于或者等于1的整数；
    所述P跳广播机制的终止条件包括下述任意一个：
    转发到达所述第一节点，终止广播；
    存活时间TTL根据转发跳数，以1为步长进行递减，当TTL等于0时，终止广播；TTL的初始值等于P。
  30. 一种极大覆盖分群装置，应用于自组网的第二节点，包括：
    第一接收模块，用于接收第一节点广播的测距信息，所述测距信息至少包括：测距信号；
    第二确定模块，用于根据所述测距信息，确定第一节点对于第二节点的覆盖状态信息，所述覆盖状态信息至少包括：第二节点与第一节点的节点相对距离以及第二节点与第一节点之间的链路状态指示；
    第二广播模块，用于广播第一节点对于第二节点的覆盖状态信息。
  31. 一种计算机可读存储介质，其上存储计算机程序，所述计算机程序被处理器执行时实现如权利要求1至11中任一项所述的极大覆盖分群方法的 步骤；或者，所述计算机程序被处理器执行时实现如权利要求12至14中任一项所述的极大覆盖分群方法的步骤。
PCT/CN2019/122630 2018-12-20 2019-12-03 极大覆盖分群方法、装置及网络节点 Ceased WO2020125398A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811565895.8A CN111356201B (zh) 2018-12-20 2018-12-20 一种极大覆盖分群方法、装置及网络节点
CN201811565895.8 2018-12-20

Publications (1)

Publication Number Publication Date
WO2020125398A1 true WO2020125398A1 (zh) 2020-06-25

Family

ID=71100215

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/122630 Ceased WO2020125398A1 (zh) 2018-12-20 2019-12-03 极大覆盖分群方法、装置及网络节点

Country Status (2)

Country Link
CN (1) CN111356201B (zh)
WO (1) WO2020125398A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115119250A (zh) * 2022-07-06 2022-09-27 广州芯德通信科技股份有限公司 一种无线mesh网络节点距离的测量方法、WIFI设备及系统

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114143711B (zh) * 2021-11-25 2024-04-02 深圳Tcl新技术有限公司 信息处理方法、装置、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2110999A1 (en) * 2008-04-15 2009-10-21 NTT DoCoMo, Inc. Method and apparatus for forwarding data in a wireless network
CN103298056A (zh) * 2013-05-14 2013-09-11 华南师范大学 一种无线路由协议方法
CN104994020A (zh) * 2015-05-06 2015-10-21 天津理工大学 基于蜂群优化算法模型的预测性能量高效分簇路由方法
CN107087290A (zh) * 2017-02-17 2017-08-22 广东工业大学 一种无线传感器网络动态分簇目标跟踪方法及装置
CN108650137A (zh) * 2018-05-17 2018-10-12 辽宁大学 无线传感器网络节点自主决策式路由协议

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6744740B2 (en) * 2001-12-21 2004-06-01 Motorola, Inc. Network protocol for wireless devices utilizing location information
US7453864B2 (en) * 2003-04-30 2008-11-18 Harris Corporation Predictive route maintenance in a mobile ad hoc network
US7382765B2 (en) * 2003-04-30 2008-06-03 Harris Corporation Predictive routing in a moble ad hoc network
CN100568843C (zh) * 2006-07-20 2009-12-09 北京航空航天大学 稳定节能分群方法
GB2440982A (en) * 2006-08-18 2008-02-20 Fujitsu Ltd Wireless multi-hop communication system
GB2440983A (en) * 2006-08-18 2008-02-20 Fujitsu Ltd Wireless multi-hop communication system
CN100438450C (zh) * 2007-02-08 2008-11-26 北京航空航天大学 稳定节能分群维护方法
CN102630097B (zh) * 2009-05-19 2015-04-29 华为技术有限公司 分组数据发送方法、基站和终端
CN101835099B (zh) * 2010-04-23 2013-01-23 西安电子科技大学 基于分簇与rrep广播的大规模传感器网络路由方法
CN101854666B (zh) * 2010-04-27 2013-04-03 南京工业大学 一种自定义的无线传感器网络跨区多跳路由方法
CN102368863B (zh) * 2011-10-24 2014-02-26 中国人民解放军理工大学 一种基于网络分簇和信息摆渡的无线自组应急通信网
CN102595412B (zh) * 2012-01-10 2014-05-07 南京邮电大学 一种基于移动节点的无线传感器网络分簇拓扑控制方法
CN103024814B (zh) * 2013-01-09 2015-06-24 中国人民解放军理工大学 一种基于冗余控制和分簇路由的无线传感网节能方法
CN105050095B (zh) * 2015-04-02 2019-01-22 浙江理工大学 一种基于能量预测的异构无线传感网的拓扑构建方法
CN106879041A (zh) * 2015-12-11 2017-06-20 中南大学 Ad Hoc网络分簇算法和路由协议的设计
CN106028416B (zh) * 2016-05-03 2018-12-25 中南大学 一种成簇范围与簇间通信模式双自适应的改进成簇方法
CN106792569B (zh) * 2016-11-25 2020-10-23 电子科技大学 基于分簇多播的集群系统切换方法
CN107371188B (zh) * 2017-07-26 2020-06-02 浙江工业大学 一种可控簇规模的能耗均衡路由方法
CN107786960A (zh) * 2017-10-30 2018-03-09 吴豪 网络分簇方法、装置、电子设备和计算机存储介质
CN107995667A (zh) * 2017-12-19 2018-05-04 浙江工业大学 一种可控簇规模的能耗均衡路由方法
CN108566658B (zh) * 2018-03-02 2021-06-08 北京信息科技大学 一种无线传感器网络中能耗均衡的分簇算法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2110999A1 (en) * 2008-04-15 2009-10-21 NTT DoCoMo, Inc. Method and apparatus for forwarding data in a wireless network
CN103298056A (zh) * 2013-05-14 2013-09-11 华南师范大学 一种无线路由协议方法
CN104994020A (zh) * 2015-05-06 2015-10-21 天津理工大学 基于蜂群优化算法模型的预测性能量高效分簇路由方法
CN107087290A (zh) * 2017-02-17 2017-08-22 广东工业大学 一种无线传感器网络动态分簇目标跟踪方法及装置
CN108650137A (zh) * 2018-05-17 2018-10-12 辽宁大学 无线传感器网络节点自主决策式路由协议

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115119250A (zh) * 2022-07-06 2022-09-27 广州芯德通信科技股份有限公司 一种无线mesh网络节点距离的测量方法、WIFI设备及系统
CN115119250B (zh) * 2022-07-06 2023-01-31 广州芯德通信科技股份有限公司 一种无线mesh网络节点距离的测量方法、WIFI设备及系统

Also Published As

Publication number Publication date
CN111356201B (zh) 2022-04-15
CN111356201A (zh) 2020-06-30

Similar Documents

Publication Publication Date Title
US10993201B2 (en) Location aware networking for ad-hoc networks and method therefor
Hong et al. Load balanced, energy-aware communications for Mars sensor networks
KR100987292B1 (ko) 무선 통신 네트워크에서의 네트워크 토폴로지 변화에 기초해 노드 이동성을 검출하기 위한 시스템 및 방법
EP2587848B1 (en) Method, apparatus, and computer program product for discovery of wireless networks
US20060109815A1 (en) System and method for dynamic frequency selection in a multihopping wireless network
CN109673035A (zh) 一种适于无线自组织网络的路由建立与维护方法
CN101478805A (zh) 一种基于机会通信的DTN网络Anycast路由方法
CN115665860A (zh) 一种基于候鸟群特性的无人机自组网的资源分配方法
CN112261665B (zh) 一种自组织网络的组网方法
Nair et al. Prediction based link stability scheme for mobile ad hoc networks
CN111356201B (zh) 一种极大覆盖分群方法、装置及网络节点
Lim et al. A hybrid centralized routing protocol for 802.11 s WMNs
Krishnakumar et al. Geographic Drone-based Route Optimization Approach for Emergency Area Ad-Hoc Network.
Dong et al. A maximally radio-disjoint geographic multipath routing protocol for MANET
Khan et al. Mobile collector aided energy reduced (MCER) data collection in agricultural wireless sensor networks
Padyal et al. Continuous neighbour discovery approach for improvement of routing performance in WSN
Marwaha et al. Challenges and recent advances in QoS provisioning in wireless mesh networks
Shete et al. Routing Protocols for Multi-hop Ad Hoc Networks: Operational Challenges and Design Optimizations
Sheikh A self-organizing location and mobility-aware route optimization protocol for bluetooth wireless
Rajkumar et al. ELMP: Efficient location based multicast protocol for mobile ad hoc networks
Jinke et al. High-dynamic adaptive geographic routing protocol based on topology for Smart Clusters
KR20240077396A (ko) 고장에 강한 이동형 임시 비상망 구성 방법 및 그 시스템
Shui et al. A cross-layer design for distributed channel assignment over multi-radio multi-channel wireless mesh networks
Venkatachalam et al. Multiple cross-layer design based complete architecture for mobile adhoc networks
Touzene et al. GRID based broadcast algorithm in mobile wireless ad-hoc networks an analytical study

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19900481

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19900481

Country of ref document: EP

Kind code of ref document: A1