基于节点度限制的大规模无线传感网络路由协议.doc

文档介绍：
基于节点度限制的大规模无线传感网络路
由协议#
贺敏,陈锴,陈佐,肖遥**
5
10
15
20
25
30
(湖南大学信息科学与工程学院,长沙 410082)
摘要:无线传感器网络 WSN 能量有限,如何在路由协议设计中降低 WSN 的能耗,一直都是研
究的热点。现有层次结构路由协议通常先选出簇头结点,然后簇头结点通过多跳传输到 BS
结点。上述机制中往往出现的簇头结点度过大,负担过重,过早出现结点死亡的问题。本文
提出一种基于节点度限制的低能耗多跳网络拓扑算法 D (Low Energy Consumption of
Node Degree work Topology Algorithm)。尽管 D 仍属于层次路由协议,
但是 D 引入了节点的度数限制,使得每个结点根据局部信息选择在自己一定范围内的与
BS 较近的能量较高且节点度数相对较低的邻居结点加入,从而实现对网络能量的均衡消耗。
实验结果显示 D 能有效延长网络的生存周期,降低网络的能耗。
关键词:无线传感网;节点度;多跳;层次路由;
中图分类号:TP393
A routing protocol for large-scale wireless work
Based on Node Degree restricted
HE Min, CHEN Kai, CHEN Zuo, XIAO Yao
(School of Information Science and Technology, Hunan University, Changsha, 410082)
Abstract: For the reason that the energy of wireless work is limited, how to reduce the
energy consumption of WSN by the design of routing protocol, has always been the research
hotspot. The present Hierarchy Routing Protocols elect the cluster head nodes at first, and then let
the cluster head nodes send data to the BS node by multi hop transmission, which may cause node
having large, heavy burden and death. A routing protocol for large-scale wireless work
Based on Node Degree restricted (D) is proposed. D is also a hierarchical routing
protocol, but without cluster head node. D taks the node degree into account and makes
each node select one of its neighbor as its next-hop according to the local information, which is
nearer to BS than itself and has the higher residual energy and relatively low node degree.
Experimental results show that D can prolong work life cycle and work
energy consumption effectively.
Key words: WSN; node degree; multi-hop; hierarchical routing
35
0 引言
随着无线通信、电子与传感技术的发展,无线传感器网络(wireless sensor
networks,简称 WSN[1])引起了人们的广泛关注。WSN 由具有传感、数据处理和
短距离无线通信功能的传感器组成。传感节点借助于节点中内置的形式多样的传
40
感器,协作地实时感知和采集周边环境,可以在任何时间、绝大多数地点和多种
环境条件下获取大量详实而可靠的信息[2]。这些优秀的特征使传感网在军事国
基金项目:高等学校博士学科点专项科研基金(20100161120021);湖南省自然科学基金(14JJ3062)
作者简介:贺敏(1989-),女,硕士研究生,主要研究方向:无线传