文件名称:1-s2.0-S1389128609002217-main
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
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