政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75324
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 113656/144643 (79%)
造访人次 : 51721327      在线人数 : 628
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/75324


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/75324


    题名: Verification of k-coverage on query line segments
    作者: Juang, K.-H.;Wang, E.T.;Chiang, Chieh-Feng;Chen, Arbee L. P.
    陳良弼
    贡献者: 資科系
    关键词: Computation costs;Coverage problem;Intersection points;K-coverage;Line segment;Lower bounds;Synthetic datasets;Verification problems;Data processing;Database systems;Decision trees;Experiments;Sensor networks;Query processing
    日期: 2013-10
    上传时间: 2015-05-26 18:28:07 (UTC+8)
    摘要: The coverage problem is one of the fundamental problems in sensor networks, which reflects the degree of a region being monitored by sensors. In this paper, we make the first attempt to address the k-coverage verification problem regarding a given query line segment, which returns all sub-segments from the line segment that are covered by at least k sensors. To deal with the problem, we propose three methods based on the R-tree index. The first method is the most primitive one, which identifies all intersection points of the query line segment and the circumferences of the covering regions of the sensors and then checks each sub-segment to see whether it is k-coverage. Improving from the first method, the second method calculates the lower bound of the number of sensors covering a specific sub-segment to reduce the computation costs. The third method partitions the query line segment into sub-segments with equal length and then verifies each of them. A series of experiments on a real dataset and two synthetic datasets are performed to evaluate these methods. The experiment results demonstrate that the third method has the best performance among all three methods. © 2013 ACM.
    關聯: ACM International Conference Proceeding Series, 2013, 114-121, 17th International Database Engineering and Applications Symposium, IDEAS 2013; Barcelona; Spain; 9 October 2013 到 13 October 2013; 代碼 100668
    数据类型: conference
    DOI 連結: http://dx.doi.org/10.1145/2513591.2513639
    DOI: 10.1145/2513591.2513639
    显示于类别:[資訊科學系] 會議論文

    文件中的档案:

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


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


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈