Dynamic RFID Network Optimization Using a Self-adaptive Bacterial Foraging Algorithm
文献类型：期刊论文
| 作者 | Chen HN(陈瀚宁); Zhu YL(朱云龙) ; Hu KY(胡琨元); Ku T(库涛)
|
| 刊名 | International Journal of Artificial Intelligence
 |
| 出版日期 | 2011 |
| 卷号 | 7期号:A11页码:219-231 |
| 关键词 | Dynamic RFID Network Optimization reader collision tag coverage BFO SABFO |
| ISSN号 | 0974-0635 |
| 产权排序 | 1 |
| 中文摘要 | Due to the low cost and simple deployment, radio frequency identification (RFID) systems are used in a variety of applications to uniquely identify physical objects. However, a number of critical design issues relating to dynamic determination of the optimal placement of RFID readers remain unresolved. In this paper, we address two important problems associated with reader location in RFID networks: (i) reader collision avoidance; (ii) optimal tag coverage. This paper, therefore, aims to use a successful swarm intelligence technique called self-adaptive bacterial foraging optimization (SABFO) to optimize both the reader-to-reader interference and tag coverage problems in RFID networks. The optimization results are also compared with the classical bacterial foraging optimization (BFO) algorithm. Numerical results for a RFID network case with ten readers have been presented to demonstrate the performance of the SABFO algorithm. |
| 语种 | 英语 |
| 公开日期 | 2012-05-29 |
| 源URL | [http://ir.sia.cn/handle/173321/7078]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室 |
| 推荐引用方式 GB/T 7714 | Chen HN,Zhu YL,Hu KY,et al. Dynamic RFID Network Optimization Using a Self-adaptive Bacterial Foraging Algorithm[J]. International Journal of Artificial Intelligence,2011,7(A11):219-231. |
| APA | Chen HN,Zhu YL,Hu KY,&Ku T.(2011).Dynamic RFID Network Optimization Using a Self-adaptive Bacterial Foraging Algorithm.International Journal of Artificial Intelligence,7(A11),219-231. |
| MLA | Chen HN,et al."Dynamic RFID Network Optimization Using a Self-adaptive Bacterial Foraging Algorithm".International Journal of Artificial Intelligence 7.A11(2011):219-231. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。