传感器网络中基于二元簇的节能路由算法  

An Energy Saving Routing Algorithm Based on Dual-membership Clusters in Sensor Network

作　　者：祝家钰[1] 唐红[1] 赵国锋[1] 

机构地区：[1]重庆邮电学院计算机网络与通信技术研究室,重庆400065

出　　处：《现代电子技术》2006年第8期36-38,共3页Modern Electronics Technique

摘　　要：传感器网络中的分簇算法已经被证明能够有效地节约能量。据此提出了一种基于二元簇的路由算法,其基本思想是网络中的每个节点同时属于2个不同簇,利用二元性来减少在路由发现中的资源浪费,并能够更加确定地发现路由以节约资源。理论分析和模拟实验都表明,该算法在能量消耗和网络生命周期延长方面较优。Clustering of sensor networks has proved to be very effective in conserving energy. In this paper a new algorithm based on dual- membership clusters is proposed. It＇s basic idea is each node has a primary membership to one cluster and a secondary membership to another. This duality is used to minimize wastage of resources duing route discovery,and makes route discovery more deterministic. Theoretic analysis and simulation results show the new algorithm performs much better in terms of energy consumption as well as network lifetime compared to the existing protocols.

关 键 词：无线传感器网络 二元簇 路由 能量损耗 

分 类 号：TP219.9[自动化与计算机技术—检测技术与自动化装置]