Institutional Repository
| 超短波无线网络规划方法研究 | |
| Alternative Title | research on ultra-short wave wireless network planning method |
| 程权; 廖名学; 胡晓惠; 何晓新 | |
| 2013 | |
| Source | 计算机工程
 |
| ISSN | 1000-3428 |
| Volume | 39Issue:2Pages:61-66 |
| English Abstract | 为改进超短波无线网络的构建方式,研究在给定若干必要网络节点的条件下,增加机动节点构成最优网络的方法。为平衡网络的建设成本、可靠性和通信质量的关系,设计一个分层优化模型,并提出分层多目标优化近似算法求解该模型,根据目标函数的优先层次求得满足约束条件的近似最优解。仿真结果表明,该算法能找到与最优解近似甚至相同的解。与GLiD算法相比,其规划的网络成本更低,可靠性和通信质量更好。 |
| Indexed Type | CNKI ; WANFANG ; CSCD |
| Abstract | In order to improve the traditional way of ultra-short wave wireless network construction, this paper studies how to form the optimal network by adding mobile nodes to a group of necessary nodes. In order to achieve the balance of network construction cost, reliability and communication quality, it designs a hierarchical optimization model. To solve this model, it proposes a hierarchical multi-objective optimization approximation algorithm. According to the priority levels of objective functions, the algorithm can achieve the approximate optimal solution which meets constraints. Simulation results show that this algorithm can effectively achieve the approximate or even the same solution as the optimal solution. Compared with the GLiD algorithm, this algorithm can plan a better network with less construction cost, higher reliability and better communication quality. |
| Keyword | 超短波 无线网络规划 分层多目标优化 近似算法 贪心算法 动态规划 |
| Department | 中国科学院软件研究所天基综合信息系统重点实验室;中国科学院研究生院; |
| Subject | Computer Science (Provided By Thomson Reuters) |
| Language | 中文 |
| CSCD ID | CSCD:4763174 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15535 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 程权,廖名学,胡晓惠,等. 超短波无线网络规划方法研究[J]. 计算机工程,2013,39(2):61-66. |
| APA | 程权,廖名学,胡晓惠,&何晓新.(2013).超短波无线网络规划方法研究.计算机工程,39(2),61-66. |
| MLA | 程权,et al."超短波无线网络规划方法研究".计算机工程 39.2(2013):61-66. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment