• 検索結果がありません。

WMN の制御通信の削減を目的とした経路制御手法の改良 要旨

N/A
N/A
Protected

Academic year: 2021

シェア "WMN の制御通信の削減を目的とした経路制御手法の改良 要旨"

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

要 旨

WMN

の制御通信の削減を目的とした 経路制御手法の改良

矢野進也

本研究グループでは、無線メッシュネットワークの制御パケットの削減を目的とした経路 制御手法であるMBCRを提案し、研究してきた。MBCRでは独自の仮想アドレス情報を 生成することでネットワークに参加する。その仮想アドレスに必要な情報は隣接するノード のみで収集することができ、宛先への送信を行う場合も自ノードと隣接ノード、宛先ノード の仮想アドレスだけでパケットの経由が可能である。しかし、現在のMBCRでは宛先ノー ドの仮想アドレスの取得方法が確立されていない。本研究では宛先仮想アドレスの取得方法 の確立を行う。

キーワード 無線メッシュネットワーク, MBCR(Multiple Branch Collection Routing)

i

(2)

Abstract

Improvement of WMNs routing method for the purpose of reduction of control communications

Shinya YANO

Our research group have proposed MBCR that is WMNs routing method for the purpose of reduction of control communications. In MBCR, to participate in the net- work by generating its own virtual address. The information required for the virtual address can be collected only on the adjacent nodes. At the time of transmission to the destination, to determine via node based on only the virtual address of Own node and the adjacent node, the destination node. But, it is not established method of ob- taining the destination node virtual address. It establishes a method for acquiring the destination node virtual address in this research.

key words WMN(Wireless Mesh Network), MBCR

ii

参照

関連したドキュメント

Comparing the Gauss-Jordan-based algorithm and the algorithm presented in [5], which is based on the LU factorization of the Laplacian matrix, we note that despite the fact that

We proposed an additive Schwarz method based on an overlapping domain decomposition for total variation minimization.. Contrary to the existing work [10], we showed that our method

IDLE 、 STOP1 、 STOP2 モードを解除可能な割り込みは、 INTIF を経由し INTIF 内の割り. 込み制御レジスター A で制御され CPU へ通知されます。

Answering a question of de la Harpe and Bridson in the Kourovka Notebook, we build the explicit embeddings of the additive group of rational numbers Q in a finitely generated group

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

Definition An embeddable tiled surface is a tiled surface which is actually achieved as the graph of singular leaves of some embedded orientable surface with closed braid

It is known that quasi-continuity implies somewhat continuity but there exist somewhat continuous functions which are not quasi-continuous [4].. Thus from Theorem 1 it follows that

But in fact we can very quickly bound the axial elbows by the simple center-line method and so, in the vanilla algorithm, we will work only with upper bounds on the axial elbows..