Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Probabilistic-based Range-free Localization for Anisotropic Sensor Networks
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 이상우 | - |
| dc.contributor.author | 최재훈 | - |
| dc.contributor.author | 최재훈 | - |
| dc.date.accessioned | 2022-07-16T11:26:59Z | - |
| dc.date.available | 2022-07-16T11:26:59Z | - |
| dc.date.created | 2021-05-13 | - |
| dc.date.issued | 2013-01 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/163569 | - |
| dc.description.abstract | This paper presents a range-free localization algorithm to improve the localizationaccuracy of the range-free scheme in anisotropic sensor networks. The proposed algorithmestimates the distance from a normal node to an anchor by considering the possibleplacements of intermediate nodes and corresponding probabilities. We showed that theproposed algorithm outperforms against DV-Hop algorithm via MATLAB simulations. | - |
| dc.language | 영어 | - |
| dc.language.iso | en | - |
| dc.publisher | 한국통신학회 | - |
| dc.title | Probabilistic-based Range-free Localization for Anisotropic Sensor Networks | - |
| dc.title.alternative | 비등방성 센서 네트워크를 위한 확률적기반 Range-free 측위 알고리즘 | - |
| dc.type | Article | - |
| dc.contributor.affiliatedAuthor | 최재훈 | - |
| dc.identifier.bibliographicCitation | 2013 한국통신학회 동계학술대회, pp.856 - 857 | - |
| dc.relation.isPartOf | 2013 한국통신학회 동계학술대회 | - |
| dc.citation.title | 2013 한국통신학회 동계학술대회 | - |
| dc.citation.startPage | 856 | - |
| dc.citation.endPage | 857 | - |
| dc.type.rims | ART | - |
| dc.type.docType | Proceeding | - |
| dc.description.journalClass | 2 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | other | - |
| dc.identifier.url | http://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE02136281 | - |
- Files in This Item
- Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.