###
DOI:
计算机系统应用英文版:2011,20(8):81-85
本文二维码信息
码上扫一扫!
一种事件驱动型无线传感器网络的分层路由算法
(浙江工业大学 计算机应用技术系,杭州 310023)
Hierarchical Routing Algorithm in Event-Driven Wireless Sensor Networks
(Department of Computer Application Technology, Zhejiang University of Technology, Hangzhou 31100, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1779次   下载 3427
Received:November 20, 2010    Revised:January 08, 2011
中文摘要: 为了降低无线传感器网络在突发事件监测系统中的能量消耗,延长网络生存周期,结合突发事件监测系统的特点,在TEEN协议的基础上进行改进,设计实现了一种基于事件驱动的分层路由算法—TEEN-PE算法.该算法采用先分区再建簇的方式解决了TEEN协议中最优簇首个数难以确定、簇首分布不均匀等问题.同时,在簇形成阶段和簇间通信阶段,综合考虑节点剩余能量以及节点到基站的距离因素,以提高网络在时间上和空间上的通信平衡.该算法能有效降低节点能耗、延长网络生存周期.最后通过NS-2进行仿真,仿真结果显示,TEEN-PE算法在节
Abstract:Based on researches on TEEN protocol and combined the characteristic of monitoring emergences system, an event-driven hierarchical routing algorithm (TEEN-PE) has been proposed to reduce the energy consumption in the monitoring system of emergences and prolong the lifetime of the wireless sensor networks (WSN). TEEN-PE has solved the problems of the difficulty in determining the initial number of the optimal clusters and the asymmetrical distribution of cluster in TEEN protocol. And to improve the communication balance of the networks on times and space, the algorithm is taken into accounts the factor of the residual energy of the nodes and the distance of the node to the base station during the phase of cluster formation and communicates among clusters. The algorithm can effectively reduce energy consumption and prolong the lifetime of the networks. It is proved by simulated in NS-2, and the simulation results show that TEEN-PE has an advantage over TEEN protocol on nodes survival and energy consumption.
文章编号:     中图分类号:    文献标志码:
基金项目:
引用文本:
沈永增,陈宣扬,贾莲莲.一种事件驱动型无线传感器网络的分层路由算法.计算机系统应用,2011,20(8):81-85
SHEN Yong-Zeng,CHEN Xuan-Yang,JIA Lian-Lian.Hierarchical Routing Algorithm in Event-Driven Wireless Sensor Networks.COMPUTER SYSTEMS APPLICATIONS,2011,20(8):81-85