中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/106024
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81629626      Online Users : 4777
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106024


    Title: A historical-beacon-aided localization algorithm for mobile sensor networks
    Authors: 張貴雲;Huang, Jen-Feng;Chang, Guey-Yun;Chen, Gen-Huey
    Contributors: 資訊電機學院資訊工程學系
    Keywords: Accuracy;Algorithm design and analysis;Algorithms;Anchors;Approximation algorithms;Computer simulation;Control systems;Cost engineering;Localization;Mobile communication;Mobile computing;Networks;Position (location);Prediction algorithms;Sensors;Wireless sensor networks
    Date: 2015-06-01
    Issue Date: 2026-04-23 13:04:29 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers Inc.;Los Alamitos: IEEE
    Abstract: 摘要: Range-free localization approaches are cost-effective for mobile sensor networks (because no additional hardware support is required). However, existing range-free localization approaches for mobile sensor networks suffer from either sparse anchor node problem or high communication cost. Due to economic considerations, mobile sensor networks typically have sparse anchor nodes which makes most range-free localization algorithms inaccurate. On the other hand, due to the power limitation of mobile sensor nodes (i.e., they are battery-operated) and high power consumption by communication, high communication cost will significantly reduce the network life time. For solving these two problems, in this paper, we use historical beacons (i.e., anchor nodes' announcements delivered in previous time slots) and received signal strength (RSS) to derive three constraints. By the aid of the three constraints, we introduce a low-communication-cost range-free localization algorithm (only one-hop beacon broadcasting is required). According to the theoretical analysis and simulation results, our three constraints can indeed improve the accuracy. Simulation results also show that our algorithm outperforms even in irregular-radio-signal environments. In addition, a hardware implementation running on sensor nodes, Octopus Xs, confirms theoretical analysis and simulation results.
    其他題名: TMC
    出版者: Los Alamitos: IEEE
    出版日期: 2015-06-01
    出處: IEEE transactions on mobile computing, 2015-06, Vol.14 (6), p.1109-1122
    資源來源: IEEE Electronic Library (IEL)
    版權: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2015
    識別號: ISSN: 1536-1233
    識別號: EISSN: 1558-0660
    識別號: DOI: 10.1109/TMC.2014.2346777
    識別號: CODEN: ITMCCJ
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML14View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 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 ©   - 隱私權政策聲明