{"created":"2023-07-25T10:25:33.767283+00:00","id":3948,"links":{},"metadata":{"_buckets":{"deposit":"b99bc76d-eaa0-468e-8365-3afbdab43fba"},"_deposit":{"created_by":4,"id":"3948","owners":[4],"pid":{"revision_id":0,"type":"depid","value":"3948"},"status":"published"},"_oai":{"id":"oai:naist.repo.nii.ac.jp:00003948","sets":["34:35"]},"author_link":["7199","215","7200","7201"],"item_7_biblio_info_9":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2011-12-15","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"490","bibliographicPageStart":"473","bibliographicVolumeNumber":"19","bibliographic_titles":[{"bibliographic_title":"Journal of Information Processing","bibliographic_titleLang":"en"}]}]},"item_7_description_7":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Aiming to achieve sensing coverage for given Areas of Interest (AoI) over time at low cost in a People-Centric Sensing manner, we propose a concept of (α, T)-coverage of a target field where each point in the field is sensed by at least one mobile node with the probability of at least α during time period T. Our goal is to achieve (α, T)-coverage of a given AoI by a minimal set of mobile nodes. In this paper, we propose two algorithms: inter-location algorithm that selects a minimal number of mobile nodes from nodes inside the AoI considering the distance between them and inter-meeting-time algorithm that selects nodes regarding the expected meeting time between the nodes. To cope with the case that there is an insufficient number of nodes inside the AoI, we propose an extended algorithm which regards nodes inside and outside the AoI. To improve the accuracy of the proposed algorithms, we also propose an updating mechanism which adapts the number of selected nodes based on their latest locations during the time period T. In our simulation-based performance evaluation, our algorithms achieved (α, T)-coverage with good accuracy for various values of α, T, AoI size, and moving probability.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_7_publisher_10":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"一般社団法人情報処理学会","subitem_publisher_language":"ja"}]},"item_7_relation_17":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.11185/imt.6.1251","subitem_relation_type_select":"DOI"}}]},"item_7_rights_18":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof.","subitem_rights_language":"ja"},{"subitem_rights":"Copyright c 2011 by the Information Processing Society of Japan","subitem_rights_language":"en"}]},"item_7_source_id_12":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-6652","subitem_source_identifier_type":"ISSN"}]},"item_7_source_id_14":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA00700121","subitem_source_identifier_type":"NCID"}]},"item_7_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ahmed, Asaad","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"7199","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Yasumoto, Keiichi","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"215","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"40273396","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=40273396"}]},{"creatorNames":[{"creatorName":"Yamauchi, Yukiko","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"7200","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Ito, Minoru","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"7201","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2023-03-02"}],"displaytype":"detail","filename":"IPSJ-JIP1900040.pdf","filesize":[{"value":"2.3 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"fulltext","objectType":"fulltext","url":"https://naist.repo.nii.ac.jp/record/3948/files/IPSJ-JIP1900040.pdf"},"version_id":"036ebd85-b519-43fa-bfff-0e79596541b6"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Probabilistic Coverage Methods in People-Centric Sensing","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Probabilistic Coverage Methods in People-Centric Sensing","subitem_title_language":"en"}]},"item_type_id":"7","owner":"4","path":["35"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2016-11-24"},"publish_date":"2016-11-24","publish_status":"0","recid":"3948","relation_version_is_last":true,"title":["Probabilistic Coverage Methods in People-Centric Sensing"],"weko_creator_id":"4","weko_shared_id":-1},"updated":"2023-11-16T08:38:00.160787+00:00"}