Research Of Localization Algorithm Based On Samll World For Heterogeneous Sensor Network

A wireless sensor network (WSN) is a novel distributed computing system andinformation access model that consists of a large amount of low-power, low-cost andsmall-size sensor nodes. WSN can routing with self-organized multi-hop, sensing, acquire,process and transmit information within the network coverage area, and complete theassigned tasks according to the autonomous environmental needs. Complex network hasbecome an emerging discipline in recent years, and small-world effect which exists in acomplex social network widely has excellent features.Aiming at the problem exists in the small world localization algorithm of heterogeneoussensor networks, this paper made an in-depth analysis and research of the heterogeneouscharacteristics, architecture and localization issues of WSN in practical engineeringapplications; designed a suitable localization algorithm of the bridge structure based on thestructure and characteristics of adverse edge nodes in structural health monitoring systems;established a CMDS-MAP model and IDV-hop localization strategy of WSN for bridgeStructural Health Monitoring; meanwhile, analyzed the generation mechanism of small-worldeffect in WSN belonging to the space map in detail, designed a novel small-world locationalgorithm. The main research results are as follows:(1) An improved localization algorithm in WSN for bridge structural health monitoringAccording to the low-cost, large-scale and low-power characteristics of WSN, andlocalization accuracy deficiency of classical MDS-MAP algorithm, a calculus-basedlocalization algorithm for multi-dimensional scaling (CMDS-MAP) is proposed. Throughactual measurement of1-hop node distance, we can use calculus schemes to calculate2-hopneighbor nodes distance. And combined with the distance, we make the multidimensionalscaling for all nodes in the network. Simulation result shows that this algorithm significantlyimproves localization accuracy and performance.(2) An Iterative Boundary Node Localization Algorithm Based on Dv-hop scheme inWSNDv-hop localization algorithm is a classical simplicity localization method with lowcomputational complexity and strong practicability. aiming at Dv-hop localization accuracydeficiency, an improved iterative Dv-hop algorithm is proposed. It uses a small amount ofanchor nodes that know their location whereby other unknown nodes estimate their locationfrom the information they receive. Aiming at localization accuracy deficiency of Dv-hopalgorithm, we present a Dv-hop based iterative algorithm (IDV-hop) that uses ReceivedSignal Strength Indicator (RSSI) ranging model to confirm the locations of the nodes in the network. Through actual measurement of1-hop node distance, we can use iterative schemesto calculate2-hop neighbor nodes distance of boundary nodes. Analysis, simulation, andexperimental results show that our scheme outperforms classical Dv-hop schemes even whenthe environment is very bad.(3) A Localization Scheme of Wireless Sensor Networks Based on Small World EffectsAiming at localization deficiency of these large networks, an improved localizationscheme (SWLS) based on multidimensional scaling (MDS) and small-world effects isdesigned and applied to wireless sensor networks. Theoretical analysis and experimentalresults show that the by adding a few reliable links, SWLS can not only reduce averageenergy consumption and average path length but also balance energy consumption.Furthermore, the proposed algorithm can achieve comparable localization performance.