Research on Collaborative Positioning Algorithm of Wireless Sensor Network Security Under Strong Topology Relation

In the monitoring area, nodes collaboratively collect various types of critical information about the target object, including temperature, humidity, and stress, and relay this data to users. This study evaluates a scenario with 100 summary points and a communication radius of 20 meters, progressively increasing the number of attack nodes from 0 to 4. Despite the effectiveness of existing security positioning algorithms in mitigating attacks, their substantial network resource consumption remains a challenge. This paper introduces a novel security positioning method designed to tolerate three distinct types of attacks. This approach identifies attack nodes by examining the physical attributes of each node. Analysis indicates that the average positioning error for the witch attack algorithm increases sharply as the number of virtual nodes rises, reaching approximately 80% when four attack nodes are present. Over 1,000 rounds of network observation, node survival rates were documented, starting with an initial pool of 100 nodes. Comparative results reveal that the key-out algorithm begins to experience node failures around the 600th round, with complete node depletion by the 700th round. The MPRP-RSSI algorithm, on the other hand, starts showing failures around the 900th round. By contrast, the proposed algorithm exhibits enhanced robustness, maintaining node stability throughout the entire monitoring period. The enhanced RSSI-based positioning algorithm, which is resilient against replication attacks, applies constraints on communication ranges and enforces unique messaging protocols to regulate node interactions, effectively reducing replication threats.