{"updated":"2025-01-22T11:01:19.830221+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00043326","sets":["1164:3865:3866:3868"]},"path":["3868"],"owner":"1","recid":"43326","title":["センサネットワークにおけるホップベースルーティング手法の精度に関する検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-09-18"},"_buckets":{"deposit":"375d2d41-fe2c-4312-b2fe-a6af7b94c00b"},"_deposit":{"id":"43326","pid":{"type":"depid","value":"43326","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"センサネットワークにおけるホップベースルーティング手法の精度に関する検討","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"センサネットワークにおけるホップベースルーティング手法の精度に関する検討"},{"subitem_title":"An estimation of a hop-vector-based routing scheme for data-centric sensor networks","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2008-09-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"宮崎大学大学院工学研究科"},{"subitem_text_value":"熊本県立大学総合管理学部"},{"subitem_text_value":"宮崎大学工学部"},{"subitem_text_value":"宮崎大学工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Engineering, University of Miyazaki","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Administration, Prefectual University of Kumamoto","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, University of Miyazaki","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, University of Miyazaki","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/43326/files/IPSJ-MBL08046007.pdf"},"date":[{"dateType":"Available","dateValue":"2010-09-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MBL08046007.pdf","filesize":[{"value":"3.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"35"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"35716326-1762-4a1c-963e-373496ab9b17","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐藤雄亮"},{"creatorName":"油田健太郎"},{"creatorName":"岡崎, 直宣"},{"creatorName":"冨田, 重幸"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yusuke, Sato","creatorNameLang":"en"},{"creatorName":"Kentaro, Aburada","creatorNameLang":"en"},{"creatorName":"Naonobu, Okazaki","creatorNameLang":"en"},{"creatorName":"Shigeyuki, Tomita","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11851388","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では DCS （Deta-Centric Storage） センサネットワークを対象とした地理的位置情報を必要としないルーティング方式である HVGF （Hop-Vector based Greedy Forwarding） を提案する．提案方式では，n 個の基準点を設け，基準点からのホップ数を要素とするベクトルを全てのノードに作成し，そのn次元ベクトル間の距離に基づいて Greedy Forwarding を行う．シミュレーションによる評価を行い，既存の正確な位置情報を用いる手法に比べノード密度が低い場合や，ノードの分布に偏りがある場合のネットワークにおいて有効な結果が得られた．また，提案方式における最適な基準点の数についての考察を行った．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose a new routing scheme, HVGF (Hop-Vector based Greedy Forwarding) which doesn't need geographic information for data-centric sensor networks. In this scheme, we introduce n base-points, and assign n-dimensional hop-vector, which consists of number of hops from each base-point to the node, to each node. Then, each node forwards packets greedily based on distance between hop-vectors of the node and of destination. The simulation results show that HVGF works well in the low density networks or networks which contain a large void in the center, compared to existing greedy forwarding scheme using information of real geographical location. We also examine the performance of the proposed scheme concerning various number of base points.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"56","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告モバイルコンピューティングとユビキタス通信（MBL）"}],"bibliographicPageStart":"49","bibliographicIssueDates":{"bibliographicIssueDate":"2008-09-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"94(2008-MBL-046)","bibliographicVolumeNumber":"2008"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:09:45.599355+00:00","id":43326,"links":{}}