English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 95844/126434 (76%)
Visitors : 31570002      Online Users : 543
RC Version 6.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
    政大機構典藏 > 理學院 > 資訊科學系 > 會議論文 >  Item 140.119/75324
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/75324

    Title: Verification of k-coverage on query line segments
    Authors: Juang, K.-H.;Wang, E.T.;Chiang, Chieh-Feng;Chen, Arbee L. P.
    Contributors: 資科系
    Keywords: 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
    Date: 2013-10
    Issue Date: 2015-05-26 18:28:07 (UTC+8)
    Abstract: 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.
    Relation: 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
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1145/2513591.2513639
    DOI: 10.1145/2513591.2513639
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

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