检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京理工大学计算机学院,南京210094 [2]南京审计学院信息科学学院,南京210029
出 处:《系统仿真学报》2009年第19期6108-6113,6117,共7页Journal of System Simulation
基 金:江苏省自然科学基金(BK2007593;07KJB520052)
摘 要:无线AdHoc网中,公平分配资源和最大化利用资源本质上是冲突的,这对资源分配算法的设计带来了挑战。在系统地分析AdHoc网络的信息流竞争特点的基础上,引入价格作为资源分配的度量指标,通过路由发现时的价格查询以及路由响应时的价格反馈,消除分布式预测带来的不一致性,构建了一种新的基于价格的无线AdHoc网络资源分配算法,对资源分配进行了仿真实验。仿真结果表明:改进的资源分配算法具有良好的收敛性,与现有的资源分配算法相比提高了资源利用率。In wireless ad hoc networks fair distribution of resource and maximization of resource utilization are in conflict in nature, which brings a great challenge for designing resource allocation algorithms. With the analysis of the contest characteristics of ad hoc network information flow, price was introduced to measure resource allocation. Price query was done with the route discovery and price feedback was done with the route reply. It can eliminate the inconsistency of distributed prediction. Then a new price-based resource allocation algorithm of wireless ad hoc networks was proposed. Contrast simulations were done to test resource allocation. The simulation results show that it has good convergence and it improves the resource utility compared to other algorithms.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171