Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 최재훈 | - |
dc.date.accessioned | 2018-03-21T07:26:39Z | - |
dc.date.available | 2018-03-21T07:26:39Z | - |
dc.date.issued | 2014-04 | - |
dc.identifier.citation | 2014 IEEE Wireless Communications & Networking Conference (WCNC); 2014, p2739-2744 | en_US |
dc.identifier.isbn | 978-1-4799-3083-8 | - |
dc.identifier.issn | 1525-3511 | - |
dc.identifier.issn | 1558-2612 | - |
dc.identifier.uri | http://ieeexplore.ieee.org/abstract/document/6952862/ | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11754/50135 | - |
dc.description.abstract | Abstract:This paper presents a multihop range-free localization algorithm to enhance the localization accuracy in anisotropic networks with a small number of anchors. We derive potential locations of a normal node and corresponding probabilities in terms of the average one-hop internodal distance, the average hop progress and the hop counts to anchors. A novel distance estimation based on the potential locations is proposed to tolerate network anisotropy from nonuniform node deployments, irregular regions, and irregular radio simultaneously. Compared to other range-free algorithms, the proposed algorithm requires fewer anchors while achieving higher localization accuracy. The superiority of the proposed algorithm against other algorithms is demonstrated through computer simulations. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.title | Pascal’s Triangle-Based Multihop Range-Free Localization for Anisotropic Sensor Networks | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/WCNC.2014.6952862 | - |
dc.relation.page | 2739-2744 | - |
dc.contributor.googleauthor | Lee, Sangwoo | - |
dc.contributor.googleauthor | Choi, Jaehoon | - |
dc.contributor.googleauthor | Kim, Sunwoo | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF ELECTRONIC ENGINEERING | - |
dc.identifier.pid | choijh | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.