2015 Fiscal Year Annual Research Report
Time-Space trade-off algorithms for sensor networks
Publicly Offered Research
| Project Area | A multifaceted approach toward understanding the limitations of computation |
|---|
| Project/Area Number |
15H00855
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
Korman Matias 東北大学, 情報科学研究科, 助教 (80732718)
|
|---|
| Project Period (FY) |
2015-04-01 – 2017-03-31
|
| Keywords | Computer Science / Time-Space Trade-off / Memory Constrained / Simple Polygons / Sensor Networks |
|---|
| Outline of Annual Research Achievements |
The project is well underway. Several interesting results have been found and submitted for publication (or are currently being written). Among other results we highlight the following results.
Computing extremal regions. Given a bounded region, the center is point whose furthest away point is as close as possible. Such a point is desirable for the potential location of a facility (say, a battery filling station), since no sensor will be located far from it. We introducing the fastest possible algorithms for computing the center in a simple polygon, while at the same time introducing new tools for otehr interesting problems. This research was published in the proceedings of the prestigious SoCG conference. Dynamic Graph coloring: graph coloring is one of the most fundamental tools for graphs. In this case, we studied a dynamic setting in which vertices can appear and disappear. This is particularly useful for the case in which each node represents a sensor, and thus appeareance/disappeareance often happens. This is the first work on the topic. The results of this research have been submitted to the prestigious ICALP conference. Routing in ad-hoc networks: another important problem when dealing with sensor networks is the efficient transmission of messages. In this work we show how can we transmit a message usign only local information without any knowledge of the whole network. The results of this research are currently being written
|
| Current Status of Research Progress |
Current Status of Research Progress
1: Research has progressed more than it was originally planned.
Reason
We have progressed in many problems, some of which were scheduled for 2017.
In addition, we have already started implementing some of the algorithms for its experimentation. This implementation was expected for the year 2017, but the main core of it is already done. This will allow us to focus the remainder of the year in making a better battery of tests and hopefully apply this to real data (instead of synthetic one as claimed in the project)
|
| Strategy for Future Research Activity |
In the second year we want to consider other memory constrained trade-offs. Computing the Voronoi diagram, triangulations, or shortest paths are the main priority. Those problems are important since they are always used as stepping stones for other problems. Special emphasys will be done in generalizing their approaches to other structures, thus obtaining a general trade-off.
In addition, we will further pursue the implementation of existing results. We want to discuss the topic with some partners in industry to see if we can use their data for obtaining more realistic results
|
-
[Journal Article] Minimum dual diameter triangulations.2016
Author(s)
M. Korman, S. Langerman, W. Mulzer, A. Pilz, and B. Vogtenhuber.
-
Journal Title
Computational Geometry: Theory and Applications (in press)
Volume: 1
Pages: in press
Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
-
-
-
-
-
-
-
-
-
-
-
-
-
-
