業績データ詳細表示 
 Search this article in Google Scholar
分類  論文誌 
著者名 (author) 
XingPing He,Sayaka Kamei,Satoshi Fujita 
英文著者名 (author) 

キー (key) 

表題 (title) 
Autonomous MultiSource MultiSink Routing in Wireless Sensor Networks 
表題 (英文) 

定期刊行物名 (journal) 
Journal of Information Processing (JIP) 
定期刊行物名 (英文) 

巻数 (volume) 
20 
号数 (number) 
1 
ページ範囲 (pages) 
319326 
刊行月 (month) 
January 
出版年 (year) 
2012 
付加情報 (note) 
also in 情報処理学会論文誌 52(12), 20111215 
注釈 (annote) 

内容梗概 (abstract) 
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 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. 
論文電子ファイル  Not available. 
 [051] XingPing He, Sayaka Kamei, and Satoshi Fujita, ``Autonomous MultiSource MultiSink Routing in Wireless Sensor Networks,'' Journal of Information Processing (JIP), vol. 20, no. 1, pp. 319326, January 2012.
@article{0_51, author = {XingPing He and Sayaka Kamei and Satoshi Fujita}, author_e = {}, title = {Autonomous MultiSource MultiSink Routing in Wireless Sensor Networks}, title_e = {}, journal = {Journal of Information Processing (JIP)}, journal_e = {}, volume = {20}, number = {1}, pages = {319326}, month = {January}, year = {2012}, note = {also in 情報処理学会論文誌 52(12), 20111215}, annote = {} }
This site is maintained by Distributed System Laboratory. PMAN 2.5.5  Paper MANagement system / (C) 20022008, Osamu Mizuno / All rights reserved. 