Construction methods of an autonomous-distributed network on a geographical space according to population
| Project/Area Number |
21500072
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Computer system/Network
|
|---|
| Research Institution | Japan Advanced Institute of Science and Technology |
|---|
Principal Investigator |
HAYASHI Yukio 北陸先端科学技術大学院大学, 知識科学研究科, 准教授 (70293397)
|
|---|
| Project Period (FY) |
2009 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2012: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2010: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2009: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Keywords | 人口分布 / ネットワーク科学 / 自己組織化 / ルーティング / トラフィック特性 / 再帰分割 / ショートカット / 淘汰 / 地理的空間 / フラクタル階層 / マルコフ連鎖 / Scale-Free / Zero Range Process / 最大負荷 / フラクタル次元 / 自己相似 / 平均パス長 |
|---|
| Research Abstract |
We have proposed construction methods of geographical networks based on recursive divisions of faces or link survivals, in which positions of nodes as base-stations are adaptive to scalably increasing request on future wide-area communication according to population. From theoretical analyses and computer simulations, we show that the proposed network models are efficient in the decentralized routings on short paths and robust in the connectivity against node removals of random failures and intentional attacks. In addition, we find several strategies to avoid traffic congestion and to improve the robustness by adding shortcuts.
|
Report
(5 results)
Research Products
(73 results)
