淡江大學機構典藏:Item 987654321/50513
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 64185/96959 (66%)
造访人次 : 11515831      在线人数 : 7087
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/50513


    题名: Obstacle-Resistant Deployment Algorithms for Wireless Sensor Networks
    作者: 張志勇;Chang, Chih-yung;Chang, Chao-tsun;Chen, Yu-chieh;Chang, Hsu-ruey
    贡献者: 淡江大學資訊工程系
    关键词: Deployment;obstacles;wireless sensor network (WSNs)
    日期: 2009-07
    上传时间: 2010-08-09 18:51:48 (UTC+8)
    出版者: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: Node deployment is an important issue in wireless sensor networks (WSNs). Sensor nodes should be efficiently deployed in a predetermined region in a low-cost and high-coverage-quality manner. Random deployment is the simplest way to deploy sensor nodes but may cause unbalanced deployment and, therefore, increase hardware costs and create coverage holes. This paper presents the efficient obstacle-resistant robot deployment (ORRD) algorithm, which involves the design of a node placement policy, a serpentine movement policy, obstacle-handling rules, and boundary rules. By applying the proposed ORRD, the robot rapidly deploys a near-minimal number of sensor nodes to achieve full sensing coverage, even though there exist unpredicted obstacles with regular or irregular shapes. Performance results reveal that ORRD outperforms the existing robot deployment mechanism in terms of power conservation and obstacle resistance and, therefore, achieves better deployment performance.
    關聯: IEEE Transactions on Vehicular Technology 58(6), pp.2925-2941
    DOI: 10.1109/TVT.2008.2010619
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    0018-9545_58(6)p2925-2941.pdf2120KbAdobe PDF941检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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