新的位置感知分簇算法  

New location aware clustering algorithm

作　　者：田炜[1] 杨震[2] 

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003 [2]南京邮电大学信号与信息处理研究院,江苏南京210003

出　　处：《通信学报》2010年第3期25-30,共6页Journal on Communications

基　　金：江苏省高校自然科学重大基础研究基金资助项目(06KJA51001);国家高技术研究发展计划("863"计划)基金资助项目(2009AA01Z241)~~

摘　　要：针对无线传感器网络能量有效性和可靠性问题,提出一种新的位置感知分簇算法(LACA,location aware clustering algorithm)。算法引入角度比和距离比2个感知参数,使节点通过其所在的位置自主地决定是否作为簇头,通过了NS2仿真验证。结果表明,与LEACH和GAF算法相比,LACA不仅提高了网络能量有效性,延长了网络寿命,而且有效地抑制了孤立节点的产生,确保了网络的可靠性。A new location aware clustering algorithm was proposed aiming at the problem of the energy efficiency and reliability in the wireless sensor networks .Using the two aware parameters of the angle ratio and distance ratio, the node makes itself to become the clustering head based on its location, which was verified by NS2 simulator. Simulation results demonstrate that the LACA not only can improve the energy efficiency and prolong the network lifetime, but also restrain the isolated nodes and guarantee the reliability effectively, compared with the LEACH and GAF.

关 键 词：无线传感器网络 分簇算法 位置感知 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]