CN111356201A - Method and device for grouping great coverage and network node - Google Patents
Method and device for grouping great coverage and network node Download PDFInfo
- Publication number
- CN111356201A CN111356201A CN201811565895.8A CN201811565895A CN111356201A CN 111356201 A CN111356201 A CN 111356201A CN 201811565895 A CN201811565895 A CN 201811565895A CN 111356201 A CN111356201 A CN 111356201A
- Authority
- CN
- China
- Prior art keywords
- node
- coverage
- information
- determining
- cluster head
- 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.)
- Granted
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
Abstract
The invention provides a method, a device and a network node for maximum coverage clustering, wherein the method comprises the following steps: determining and broadcasting coverage capability information of a first node; acquiring coverage capability information of a second node broadcasted by the second node; selecting a cluster 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 cluster; according to the embodiment of the invention, the cluster head node with the largest coverage is preferably selected through the coverage state information exchange and the coverage capability information calculation of the nodes, and then the wireless backbone network with the least hop and the largest coverage is formed, so that the effective utilization of the nodes with high communication capability in the wireless heterogeneous network is realized, and the optimal clustering of the wireless heterogeneous network is realized.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a method, a device and a network node for extremely large coverage clustering.
Background
The wireless Ad hoc network (i.e. Ad hoc network) integrates the technologies of mobile wireless communication, computer network and the like, can realize quick and automatic networking without depending on preset communication infrastructure, has the characteristics of self-organization, self-healing, no center, multi-hop routing, high survivability and the like, and is suitable for emergent and temporary emergency communication occasions. The maintenance flexibility and robustness of network organization can be improved by utilizing the multi-hop forwarding and self-organization characteristics of the Ad hoc network.
However, the scalability of the planar Ad hoc network is poor, and an effective method for solving the problem of the scalability of the Ad hoc network is to construct a hierarchical network topology structure by clustering, and the basic idea of clustering is to divide network nodes into a plurality of groups according to geographical proximity relation, so as to provide a smaller-scale logic organization for the network, and to make the network easy to manage. The node sets in the clusters can share channel resources, and the spatial multiplexing of time slots and spreading codes is conveniently realized among the clusters, so that the channel throughput is improved. An important node forming a network Cluster structure is the Cluster-Head (Cluster-Head), which is responsible for establishing the Cluster and maintaining the network topology. The Set of cluster heads is called a Dominating Set (DS), and inter-cluster communication is realized through direct-view (LOS) links or Gateway (Gateway) forwarding between them, and the Dominating node sets that are Connected with each other are also called Connected Dominating Sets (CDS).
The minimum connected dominating set problem is a non-determinacy (NP-hard) problem, and the grouping generation of the ad-hoc network adopts a heuristic algorithm to carry out grouping division. According to different group head selection principles, the algorithm can be divided into a minimum ID priority algorithm, a maximum connectivity priority algorithm, a maximum weight priority algorithm and the like. In the minimum ID priority algorithm, the probability that the node with the smaller ID is called as the cluster head is far higher than that of other nodes, and the algorithm lacks fairness. The maximum connectivity priority algorithm takes connectivity as a heuristic selection cluster head node, the load balance is poor, and the requirements of the network in the aspects of stability, expansibility and the like cannot be comprehensively considered. The clustering algorithm based on the weight comprehensively considers various factors of enhancing the stability of the cluster structure, such as the node degree, the mobility and the like of the system, so that the network can be ensured to have more reliable performance, the selection of the weight has great subjectivity, and the practicability of the algorithm is reduced.
The existing clustering technology generally assumes that each node in the network has the same communication coverage range, the communication capability of the node cannot be distinguished, and the generated clustering structure can only cover limited communication distance and cannot be applied to a wireless heterogeneous network formed by multiple types of nodes.
Disclosure of Invention
The invention aims to provide a method, a device and a network node for maximum coverage clustering, so as to solve the clustering problem of a wireless heterogeneous network formed by multiple types of nodes in the prior art.
In order to solve the above problem, an embodiment of the present invention provides a maximum coverage clustering method applied to a first node of an ad hoc network, including:
determining and broadcasting coverage capability information of a first node;
acquiring coverage capability information of a second node broadcasted by the second node;
and selecting a cluster 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 cluster.
Wherein, before determining and broadcasting the coverage capability information of the first node, the method further comprises:
periodically or based on an event trigger mechanism, broadcasting ranging information, wherein the ranging information at least comprises: a ranging signal;
acquiring coverage state information of the second node broadcast by the second node based on the ranging information, wherein the coverage state information at least comprises: a node relative distance of the second node from the first node and a link state indication between the second node and the first node.
Wherein, determining the coverage capability information of the first node comprises;
and determining the coverage capability information of the first node according to the coverage state information of the second node broadcasted by the second node and relative to the first node.
Wherein, the determining the coverage capability information of the first node according to the coverage status information of the second node broadcasted by the first node to the second node comprises:
determining a coverage weight of the second node relative to the first node according to the coverage state information;
and determining the coverage capability information of the first node according to the coverage weight.
Determining a coverage weight of the second node relative to the first node according to the coverage state information, including:
determining a coverage weight of the second node relative to the first node according to the coverage state information of the second node and a first formula; wherein the content of the first and second substances,
the first formula is:
CWuv＝w1*DRCuv+w2*lg(LQIuv)；
wherein CWuvThe coverage weight of the second node relative to the first node; DRCuvThe relative distance between the second node and the first node is taken as the node relative distance; LQIuvIs a link state indication between the second node and the first node; w is a1、w2Is the influence factor of the coverage weight.
Wherein the overlay capability information includes: a value of covering power;
the determining the coverage capability information of the first node according to the coverage weight includes:
determining the maximum coverage weight as the coverage capability value of the first node according to the maximum adjacent coverage criterion;
alternatively, the first and second electrodes may be,
and integrating the coverage weight according to the maximum communication coverage criterion, and determining a comprehensive value obtained by integration as the coverage capability value of the first node.
Wherein the determining coverage capability information of the first node comprises:
and determining the coverage capability information of the first node according to the coverage state information of the first node to the second node, the node residual energy indication of the first node and the node intention of the first node.
Wherein the acquiring coverage state information of the second node broadcast by the second node based on the ranging information, includes:
receiving coverage state information forwarded by a second node through at most P intermediate nodes by adopting a P-hop broadcasting mechanism;
wherein P is an integer greater than or equal to 1.
Wherein, the termination condition of the P-hop broadcast mechanism comprises any one of the following conditions:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
Wherein the selecting a cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node comprises:
selecting the node with the maximum coverage capability as a candidate cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node;
broadcasting the alternative cluster head node selected by the first node, and forwarding alternative indication information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism until the alternative indication information reaches the alternative cluster head node, wherein the alternative indication information is used for indicating the first node to select the alternative cluster head node as an alternative cluster head; p is an integer greater than or equal to 1;
receiving a standby cluster head node broadcast by a second node and selected by the second node;
and determining the node which is selected as the candidate cluster head node most frequently as the cluster head node.
Wherein, if the first node is selected as the cluster head node, the method further comprises:
respectively sending a cluster head confirmation message to the nodes which select the first node as the cluster head node; the first node and the node which selects the first node as the cluster head node form a maximum coverage cluster.
The embodiment of the invention also provides a maximum coverage clustering method, which is applied to a second node of an ad hoc network and comprises the following steps:
receiving ranging information broadcast by a first node, wherein the ranging information at least comprises: a ranging signal;
according to the ranging information, determining coverage state information of the first node to the second node, wherein the coverage state information at least comprises: the relative distance between the second node and the first node and the link state indication between the second node and the first node;
the coverage status information of the first node for the second node is broadcast.
Wherein, the determining the coverage state information of the first node to the second node according to the ranging information includes:
determining the node relative distance between the second node and the first node according to the ranging information and a second formula;
wherein the second formula is:
DRCuv＝Dist(u,v)/Do；
DRCuvthe relative distance between the second node and the first node is taken as the node relative distance; dist (u, v) is the absolute distance between the second node and the first node; doThe standard coverage distance is used for carrying out normalization operation on the absolute distance;
measuring the strength indication RSSI of the received signal according to the ranging information, filtering the RSSI by adopting a sliding filter, and calculating a link state indication between the second node and the first node;
the filtering calculation formula of the sliding filter is as follows:
LQIuv(n) is a link state indication between the second node and the first node; k is the order of the sliding filter; n is a discrete time point; i is the sampling time point of the sliding filter.
Wherein the broadcasting the coverage status information of the first node to the second node comprises:
forwarding the coverage state information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism; wherein, P is an integer greater than or equal to 1;
the termination condition of the P-hop broadcast mechanism includes any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
An embodiment of the present invention further provides a network node, where the network node is a first node of an ad hoc network, and the network node includes: a transceiver, a memory, a processor, and a program stored on the memory and executable on the processor, the processor to determine coverage capability information for a first node;
the transceiver is used for broadcasting the coverage capability information of the first node; acquiring coverage capability information of a second node broadcasted by the second node;
the processor is further configured to: and selecting a cluster 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 cluster.
Wherein the transceiver is further configured to:
periodically or based on an event trigger mechanism, broadcasting ranging information, wherein the ranging information at least comprises: a ranging signal;
acquiring coverage state information of the second node broadcast by the second node based on the ranging information, wherein the coverage state information at least comprises: a node relative distance of the second node from the first node and a link state indication between the second node and the first node.
Wherein the processor is further configured to:
and determining the coverage capability information of the first node according to the coverage state information of the second node broadcasted by the second node and relative to the first node.
Wherein the processor is further configured to:
determining a coverage weight of the second node relative to the first node according to the coverage state information;
and determining the coverage capability information of the first node according to the coverage weight.
Wherein the processor is further configured to:
determining a coverage weight of the second node relative to the first node according to the coverage state information of the second node and a first formula; wherein the content of the first and second substances,
the first formula is:
CWuv＝w1*DRCuv+w2*lg(LQIuv)；
wherein CWuvThe coverage weight of the second node relative to the first node; DRCuvThe relative distance between the second node and the first node is taken as the node relative distance; LQIuvIs a link state indication between the second node and the first node; w is a1、w2Is the influence factor of the coverage weight.
Wherein the overlay capability information includes: a value of covering power;
the processor is further configured to:
determining the maximum coverage weight as the coverage capability value of the first node according to the maximum adjacent coverage criterion;
alternatively, the first and second electrodes may be,
and integrating the coverage weight according to the maximum communication coverage criterion, and determining a comprehensive value obtained by integration as the coverage capability value of the first node.
Wherein the processor is further configured to:
and determining the coverage capability information of the first node according to the coverage state information of the first node to the second node, the node residual energy indication of the first node and the node intention of the first node.
Wherein the transceiver is further configured to:
receiving coverage state information forwarded by a second node through at most P intermediate nodes by adopting a P-hop broadcasting mechanism;
wherein P is an integer greater than or equal to 1.
Wherein, the termination condition of the P-hop broadcast mechanism comprises any one of the following conditions:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
Wherein the processor is further configured to:
selecting the node with the maximum coverage capability as a candidate cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node;
broadcasting the alternative cluster head node selected by the first node, and forwarding alternative indication information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism until the alternative indication information reaches the alternative cluster head node, wherein the alternative indication information is used for indicating the first node to select the alternative cluster head node as an alternative cluster head; p is an integer greater than or equal to 1;
receiving a standby cluster head node broadcast by a second node and selected by the second node;
and determining the node which is selected as the candidate cluster head node most frequently as the cluster head node.
Wherein, if the first node is selected as the cluster head node, the processor is further configured to:
respectively sending a cluster head confirmation message to the nodes which select the first node as the cluster head node; the first node and the node which selects the first node as the cluster head node form a maximum coverage cluster.
The embodiment of the present invention further provides a maximum coverage clustering apparatus, which is applied to a first node of an ad hoc network, and includes:
the first broadcast module is used for determining and broadcasting the coverage capability information of the first node;
the second information acquisition module is used for acquiring the coverage capability information of the second node broadcasted by the second node;
and the clustering module is used for selecting a cluster 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 cluster.
An embodiment of the present invention further provides a network node, where the network node is a second node of an ad hoc network, and the network node includes: a transceiver, a memory, a processor, and a program stored on the memory and executable on the processor, the transceiver configured to receive ranging information broadcast by a first node, the ranging information comprising at least: a ranging signal;
the processor is used for reading the program in the memory and executing the following processes: according to the ranging information, determining coverage state information of the first node to the second node, wherein the coverage state information at least comprises: the relative distance between the second node and the first node and the link state indication between the second node and the first node;
the transceiver is further configured to: the coverage status information of the first node for the second node is broadcast.
Wherein the processor is further configured to:
determining the node relative distance between the second node and the first node according to the ranging information and a second formula;
wherein the second formula is:
DRCuv＝Dist(u,v)/Do；
DRCuvthe relative distance between the second node and the first node is taken as the node relative distance; dist (u, v) is the absolute distance between the second node and the first node; doThe standard coverage distance is used for carrying out normalization operation on the absolute distance;
measuring the strength indication RSSI of the received signal according to the ranging information, filtering the RSSI by adopting a sliding filter, and calculating a link state indication between the second node and the first node;
the filtering calculation formula of the sliding filter is as follows:
LQIuv(n) is a link state indication between the second node and the first node; k is the order of the sliding filter; n isAre discrete time points; i is the sampling time point of the sliding filter.
Wherein the transceiver is further configured to:
forwarding the coverage state information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism; wherein, P is an integer greater than or equal to 1;
the termination condition of the P-hop broadcast mechanism includes any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
The embodiment of the present invention further provides a maximum coverage clustering apparatus, which is applied to a second node of an ad hoc network, and includes:
a first receiving module, configured to receive ranging information broadcast by a first node, where the ranging information at least includes: a ranging signal;
a second determining module, configured to determine, according to the ranging information, coverage state information of the first node with respect to the second node, where the coverage state information at least includes: the relative distance between the second node and the first node and the link state indication between the second node and the first node;
and the second broadcasting module is used for broadcasting the coverage state information of the first node to the second node.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the maximum coverage clustering method described above are implemented.
The technical scheme of the invention at least has the following beneficial effects:
in the maximal coverage clustering method, the maximal coverage clustering device and the network nodes, the cluster head node with the maximal coverage is preferably selected through the coverage state information exchange and the coverage capability information calculation of the nodes, and then the wireless backbone network with the minimal jump of the maximal coverage is formed, so that the effective utilization of the nodes with high communication capability in the wireless heterogeneous network is realized, and the optimal clustering of the wireless heterogeneous network is realized.
Drawings
FIG. 1 is a flow chart illustrating one embodiment of a method for maximum coverage clustering;
FIG. 2 is a second flowchart illustrating a step of a method for maximal coverage clustering according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating steps of a specific example of a method for maximum coverage clustering according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a network node according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a very large coverage clustering apparatus according to an embodiment of the present invention;
fig. 6 is a second schematic structural diagram of a maximum coverage grouping apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific embodiments.
As shown in fig. 1, an embodiment of the present invention provides a maximum coverage clustering method applied to a first node of an ad hoc network, including:
And step 13, selecting a cluster 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 cluster.
In the embodiment of the present invention, the first node is any one network node in the ad hoc network, the second node is a neighboring node of the first node, the first node has at least one neighboring node, that is, the second node is specifically at least one node, and the first node and the second node communicate through broadcasting.
The maximal coverage clustering method provided by the embodiment of the invention is a clustering method based on coverage priority, and can solve the problem of generation of a connected dominating set of a heterogeneous interconnection network. Preferably, the ad hoc network related to the embodiment of the present invention is an ad hoc network including a plurality of types of nodes; for example, the nodes of multiple types may be: ground vehicle-mounted nodes, ground walking nodes, lift-off nodes, and the like.
In the embodiment of the invention, the wireless backbone network formed by preferably selecting the nodes with the maximum coverage capacity as the cluster head and the backbone network nodes can provide communication coverage in a very large range with the hop count as few as possible; meanwhile, the large coverage cluster head can provide multi-hop coverage in the cluster, and the node capacity in the cluster is effectively increased.
As an alternative embodiment, before step 11, the method provided in the embodiment of the present invention further includes:
periodically or based on an event trigger mechanism, broadcasting ranging information, wherein the ranging information at least comprises: a ranging signal; the ranging information may further include: the node ID number of the first node and other extension information.
Acquiring coverage state information of the second node broadcast by the second node based on the ranging information, wherein the coverage state information at least comprises: a node relative distance of the second node from the first node and a link state indication between the second node and the first node. The overlay status information may further include: the node ID number of the second node.
The steps form a neighbor discovery process of the first node, and after a period of neighbor discovery, the neighbor state information table maintained by the node tends to be stable. Incompletely, the neighbor state information table includes: coverage status information broadcast by the plurality of second nodes. For example, a neighbor state information table as shown in table 1.
TABLE 1
| Node ID number 1 | Relative distance of nodes | Link state indication |
| Node ID number 2 | Relative distance of nodes | Link state indication |
| …… | …… | …… |
| Node ID number n | Relative distance of nodes | Link state indication |
The network nodes of the ad hoc network broadcast the coverage state information by adopting a periodic or event triggering mechanism, so that other nodes can perform neighbor cell discovery and neighbor cell state information maintenance. Each network node of the ad hoc network can obtain the coverage state information based on the ranging information measurement of other nodes. The event triggering mechanism comprises any one of the following: node activation, node deactivation, link activation, link interruption.
The coverage status information includes at least: a node relative Distance (DRC) between the second node and the first node, and a Link Quality Indicator (LQI) between the second node and the first node. The overlay status information may further include: the node ID number of the second node.
Bearing the above example, step 11 in the above embodiment of the present invention includes;
and determining the coverage capability information of the first node according to the coverage state information of the second node broadcasted by the second node and relative to the first node.
In order to complete the coverage capability estimation of the first node (also referred to as a sending node), the second node (also referred to as a receiving node) needs to feed back the node relative distance and the link state indication to the first node, but the second node with weak coverage capability may not be able to directly realize the feedback information transmission by adopting a line-of-sight communication means. To this end, in the above embodiment of the present invention, the acquiring coverage status information of the second node broadcast by the second node based on the ranging information includes:
receiving coverage state information forwarded by a second node through at most P intermediate nodes by adopting a P-hop broadcasting mechanism;
wherein P is an integer greater than or equal to 1.
Note that, for a node with high coverage capability, coverage state information is directly fed back to the first node by directly adopting a line-of-sight communication means, and a description thereof is not given here.
The P-hop broadcast mechanism in the embodiment of the present invention adopts a flooding limiting principle, and two parameters, namely a destination node ID number (Dest ID, i.e. ID number of a first node) and TTL, are used as P-hop broadcast termination conditions, that is, the termination conditions of the P-hop broadcast mechanism include any one of the following:
forwarding to the first node (e.g., forwarding the arriving node ID equals the first node ID), terminating the broadcast;
the survival time TTL (time To live) is decreased by taking 1 as a step length according To the forwarding hop count, and when the TTL is equal To 0, the broadcast is stopped; the initial value of TTL is equal to P.
The P-hop broadcast mechanism adopts a flooding limiting principle, can prevent the broadcast storm problem caused by large-scale multi-hop broadcast, and can record the optimal multi-hop path from a receiving node to a sending node in the multi-hop forwarding process, thereby simplifying the establishment process of the intra-cluster node multi-hop route.
As a preferred embodiment, the determining coverage capability information of the first node according to the coverage status information of the second node broadcast by the second node, includes:
determining a coverage weight of the second node relative to the first node according to the coverage state information;
and determining the coverage capability information of the first node according to the coverage weight.
In this embodiment of the present invention, based on the Coverage status information of the plurality of second nodes, the first node may calculate a Coverage Weight (CW) of each second node with respect to the first node. The calculation method is as follows: determining a coverage weight of the second node relative to the first node according to the coverage state information, including:
determining a coverage weight of the second node relative to the first node according to the coverage state information of the second node and a first formula; wherein the content of the first and second substances,
the first formula is:
CWuv＝w1*DRCuv+w2*lg(LQIuv)；
wherein CWuvThe coverage weight of the second node relative to the first node; DRCuvThe relative distance between the second node and the first node is taken as the node relative distance; LQIuvIs a link state indication between the second node and the first node; w is a1、w2Wherein v ∈ N (u) indicates that node v (i.e. the second node) is any neighbor node of node u (i.e. the first node), Lg (LQI)uv) Is the coverage quality of the second node.
Under a certain evaluation criterion, the weight set (CW) can be covered by the second nodeuvAnd estimating the Coverage Capability (CCu) of the first node, wherein the CCu is used for effectively characterizing the Coverage Capability of the first node. The embodiment of the invention provides two coverage capability estimation criteria: a maximum adjacent coverage criterion and a maximum connected coverage criterion.
Preferably, the coverage capability information includes: a value of covering power; the determining the coverage capability information of the first node according to the coverage weight includes:
determining the maximum coverage weight (second node coverage weight set { CW) according to the maximum adjacent coverage criterionuvThe largest covering weight in the } is the first one)A coverage capability value of a node; namely CCu＝Max{CWuvV ∈ N (u), wherein, the formulauvV ∈ n (u) indicates that node v (i.e., the second node) is any neighbor node of node u (i.e., the first node).
Alternatively, the first and second electrodes may be,
according to the maximum connected coverage criterion, integrating the coverage weight (integrating the second node coverage weight set { CW)uv}) determining a comprehensive value obtained by integration as the coverage capability value of the first node; namely CCu＝∑vCWuvV ∈ N (u), wherein CWuvV ∈ N (u) indicates that node v (i.e., the second node) is any neighbor node of node u (i.e., the first node).
As another alternative, the determining the coverage capability information of the first node in step 11 includes:
and determining the coverage capability information of the first node according to the coverage state information of the first node to the second node, the node residual energy indication of the first node and the node intention of the first node.
In the embodiment of the present invention, the coverage capability estimation of the node may further consider factors such as a Residual Energy Indicator (REI) of the node and a Willingness (Willingness), and perform a linear weighting method to perform a comprehensive estimation, so that the capability of the node suitable for serving as a group head role can be more comprehensively estimated. Wherein the Remaining Energy Indication (REI) may be used in absolute value or percentage for indicating the remaining of energy.
As a preferred embodiment, step 13 comprises:
selecting the node with the maximum coverage capability as a candidate cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node;
broadcasting the alternative cluster head node selected by the first node, and forwarding alternative indication information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism until the alternative indication information reaches the alternative cluster head node, wherein the alternative indication information is used for indicating the first node to select the alternative cluster head node as an alternative cluster head; p is an integer greater than or equal to 1;
receiving a standby cluster head node broadcast by a second node and selected by the second node;
and determining the node which is selected as the candidate cluster head node most frequently as the cluster head node.
After the self coverage capability of the network nodes of the ad hoc network is estimated, the nodes broadcast the self coverage capability values outwards, and each node adopts a distributed algorithm to select the cluster head node.
Firstly, each node selects a neighboring node set (namely a plurality of second nodes) and a node with the maximum coverage capability in the node as a candidate cluster head, namely CHcan(u)＝Max(CCv∪CCu) V ∈ N (u), wherein, CHcan(u) as head of alternative group, CCuFor coverage capability of the first node, CCvV ∈ N (u) indicates that node v (i.e., the second node) is any neighbor node to node u (i.e., the first node).
After the selection of the candidate cluster head node is finished, the node broadcasts the self-selected candidate cluster head node to the surrounding nodes, and broadcasts the cluster head candidate information by adopting a P-hop broadcasting mechanism until the candidate cluster head node is reached. In the P-hop range, the candidate group head node that obtains the most referrals is called the group head node.
Further, if the first node is selected as the cluster head node, the method further includes:
respectively sending a cluster head confirmation message to the nodes which select the first node as the cluster head node; the first node and the node which selects the first node as the cluster head node form a maximum coverage cluster.
In the embodiment of the invention, after a certain node is selected as the cluster head node, the cluster head node confirms the cluster head identity of the node through a single-hop broadcasting mechanism. At the same time, other nodes within its coverage area are identified as normal nodes within its cluster. For example, if the neighbor node v of the node u selects the node u as the cluster head, the node v broadcasts the message of selecting the node u to the network, and after receiving the message, the node u knows that the node v selects the node u as the cluster head, and then the node u unicasts the message of confirming the cluster head to the node v.
Further, after the maximal coverage clusters are formed, similar to other clustering algorithms, nodes at the intersection of the multiple maximal coverage clusters declare their gateway roles. At this time, the topological connections between the headers and the gateways of the plurality of very large coverage clusters form a backbone network.
Because the cluster head of the large-coverage clustering can cover multi-hop distance beyond common nodes, the wireless backbone network can realize large-range communication coverage with the hop count as less as possible.
In summary, in the embodiments of the present invention, through the coverage state information exchange and the coverage capability information calculation of the nodes, the cluster head node with the largest coverage is preferably selected, and then the wireless backbone network with the least hop of the largest coverage is formed, so that the efficient utilization of the high communication capability node in the wireless heterogeneous network is realized, and the optimal clustering of the wireless heterogeneous network is realized.
As shown in fig. 2, an embodiment of the present invention further provides a maximum coverage clustering method applied to a second node of an ad hoc network, including:
For example, as shown in table 2, a format example of the ranging information is shown.
TABLE 2
| Ranging signal | Node ID number | Extension information |
The maximal coverage clustering method provided by the embodiment of the invention is a clustering method based on coverage priority, and can solve the problem of generation of a connected dominating set of a heterogeneous interconnection network. Preferably, the ad hoc network related to the embodiment of the present invention is an ad hoc network including a plurality of types of nodes; for example, the nodes of multiple types may be: ground vehicle-mounted nodes, ground walking nodes, lift-off nodes, and the like.
In the embodiment of the invention, the second node is any one network node in the ad hoc network, the first node is a neighbor node of the first node, and the first node and the second node are communicated through broadcasting.
The self-organized network broadcasts the measurement at the network node to obtain the coverage state information, and other nodes can perform neighbor discovery and neighbor state information maintenance. Each network node of the ad hoc network can obtain the coverage state information based on the ranging information measurement of other nodes.
As one embodiment, step 22 includes:
determining the node relative distance between the second node and the first node according to the ranging information and a second formula;
wherein the second formula is:
DRCuv＝Dist(u,v)/Do；
DRCuvthe relative distance between the second node and the first node is taken as the node relative distance; dist (u, v) is the absolute distance between the second node and the first node; doThe standard coverage distance is used for carrying out normalization operation on the absolute distance; doValues (such as 1km) can be taken according to design indexes, and normalization operation is carried out on the absolute distance.
Measuring the strength indication RSSI of the received signal according to the ranging information, filtering the RSSI by adopting a sliding filter, and calculating a link state indication between the second node and the first node;
the filtering calculation formula of the sliding filter is as follows:
LQIuv(n) is a link state indication between the second node and the first node; k is the order of the sliding filter; n is a discrete time point; i is the sampling time point of the sliding filter.
The DRC isuvAnd LQIuv(n) the calculation is not limited to the order before and after, for example, a node receiving the neighboring node coverage status information broadcast first measures the quality of the received signal (RSSI) and performs the link quality calculation (LQI) by using the sliding filtering method; then, some one-way ranging technique (such as DOR) adapted to the ranging signal is used to perform inter-node distance measurement, so as to resolve other fields of the node status information, including the node ID number and other extension information.
The link state indicator (LQI) is used to characterize the link quality over a period of time, and may employ algorithms such as moving average, median filtering, etc. to filter the RSSI, which is an indicator of the strength of the received signal, so as to form a stability prediction of the link state.
In order to complete the coverage capability estimation of the first node (also referred to as a sending node), the second node (also referred to as a receiving node) needs to feed back the node relative distance and the link state indication to the first node, but the second node with weak coverage capability may not be able to directly realize the feedback information transmission by adopting a line-of-sight communication means. To this end, in the above embodiment of the present invention, step 23 includes:
forwarding the coverage state information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism; wherein, P is an integer greater than or equal to 1;
the P-hop broadcast mechanism in the embodiment of the present invention adopts a flooding limiting principle, and two parameters, namely a destination node ID number (Dest ID, i.e. ID number of a first node) and TTL, are used as P-hop broadcast termination conditions, that is, the termination conditions of the P-hop broadcast mechanism include any one of the following:
forwarding to the first node (e.g., forwarding the arriving node ID equals the first node ID), terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
Note that, for a node with high coverage capability, coverage state information is directly fed back to the first node by directly adopting a line-of-sight communication means, and a description thereof is not given here.
The P-hop broadcast mechanism adopts a flooding limiting principle, can prevent the broadcast storm problem caused by large-scale multi-hop broadcast, and can record the optimal multi-hop path from a receiving node to a sending node in the multi-hop forwarding process, thereby simplifying the establishment process of the intra-cluster node multi-hop route.
In summary, the above embodiments of the present invention assist other nodes to complete estimation of coverage capability through coverage status information exchange of the nodes, thereby implementing effective utilization of nodes with high communication capability in the wireless heterogeneous network and implementing optimal clustering of the wireless heterogeneous network.
Without loss of generality, a specific implementation of the maximum coverage clustering method provided by the embodiment of the present invention is as follows:
a typical ad hoc network scene is composed of a plurality of ground vehicle-mounted nodes, ground walking nodes and lift-off nodes, wherein the communication coverage capacity, the computing capacity and the energy supply capacity of the 3 types of nodes are different, and a wireless heterogeneous network is formed. Influenced by energy supply capacity, the communication coverage capacity of the ground vehicle-mounted node is stronger than that of the ground walking node; under the influence of channel fading conditions, the communication coverage capability of the lift-off node is stronger than that of the two types of ground nodes.
In order to preferably select a node with higher coverage capability to serve as a cluster head and form a wireless backbone network with the maximum coverage by using as few nodes as possible, as shown in fig. 3, the maximum coverage clustering method provided by the embodiment of the present invention adopts the following steps to perform clustering calculation:
in step 31, all network nodes in the ad hoc network, including ground vehicle-mounted nodes, ground walking nodes, and lift-off nodes, periodically broadcast their own ID and ranging signals, such as radio frequency RF signals with time tags (based on TDOA ranging principle), to one hop, and the ranging signals are used for one-way distance measurement between each receiving node and each transmitting node.
In order to ensure that the ranging signal has the same coverage area as the communication signal, the ranging signal and the communication signal are required to have the same frequency, the same transmission power and the same receiving sensitivity.
Where Dist (u, v) represents the absolute distance between node u and node v, and tdTime difference for ranging signal transmission and reception; c is the electromagnetic wave propagation velocity, usually taken as the speed of light.
Wherein, DRCuvThe node relative distance between the node u and the node v is shown; dist (u, v) is the absolute distance between the second node and the first node; doIs the standard coverage distance.
And step 34, selecting a Received Signal Strength Indicator (RSSI) to characterize Link Quality (LQI) between the nodes, and selecting a k-order sliding filter to filter the RSSI in k steps in order to suppress estimation errors caused by unstable signal strength.
Taking k to 3, the Link Quality Indicator (LQI) between node u and node v is calculated as follows:
wherein the RSSIn、RSSIn-1、RSSIn-2Are respectively strong received signalsThe degree indicates the buffering of the current value and the first two measurements.
Given the limited coverage capability of ground nodes, the feedback of status information from the receiving node v is not always directly passed to the lift-off node. At this time, it may be considered that the "P-hop broadcast mechanism" described in the present application is used to feed back the state information to the lift-off node in a relay manner by using a flooding restriction method.
Taking P to 3, the P-hop broadcast mechanism refers to a range within which the state feedback information can be maximally delivered to 3 hops. And setting the TTL value of the feedback information of the body to be 3, and gradually decreasing the TTL value by taking 1 as a step length every time the feedback information is forwarded for 1 time. If the feedback information reaches the destination node, the transmission is terminated; if the destination node is not reached and the TTL is less than 1, the continuous transmission is stopped, and the broadcast storm problem caused by the flooding of the whole network is avoided.
The steps 31-35 are continuously carried out in a periodic mode or an event response mode and are used for neighbor discovery among nodes and neighbor node state information maintenance.
CWuv＝w1*DRCuv+w2*lg(LQIuv)；
wherein CWuvThe coverage weight of the second node relative to the first node; DRCuvThe relative distance between the second node and the first node is taken as the node relative distance; LQIuvIs a link state indication between the second node and the first node; w is a1、w2Wherein v ∈ N (u) indicates that node v (i.e. the second node) is any neighbor node of node u (i.e. the first node), Lg (LQI)uv) Is the coverage quality of the second node.
CCu＝Max{CWuv},v∈N(u)；
typically, the coverage distances of the ground walking nodes, the ground vehicle-mounted nodes and the lift-off nodes are respectively 10km, 30km and 150 km. Get w1＝0.8，w2＝0.2，LQIuvThe coverage capability estimates for typical ground walking nodes, ground vehicle nodes, and lift-off nodes are 2.8, 4.4, and 14, respectively, 100.
The difference of the node coverage capability can be used for optimizing the optimal cluster head to realize the maximum coverage.
And step 38, after the coverage capability estimation is completed, broadcasting the coverage capability value of each node outwards by the nodes, and selecting the cluster head by each node by adopting a distributed algorithm. The node selects the node with the maximum coverage capability in the neighbor node set as the head of the candidate group, namely CHcan(u)＝Max(CCv∪CCu),v∈N(u)；
After the selection of the alternative cluster head is finished, the node broadcasts the self cluster head selection to the surrounding nodes, and a k-hop broadcasting mechanism is adopted to broadcast the cluster head alternative information until the alternative cluster head is reached. And in the k-hop range, the candidate group head which is recommended most is obtained to become a group head node.
And step 39, after the group head node is selected as the group head, the group head node confirms the group head identity of the group head node through a single-hop broadcasting mechanism. At the same time, other nodes within its coverage area are identified as normal nodes within its cluster.
Because the cluster head of the large-coverage clustering can cover multi-hop distance beyond common nodes, the wireless backbone network can realize large-range communication coverage with the hop count as less as possible.
In summary, the method for maximum coverage clustering provided by the above embodiments of the present invention can solve the multi-hop clustering problem in the wireless heterogeneous network, provide a wireless backbone network topology structure with high coverage capability, and is suitable for networking scenarios with multiple types of nodes; the maximum coverage clustering method can provide communication coverage in an extremely large range with the hop count as few as possible through a wireless backbone network formed by preferably selecting the maximum coverage capacity node to serve as a cluster head and a backbone network node; meanwhile, the large coverage cluster head can provide multi-hop coverage in the cluster, and the node capacity in the cluster is effectively increased; furthermore, the method for grouping with great coverage carries out coverage state feedback by a multi-hop broadcasting method with a limited range, can calculate multi-hop routes in a group in the grouping calculation process, and saves the expenses of discovery and maintenance of the multi-hop routes in the group; the maximum coverage clustering method has compatibility, and when link quality factors are not considered and the coverage distances of the nodes are the same, the clustering effect of the method is equal to a maximum connectivity (MaxMegrere) clustering algorithm, so that the method is suitable for common wireless ad hoc network clustering scenes.
As shown in fig. 4, an embodiment of the present invention further provides a network node, where the network node is a first node of an ad hoc network, and the network node includes: a transceiver 400, a memory 410, a processor 400 and a program stored on the memory 410 and executable on the processor 400, the processor 400 being configured to determine coverage capability information of a first node;
the transceiver 420 is configured to broadcast coverage capability information of a first node; acquiring coverage capability information of a second node broadcasted by the second node;
the processor 400 is further configured to: and selecting a cluster 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 cluster.
Optionally, in the foregoing embodiment of the present invention, the transceiver 420 is further configured to:
periodically or based on an event trigger mechanism, broadcasting ranging information, wherein the ranging information at least comprises: a ranging signal;
acquiring coverage state information of the second node broadcast by the second node based on the ranging information, wherein the coverage state information at least comprises: a node relative distance of the second node from the first node and a link state indication between the second node and the first node.
Optionally, in the foregoing embodiment of the present invention, the processor 400 is further configured to:
and determining the coverage capability information of the first node according to the coverage state information of the second node broadcasted by the second node and relative to the first node.
Optionally, in the foregoing embodiment of the present invention, the processor 400 is further configured to:
determining a coverage weight of the second node relative to the first node according to the coverage state information;
and determining the coverage capability information of the first node according to the coverage weight.
Optionally, in the foregoing embodiment of the present invention, the processor 400 is further configured to:
determining a coverage weight of the second node relative to the first node according to the coverage state information of the second node and a first formula; wherein the content of the first and second substances,
the first formula is:
CWuv＝w1*DRCuv+w2*lg(LQIuv)；
wherein CWuvThe coverage weight of the second node relative to the first node; DRCuvThe relative distance between the second node and the first node is taken as the node relative distance; LQIuvIs a link state indication between the second node and the first node; w is a1、w2Is the influence factor of the coverage weight.
Optionally, in the foregoing embodiment of the present invention, the coverage capability information includes: a value of covering power;
the processor 400 is further configured to:
determining the maximum coverage weight as the coverage capability value of the first node according to the maximum adjacent coverage criterion;
alternatively, the first and second electrodes may be,
and integrating the coverage weight according to the maximum communication coverage criterion, and determining a comprehensive value obtained by integration as the coverage capability value of the first node.
Optionally, in the foregoing embodiment of the present invention, the processor 400 is further configured to:
and determining the coverage capability information of the first node according to the coverage state information of the first node to the second node, the node residual energy indication of the first node and the node intention of the first node.
Optionally, in the foregoing embodiment of the present invention, the transceiver 420 is further configured to:
receiving coverage state information forwarded by a second node through at most P intermediate nodes by adopting a P-hop broadcasting mechanism;
wherein P is an integer greater than or equal to 1.
Optionally, in the foregoing embodiment of the present invention, the termination condition of the P-hop broadcast mechanism includes any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
Optionally, in the foregoing embodiment of the present invention, the processor 400 is further configured to:
selecting the node with the maximum coverage capability as a candidate cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node;
broadcasting the alternative cluster head node selected by the first node, and forwarding alternative indication information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism until the alternative indication information reaches the alternative cluster head node, wherein the alternative indication information is used for indicating the first node to select the alternative cluster head node as an alternative cluster head; p is an integer greater than or equal to 1;
receiving a standby cluster head node broadcast by a second node and selected by the second node;
and determining the node which is selected as the candidate cluster head node most frequently as the cluster head node.
Optionally, in the foregoing embodiment of the present invention, if the first node is selected as the cluster head node, the processor 400 is further configured to:
respectively sending a cluster head confirmation message to the nodes which select the first node as the cluster head node; the first node and the node which selects the first node as the cluster head node form a maximum coverage cluster.
In summary, in the embodiments of the present invention, through the coverage state information exchange and the coverage capability information calculation of the nodes, the cluster head node with the largest coverage is preferably selected, and then the wireless backbone network with the least hop of the largest coverage is formed, so that the efficient utilization of the high communication capability node in the wireless heterogeneous network is realized, and the optimal clustering of the wireless heterogeneous network is realized.
It should be noted that the network node provided in the embodiments of the present invention is a network node capable of executing the maximum coverage clustering method, and all embodiments of the maximum coverage clustering method are applicable to the network node and can achieve the same or similar beneficial effects.
As shown in fig. 5, an embodiment of the present invention further provides a maximum coverage clustering apparatus, which is applied to a first node of an ad hoc network, and includes:
a first broadcasting module 51, configured to determine and broadcast coverage capability information of a first node;
a second information obtaining module 52, configured to obtain coverage capability information of a second node broadcasted by the second node;
and a clustering module 53, configured to select a cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node, so as to form a maximum coverage cluster.
Optionally, in the above embodiment of the present invention, the apparatus further includes:
a third broadcasting module, configured to broadcast ranging information periodically or based on an event trigger mechanism, where the ranging information at least includes: a ranging signal;
a first information obtaining module, configured to obtain coverage status information of the second node, which is broadcasted by the second node based on the ranging information, where the coverage status information at least includes: a node relative distance of the second node from the first node and a link state indication between the second node and the first node.
Optionally, in the foregoing embodiment of the present invention, the first broadcasting module includes;
and the first submodule is used for determining the coverage capability information of the first node according to the coverage state information of the second node, broadcasted by the second node, of the first node.
Optionally, in the above embodiment of the present invention, the first sub-module includes:
a first unit, configured to determine a coverage weight of a second node relative to a first node according to the coverage status information;
and the second unit is used for determining the coverage capability information of the first node according to the coverage weight.
Optionally, in the above embodiment of the present invention, the first unit is further configured to:
determining a coverage weight of the second node relative to the first node according to the coverage state information of the second node and a first formula; wherein the content of the first and second substances,
the first formula is:
CWuv＝w1*DRCuv+w2*lg(LQIuv)；
wherein CWuvThe coverage weight of the second node relative to the first node; DRCuvThe relative distance between the second node and the first node is taken as the node relative distance; LQIuvIs a link state indication between the second node and the first node; w is a1、w2Is the influence factor of the coverage weight.
Optionally, in the foregoing embodiment of the present invention, the coverage capability information includes: a value of covering power;
the second unit is further to:
determining the maximum coverage weight as the coverage capability value of the first node according to the maximum adjacent coverage criterion;
alternatively, the first and second electrodes may be,
and integrating the coverage weight according to the maximum communication coverage criterion, and determining a comprehensive value obtained by integration as the coverage capability value of the first node.
Optionally, in the foregoing embodiment of the present invention, the first broadcasting module includes:
and the second submodule is used for determining the coverage capability information of the first node according to the coverage state information of the first node to the second node, the node residual energy indication of the first node and the node intention of the first node.
Optionally, in the above embodiment of the present invention, the first sub-module includes:
a third unit, configured to receive coverage status information forwarded by the second node through at most P intermediate nodes by using a P-hop broadcast mechanism;
wherein P is an integer greater than or equal to 1.
Optionally, in the foregoing embodiment of the present invention, the termination condition of the P-hop broadcast mechanism includes any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
Optionally, in the above embodiment of the present invention, the clustering module includes:
the third submodule is used for selecting the node with the maximum coverage capability as the candidate cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node;
a fourth sub-module, configured to broadcast the candidate cluster head node selected by the first node, and forward candidate indication information through at most P intermediate nodes by using a P-hop broadcast mechanism until the candidate indication information reaches the candidate cluster head node, where the candidate indication information is used to indicate the first node to select the candidate cluster head node as a candidate cluster head; p is an integer greater than or equal to 1;
a fifth sub-module, configured to receive a candidate cluster head node selected by a second node and broadcasted by the second node;
and the sixth submodule is used for determining the node which is selected as the candidate cluster head node with the most times as the cluster head node.
A third sub-module, configured to, if the first node is selected as the cluster head node, the apparatus further includes:
the group head confirmation module is used for respectively sending group head confirmation messages to the nodes which select the first node as the group head node; the first node and the node which selects the first node as the cluster head node form a maximum coverage cluster.
In summary, in the embodiments of the present invention, through the coverage state information exchange and the coverage capability information calculation of the nodes, the cluster head node with the largest coverage is preferably selected, and then the wireless backbone network with the least hop of the largest coverage is formed, so that the efficient utilization of the high communication capability node in the wireless heterogeneous network is realized, and the optimal clustering of the wireless heterogeneous network is realized.
It should be noted that the maximum coverage clustering device provided in the embodiment of the present invention is a maximum coverage clustering device capable of executing the maximum coverage clustering method, and all embodiments of the maximum coverage clustering method are applicable to the maximum coverage clustering device and can achieve the same or similar beneficial effects.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements each process of the embodiment of the maximum coverage clustering method described above, and can achieve the same technical effect, and is not described here again to avoid repetition. The computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk.
As shown in fig. 4, an embodiment of the present invention further provides a network node, where the network node is a second node of an ad hoc network, and the network node includes: a transceiver 420, a memory 410, a processor 400, and a program stored on the memory 410 and executable on the processor 400, the transceiver 420 configured to receive ranging information broadcast by a first node, the ranging information comprising at least: a ranging signal;
the processor 400 is used for reading the program in the memory and executing the following processes: according to the ranging information, determining coverage state information of the first node to the second node, wherein the coverage state information at least comprises: the relative distance between the second node and the first node and the link state indication between the second node and the first node;
the transceiver 420 is further configured to: the coverage status information of the first node for the second node is broadcast.
Optionally, in the foregoing embodiment of the present invention, the processor 400 is further configured to:
determining the node relative distance between the second node and the first node according to the ranging information and a second formula;
wherein the second formula is:
DRCuv＝Dist(u,v)/Do；
DRCuvthe relative distance between the second node and the first node is taken as the node relative distance; dist (u, v) is the absolute distance between the second node and the first node; doThe standard coverage distance is used for carrying out normalization operation on the absolute distance;
measuring the strength indication RSSI of the received signal according to the ranging information, filtering the RSSI by adopting a sliding filter, and calculating a link state indication between the second node and the first node;
the filtering calculation formula of the sliding filter is as follows:
LQIuv(n) is a link state indication between the second node and the first node; k is the order of the sliding filter; n is a discrete time point; i is the sampling time point of the sliding filter.
Optionally, in the foregoing embodiment of the present invention, the transceiver 420 is further configured to:
forwarding the coverage state information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism; wherein, P is an integer greater than or equal to 1;
the termination condition of the P-hop broadcast mechanism includes any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
In summary, the above embodiments of the present invention assist other nodes to complete estimation of coverage capability through coverage status information exchange of the nodes, thereby implementing effective utilization of nodes with high communication capability in the wireless heterogeneous network and implementing optimal clustering of the wireless heterogeneous network.
It should be noted that the network node provided in the embodiments of the present invention is a network node capable of executing the maximum coverage clustering method, and all embodiments of the maximum coverage clustering method are applicable to the network node and can achieve the same or similar beneficial effects.
As shown in fig. 6, an embodiment of the present invention further provides a maximum coverage clustering apparatus, which is applied to a second node of an ad hoc network, and includes:
a first receiving module 61, configured to receive ranging information broadcast by a first node, where the ranging information at least includes: a ranging signal;
a second determining module 62, configured to determine, according to the ranging information, coverage state information of the first node for the second node, where the coverage state information at least includes: the relative distance between the second node and the first node and the link state indication between the second node and the first node;
and a second broadcasting module 63, configured to broadcast the coverage status information of the first node to the second node.
Optionally, in the foregoing embodiment of the present invention, the second determining module includes:
the eighth submodule is used for determining the node relative distance between the second node and the first node according to the ranging information and a second formula;
wherein the second formula is:
DRCuv＝Dist(u,v)/Do；
DRCuvthe relative distance between the second node and the first node is taken as the node relative distance; dist (u, v) is the absolute distance between the second node and the first node; doThe standard coverage distance is used for carrying out normalization operation on the absolute distance;
a ninth sub-module, configured to measure an RSSI of the received signal according to the ranging information, filter the RSSI by using a sliding filter, and calculate a link state indicator between the second node and the first node;
the filtering calculation formula of the sliding filter is as follows:
LQIuv(n) is a link state indication between the second node and the first node; k is the order of the sliding filter; n is a discrete time point; i is the sampling time point of the sliding filter.
Optionally, in the foregoing embodiment of the present invention, the second broadcasting module includes:
a broadcast submodule, configured to forward the coverage status information through a maximum of P intermediate nodes by using a P-hop broadcast mechanism; wherein, P is an integer greater than or equal to 1;
the termination condition of the P-hop broadcast mechanism includes any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
In summary, the above embodiments of the present invention assist other nodes to complete estimation of coverage capability through coverage status information exchange of the nodes, thereby implementing effective utilization of nodes with high communication capability in the wireless heterogeneous network and implementing optimal clustering of the wireless heterogeneous network.
It should be noted that the maximum coverage clustering device provided in the embodiment of the present invention is a maximum coverage clustering device capable of executing the maximum coverage clustering method, and all embodiments of the maximum coverage clustering method are applicable to the maximum coverage clustering device and can achieve the same or similar beneficial effects.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements each process of the embodiment of the maximum coverage clustering method described above, and can achieve the same technical effect, and is not described here again to avoid repetition. The computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
While the present invention has been described with reference to the embodiments shown in the drawings, the present invention is not limited to the embodiments, which are illustrative and not restrictive, and it will be apparent to those skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope of the invention as defined in the appended claims.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (31)
1. A maximum coverage clustering method is applied to a first node of an ad hoc network, and is characterized by comprising the following steps:
determining and broadcasting coverage capability information of a first node;
acquiring coverage capability information of a second node broadcasted by the second node;
and selecting a cluster 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 cluster.
2. The method of claim 1, wherein prior to determining and broadcasting the coverage capability information of the first node, the method further comprises:
periodically or based on an event trigger mechanism, broadcasting ranging information, wherein the ranging information at least comprises: a ranging signal;
acquiring coverage state information of the second node broadcast by the second node based on the ranging information, wherein the coverage state information at least comprises: a node relative distance of the second node from the first node and a link state indication between the second node and the first node.
3. The method of claim 2, wherein determining the coverage capability information of the first node comprises;
and determining the coverage capability information of the first node according to the coverage state information of the second node broadcasted by the second node and relative to the first node.
4. The method of claim 3, wherein determining the coverage capability information of the first node according to the coverage status information of the second node broadcasted by the second node, comprises:
determining a coverage weight of the second node relative to the first node according to the coverage state information;
and determining the coverage capability information of the first node according to the coverage weight.
5. The method of claim 4, wherein determining the coverage weight of the second node relative to the first node according to the coverage status information comprises:
determining a coverage weight of the second node relative to the first node according to the coverage state information of the second node and a first formula; wherein the content of the first and second substances,
the first formula is:
CWuv＝w1*DRCuv+w2*lg(LQIuv)；
wherein CWuvThe coverage weight of the second node relative to the first node; DRCuvThe relative distance between the second node and the first node is taken as the node relative distance; LQIuvIs a link state indication between the second node and the first node; w is a1、w2Is the influence factor of the coverage weight.
6. The method of claim 4, wherein the overlay capability information comprises: a value of covering power;
the determining the coverage capability information of the first node according to the coverage weight includes:
determining the maximum coverage weight as the coverage capability value of the first node according to the maximum adjacent coverage criterion;
alternatively, the first and second electrodes may be,
and integrating the coverage weight according to the maximum communication coverage criterion, and determining a comprehensive value obtained by integration as the coverage capability value of the first node.
7. The method of claim 1, wherein determining the coverage capability information of the first node comprises:
and determining the coverage capability information of the first node according to the coverage state information of the first node to the second node, the node residual energy indication of the first node and the node intention of the first node.
8. The method of claim 2, wherein the obtaining coverage status information of the second node broadcast by the second node based on the ranging information by the first node comprises:
receiving coverage state information forwarded by a second node through at most P intermediate nodes by adopting a P-hop broadcasting mechanism;
wherein P is an integer greater than or equal to 1.
9. The method of claim 8, wherein the termination condition of the P-hop broadcast mechanism comprises any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
10. The method of claim 1, wherein selecting a cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node comprises:
selecting the node with the maximum coverage capability as a candidate cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node;
broadcasting the alternative cluster head node selected by the first node, and forwarding alternative indication information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism until the alternative indication information reaches the alternative cluster head node, wherein the alternative indication information is used for indicating the first node to select the alternative cluster head node as an alternative cluster head; p is an integer greater than or equal to 1;
receiving a standby cluster head node broadcast by a second node and selected by the second node;
and determining the node which is selected as the candidate cluster head node most frequently as the cluster head node.
11. The method of claim 10, wherein if the first node is selected as the cluster head node, the method further comprises:
respectively sending a cluster head confirmation message to the nodes which select the first node as the cluster head node; the first node and the node which selects the first node as the cluster head node form a maximum coverage cluster.
12. A maximum coverage clustering method is applied to a second node of an ad hoc network, and is characterized by comprising the following steps:
receiving ranging information broadcast by a first node, wherein the ranging information at least comprises: a ranging signal;
according to the ranging information, determining coverage state information of the first node to the second node, wherein the coverage state information at least comprises: the relative distance between the second node and the first node and the link state indication between the second node and the first node;
the coverage status information of the first node for the second node is broadcast.
13. The method of claim 12, wherein the determining the coverage status information of the first node for the second node according to the ranging information comprises:
determining the node relative distance between the second node and the first node according to the ranging information and a second formula;
wherein the second formula is:
DRCuv＝Dist(u,v)/Do；
DRCuvthe relative distance between the second node and the first node is taken as the node relative distance; dist (u, v) is the absolute distance between the second node and the first node; doThe standard coverage distance is used for carrying out normalization operation on the absolute distance;
measuring the strength indication RSSI of the received signal according to the ranging information, filtering the RSSI by adopting a sliding filter, and calculating a link state indication between the second node and the first node;
the filtering calculation formula of the sliding filter is as follows:
LQIuv(n) is a link state indication between the second node and the first node; k is the order of the sliding filter; n is a discrete time point; i is the sampling time point of the sliding filter.
14. The method of claim 12, wherein broadcasting the coverage status information of the first node to the second node comprises:
forwarding the coverage state information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism; wherein, P is an integer greater than or equal to 1;
the termination condition of the P-hop broadcast mechanism includes any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
15. A network node, the network node being a first node of an ad hoc network, the network node comprising: a transceiver, a memory, a processor, and a program stored on the memory and executable on the processor; wherein the processor is configured to determine coverage capability information for the first node;
the transceiver is used for broadcasting the coverage capability information of the first node; acquiring coverage capability information of a second node broadcasted by the second node;
the processor is further configured to: and selecting a cluster 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 cluster.
16. The network node of claim 15, wherein the transceiver is further configured to:
periodically or based on an event trigger mechanism, broadcasting ranging information, wherein the ranging information at least comprises: a ranging signal;
acquiring coverage state information of the second node broadcast by the second node based on the ranging information, wherein the coverage state information at least comprises: a node relative distance of the second node from the first node and a link state indication between the second node and the first node.
17. The network node of claim 16, wherein the processor is further configured to:
and determining the coverage capability information of the first node according to the coverage state information of the second node broadcasted by the second node and relative to the first node.
18. The network node of claim 17, wherein the processor is further configured to:
determining a coverage weight of the second node relative to the first node according to the coverage state information;
and determining the coverage capability information of the first node according to the coverage weight.
19. The network node of claim 18, wherein the processor is further configured to:
determining a coverage weight of the second node relative to the first node according to the coverage state information of the second node and a first formula; wherein the content of the first and second substances,
the first formula is:
CWuv＝w1*DRCuv+w2*lg(LQIuv)；
wherein CWuvThe coverage weight of the second node relative to the first node; DRCuvThe relative distance between the second node and the first node is taken as the node relative distance; LQIuvIs a link state indication between the second node and the first node; w is a1、w2Is the influence factor of the coverage weight.
20. The network node of claim 18, wherein the coverage capability information comprises: a value of covering power;
the processor is further configured to:
determining the maximum coverage weight as the coverage capability value of the first node according to the maximum adjacent coverage criterion;
alternatively, the first and second electrodes may be,
and integrating the coverage weight according to the maximum communication coverage criterion, and determining a comprehensive value obtained by integration as the coverage capability value of the first node.
21. The network node of claim 15, wherein the processor is further configured to:
and determining the coverage capability information of the first node according to the coverage state information of the first node to the second node, the node residual energy indication of the first node and the node intention of the first node.
22. The network node of claim 16, wherein the transceiver is further configured to:
receiving coverage state information forwarded by a second node through at most P intermediate nodes by adopting a P-hop broadcasting mechanism;
wherein P is an integer greater than or equal to 1.
23. The network node of claim 22, wherein the termination condition of the P-hop broadcast mechanism comprises any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
24. The network node of claim 15, wherein the processor is further configured to:
selecting the node with the maximum coverage capability as a candidate cluster head node according to the coverage capability information of the first node and the coverage capability information of the second node;
broadcasting the alternative cluster head node selected by the first node, and forwarding alternative indication information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism until the alternative indication information reaches the alternative cluster head node, wherein the alternative indication information is used for indicating the first node to select the alternative cluster head node as an alternative cluster head; p is an integer greater than or equal to 1;
receiving a standby cluster head node broadcast by a second node and selected by the second node;
and determining the node which is selected as the candidate cluster head node most frequently as the cluster head node.
25. The network node of claim 24, wherein if the first node is selected as the cluster head node, the processor is further configured to:
respectively sending a cluster head confirmation message to the nodes which select the first node as the cluster head node; the first node and the node which selects the first node as the cluster head node form a maximum coverage cluster.
26. A maximum coverage clustering device applied to a first node of an ad hoc network, comprising:
the first broadcast module is used for determining and broadcasting the coverage capability information of the first node;
the second information acquisition module is used for acquiring the coverage capability information of the second node broadcasted by the second node;
and the clustering module is used for selecting a cluster 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 cluster.
27. A network node, the network node being a second node of an ad hoc network, the network node comprising: a transceiver, a memory, a processor, and a program stored on the memory and executable on the processor; the method is characterized in that the transceiver is used for receiving ranging information broadcasted by a first node, and the ranging information at least comprises: a ranging signal;
the processor is used for reading the program in the memory and executing the following processes: according to the ranging information, determining coverage state information of the first node to the second node, wherein the coverage state information at least comprises: the relative distance between the second node and the first node and the link state indication between the second node and the first node;
the transceiver is further configured to: the coverage status information of the first node for the second node is broadcast.
28. The network node of claim 27, wherein the processor is further configured to:
determining the node relative distance between the second node and the first node according to the ranging information and a second formula;
wherein the second formula is:
DRCuv＝Dist(u,v)/Do；
DRCuvthe relative distance between the second node and the first node is taken as the node relative distance; dist (u, v) is the absolute distance between the second node and the first node; doThe standard coverage distance is used for carrying out normalization operation on the absolute distance;
measuring the strength indication RSSI of the received signal according to the ranging information, filtering the RSSI by adopting a sliding filter, and calculating a link state indication between the second node and the first node;
the filtering calculation formula of the sliding filter is as follows:
LQIuv(n) is a link state indication between the second node and the first node; k is the order of the sliding filter; n is a discrete time point; i is the sampling time point of the sliding filter.
29. The network node of claim 27, wherein the transceiver is further configured to:
forwarding the coverage state information through at most P intermediate nodes by adopting a P-hop broadcasting mechanism; wherein, P is an integer greater than or equal to 1;
the termination condition of the P-hop broadcast mechanism includes any one of:
forwarding to the first node, and terminating the broadcast;
the survival time TTL is decreased progressively by taking 1 as a step length according to the forwarding hop number, and when the TTL is equal to 0, the broadcast is stopped; the initial value of TTL is equal to P.
30. A maximal coverage clustering device applied to a second node of an ad hoc network, comprising:
a first receiving module, configured to receive ranging information broadcast by a first node, where the ranging information at least includes: a ranging signal;
a second determining module, configured to determine, according to the ranging information, coverage state information of the first node with respect to the second node, where the coverage state information at least includes: the relative distance between the second node and the first node and the link state indication between the second node and the first node;
and the second broadcasting module is used for broadcasting the coverage state information of the first node to the second node.
31. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the maximum coverage clustering method according to any one of claims 1 to 11; alternatively, the computer program when executed by a processor implements the steps of the maximum coverage clustering method of any one of claims 12 to 14.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811565895.8A CN111356201B (en) | 2018-12-20 | 2018-12-20 | Method and device for grouping great coverage and network node |
| PCT/CN2019/122630 WO2020125398A1 (en) | 2018-12-20 | 2019-12-03 | Maximum coverage clustering method, device, and network node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811565895.8A CN111356201B (en) | 2018-12-20 | 2018-12-20 | Method and device for grouping great coverage and network node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111356201A true CN111356201A (en) | 2020-06-30 |
| CN111356201B CN111356201B (en) | 2022-04-15 |
Family
ID=71100215
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811565895.8A Active CN111356201B (en) | 2018-12-20 | 2018-12-20 | Method and device for grouping great coverage and network node |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111356201B (en) |
| WO (1) | WO2020125398A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114143711A (en) * | 2021-11-25 | 2022-03-04 | 深圳Tcl新技术有限公司 | Information processing method, information processing device, electronic equipment and storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115119250B (en) * | 2022-07-06 | 2023-01-31 | 广州芯德通信科技股份有限公司 | Wireless mesh network node distance measuring method, WIFI equipment and system |
Citations (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003058890A1 (en) * | 2001-12-21 | 2003-07-17 | Motorola, Inc., A Corporation Of The State Of Delaware | Network protocol for wireless devices utilizing location information |
| EP1473889A2 (en) * | 2003-04-30 | 2004-11-03 | Harris Corporation | Predictive routing in a mobile ad hoc network |
| US20040218582A1 (en) * | 2003-04-30 | 2004-11-04 | Harris Corporation | Predictive route maintenance in a mobile ad hoc network |
| CN1921436A (en) * | 2006-07-20 | 2007-02-28 | 北京航空航天大学 | Stabilizing energy-saving grouping method |
| CN101035021A (en) * | 2007-02-08 | 2007-09-12 | 北京航空航天大学 | Stable energy-saving group maintenance method |
| CN101820311A (en) * | 2006-08-18 | 2010-09-01 | 富士通株式会社 | The transmission method of multi-hop wireless communication system and use thereof |
| CN101835099A (en) * | 2010-04-23 | 2010-09-15 | 西安电子科技大学 | Large-scale sensor network routing method based on cluster and RREP broadcast |
| CN101854666A (en) * | 2010-04-27 | 2010-10-06 | 南京工业大学 | Customized trans-regional and multi-hop routing method for wireless sensor network |
| CN102368863A (en) * | 2011-10-24 | 2012-03-07 | 中国人民解放军理工大学 | Wireless ad-hoc emergency communication network based on network cluster and message ferrying |
| CN102595412A (en) * | 2012-01-10 | 2012-07-18 | 南京邮电大学 | Wireless sensor network clustering topology control method based on mobile nodes |
| CN102630097A (en) * | 2009-05-19 | 2012-08-08 | 华为技术有限公司 | Grouped data sending method, base station and terminal |
| CN103024814A (en) * | 2013-01-09 | 2013-04-03 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| CN104602314A (en) * | 2006-08-18 | 2015-05-06 | 富士通株式会社 | Path selection method, communication system and particular communication apparatus in communication system |
| CN104994020A (en) * | 2015-05-06 | 2015-10-21 | 天津理工大学 | Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model |
| CN105050095A (en) * | 2015-04-02 | 2015-11-11 | 浙江理工大学 | Topology construction method for heterogeneous wireless sensor networks based on energy prediction |
| CN106028416A (en) * | 2016-05-03 | 2016-10-12 | 中南大学 | Cluster range and inter-cluster communication mode dual self-adapting improved cluster method |
| CN106792569A (en) * | 2016-11-25 | 2017-05-31 | 电子科技大学 | Group system changing method based on sub-clustering multicast |
| CN106879041A (en) * | 2015-12-11 | 2017-06-20 | 中南大学 | The design of Ad Hoc networks cluster algorithm and Routing Protocol |
| CN107371188A (en) * | 2017-07-26 | 2017-11-21 | 浙江工业大学 | A kind of energy consumption balance method for routing of controllable cluster scale |
| CN107786960A (en) * | 2017-10-30 | 2018-03-09 | 吴豪 | Network cluster dividing method, device, electronic equipment and computer-readable storage medium |
| CN107995667A (en) * | 2017-12-19 | 2018-05-04 | 浙江工业大学 | A kind of energy consumption balance method for routing of controllable cluster scale |
| CN108566658A (en) * | 2018-03-02 | 2018-09-21 | 北京信息科技大学 | A kind of cluster algorithm of Energy Consumption in Wireless Sensor Networks equilibrium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2110999B1 (en) * | 2008-04-15 | 2012-12-12 | NTT DoCoMo, Inc. | Method and apparatus for forwarding data in a wireless network |
| CN103298056B (en) * | 2013-05-14 | 2015-11-25 | 华南师范大学 | A kind of Wireless Routing Protocol method |
| CN107087290B (en) * | 2017-02-17 | 2020-08-11 | 广东工业大学 | Wireless sensor network dynamic clustering target tracking method and device |
| CN108650137B (en) * | 2018-05-17 | 2021-03-02 | 辽宁大学 | Autonomous decision-making type routing protocol for wireless sensor network node |
-
2018
- 2018-12-20 CN CN201811565895.8A patent/CN111356201B/en active Active
-
2019
- 2019-12-03 WO PCT/CN2019/122630 patent/WO2020125398A1/en active Application Filing
Patent Citations (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003058890A1 (en) * | 2001-12-21 | 2003-07-17 | Motorola, Inc., A Corporation Of The State Of Delaware | Network protocol for wireless devices utilizing location information |
| EP1473889A2 (en) * | 2003-04-30 | 2004-11-03 | Harris Corporation | Predictive routing in a mobile ad hoc network |
| US20040218582A1 (en) * | 2003-04-30 | 2004-11-04 | Harris Corporation | Predictive route maintenance in a mobile ad hoc network |
| CN1921436A (en) * | 2006-07-20 | 2007-02-28 | 北京航空航天大学 | Stabilizing energy-saving grouping method |
| CN101820311A (en) * | 2006-08-18 | 2010-09-01 | 富士通株式会社 | The transmission method of multi-hop wireless communication system and use thereof |
| CN104602314A (en) * | 2006-08-18 | 2015-05-06 | 富士通株式会社 | Path selection method, communication system and particular communication apparatus in communication system |
| CN101035021A (en) * | 2007-02-08 | 2007-09-12 | 北京航空航天大学 | Stable energy-saving group maintenance method |
| CN102630097A (en) * | 2009-05-19 | 2012-08-08 | 华为技术有限公司 | Grouped data sending method, base station and terminal |
| CN101835099A (en) * | 2010-04-23 | 2010-09-15 | 西安电子科技大学 | Large-scale sensor network routing method based on cluster and RREP broadcast |
| CN101854666A (en) * | 2010-04-27 | 2010-10-06 | 南京工业大学 | Customized trans-regional and multi-hop routing method for wireless sensor network |
| CN102368863A (en) * | 2011-10-24 | 2012-03-07 | 中国人民解放军理工大学 | Wireless ad-hoc emergency communication network based on network cluster and message ferrying |
| CN102595412A (en) * | 2012-01-10 | 2012-07-18 | 南京邮电大学 | Wireless sensor network clustering topology control method based on mobile nodes |
| CN103024814A (en) * | 2013-01-09 | 2013-04-03 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| CN105050095A (en) * | 2015-04-02 | 2015-11-11 | 浙江理工大学 | Topology construction method for heterogeneous wireless sensor networks based on energy prediction |
| CN104994020A (en) * | 2015-05-06 | 2015-10-21 | 天津理工大学 | Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model |
| CN106879041A (en) * | 2015-12-11 | 2017-06-20 | 中南大学 | The design of Ad Hoc networks cluster algorithm and Routing Protocol |
| CN106028416A (en) * | 2016-05-03 | 2016-10-12 | 中南大学 | Cluster range and inter-cluster communication mode dual self-adapting improved cluster method |
| CN106792569A (en) * | 2016-11-25 | 2017-05-31 | 电子科技大学 | Group system changing method based on sub-clustering multicast |
| CN107371188A (en) * | 2017-07-26 | 2017-11-21 | 浙江工业大学 | A kind of energy consumption balance method for routing of controllable cluster scale |
| CN107786960A (en) * | 2017-10-30 | 2018-03-09 | 吴豪 | Network cluster dividing method, device, electronic equipment and computer-readable storage medium |
| CN107995667A (en) * | 2017-12-19 | 2018-05-04 | 浙江工业大学 | A kind of energy consumption balance method for routing of controllable cluster scale |
| CN108566658A (en) * | 2018-03-02 | 2018-09-21 | 北京信息科技大学 | A kind of cluster algorithm of Energy Consumption in Wireless Sensor Networks equilibrium |
Non-Patent Citations (4)
| Title |
|---|
| ""29235-f00"", 《3GPP SPECS\29_SERIES》 * |
| B. VENKATA SAIKUMAR: "A Systematic Approach for Analyzing Hop count and Path Reliability of Mobile AdHoc Networks", 《IEEE XPLORE》 * |
| 马明辉: "无线自组织网络路由协议研究", 《中国博士学位论文全文数据库（电子期刊）信息科技辑》 * |
| 黄河清: "一种基于多权值优化的无线传感网分簇算法的研究", 《电子与信息学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114143711A (en) * | 2021-11-25 | 2022-03-04 | 深圳Tcl新技术有限公司 | Information processing method, information processing device, electronic equipment and storage medium |
| CN114143711B (en) * | 2021-11-25 | 2024-04-02 | 深圳Tcl新技术有限公司 | Information processing method, information processing device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111356201B (en) | 2022-04-15 |
| WO2020125398A1 (en) | 2020-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100987292B1 (en) | System and method for detecting node mobility based on network topology changes in a wireless communication network | |
| US10063460B2 (en) | Method and apparatus for shortening multi-hop routes in a wireless ad hoc network | |
| US7693119B2 (en) | Transmission power control over a wireless ad-hoc network | |
| KR101271389B1 (en) | A method for multi-channel resource reservation in a wireless mesh network | |
| CN111526557B (en) | Wireless ad hoc network routing information acquisition method | |
| CN101611392A (en) | The method and system that is used for dynamic measurement and wireless hello agreement | |
| CN112040528B (en) | Method for selecting control node of wireless ad hoc network center | |
| CN111356201B (en) | Method and device for grouping great coverage and network node | |
| KR101507720B1 (en) | Method for improved topology mapping in wireless communication networks | |
| Sheu et al. | Location-free topology control protocol in wireless ad hoc networks | |
| CN113891329A (en) | Frequency spectrum monitoring method and system based on multi-hop forwarding of unmanned aerial vehicle | |
| CN112261665B (en) | Networking method of self-organizing network | |
| CN115665860B (en) | Unmanned aerial vehicle ad hoc network resource allocation method based on characteristics of waiting bird group | |
| CN110519167B (en) | RSSI-based implementation method for improved OLSR routing protocol | |
| CN113273101B (en) | Integrating sectorized communications and route discovery in a multi-hop system | |
| CN109688557B (en) | Cooperative node selection method and device | |
| Zaman et al. | Clustered and leveled disjoint multipath routing algorithm for wireless sensor networks | |
| Liu et al. | A novel stable cluster protocol for mobile ad hoc networks | |
| KR101127359B1 (en) | Method for establishing route path on Multi-hop Resource Sensing Mechanism for supporting path stability in Ad-Hoc network | |
| Ijjada | Optimal Relay Selection Strategy for Efficient and Reliable Cluster based Cooperative Multi Hop Transmission in Vehicular Communication | |
| Venkatachalam et al. | Multiple cross-layer design based complete architecture for mobile adhoc networks | |
| CN117675687A (en) | Tough and anti-destruction routing method and system for large-scale hierarchical clustering cluster network | |
| Muneer et al. | Single Frequency Network Based Distributed Cooperative Routing with CSMA MAC | |
| Zhao et al. | The application of multi-path fault tolerant algorithm in WSN nodes | |
| Sahu et al. | AAF: Analog superposition assisted forwarding node selection and density estimation in vehicular networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210604 Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing Applicant after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Applicant before: Telecommunications Science and Technology Research Institute Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |