用自适应图着色算法解决RFID阅读器冲突问题  

An Adaptive Graph Coloring Algorithm for RFID Reader Collision Problem

作　　者：徐雪慧[1] 李玲远[1] 王正强[1] 郑军[1] 

机构地区：[1]华中师范大学,湖北武汉430079

出　　处：《现代电子技术》2006年第9期27-29,33,共4页Modern Electronics Technique

摘　　要：建立了阅读器网络的图模型,阐述了阅读器网络拓扑结构固定和可随机改变情况下对解决阅读器冲突问题的不同要求。对于动态阅读器网络应用中的阅读器冲突问题,基于图着色方法提出了一种自适应分布式的颜色选择算法,这种算法能降低相邻阅读器冲突概率,并且使获得特定百分率的成功传输所需的总时隙数最少。The article introduces the graph model of reader network, and formulates requirement of the solution to reader collision when topology of the reader network is fixable or variable randomly. To reader collision problem of a dynamic reader network,this article presents an adaptive distributed color selection algorithm based on graph coloring. This algorithm can decrease the probability of reader collision between neighbor readers. Furthermore, this algorithm can minimum the total number of timeslot for a certain percentage of successful transmission

关 键 词：阅读器网络 冲突问题 图着色 RFID 自适应图着色算法 

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