| 一种基于Ad hoc网络的分布式公平调度算法 |
| |
| 引用本文： | 万润泽,朱彦松,刘河,罗飞.一种基于Ad hoc网络的分布式公平调度算法[J].电子测量技术,2007,30(4):159-161,205. |
| |
| 作者姓名： | 万润泽 朱彦松 刘河 罗飞 |
| |
| 作者单位： | 1. 华中师范大学计算机科学系,武汉,430079
2. 中原工学院计算机科学系,郑州,450007 |
| |
| 摘 要： | 针对Ad hoc网络拓扑结构的分布式特征和各节点之间数据发送时容易因广播消息产生的冲突,本文提出了一种改进的、在互不干扰前提下能发送数据包的节点最大匹配集合的算法.该算法具有分布式、自组织的特点,网络中的各节点通过很小的代价就可实现某个时间片内不冲突域的形成.通过实验验证,该算法具备低复杂性、最大最小公平性特点,同时能更好地利用网络带宽资源和对网络中所有节点之间的公平提供更好的保障.
|
| 关 键 词： | 最大匹配集 公平性 Ad hoc网络 |
Distributed fair scheduling algorithm in Ad hoc network |
| |
| Wan Runze,Zhu Yansong,Liu He,Luo Fei.Distributed fair scheduling algorithm in Ad hoc network[J].Electronic Measurement Technology,2007,30(4):159-161,205. |
| |
| Authors: | Wan Runze Zhu Yansong Liu He Luo Fei |
| |
| Affiliation: | 1. Department of Computer Science, Huazhong Normal University,Wuhan 430079; 2. Department of Computer Science, Zhongyuan Institute of Technology, Zhengzhou 450007 |
| |
| Abstract: | It proposed an improved maximum matching set algorithm based on the distributed scheduling and interferences between the nodes in Ad hoc network.This algorithm is distributed and self-organized,each nodes of the network can construct the contention-free domain in each time slots.From the simulation results,we evaluate the low-complexity,max-min fairness and high capacity efficiency in the network environment. |
| |
| Keywords: | RTW maximum matching set fairness Ad hoc network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
