摘要
为了均衡节点能耗、提高路由性能,提出了一种基于层次分析法的自适应路由算法。该算法借鉴建立梯度引导路由和分簇的思想,引入层次分析法建模以确定权值,利用若干权重因子的组合(该组合综合地反映了网络的当前状态)来选取簇头并形成簇;针对由每轮的簇头和Sink构建的当前轮虚拟骨干网络建立路由。理论分析和仿真实验表明,该算法支持低功率传感器,比基于周期性分簇的LEACH(low-energy adaptive clustering hierarchy)更节能,从而更有效地均衡节点能耗、延长网络生命周期。
For the sake of balancing energy expenditure of sensor nodes and improving the performance of routing, a self-adaptive routing algorithm based on analytic hierarchy process（AHP） is proposed. The new algorithm induces AHP to cluster self-adaptively, i.e. it selects cluster-heads by considering the working order synthetically instead of periodically. And then it makes virtual backbone network by clusters and sinks. Furthermore data is forwarded via routes built among virtual backbone networks instead of being sent directly to Sinks which may be faraway. Theoretic analysis and simulation results prove it＇s more effective than LEACH, which supports lower-class sensors and can balance the energy expenditure.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第18期139-142,共4页
Computer Engineering
关键词
传感器网络
层次分析法
自适应
路由
能耗
sensor networks
AHP
self-adaptive
routing
energy expenditure
