This paper presents a novel range-free single chord localization algorithm with low energy consumption and high accuracy for wireless sensor networks. A mobile anchor node and a mobile reference node are employed to periodically broadcast beacon messages and reference messages, respectively. Each sensor node is equipped with a received signal strength indicator for comparing the signal strength. By using the edge function and the result of comparing signal strength, each sensor node only needs one chord on the communication circle for localization. Compared with previous approaches that require multiple chords, less beacon messages are required by the sensor nodes. In the proposed algorithm, the localization error mainly depends on the move distance interval. However, for the other approaches, large localization errors can be observed according to the angle between chords which may descend the localization accuracy dramatically. Analysis results indicate that the proposed algorithm is superior to other approaches in energy consumption and localization accuracy.
목차
Abstract 1. Introduction 2. Double Mobile Anchor Nodes Scheme 3. The Proposed Algorithm 3.1. Beacon Points Selecting Stage 3.2. Localization Calculating Stage 3.3. Location Result 4. Analysis 4.1. Constrains of Chord Length 4.2. Obstacle Tolerance 4.3. Energy Consumption 4.4. Localization Accuracy 5. Conclusion Acknowledgements References
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.8 No.1