|
|
|
留学生の方
(For International Students) |
|
|
|
|
|
|
|
|
|
|
|
|
Almost Delaunay Triangulation Routing for Energy Efficient Wireless Sensor Networks(エネルギー効率の良い無線センサーネットワークのための近似ドロネー三角形分割経路法) |
ハイダー モハッマド バルルー
(指導教員:杉原 厚吉 教授/数理情報第5研究室)
The wireless sensor network is a new and promising style of sensing
data from various kinds of environments, and hence is one of the most
important research areas with many practical applications such as
pollution monitoring, wildlife tracking, traffic monitoring etc. In
particular, energy efficiency is the most important aspect in wireless
sensor networks. Energy consumption could be reduced by an efficient
routing topology of the sensor network. Further energy consumption
could be reduced by taking localized routing decision. In this paper,
we propose an energy efficient rouging for wireless sensor networks
called almost Delaunay triangulation routing approach, which meets
both the energy efficiency and localized routing criteria. The
architecture of the routing tree will be dynamic even though the
underlying graph is static and calculated only once. Experimental
results show that the performance of the proposed approach is good for
uniform random distribution of the sensor nodes.
|
|
|