期刊文献+

有矩形障碍物的物流射频识别网络优化研究 被引量:1

On the optimization of logistics radio frequency identification network with rectangular obstacles
在线阅读 下载PDF
导出
摘要 针对存在矩形障碍物的物流射频识别网络,综合考虑覆盖率、负载平衡程度、成本,建立了网络优化模型.将矩形障碍物对阅读器识别能力的影响问题,归结为线段与矩形对角线的交叉问题.讨论了快速排斥实验对判断是否交叉的影响程度.为减少计算量,提高算法寻优能力,基于Sigmoid函数设计了"跨立实验"执行概率.迭代前期,"跨立实验"执行概率低,加快算法探索速度;迭代后期,"跨立实验"执行概率高,提高算法开发精度.仿真实验表明,该方法具有较佳的搜索性能. By comprehensively considering the coverage rate, load balance and the cost, we build a network optimization model for the logistics radio frequency identification (RFID)-based network with rectangular obstacle. The effect from the rectangular obstacle on the identification ability of readers is attributed to the intersection problem of the line segment and the rectangular diagonal, and the impact from the quick rejection test on the determination of intersection is discussed. To reduce the computational complexity and improve the search capability, we introduce the straddle test and design its execution probability based on the sigmoid function. In the prophase of the iterative process, the execution probability of straddle test is set to a low value for accelerating the exploration speed. In the anaphase, the execution probability of straddle test is set to a high value for improving the exploitation precision. Simulation results show that the proposed method can achieve better searching ability.
出处 《控制理论与应用》 EI CAS CSCD 北大核心 2014年第1期49-56,共8页 Control Theory & Applications
基金 国家自然科学基金资助项目(51279099) 上海市科学技术委员会基金资助项目(12ZR1412500) 上海市教委科研创新基金重点项目资助(13ZZ124) 上海市教育委员会和上海市教育发展基金会"曙光计划"基金资助项目(12SG40) 交通运输部应用基础研究资助项目(2013329810300)
关键词 矩形障碍物 射频识别 网络优化 跨立实验 执行概率 rectangular obstacle radio frequency identification (RFID) network optimization straddle test executionprobability
  • 相关文献

参考文献10

  • 1GIAMPAOLO E D, FORNI E MARROCCO G. RFID-network plan- ning by particle swarm optimization [C] //Proceedings of the 4th Eu- ropean Conference on Antennas and Propagation. New York: IEEE, 2010:1 - 5.
  • 2刘微,陈贺新,陈瀚宁,陈绵书.改进的PSO算法在RFID网络调度中的应用[J].吉林大学学报(信息科学版),2011,29(2):121-127. 被引量:6
  • 3刘快,沈艳霞,纪志成.基于改进粒子群算法的RFID网络系统的优化[J].中南大学学报(自然科学版),2011,42(1):900-904.
  • 4GONG Y J, SHEN M, ZHANG J, et al. Optimizing RFID network planning by using a particle swarm optimization algorithm with re- dundant reader elimination [J]. IEEE Transactions on Industrial ln- formatics, 2012, 8(4): 900- 912.
  • 5刘快,纪志成.基于混合粒子群的RFID网络的优化部署[J].计算机应用研究,2012,29(4):1326-1328. 被引量:11
  • 6CHIH Y C, CHAO T C, YU C C, et al. An obstacle-free and power- efficient deployment algorithm for wireless sensor networks [J]. IEEE Transactions on Vehicular Technology, 2009, 58(6): 2925 - 2941.
  • 7HEXSEL B, CHAKRABORTY N, SYCARA K. Coverage control for mobile anisotropic sensor networks [C]//2011 IEEE International Conference on Robotics and Automation. New York: IEEE, 2011: 2878 - 2885.
  • 8CARMELO C, VALERIA L, ENRICO N, et al. Nodes self- deployment for coverage maximization in mobile robot networks using an evolving neural network [J]. Computer Communications, 2012, 35(9): 1047 - 1055.
  • 9RAHMAN F. Towards secure and scalable tag search approaches for current and next generation RFID systems [D]. Milwaukee, Wis- consin: Marquette University, 2010:76 - 79.
  • 10GILL H S, LEMIEUX C L. Searching for extensible Korobov rules [J]. Journal of Complexity, 2007, 23(4/6): 603 - 613.

二级参考文献25

  • 1CLERC M. Binary Particle Swarm Optimizers: Toolbox, Derivations, and Mathematical Insights [ EB/OL ]. [ 2010-05 ]. [2005-02]. http: //clerc. maurice, free. fr/pso.
  • 2LIANG J J, SUGANTHAN P N, DED K. Novel Composition Test Functions for Numerical Global Optimization [ C/OL] ,// Proceeding of the 2005 Swarm Intelligence Symposium2005 : 68-75 [ 2101-09 ]. http : // ieeexplore, ieee. ory/xpls/absall. jsp? arnumber = 1501604.
  • 3CHEN Han-ning, ZHU Yun-long, HU Kun-yuan. A Novel Adaptive Bacterial Foraging Algorithm [ C]//Proc of the ISKE 2008. Xiamen, China: [s. n. ], 2008:1-5.
  • 4CHEN Han-ning, ZHU Yun-long, HU Kun-yuan, et al. Application of a Multi-Species Optimizer in Ubiquitous Computing for RFID Networks Scheduling [ C] //Proceeding of the 3rd International Conference on Natural Computation. Hainan, China: [ s. n. ] , 2007: 420-425.
  • 5EBERCHART R C, KENNEDY J. A New Optimizer Using Particle Swarm Theory [ C ] ///Proceedings of the 6th International Svmoosium on Micromachine and Human Science. Nagoya, Japan: [ s. n. ], 1995: 5943.
  • 6KENNEDY J, EBERCHART R C. Particle Swarm Optimization [ C ] //Proceedings of the IEEE International Conference on Neural Networks. Perth, Australia: [ s. n. ] , 1995: 1942-1945.
  • 7ELKAMCHOUCHI H M, ELRAGAL H M, MAKAR M A. Cellular Radio Network Planning Using Particle Swarm Optimiza- tion [C/OL] //Proceeding of the2007 Radio Science Conference. 2007:1-8[2010-09]. http: //ieeexpiore. ieee. org/ xpls/abs-all, jsp? arnumber =4234136tag = 1.
  • 8KARABOGA D, BASTURK B. On the Performance of Articial Bee Colony (ABC) Algorithm [ J ]. Applied Soft Computing, 2008, 8 (1): 687-697.
  • 9SHI Y, EBERHART R, EMPIRICAL C. Study of Particle Swarm Optimization [ C] ,//Proceeding of the World Multiconference on Syatemics Cybernetics and Informatics. Orlando, FL: [s. n. ] , 2000: 1995-1950.
  • 10CLERK M. Binary Particle Swarm Optimisers : Toolbox, Derivations, and Mathematical Insights [ EB/OL ]. [ 2010-05 ]. (2005-02-02). http: //clerc. maurice, free. fr/pso/.

共引文献15

同被引文献15

  • 1刘快,沈艳霞,纪志成.基于改进粒子群算法的RFID网络系统的优化[J].中南大学学报(自然科学版),2011,42(1):900-904.
  • 2DI GIAMPAOLO E, FORNI F, MARROCCO G. RFID-network planning by particle swarm optimization [C] //Proceedings of the Fourth European Conference on Antennas and Propagation. New York: IEEE, 2010:1 - 5.
  • 3YANG Y H, WU Y J, XIA M, et al. A RFID network planning method based on genetic algorithm [C] //2009 International Conference on Networks Security, Wireless Communications and Trusted Comput- ing. New York: IEEE, 2009, 1:534 - 537.
  • 4GONG Y J, SHEN M, ZHANG J, et al. Optimizing RFID network planning by using a particle swarm optimization algorithm with re- dundant reader elimination [J]. 1EEE Transactions on Industrial In- formatics, 2012, 8(4): 900 - 912.
  • 5YANG F, SUN X B, ZHAO C L, et al. The intelligent-water-drop based routing algorithm for MANET [C] //2010 International Con- ference on Future Information Technology Proceedings. New York: IEEE, 2010, 2:253 - 255.
  • 6KHUONG V, RONG Z. Robust coverage under uncertainty in wire- less sensor networks [C] //2011 International Conference on Com- puter Communications. New York: IEEE, 2011:2015 - 2023.
  • 7KHUONG V, RONG Z. Geometric algorithms for target localiza- tion and tracking under location uncertainties in wireless sensor net- works [C]//2012 International Conference on Computer Communi- cations. New York: IEEE, 2012:1835 - 1843.
  • 8LI S J, XU C E PAN W K, et al. Sensor deployment optimization for detecting maneuvering targets [C] //Proceedings of the 7th Inter- national Conference on Information Fusion. New York: IEEE, 2005: 1629- 1635.
  • 9CELAL O, DERVIS K, BEYZA G. Probabilistic dynamic deploy- ment of wireless sensor networks by artificial bee colony algo- rithm [J]. Sensors, 2011, 11(6): 6056 - 6065.
  • 10SHIRLEY P, CHIU K. A low distortion map between disk and square [J]. Journal of Graphics Tools, 1997, 2(3): 45 - 52.

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部