| Ad Hoc网络中最大最小公平性算法的改进 |
| |
| 引用本文： | 刘景景,许宗泽.Ad Hoc网络中最大最小公平性算法的改进[J].太原大学学报,2009,10(2):133-135. |
| |
| 作者姓名： | 刘景景 许宗泽 |
| |
| 作者单位： | 1. 南京航空航天大学信息与科学技术学院,江苏南京210016;池州学院物理系,安徽池州247000
2. 南京航空航天大学信息与科学技术学院,江苏南京,210016 |
| |
| 摘 要： | Ad Hoc网络的信道资源非常有限，且相邻节点之间竞争网络资源，公平有效的分配带宽成为Ad Hoc网络的重要研究方向。本文在已有的最大最小公平算法基础上，采用加权的最大群算法，并利用节点的代价值作为权值进行调节，保证了带宽的公平分配，而且有效的提高了网络资源的利用率。
|
| 关 键 词： | 最大群 权值 节点代价 最大最小公平 吞吐量 |
The Improvment of Max-min Fair Algorithm in Ad Hoc Network |
| |
| LIU Jing-jing,XU Zong-ze.The Improvment of Max-min Fair Algorithm in Ad Hoc Network[J].Journal of Taiyuan University,2009,10(2):133-135. |
| |
| Authors: | LIU Jing-jing XU Zong-ze |
| |
| Institution: | 1. Institute of information science and technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China; 2. Department of Physics, Chizhou College, Chizhou 247000, China) |
| |
| Abstract: | Ad Hoc network＇s channel resources is very limited, and the neighboring nodes of network compete channel resources, how to allocate bandwidth fairly and efficiently in Ad Hoc network becomes very important. This article use weighted max-clique algorithm, basing on the existent max-rain fair algorithm, and use the value of the node＇s price-value as the weight to regulate the bandwidth. The improved algorithm not only ensure the fair distribution of bandwidth, but also enhance the utilization of network resources effectively. |
| |
| Keywords: | max-clique weight price-value rnax-min fair throughput |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
