文件名称:Gateway_Placement_Optimization_in_Wireless
- 所属分类：
- Internet/网络编程
- 资源属性：
- [MacOS] [PDF]
- 上传时间：
- 2012-11-26
- 文件大小：
- 235kb
- 下载次数：
- 0次
- 提 供 者：
- Dinh Hu*******
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
In a Wireless Mesh Network (WMN), the traffic is
aggregated and forwarded towards the gateways. Strategically
placing and connecting the gateways to the wired backbone is
critical to the management and efficient operation of a WMN.
In this paper, we address the problem of gateways placement,
consisting in placing a minimum number of gateways such that
QoS requirements are satisfied. We propose a polynomial time
near-optimal algorithm which recursively computes minimum
weighted Dominating Sets (DS), while consistently preserving
QoS requirements across iterations. We evaluate the
performance of our algorithm using both analysis and
simulation, and show that it outperforms other alternative
schemes by comparing the number of gateways placed in
different scenarios. -In a Wireless Mesh Network (WMN), the traffic is
aggregated and forwarded towards the gateways. Strategically
placing and connecting the gateways to the wired backbone is
critical to the management and efficient operation of a WMN.
In this paper, we address the problem of gateways placement,
consisting in placing a minimum number of gateways such that
QoS requirements are satisfied. We propose a polynomial time
near-optimal algorithm which recursively computes minimum
weighted Dominating Sets (DS), while consistently preserving
QoS requirements across iterations. We evaluate the
performance of our algorithm using both analysis and
simulation, and show that it outperforms other alternative
schemes by comparing the number of gateways placed in
different scenarios.
aggregated and forwarded towards the gateways. Strategically
placing and connecting the gateways to the wired backbone is
critical to the management and efficient operation of a WMN.
In this paper, we address the problem of gateways placement,
consisting in placing a minimum number of gateways such that
QoS requirements are satisfied. We propose a polynomial time
near-optimal algorithm which recursively computes minimum
weighted Dominating Sets (DS), while consistently preserving
QoS requirements across iterations. We evaluate the
performance of our algorithm using both analysis and
simulation, and show that it outperforms other alternative
schemes by comparing the number of gateways placed in
different scenarios. -In a Wireless Mesh Network (WMN), the traffic is
aggregated and forwarded towards the gateways. Strategically
placing and connecting the gateways to the wired backbone is
critical to the management and efficient operation of a WMN.
In this paper, we address the problem of gateways placement,
consisting in placing a minimum number of gateways such that
QoS requirements are satisfied. We propose a polynomial time
near-optimal algorithm which recursively computes minimum
weighted Dominating Sets (DS), while consistently preserving
QoS requirements across iterations. We evaluate the
performance of our algorithm using both analysis and
simulation, and show that it outperforms other alternative
schemes by comparing the number of gateways placed in
different scenarios.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Gateway_Placement_Optimization_in_Wireless.pdf