文件名称:[10]Minimum_cost_configuration_of_relay_and_chann
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:254.49kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Fixed broadband wireless access is a promising technology allowing
Internet service providers to expend their customer base in sparsely populated
rural areas. Because the size of the target service area is humongous, relay in-
frastructure is essential. Installing and maintaining this relay infrastructure is
the main cost associated with such networks. Thus, we develop an optimization
framework which computes the minimum number of relay stations and their cor-
responding channel confi gurations such that a pre-specifi ed subscribers’ traffi c
demand can be satisfi ed. Since the problem is a mixed-integer program, we pro-
pose an effi cient optimization algorithm to compute the optimal solution in a
reasonable amount of time. Our numerical results show that by using a few relay
stations in a rural community, broadband Internet access can be established in a
cost effective manner.
Internet service providers to expend their customer base in sparsely populated
rural areas. Because the size of the target service area is humongous, relay in-
frastructure is essential. Installing and maintaining this relay infrastructure is
the main cost associated with such networks. Thus, we develop an optimization
framework which computes the minimum number of relay stations and their cor-
responding channel confi gurations such that a pre-specifi ed subscribers’ traffi c
demand can be satisfi ed. Since the problem is a mixed-integer program, we pro-
pose an effi cient optimization algorithm to compute the optimal solution in a
reasonable amount of time. Our numerical results show that by using a few relay
stations in a rural community, broadband Internet access can be established in a
cost effective manner.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
[10]Minimum_cost_configuration_of_relay_and_channel__.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.