Autonomous Multi-Source Multi-Sink Routing in Wireless Sensor Networks

• Item type: Journal(1)
• 公開日: 2011-12-15
• タイトル: Autonomous Multi-Source Multi-Sink Routing in Wireless Sensor Networks
• タイトル / 言語: en
• タイトル: Autonomous Multi-Source Multi-Sink Routing in Wireless Sensor Networks
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 一般論文
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Toshiba Tec Corporation
• 著者所属: Graduate School of Engineering, Hiroshima University
• 著者所属: Graduate School of Engineering, Hiroshima University
• 著者所属(英): en
• 著者所属(英): Toshiba Tec Corporation
• 著者所属(英): en
• 著者所属(英): Graduate School of Engineering, Hiroshima University
• 著者所属(英): en
• 著者所属(英): Graduate School of Engineering, Hiroshima University
• 著者名: XingPing, He; Sayaka, Kamei; Satoshi, Fujita
• 著者名(英): XingPing, He; Sayaka, Kamei; Satoshi, Fujita
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: This paper proposes a distributed algorithm to calculate a subnetwork of a given wireless sensor network (WSN) connecting a set of sources and a set of sinks, in such a way that: 1) the length of one of the shortest paths connecting from a source to a sink in the subgraph does not exceed the distance from the source to the farthest sink in the original graph, and 2) the number of links contained in the subgraph is smallest. The proposed algorithm tries to improve an initial solution generated by a heuristic scheme by repeatedly applying a local search. The result of simulations indicates that: 1) using a heuristic to generate an initial solution, the size of the initial solution is reduced by 10% compared with a simple shortest path tree; and 2) the local search reduces the size of the resultant subgraph by 20% and the cost required for such an improvement by the local search can be recovered by utilizing the resultant subgraph for a sufficiently long time such as a few days.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.20(2012) No.1 (online); DOI http://dx.doi.org/10.2197/ipsjjip.20.319; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: This paper proposes a distributed algorithm to calculate a subnetwork of a given wireless sensor network (WSN) connecting a set of sources and a set of sinks, in such a way that: 1) the length of one of the shortest paths connecting from a source to a sink in the subgraph does not exceed the distance from the source to the farthest sink in the original graph, and 2) the number of links contained in the subgraph is smallest. The proposed algorithm tries to improve an initial solution generated by a heuristic scheme by repeatedly applying a local search. The result of simulations indicates that: 1) using a heuristic to generate an initial solution, the size of the initial solution is reduced by 10% compared with a simple shortest path tree; and 2) the local search reduces the size of the resultant subgraph by 20% and the cost required for such an improvement by the local search can be recovered by utilizing the resultant subgraph for a sufficiently long time such as a few days.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.20(2012) No.1 (online); DOI http://dx.doi.org/10.2197/ipsjjip.20.319; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 52, 号 12, 発行日 2011-12-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764