원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Aiming at the inherent deficiencies of large-scale wireless sensor network for distributed positioning algorithm, the DV-hop algorithm is mainly studied and improved, and two kinds of improved algorithms DV-hop and DV-hop+Lastdist DV- hop-MinMax are proposed. The DV- hop+Lastdist improves the positioning accuracy of the node by only adding a message variable, while the DV-hop-MinMax effectively reduces the costs of floating-point operations and power consumption, and can select the appropriate algorithm according to actual application environment. Finally, the paper gives the method to realize OMNeT++ in the simulation environment, and carries out the simulation analysis.
목차
Abstract
1. Introduction
2. General Model for Fully Distributed Positioning Algorithm
2.1. Distance Measurement between Unknown Node and Anchor Node
2.2. Node Positioning Calculation Coordinates
2.3. Iterative Refinement
3. Improved DV-hop Positioning Algorithm
3.1. Improved DV-hop Algorithm DV-hop+Lastdist
3.2. Combination Method of DV-hop and Min-Max
4. Simulation and Result Analysis
4.1. Establishment of Standard Scene
4.2. Analysis of Simulation Results
5. Conclusion
References
1. Introduction
2. General Model for Fully Distributed Positioning Algorithm
2.1. Distance Measurement between Unknown Node and Anchor Node
2.2. Node Positioning Calculation Coordinates
2.3. Iterative Refinement
3. Improved DV-hop Positioning Algorithm
3.1. Improved DV-hop Algorithm DV-hop+Lastdist
3.2. Combination Method of DV-hop and Min-Max
4. Simulation and Result Analysis
4.1. Establishment of Standard Scene
4.2. Analysis of Simulation Results
5. Conclusion
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보