講演抄録/キーワード |
講演名 |
2011-12-15 13:40
A Stable Routing for Multi hop Cognitive Radio Mesh Networks ○Shamsad Parvin・Takeo Fujii(Univ. of Electro-Comm.) NS2011-127 RCS2011-240 |
抄録 |
(和) |
Routing is a challenging issue when dealing with multi-hop cognitive radio mesh networks (CRMNs). In this paper we consider the effect of the spectrum heterogeneity on the routing of CRMNs. We observe that a cognitive radio network topology and its connectivity are highly influenced by the behavior of the primary users. For this reason the conventional routing metric is not well suited for the cognitive radio networks. We present a new routing metric for the cognitive radio networks, which find a stable route towards the destination node. In the graph theory the second smallest Laplacian eigenvalue, represents the algebraic connectivity of the graph. We use the second smallest eigen value in the proposed routing metric to select a stable route. This provides a unique metric that captures network connectivity, path length and activity of primary users. Our goal is to maximize the secondary network throughput by choosing the stable route between the source and the destination. We study the performances of the proposed routing scheme in terms of secondary throughput and end to end delay. It shows that the proposed routing scheme enhances the network throughput and reduces the end-to-end delay compared to the conventional routing scheme with hop-count routing metric. |
(英) |
Routing is a challenging issue when dealing with multi-hop cognitive radio mesh networks (CRMNs). In this paper we consider the effect of the spectrum heterogeneity on the routing of CRMNs. We observe that a cognitive radio network topology and its connectivity are highly influenced by the behavior of the primary users. For this reason the conventional routing metric is not well suited for the cognitive radio networks. We present a new routing metric for the cognitive radio networks, which find a stable route towards the destination node. In the graph theory the second smallest Laplacian eigenvalue, represents the algebraic connectivity of the graph. We use the second smallest eigen value in the proposed routing metric to select a stable route. This provides a unique metric that captures network connectivity, path length and activity of primary users. Our goal is to maximize the secondary network throughput by choosing the stable route between the source and the destination. We study the performances of the proposed routing scheme in terms of secondary throughput and end to end delay. It shows that the proposed routing scheme enhances the network throughput and reduces the end-to-end delay compared to the conventional routing scheme with hop-count routing metric. |
キーワード |
(和) |
Cognitive Radio / Primary exposed node / Primary Hidden node / Routing metric / Secondary user / Multi hop cognitive radio mesh network / Throughput / primary user |
(英) |
Cognitive Radio / Primary exposed node / Primary Hidden node / Routing metric / Secondary user / Multi hop cognitive radio mesh network / Throughput / primary user |
文献情報 |
信学技報, vol. 111, no. 345, RCS2011-240, pp. 45-50, 2011年12月. |
資料番号 |
RCS2011-240 |
発行日 |
2011-12-08 (NS, RCS) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
NS2011-127 RCS2011-240 |
|