| 用自适应图着色算法解决RFID阅读器冲突问题 |
| |
| 引用本文： | 徐雪慧,李玲远,王正强,郑军.用自适应图着色算法解决RFID阅读器冲突问题[J].现代电子技术,2006,29(9):27-29,33. |
| |
| 作者姓名： | 徐雪慧 李玲远 王正强 郑军 |
| |
| 作者单位： | 华中师范大学,湖北,武汉,430079 |
| |
| 摘 要： | 建立了阅读器网络的图模型,阐述了阅读器网络拓扑结构固定和可随机改变情况下对解决阅读器冲突问题的不同要求。对于动态阅读器网络应用中的阅读器冲突问题,基于图着色方法提出了一种自适应分布式的颜色选择算法,这种算法能降低相邻阅读器冲突概率,并且使获得特定百分率的成功传输所需的总时隙数最少。
|
| 关 键 词： | 阅读器网络 冲突问题 图着色 RFID |
| 文章编号： | 1004-373X（2006）09-027-03 |
| 收稿时间： | 2006-01-10 |
| 修稿时间： | 2006-01-10 |
An Adaptive Graph Coloring Algorithm for RFID Reader Collision Problem |
| |
| XU Xuehui,LI Lingyuan,WANG Zhengqiang,ZHENG Jun.An Adaptive Graph Coloring Algorithm for RFID Reader Collision Problem[J].Modern Electronic Technique,2006,29(9):27-29,33. |
| |
| Authors: | XU Xuehui LI Lingyuan WANG Zhengqiang ZHENG Jun |
| |
| Affiliation: | Central China Normal University,Wuhan,430079,China |
| |
| Abstract: | 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. |
| |
| Keywords: | reader network collision problem graph coloring RFID |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
