{"created":"2023-05-15T12:20:28.753667+00:00","id":11060,"links":{},"metadata":{"_buckets":{"deposit":"c4df7d7c-a73c-4fbd-b268-fc7ddf412b46"},"_deposit":{"created_by":1,"id":"11060","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"11060"},"status":"published"},"_oai":{"id":"oai:kansai-u.repo.nii.ac.jp:00011060","sets":["528:1538:1587"]},"author_link":["23729","23734","23732","23735","23727","23730","23728","23726","23731","23733"],"item_9_alternative_title_20":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Building Long Range Contact over P2P Delaunay Network Distributively"}]},"item_9_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2007-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG11(TOD34)","bibliographicPageEnd":"214","bibliographicPageStart":"190","bibliographicVolumeNumber":"48","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌 データベース"}]}]},"item_9_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"本稿では,P2Pドロネーネットワークにおける遠隔接続経路群(LRC)の自律分散生成法および遠隔地点への経路選択と範囲問合せへの適用について述べる.ドロネー図の構造を持つオーバレイネットワークである P2Pドロネーネットワークでは,各ノードは近傍ノードのみと接続する.この特徴は地理的な経路選択や範囲問合せに有効である.しかし,ノード数の増加に対してネットワークの直径が増大するため,遠隔ノード間の通信や広範囲の問合せに要するクエリのホップ数が増大し,通信遅延が生じるという課題が残されていた.そこで,空間全体にLRCを構成することで2ノード間のホップ散を低減する.我々は,平面上の各ノードが,ホップ数に基づいた水平/鉛直方向の経路を協調的に生成することで,平面全体へのLRCを完成させるボトムアップな生成法を与える.この水平/鉛直のLRCを用いた経路選択法,効率的な範囲問合せ法を提案する.さらに,ノードの参加・離脱時に,LRCを部分的に修正し構造を維持するアルゴリズムについて述べる.そして,数値シミュレーションにより,LRCの生成と維持にかかる負荷やLRCを用いた経路選択と範囲問合せの効果について検証した.また,応用システム例として災害時の被災者支援システムを提案し,実利用を想定したシミュレーションにより,LRCを組み込んだP2Pドロネーネットワークおよび関連システムのGeoPeerに対して2種類の構造を設定し,3者を比較評価した.\n　\nIn this paper, the authors propose an autonomous distributive generation algorithm of LRC (Long Range Contact) over P2P Delaunay network, and discuss on a routing method to distant location and on range query. In a P2P Delaunay network, which builds-in a Delaunay diagram as a topology using node location, a node has connections only with its neighboring nodes. This structural property has advantages for a geometric routing and range query mechanism among nodes. However, in case a P2P Delaunay network consists of a large number of nodes, its diameter increases which causes a serious communication delay in the wide area of range query. To overcome the problem, the authors show a method for nodes to construct LRC collaboratively in a bottom-up fashion both horizontally and vertically over a P2P Delaunay network to the entire target space, and provide algorithms for geometric routing as well as efficient range queries by use of horizontal/vertical LRC's. Moreover, algorithms for partial structural maintenance due to node join/leave are given. The authors examine the loads for generating/maintaining LRC, and the efficiency for routing and range query using LRC through numerical simulations. As a practical application, we set a scenario of a communication network for victims in a disaster area and rescue crues, and compare the efficiencies between the proposed system and two types of network topologies using GeoPeer numerically.","subitem_description_type":"Other"}]},"item_9_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"23731","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Ohnishi, Masaaki"}]},{"nameIdentifiers":[{"nameIdentifier":"23732","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Tsuboi, Shinji"}]},{"nameIdentifiers":[{"nameIdentifier":"23733","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Hirayama, Masao"}]},{"nameIdentifiers":[{"nameIdentifier":"23734","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Eguchi, Takayuki"}]},{"nameIdentifiers":[{"nameIdentifier":"23735","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Ueshima, Shinichi"}]}]},"item_9_publisher_34":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会"}]},"item_9_source_id_10":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464847","subitem_source_identifier_type":"NCID"}]},"item_9_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"03875806","subitem_source_identifier_type":"ISSN"}]},"item_9_version_type_17":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大西, 真晶"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"坪井, 新治"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"平山, 雅夫"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"江口, 隆之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"上島, 紳一"}],"nameIdentifiers":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-22"}],"displaytype":"detail","filename":"KU-1100-20070600-01.pdf","filesize":[{"value":"2.4 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KU-1100-20070600-01.pdf","url":"https://kansai-u.repo.nii.ac.jp/record/11060/files/KU-1100-20070600-01.pdf"},"version_id":"53c1e09b-525b-442c-bc60-a6613b878760"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"P2Pドロネーネットワークにおける遠隔接続経路の自律分散生成法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"P2Pドロネーネットワークにおける遠隔接続経路の自律分散生成法"}]},"item_type_id":"9","owner":"1","path":["1587"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-07-23"},"publish_date":"2010-07-23","publish_status":"0","recid":"11060","relation_version_is_last":true,"title":["P2Pドロネーネットワークにおける遠隔接続経路の自律分散生成法"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-05-15T14:39:56.586743+00:00"}