Full metadata record

DC FieldValueLanguage
dc.contributor.author최재훈-
dc.date.accessioned2018-03-21T07:26:39Z-
dc.date.available2018-03-21T07:26:39Z-
dc.date.issued2014-04-
dc.identifier.citation2014 IEEE Wireless Communications & Networking Conference (WCNC); 2014, p2739-2744en_US
dc.identifier.isbn978-1-4799-3083-8-
dc.identifier.issn1525-3511-
dc.identifier.issn1558-2612-
dc.identifier.urihttp://ieeexplore.ieee.org/abstract/document/6952862/-
dc.identifier.urihttp://hdl.handle.net/20.500.11754/50135-
dc.description.abstractAbstract: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.isoenen_US
dc.publisherIEEEen_US
dc.titlePascal’s Triangle-Based Multihop Range-Free Localization for Anisotropic Sensor Networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/WCNC.2014.6952862-
dc.relation.page2739-2744-
dc.contributor.googleauthorLee, Sangwoo-
dc.contributor.googleauthorChoi, Jaehoon-
dc.contributor.googleauthorKim, Sunwoo-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF ENGINEERING[S]-
dc.sector.departmentDEPARTMENT OF ELECTRONIC ENGINEERING-
dc.identifier.pidchoijh-
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > ELECTRONIC ENGINEERING(융합전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE