中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/51648
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 80990/80990 (100%)
造访人次 : 41262178      在线人数 : 114
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51648


    题名: The optimal k-covering tag deployment for RFID-based localization
    作者: Ku,WS;Sakai,K;Sun,MT
    贡献者: 資訊工程學系
    日期: 2011
    上传时间: 2012-03-27 18:58:26 (UTC+8)
    出版者: 國立中央大學
    摘要: Radio Frequency Identification (RFID) technologies are applied in many fields for a variety of applications today. Recently, new solutions are proposed to deploy RF tags on the ground instead of attaching them to objects for RFID-based monitoring and localization. However, the optimal tag deployment strategy is yet to be addressed. In this paper, we identify the optimal deployment patterns that guarantee k-covering (i.e., at least k RFID tags are accessible anywhere in the deployment region), where k <= 3. In addition, we analyze the achievable minimum upper bound and the average of localization error when the optimal deployment patterns are applied. The numerical results show that our optimal deployment patterns significantly reduce the required number of tags for k-covering compared with the square pattern which is commonly used in RFID-based monitoring and localization systems. The comparison between simulation and analytical results shows that our analytical models provide very accurate estimations of localization error. (C) 2010 Elsevier Ltd. All rights reserved.
    關聯: JOURNAL OF NETWORK AND COMPUTER APPLICATIONS
    显示于类别:[資訊工程學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML557检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明