- psid_data8395 Matlab code for The Labor
- OpenglExt OpenGL根据扩展头文件自动生成扩展函数vc++代码
- FileRW 在 Android 中
- ethtool Intel(R) 82576 Virtual Function Linux driver.
- SASE 用Java实现输入事件流的模式匹配
- PATENT_pudn This patent named Relative positioning of balloons with altitude control and wind data was granted to google for its Loon Project (A communication network of balloons by Project Loon of Google). Project Loon is a research and development project being developed by Google with the mission of providing Internet access to rural and remote areas. The project uses high
文件名称:Gateway_Placement_Optimization_in_Wireless
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:235.33kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
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
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.