期刊文献+

一种基于遗传算法的无线传感器网络定位新算法 被引量:16

New Positioning Algorithm for Wireless Sensor Network Ased on Genetic Algorithm
下载PDF
导出
摘要 针对无线传感器网络节点自身定位问题,提出一种基于遗传算法的新定位算法。该算法假设无线传感器网络中有一定比例的位置已知的节点,通过分析未知节点及其无线射程范围内的已知节点之间的通讯约束和几何关系,建立以未知节点位置为参数的优化设计数学模型,使用遗传算法求解此模型得出未知节点的位置,并通过修改遗传算法参数来提高遗传算法收敛速度。理论分析和试验结果表明,本算法具有很强的健壮性,未知节点的失效和新节点的加入不会影响算法的性能,并且算法定位精度高,条件简单,适合各种规模的无线传感器网络的节点定位。 This paper presents a new positioning algorithm based on Genetic Algorithm to estimate an unknown node position in a wireless sensor network. Given a limited fraction of nodes which' s positions are known, the optimal model, which sets the position of unknown node as its parameters, can be set up based on the communication restrict and geometrical relation between the unknown node and the anchor nodes which are in the radio range of the unknown node. The parameter of genetic algorithm is modified for has faster convergence speed and the solution is regarded as the estimate position of the unknown code. A theoretical analysis and simulation results show that, this algorithm is robust because neither the failure of old unknown nodes nor the addition of new unknown nodes influences the algorithm performance, the error of this algorithm is low, and its condition is simple so that suitable for all sizes of low- power wireless sensor networks.
出处 《计算技术与自动化》 2007年第4期53-56,共4页 Computing Technology and Automation
基金 国家杰出青年科学基金项目(60425310) 国家自然科学基金项目(60674044)
关键词 无线传感器网络 节点定位 遗传算法 算法性能 wireless sensor network nodes location genetic algorithm algorithm performance
  • 相关文献

参考文献6

  • 1B Warneke, M Last, B Liebowitz, K. S. J Pister. Smart dust: communieating with a cubic - millimeter computer [J]. IEEE Computer. Jan. 2001.2-9.
  • 2E Shih, S. H Cho, N Ickes, R Min, A Sinha, A Wang. Physical Layer Driven Protocol and Algorithm Design for Energy - Efficient Wireless Sensor Networks [ A]. In: Porcessing ACM MobiCom' 01 [c]. Rome, Italy, July 2001: 272-286.
  • 3D Niculescu, B Nath. DV based positioning in ad hoe networks[J]. Journal of Telecommuni - cation Systems, 2003, (22) : 267-280.
  • 4L. Doherty, K. S. J. Pister, L. E. Ghaoui. Convex-position estimation in wireless sensor networks. In: Proceedings of Twentieth Annual Joint USA[J]. Conference of the IEEE Computer and Communications Societies, Anchorage, AK, 2001, 3 (1): 1655-1663.
  • 5T He, C Huang, B. M Blum, J. A Stankovic, T Abdelzaher. Range -Free Localization Schemes in Large Scale Sensor Networks[C]. In: Processing 9th annual international conference on Mobile computing and networking, San Diego, Califomia, USA, ACM Press, 2003: 81-95.
  • 6潘伟,刁华宗,井元伟.一种改进的实数自适应遗传算法[J].控制与决策,2006,21(7):792-795. 被引量:53

二级参考文献10

  • 1张晓缋,方浩,戴冠中.遗传算法的编码机制研究[J].信息与控制,1997,26(2):134-139. 被引量:93
  • 2Bessaou M, Slarry P. A Genetic Algorithm with Realvalue Coding to Optimize Multimodal Continuous Functions[J]. Structure Multitask Optimization, 2001,23(1):63-74.
  • 3Blanco A, Delgado M, Pegalajar M C. A Real Coded Genetic Algorithm for Training Recurrent Neural Networks[J]. Neural Networks, 2001,14 (1) :93-105.
  • 4Baskar S, Subberaj P, Rao M V C. Hybrid Real Coded Genetic Algorithm Solution to Economic Dispatch Problem [J]. Computers and Electrical Engineering,2003,29(3):407-419.
  • 5Tsutsui S, Goldberg D E. Search Space Boundary Extension Method in Real Coded Genetic Algorithms[J]. Information Sciences, 2001,133(3) :229-247.
  • 6Goldberg D E. Real Coded Genetic Algorithms, Virtual Alphabets and Blocking[J]. Complex Systems, 1991,5(2):139-167.
  • 7Srinivas M, Patnaik L M. Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms [J].IEEE Trans on Systems, Man and Cybernetics, 1994,24(4) : 656-667.
  • 8Whitley D, Beveridge R, Graves C, et al. Test Driving Three Genetic Algorithms: New Test Functions and Geometric Matching [J].J of Heuristics, 1995, 1(1): 77-104.
  • 9侯格贤,吴成柯.遗传算法的性能分析[J].控制与决策,1999,14(3):257-260. 被引量:30
  • 10陈长征,王楠.遗传算法中交叉和变异概率选择的自适应方法及作用机理[J].控制理论与应用,2002,19(1):41-43. 被引量:81

共引文献52

同被引文献117

引证文献16

二级引证文献95

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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