淡江大學機構典藏:Item 987654321/54971
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64178/96951 (66%)
Visitors : 10771853      Online Users : 20986
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/54971


    Title: A GA-based mobile RFID localization scheme for internet of things
    Authors: Wu, Tin-Yu;Liaw, Guan-Hsiung;Huang, Sing-Wei;Lee, Wei-Tsong;Wu, Chung-Chi
    Contributors: 淡江大學電機工程學系
    Keywords: IOT;RF-mapping;Indoor localization;Genetic algorithms
    Date: 2011-03
    Issue Date: 2011-08-05 12:18:58 (UTC+8)
    Publisher: Guildford: Springer U K
    Abstract: In the current (Internet of Things) trend, the identification capability of RFID is integrated for the identification and applications of all objects, and this trend reveals the future demand for RFID wireless communication and localization. Therefore, this paper investigates the influences of RSSI and the distance to RFID and analyzes the common indoor localization algorithms, including range-based algorithms and range-free algorithms. However, there are too many interference factors in the indoor environment that easily lead to localization inaccuracy. To improve the RF-mapping technique in RFID that requires much time for initiation and lots of calculations, this paper proposes a GA-based (Genetic Algorithms, GA) localization algorithm to estimate the locations of unknown nodes and avoid the influence of environmental factors by pre-establishing the pattern. The designed scenarios and reference nodes in this paper are used to train our proposed algorithm and obtain the patents of the scenarios, which are adopted for RFID nodes to further compare and decrease errors. Therefore, as long as the algorithm is trained in advance with the scenarios and then include the patents in the new environment, the errors and the training time can be greatly reduced. Moreover, our proposed algorithm needs only little information about reference nodes to pre-establish the pattern.
    Relation: Personal and Ubiquitous Computing 16(3), pp.245-258
    DOI: 10.1007/s00779-011-0398-9
    Appears in Collections:[Graduate Institute & Department of Electrical Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML799View/Open
    index.html0KbHTML350View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback