Unlock instant, AI-driven research and patent intelligence for your innovation.

A Hop Matrix Recovery Method Based on Adjacency Matrix Construction

A technology of adjacency matrix and matrix recovery, which is applied to services based on specific environments, wireless communications, electrical components, etc., can solve the problem of poor recovery of missing values ​​in the hop matrix, and achieve easy and strong adaptability to restore the hop matrix sexual effect

Active Publication Date: 2022-07-15
SUN YAT SEN UNIV
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] In order to solve the problem that the recovery effect of the missing values ​​in the hop count matrix is ​​not good in the above prior art, the present invention provides a hop count matrix recovery method based on the adjacency matrix construction, which has a more accurate prediction result for the missing hop count, Greatly improved resiliency to hop matrix

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Hop Matrix Recovery Method Based on Adjacency Matrix Construction
  • A Hop Matrix Recovery Method Based on Adjacency Matrix Construction
  • A Hop Matrix Recovery Method Based on Adjacency Matrix Construction

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0050] like figure 1 As shown, a hop number matrix recovery method based on adjacency matrix construction, the method includes the steps as follows:

[0051] S1: The hop count matrix obtained due to an incomplete flooding process or an attack by a malicious node contains missing items;

[0052] S2: If the hop count matrix , the symmetric positions of the missing hops are observed, and they are filled using the symmetric position hops;

[0053] S3: Pass the missing hop count matrix Infer the connectivity between different pairs of nodes, resulting in an adjacency matrix A=[a ij ] n×n , i=1,...,n; j=1,...,n;

[0054] S4: use the shortest path algorithm to process the adjacency matrix obtained in step S3 to obtain a preliminary hop number matrix;

[0055] S5: Traverse the initially obtained hop number matrix, and use the hop number completed by the neighbor to replace the position without the hop number value, so as to restore the complete hop number matrix.

[0056] I...

Embodiment 2

[0111] A computer system, comprising a memory, a processor and a computer program stored on the memory and running on the processor, when the processor executes the computer program, the method steps implemented are as follows:

[0112] S1: Obtain the missing hop count matrix through the flooding process

[0113] S2: If the hop count matrix , the symmetric positions of the missing hops are observed, and they are filled using the symmetric position hops;

[0114] S3: Pass the missing hop count matrix Infer the connectivity between different pairs of nodes, resulting in an adjacency matrix A=[a ij ] n×n , i=1,...,n; j=1,...,n;

[0115] S4: use the shortest path algorithm to process the adjacency matrix obtained in step S3 to obtain a preliminary hop number matrix;

[0116] S5: Traverse the initially obtained hop number matrix, and use the hop number completed by the neighbor to replace the position without the hop number value, so as to restore the complete hop number m...

Embodiment 3

[0118] A computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the method steps implemented are as follows:

[0119] S1: Obtain the missing hop count matrix through the flooding process

[0120] S2: If the hop count matrix , the symmetric positions of the missing hops are observed, and they are filled using the symmetric position hops;

[0121] S3: Pass the missing hop count matrix Infer the connectivity between different pairs of nodes, resulting in an adjacency matrix A=[a ij ] n×n , i=1,...,n; j=1,...,n;

[0122] S4: use the shortest path algorithm to process the adjacency matrix obtained in step S3 to obtain a preliminary hop number matrix;

[0123] S5: Traverse the initially obtained hop number matrix, and use the hop number completed by the neighbor to replace the position without the hop number value, so as to restore the complete hop number matrix.

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The present invention provides a hop number matrix recovery method based on an adjacency matrix structure, which includes the following steps: S1: due to an incomplete flooding process or an attack by a malicious node, the acquired hop number matrix contains missing items; S2: if the hop number matrix contains missing items; In the matrix, the symmetric positions of the missing hops are observed, and the symmetric position hops are used to complete them; S3: The connectivity between different node pairs is inferred from the missing hops matrix, thereby obtaining the adjacency matrix A=[ a ij ] n×n , i=1,...,n; j=1,...,n; S4: use the shortest path algorithm to process the adjacency matrix to obtain the preliminary hop number matrix; S5: traverse the preliminary obtained hop number matrix, for no hop number matrix The position of the value is replaced by the hop value completed by the neighbor, so as to restore the complete hop number matrix. The present invention predicts the missing hops more accurately, and greatly improves the recovery ability of the hops matrix.

Description

technical field [0001] The invention relates to the technical field of wireless sensor networks, and more particularly, to a hop number matrix recovery method constructed based on an adjacency matrix. Background technique [0002] In modern IoT systems, data integrity becomes the most important aspect that affects the overall performance of the system. However, the problem of missing data is very common in IoT, which can lead to drawing wrong conclusions from the data. An essential task after deployment of awareness nodes is to obtain their own location, since most of the time, awareness nodes are deployed automatically. A sensing node communicates with nodes outside its maximum transmission range via multi-hop links. In this case, the hop count matrix of the network contains the hop values ​​between sensing nodes. However, in some cases, some entries in the hop count matrix may not be observed, or they may be polluted. We illustrate by taking the non-ranging positioning...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04W4/38H04W40/04H04W40/24H04W40/34
CPCH04W4/38H04W40/04H04W40/248H04W40/34
Inventor 刘星成赵莹莹
Owner SUN YAT SEN UNIV