数据加载中.....
|
jsp.display-item.identifier=請使用永久網址來引用或連結此文件:
https://irlib.pccu.edu.tw/handle/987654321/24131
|
| 题名: | Adaptive collision resolution for efficient RFID tag identification |
| 作者: | Chen, YC (Chen, Yung-Chun)
Yeh, KH (Yeh, Kuo-Hui)
Lo, NW (Lo, NaiWei)
Li, YJ (Li, Yingjiu)
Winata, E (Winata, Enrico) |
| 贡献者: | Dept Informat Management |
| 关键词: | ANTICOLLISION
PROTOCOL
SYSTEMS
ALOHA
ARBITRATION
ALGORITHMS
CHANNELS |
| 日期: | 2011 |
| 上传时间: | 2013-01-31 14:59:08 (UTC+8) |
| 摘要: | In large-scale RFID systems, all of the communications between readers and tags are via a shared wireless channel. When a reader intends to collect all IDs from numerous existing tags, a tag identification process is invoked by the reader to collect the tags' IDs. This phenomenon results in tag-to-reader signal collisions which may suppress the system performance greatly. To solve this problem, we design an efficient tag identification protocol in which a significant gain is obtained in terms of both identification delay and communication overhead. A k-ary tree-based abstract is adopted in our proposed tag identification protocol as underlying architecture for collision resolution. Instead of just recognizing whether tag collision happens at each interrogation time period, the reader can further obtain the reason of why the collision occurs in the current tag inquiry operation. With this valuable information, we can reduce tag signal collisions significantly and at the same time avoid all of the tag idle scenarios during a tag identification session. The rigorous performance analysis and evaluation show that our proposed tag identification protocol outperforms existing tree-based schemes. |
| 關聯: | EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 文獻號碼: 139 |
| 显示于类别: | [資訊管理學系暨資訊管理研究所 ] 期刊論文
|
文件中的档案:
| 档案 |
描述 |
大小 | 格式 | 浏览次数 |
|---|
| index.html | | 0Kb | HTML | 577 | 检视/开启 |
|
在CCUR中所有的数据项都受到原著作权保护.
|
