무선 센서 네트워크에서 개선된 DV-Hop 위치 추정 알고리즘
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 이채우 | - |
dc.contributor.author | Martin Ekale Etinge | - |
dc.date.accessioned | 2018-11-08T08:00:21Z | - |
dc.date.available | 2018-11-08T08:00:21Z | - |
dc.date.issued | 2011-02 | - |
dc.identifier.other | 11701 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/9663 | - |
dc.description | 학위논문(석사)--아주대학교 일반대학원 :전자공학과,2011. 2 | - |
dc.description.tableofcontents | Acknowledgement 1 Abstract 4 Dedication 5 List of Figures 6 List of Table 7 CHAPTER 1INTRODUCTION 8 1.1 Wireless Sensor Networks Model 9 1.2 Applications of Sensor Networks 11 1.3 Localization in Sensor Networks 14 1.4 Problem definition and Challenges of Localization 15 CHAPTER 2 BACKGROUND AND RELATED RESEARCH 18 2.1 General Overview 18 2.2 Range Based Localization 19 2.2.1 Angle of Arrival (AOA) 19 2.2.2 Time of Arrival (TOA) 22 2.2.3 Time Difference of Arrival (TDOA) 23 2.2.4 Received Signal Strength Indication (RSSI) 24 2.3 Range Free Localization 25 2.3.1 Hop Counting 25 2.3.2 APIT 27 2.3.3 Proximity 28 2.3.4 DV Distance 29 2.3.5 Multi Hop 30 2.3.6 Multidimensional scaling 30 2.3.7 N-Hop Multilateration 31 2.3.8 Finger Printing 31 CHAPTER 3 COEFFICIENT ALLOCATED DV-HOP (CADV-Hop) AND THE MODIFIED DV-HOP ALGORITHM 32 3.1 Coefficient Allocated DV-Hop (CA DV-Hop) 32 3.1.1 Aim 32 3.1.2 Location Estimation 33 3.1.3 Performance and Simulation Results 34 3.2 The modified DV-Hop algorithm 36 3.2.1 Aim 36 3.2.2 Location Estimation 36 3.2.3 Performance Analysis and Simulation Results 37 CHAPTER 4CONCLUSION 42 REFERENCE 43 | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | 무선 센서 네트워크에서 개선된 DV-Hop 위치 추정 알고리즘 | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 일반대학원 | - |
dc.contributor.department | 일반대학원 전자공학과 | - |
dc.date.awarded | 2011. 2 | - |
dc.description.degree | Master | - |
dc.identifier.localId | 568943 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000011701 | - |
dc.subject.keyword | Localization | - |
dc.subject.keyword | DV-Hop | - |
dc.description.alternativeAbstract | Localization is an important challenge in wireless sensor networks (WSN). Localization usually refers to the process of dynamically determining the position(s) of one or more node(s) in a larger network. The challenge lies in efficiently providing acceptable accuracy while conforming to the many constraints of WSNs and at the same time handling scalability. Wireless Sensor Networks have been proposed for several location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point to point distance estimates. Localization of sensor nodes is the foundation of the entire wireless sensor network. Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. This thesis introduces the localization process of sensor nodes based on Distance ? Vector Hop (DV-HOP) algorithm. Based on this, it proposes an improved DV-HOP algorithm which is based on coefficient least square method. The new algorithm called Coefficient Allocated DV-Hop (CA DV-Hop) reduces node?s location error by awarding a credit value with respect to number of hops of each anchor to an unknown node to differentiate the anchor node influence, and proposed a new method of determining location of the node. The simulation results show that the proposed improvements can greatly enhance the localization accuracy of the nodes. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.