{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1390293810375937920.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.11308/tjsst.14.104"}}],"dc:title":[{"@language":"en","@value":"Performance Characterization of Virtual Accumulation and Reaccumulation by Information Floating"},{"@language":"ja","@value":"情報フローティングによる仮想蓄積と再蓄積の特徴付け"}],"dc:language":"ja","description":[{"type":"abstract","notation":[{"@language":"en","@value":"<p>Information Floating (IF) is a method of delivering information to mobile nodes in target areas preventing unnecessary transmissions by permitting mobile nodes to transmit data via wireless direct links only in Transmittable Areas (TAs). IF can virtually accumulate data by making mobile nodes transmit multiple different data in the same TAs. In addition, the cooperation of multiple TAs reaccumulates temporarily lost data. In this paper, we first consider reaccumulation with the cooperation of two TAs while assuming that these TAs are points on a road. We classify the system states into two kinds based on how well the reaccumulation works using simulation results and estimate the node density representing the boundary between these two states using approximate theoretical analysis. The numerical and simulation results show that we can estimate node density to realize sufficient reaccumulation. We then show how to extend the TAs based on the above results to achieve sufficient reaccumulation and show that the proposed method is effective.</p>"},{"@language":"ja","@value":"<p>情報フローティング（Information Floating：IF）は，移動ノードが送信可能エリア（Transmittable Area：TA）内だけで直接無線通信でデータを送信することにより，不要な送信を防ぎつつ，目的の領域の移動ノードに情報を配信する方法である．IFでは，移動ノードが同じTAで複数の異なるデータを送信することにより，仮想的にデータを蓄積することができる．また，複数のTAが連携することで，一時的に失われたデータを再蓄積することができる．本論文では，二つのTAが連携した場合の再蓄積について考え，まず，これらのTAが道路上の点であると仮定して検討する．シミュレーション結果から，システムの状態を再蓄積が十分に機能する状況と再蓄積能力が低下する状況の2種類に分類し，近似的な理論解析により，この二つの状況の境界を表すノード密度を推定する．数値計算結果とシミュレーション結果から，十分な再蓄積を実現するためのノード密度を推定できることを示す．また，上記の結果を用いて，ノード密度が十分でない場合に十分な再蓄積を実現するためにTAを拡張する手法を提案し，その有効性を示す．</p>"}],"abstractLicenseFlag":"disallow"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1410293810375937921","@type":"Researcher","foaf:name":[{"@language":"en","@value":"Miyakita Kazuyuki"},{"@language":"ja","@value":"宮北 和之"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"新潟国際情報大学"},{"@language":"en","@value":"Niigata University of International and Information Studies"}]},{"@id":"https://cir.nii.ac.jp/crid/1410293810375937922","@type":"Researcher","foaf:name":[{"@language":"en","@value":"Tamura Hiroshi"},{"@language":"ja","@value":"田村 裕"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"中央大学"},{"@language":"en","@value":"Chuo University"}]},{"@id":"https://cir.nii.ac.jp/crid/1410293810375937920","@type":"Researcher","foaf:name":[{"@language":"en","@value":"Nakano Keisuke"},{"@language":"ja","@value":"中野 敬介"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"新潟大学"},{"@language":"en","@value":"Niigata University"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"18835031"},{"@type":"EISSN","@value":"18835058"},{"@type":"LISSN","@value":"18835058"}],"prism:publicationName":[{"@language":"en","@value":"Transaction of the Japan Society for Simulation Technology"},{"@language":"ja","@value":"日本シミュレーション学会論文誌"},{"@language":"en","@value":"Transaction of the Japan Society for Simulation Technology"},{"@language":"en","@value":"Nihon Shimyureshon Gakkai Ronbunshi"},{"@language":"ja","@value":"日本シミュレーション学会論文誌"}],"dc:publisher":[{"@language":"en","@value":"Japan Society for Simulation Technology"},{"@language":"ja","@value":"日本シミュレーション学会"}],"prism:publicationDate":"2022","prism:volume":"14","prism:number":"2","prism:startingPage":"104","prism:endingPage":"113"},"availableAt":"2022","foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=%E6%83%85%E5%A0%B1%E3%83%95%E3%83%AD%E3%83%BC%E3%83%86%E3%82%A3%E3%83%B3%E3%82%B0","dc:title":"情報フローティング"},{"@id":"https://cir.nii.ac.jp/all?q=%E3%83%87%E3%83%BC%E3%82%BF%E8%93%84%E7%A9%8D","dc:title":"データ蓄積"},{"@id":"https://cir.nii.ac.jp/all?q=%E5%86%8D%E8%93%84%E7%A9%8D","dc:title":"再蓄積"},{"@id":"https://cir.nii.ac.jp/all?q=%E6%80%A7%E8%83%BD%E8%A9%95%E4%BE%A1","dc:title":"性能評価"},{"@id":"https://cir.nii.ac.jp/all?q=DTN","dc:title":"DTN"},{"@id":"https://cir.nii.ac.jp/all?q=Information%20Floating","dc:title":"Information Floating"},{"@id":"https://cir.nii.ac.jp/all?q=Data%20Accumulation","dc:title":"Data Accumulation"},{"@id":"https://cir.nii.ac.jp/all?q=Reaccumulation","dc:title":"Reaccumulation"},{"@id":"https://cir.nii.ac.jp/all?q=Performance%20Analysis","dc:title":"Performance Analysis"},{"@id":"https://cir.nii.ac.jp/all?q=DTN","dc:title":"DTN"}],"dataSourceIdentifier":[{"@type":"JALC","@value":"oai:japanlinkcenter.org:2009928127"}]}