文件名称:1-s2.0-S1389128609002217-main
-
所属分类:
- 标签属性:
- 上传时间:2014-12-23
-
文件大小:685.56kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks We consider the channel assignment problem in a multi-radio wireless mesh network that
involves assigning channels to radio interfaces for achieving efficient channel utilization.
We present a graph–theoretic formulation of the channel assignment guided by a novel
topology control perspective, and show that the resulting optimization problem is NP-complete.
We also present an ILP formulation that is used for obtaining a lower bound for the
optimum. We then develop a new greedy heuristic channel assignment algorithm (termed
CLICA) for finding connected, low interference topologies by utilizing multiple channels.
Our uations show that the proposed CLICA algorithm exhibits similar behavior and
comparable performance relative to the optimum bound with respect to interference
and capacity measures.-A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks We consider the channel assignment problem in a multi-radio wireless mesh network that
involves assigning channels to radio interfaces for achieving efficient channel utilization.
We present a graph–theoretic formulation of the channel assignment guided by a novel
topology control perspective, and show that the resulting optimization problem is NP-complete.
We also present an ILP formulation that is used for obtaining a lower bound for the
optimum. We then develop a new greedy heuristic channel assignment algorithm (termed
CLICA) for finding connected, low interference topologies by utilizing multiple channels.
Our uations show that the proposed CLICA algorithm exhibits similar behavior and
comparable performance relative to the optimum bound with respect to interference
and capacity measures.
involves assigning channels to radio interfaces for achieving efficient channel utilization.
We present a graph–theoretic formulation of the channel assignment guided by a novel
topology control perspective, and show that the resulting optimization problem is NP-complete.
We also present an ILP formulation that is used for obtaining a lower bound for the
optimum. We then develop a new greedy heuristic channel assignment algorithm (termed
CLICA) for finding connected, low interference topologies by utilizing multiple channels.
Our uations show that the proposed CLICA algorithm exhibits similar behavior and
comparable performance relative to the optimum bound with respect to interference
and capacity measures.-A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks We consider the channel assignment problem in a multi-radio wireless mesh network that
involves assigning channels to radio interfaces for achieving efficient channel utilization.
We present a graph–theoretic formulation of the channel assignment guided by a novel
topology control perspective, and show that the resulting optimization problem is NP-complete.
We also present an ILP formulation that is used for obtaining a lower bound for the
optimum. We then develop a new greedy heuristic channel assignment algorithm (termed
CLICA) for finding connected, low interference topologies by utilizing multiple channels.
Our uations show that the proposed CLICA algorithm exhibits similar behavior and
comparable performance relative to the optimum bound with respect to interference
and capacity measures.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1-s2.0-S1389128609002217-main.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.