检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]同济大学计算机科学及技术系
出 处:《计算机工程与应用》2007年第5期211-214,共4页Computer Engineering and Applications
基 金:国家自然科学基金(the National Natural Science Foundation of China under Grant No.60173026);教育部科研重点项目(the Research Project of MOE of China under Grant No.105071);上海高校网格技术E-研究院资助(200301- 1)
摘 要:无线基站、公共设施等的选址问题是关系到其能否发挥到最大效用的问题,在无线通讯、城市规划等领域十分重要。论文利用地图划分理论,充分考虑选址时应注意的覆盖城市路口点数、覆盖城市范围和城市密度梯度等因素,给出一种实用的基于地图划分的选址方法和算法实现。论文以无线基站选址为背景,阐明该算法在满足基站选址的必要条件和可选条件下,采用自适应分治地图的策略,求出无线基站在地图上的分布情况,从而达到有效指导选址的目的。算法思想主体包括三步:分治地图,考察约束条件,以及选址。论文利用上海城市电子地图进行了算法实验,取得较好的效果。The problem to locate wireless base stations and public establishments relates to how to make the best use of effectiveness,which is very important in the field of wireless communication engineering and city planning.This paper refers to the theories of graph partitioning,considering the number of covered vertex,the number of covered ranges and the gradient of density. At last,this paper presents a practical algorithm framework to solve the problem based on map partitioning.This paper takes the location problem of wireless base stations as a background.When considering the necessary conditions and optional conditions,this algorithm framework adopts the strategy of self adaptive divide-and-conquer,shows the allocations of base stations on maps,and achieves the objective to instruct construction efficiently.Our algorithm works as three steps:divide and conquer maps,check restraint conditions,and select locations.We do some experiments on Shanghai's traffic map,and achieve good results.
分 类 号:TN915[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.17.175