并行图染色的无线网状网络媒体接入控制  

A Medium Access Control Algorithm Based on Parallel Graph Coloring for Wireless Mesh Networks

作　　者：张学聃[1] 洪珺[1] 张林[1] 李安国[1] 山秀明[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《北京邮电大学学报》2007年第6期36-39,50,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(60672107);国家"863计划"项目(10Z2);国家"973计划"项目(2007CB307105)

摘　　要：将无线网状网络(WMNs)的传输调度建模为冲突图染色问题,提出了一种新颖的基于并行图染色的分布式时分多址(TDMA)媒体接入控制算法.该算法充分利用无线路由器和无线骨干网的自身优势,只需依靠网络的局部拓扑和负载信息,对无线接入网的传输调度实现全局优化.仿真结果表明,所提算法性能十分接近最优调度,并且通信开销成本非常低.The transmission scheduling of wireless mesh networks （WMNs） is modeled as a problem of conflict graph coloring. A new distributed time division multiple access（TDMA） medium access control algorithm based on parallel graph coloring is proposed. The algorithm utilizes the advantages of mesh touters and backbone networks, and only depends on local topology and traffic load information. Simulation demonstrates that the proposed scheme achieves significant throughput enhancement approaching optimal scheduling in WMNs, and enjoys very low communication overhead.

关 键 词：无线网状网络 媒体接入控制 并行图染色 分布式调度算法 

分 类 号：TN915.04[电子电信—通信与信息系统]