| 大会名称 |
|---|
| 2009年 情報科学技術フォーラム(FIT) |
| 大会コ－ド |
| F |
| 開催年 |
| 2009 |
| 発行日 |
| 2009/8/20 |
| セッション番号 |
| 1S |
| セッション名 |
| アドホックネットワーク |
| 講演日 |
| 2009/09/02 |
| 講演場所(会議室等) |
| S会場（5号館4F 541教室） |
| 講演番号 |
| M-060 |
| タイトル |
| モバイル・アドホック・ネットワークにおけるクラスタ接続法による転送量の比較評価 |
| 著者名 |
| 岸田 健太郎, 笹間 俊彦, 川村 尚生, 菅原 一孔, 増山 博, |
| キーワード |
| Mobile Ad Hoc Network, MANET, routing, packet transmission |
| 抄録 |
| A mobile ad hoc network is a network of mobile nodes without any notion of centralized administration. In such a network, each node behaves as not only a host which runs applications but also as a router to forward packets on behalf of others. Clustering is one of the most important approaches to energy/cost efficient communications. It is an algorithm in which the network is divided into non-overlapping subnetworks, referred to as clusters where every node of each subnetwork is at the most k-hops from a distinguished station called cluster-head. A cluster-head (CH) network expresses the connected relation among cluster-heads. A one-to-one route can be determined after flooding on the CH-network. The method of construction of the CH-network is characterized by the calculating the amount of area to construct; the largest 2k+1 hops-, the middle 2.5 hops-, and the smallest A-NCR-methods. The A-NCR method is the most cost-effective for construction of the CH-network because it uses the smallest computing area. Since a path find through the smallest area creates the possibility of finding a longer path, this subsequently may lead to a higher running cost, which places receiving the data transmission in real circumstances at a disadvantage. This paper evaluates how the running costs vary for the transmission on each routing path, as found by the above three methods. It also makes clarifies how the differences of order-of-time complexities are under several times among these methods. |
| 本文pdf |
| PDF download (384.7KB) |