A study of trust mining algorithms for beacon nodes in large-scale network environments

In a large-scale network environment, node positioning is prone to large deviations. Mining beacon node trust is the basis for precise node positioning in the network environment. Therefore, this article studies the trust degree mining algorithm of beacon nodes in a large-scale network environment. First, according to the distance error evaluation and probability function of beacon nodes in the large-scale network environment, the direct trust degree of beacon nodes is obtained. The trust degree is converted into influence, and the influence of beacon nodes is mined using the seepage theory to determine the beacon node with the highest impact in the large-scale network environment. Then, according to the influence of nodes, received signal strength indicator (RSSI) is used to optimize the conventional distance vector hop (DV-Hop) node location algorithm. The influence weights the average hop distance of beacon nodes. The weight of the influence of beacon nodes defines the average hop distance of unknown nodes. The average hop distance information of unknown nodes is taken from more high-influence beacon nodes, solving the problem of significant positioning errors caused by the uncertainty of location targets. Finally, the security status of nodes is reflected according to the degree of trust of different nodes to beacon nodes. The experimental results show that the algorithm can accurately locate other nodes in a wide network environment when the number of beacon nodes and communication distance change, and the trust degree of nodes mined can accurately reflect the security status of nodes.

Authors

Institutions

Publication Details

Journal
PeerJ Computer Science
Published
2025-04-22
DOI
https://doi.org/10.7717/peerj-cs.2755
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A study of trust mining algorithms for beacon nodes in large-scale network environments

Yanyan Jiang
PeerJ Computer Science
Energy Efficient Wireless Sensor Networks
article

A study of trust mining algorithms for beacon nodes in large-scale network environments

Yanyan Jiang
article en

Abstract

In a large-scale network environment, node positioning is prone to large deviations. Mining beacon node trust is the basis for precise node positioning in the network environment. Therefore, this article studies the trust degree mining algorithm of beacon nodes in a large-scale network environment. First, according to the distance error evaluation and probability function of beacon nodes in the large-scale network environment, the direct trust degree of beacon nodes is obtained. The trust degree is converted into influence, and the influence of beacon nodes is mined using the seepage theory to determine the beacon node with the highest impact in the large-scale network environment. Then, according to the influence of nodes, received signal strength indicator (RSSI) is used to optimize the conventional distance vector hop (DV-Hop) node location algorithm. The influence weights the average hop distance of beacon nodes. The weight of the influence of beacon nodes defines the average hop distance of unknown nodes. The average hop distance information of unknown nodes is taken from more high-influence beacon nodes, solving the problem of significant positioning errors caused by the uncertainty of location targets. Finally, the security status of nodes is reflected according to the degree of trust of different nodes to beacon nodes. The experimental results show that the algorithm can accurately locate other nodes in a wide network environment when the number of beacon nodes and communication distance change, and the trust degree of nodes mined can accurately reflect the security status of nodes.

PeerJ Computer ScienceVol. 11
Huzhou Vocational and Technical College (CN)
Openalex Percentile: Top 92%
Energy Efficient Wireless Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.