淡江大學機構典藏:Item 987654321/37515
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62830/95882 (66%)
造访人次 : 4036667      在线人数 : 623
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/37515


    题名: OFRD:Obstacle-Free Robot Deployment Algorithms for Wireless Sensor Networks
    作者: Chang, Chih-yung;Chang, Hsu-ruey;Hsieh, Chen-chi;Chang, Chao-tsun
    贡献者: 淡江大學資訊工程學系
    日期: 2007-03-11
    上传时间: 2010-04-15 10:04:17 (UTC+8)
    出版者: New York: I E E E Communications Society
    摘要: 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 for deploying sensor nodes but may cause the unbalanced deployment and therefore increase the hardware cost. This paper presents an efficient obstacle-free robot deployment algorithm, called OFRD which involves the design of node placement policy, snake-like movement policy, and obstacle handling rules. By applying the proposed OFRD, the robot rapidly deploys near-minimal number of sensor nodes to achieve full sensing coverage even though there exist unpredicted obstacles. Performance results reveal that OFRD outperforms the existing robot deployment mechanism in terms of power conservation and obstacle resistance, and, therefore achieves a better deployment performance.
    關聯: Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE, pp.4371-4376
    DOI: 10.1109/WCNC.2007.797
    显示于类别:[資訊工程學系暨研究所] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    1525-3511_p4371-4376.pdf520KbAdobe PDF496检视/开启
    index.html0KbHTML335检视/开启
    OFRDObstacle-Free Robot Deployment Algorithms for Wireless Sensor Networks.pdf518KbAdobe PDF660检视/开启

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

    TAIR相关文章

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