Challenging Research to Kinetic Adhoc Network Design
| Project/Area Number |
24650001
|
|---|
| Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2012-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | アルゴリズム / 計算幾何学 / アドホックネットワーク / 動力学的構造 / キネティックデータ構造 |
|---|
| Outline of Final Research Achievements |
In this project, we aimed at realizing theoretical framework of new adhoc network design based on theoretical methodology of kinetic control of moving objects. The grand challenge is its contribution to the network design in the future smart society.
During the research period, we gave theoretical investigation of kinetic design of geometric routing and interference minimization, and proposed network construction with practical model that has robust theoretical guarantee under several integrated conditions. The research results have been published in seven papers in international journals and refereed international conferences. We also pursued several international collaborations, and this sprout research has been continued to a more large-scale international joint research to aim at our grand challenge.
|
Report
(5 results)
Research Products
(16 results)
-
-
-
-
[Journal Article] Order-preserving matching2014
Author(s)
Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
-
Journal Title
Theoretical Computer Science
Volume: 525
Pages: 69-79
DOI
Related Report
Peer Reviewed / Acknowledgement Compliant
-
-
-
-
-
-
-
-
-
-
-
-
