勤益科大機構典藏:Item 987654321/5891
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 2928/5721 (51%)
造訪人次 : 375605      線上人數 : 323
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/5891


    題名: Linear Time Approximation Algorithms for the Relay Node Placement Problem in Wireless Sensor Networks with Hexagon Tessellation
    作者: Chi-Chang Chen, Chi-Yu Chang, and Po-Ying Chen
    貢獻者: 圖書館
    日期: 2015
    上傳時間: 2016-10-17 10:47:55 (UTC+8)
    摘要: The relay node placement problem in wireless sensor network (WSN) aims at deploying the minimum number of relay nodes over the network so that each sensor can communicate with at least one relay node. When the deployed relay nodes are homogeneous and their communication ranges are circular, one way to solve the WSN relay node placement problem is to solve the minimum geometric disk cover (MGDC) problem first and place the relay nodes at the centers of the covering disks and then, if necessary, deploy additional relay nodes to meet the connection requirement of relay nodes. It is known that the MGDC problem is NP-complete. A novel linear time approximation algorithm for the MGDC problem is proposed, which identifies covering disks using the regular hexagon tessellation of the plane with bounded area. The approximation ratio of the proposed algorithm is (5+ε), where 0<ε≦15 . Experimental results show that the worst case is rare, and on average the proposed algorithm uses less than 1.7 times the optimal disks of the MGDC problem. In cases where quick deployment is necessary, this study provides a fast 7-approximation algorithm which uses on average less than twice the optimal number of relay nodes in the simulation.
    關聯: Journal of Sensors Volume 2015, Article ID 565983, 12 pages
    顯示於類別:[電子工程系(所)] 【電子工程系所】期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    Linear Time Approximation Algorithms for the Relay Node Placement Problem in Wireless Sensor Networks with Hexagon Tessellation.pdf1828KbAdobe PDF1622檢視/開啟


    檢視Licence

    在NCUTIR中所有的資料項目都受到原著作權保護.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋