As one of the most important applications of wireless sensor network, positioning technology has become a extremely hot research filed. Taking into account of the position of beacon nodess, they make an effect on the positioning accuracy of unknown nodes. Therefore, in this paper, it proposes a new weighted centroid localization algorithm based on the traditional algorithm. For the selection of weight, the distance between beacon nodes and unknown nodes, and the slide length of the triangle are used to formed as the weighted factor. Experiment Simulation results show that this algorithm increased localisition accuracy than that of traditional algorithm.
목차
Abstract 1. Introduction 2. Traditional Centroid Localization Algorithm Model 3. Weighted Centroid Localization Algorithm 4. An improved Weighted Centroid Localization Algorithm 5. Implementation Process of Algorithm 6. Algorithm Simulation 7. Conclusion Acknowledgements References
키워드
Wireless Sensor NetworksPositioning TechnologyWeighted Centroid LocalizationNodes Position
저자
Li Bin [ College of Information and Communication Engineering Harbin Engineering University Harbin, China ]
Dou Zheng [ College of Information and Communication Engineering Harbin Engineering University Harbin, China ]
Ning Yu [ College of Information and Communication Engineering Harbin Engineering University Harbin, China ]
Lin Yun [ College of Information and Communication Engineering Harbin Engineering University Harbin, China ]
보안공학연구지원센터(IJFGCN) [Science & Engineering Research Support Center, Republic of Korea(IJFGCN)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Future Generation Communication and Networking
간기
격월간
pISSN
2233-7857
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Future Generation Communication and Networking Vol.6 No.5