Font Size: a A A

Research On The Positioning Algorithm Of The City Wireless Sensor Network

Posted on:2016-05-04Degree:MasterType:Thesis
Country:ChinaCandidate:X X LiuFull Text:PDF
GTID:2308330464962594Subject:Electronics and Communications Engineering
Abstract/Summary:PDF Full Text Request
City node localization technology is an important part in wireless sensor network,As the restrictions of wireless sensor node,such as limited energy, small memory, transmission range, making wireless sensor positioning technology has great room for optimization.Therefore, the design of a low-power, high-precision wireless node localization algorithm in wireless sensor networks is an important part of WSN.Not only can effectively improve the efficiency of WSN routing, and for the entire network management, data integration, topology management must provide effective technical support base on more accurate location information data.Designing a high-precision, high efficiency, low energy consumption, low redundancy node localization algorithm has been a hot issue in the field of WSN.The article think about from real environment that the whole city, part city, border city. finally proposing two node localization algorithm, and made some meaningful results.Its mainly in the following aspects:(1)Combined with the city as well as wireless communications model to analyze advantages and disadvantages of the existing location algorithms.Improved RSSI algorithm is based on the city’s environment and wireless sensor network’s characteristics.The whole city is divided into three parts of city center, open areas, suburbs or marginal zone based on cluster of the city. The node localization algorithm based on potential cluster improve the positioning accuracy greatly and using different communication model in different cluster region.(2)For improving the positioning accuracy of the city’s local,Introducing the concept of a mathematical model matrix rank to reduces the complexity and energy expenditure calculated in the RSSI algorithm.The simulation results show that reduced rank of the matrix reduces costs of nodes.(3)This paper proposes chaotic particle swarm optimization algorithm to reduce the positioning error of wireless sensor nodes based on introduction of the matrix model.Firstly, the best particle must be chaos optimization in the population and the result of optimization will instead of a par ticle population,finally calculating coordinate through iterations.The simulation results show that the algorithm can be suitable for fast-paced city positioning.(4)In order to improve accuracy of APIT localization algorithm in WSN In the sparse network of border WSN, proposed a localization algorithm that the beacon nodes correction combined with the APIT algorithm. RSSI and DV-HOP algorithm to correct positioning of the unknown node.Simulation results show that the improved algorithm will bemore suitable for city sparse strip.(5)Three algorithms contains whole city algorithm, part city algorithm, border city algorithm that cover the whole city. Simulation results show that WSN has good accuracy.
Keywords/Search Tags:city wireless sensor network, Received Signal Strength Indication, Clustering, rank of a matrix, chaos, particle swarm optimization algorithm, DV-Hop, APIT
PDF Full Text Request
Related items