摘要
针对DRNG算法中出现的当节点天线为全向天线时形成的网络拓扑复杂度过大的问题,对DRNG算法进行了改进,在保证原算法网络优化性能的基础上,减少了需要确定的邻居节点个数,缩小了确定邻居节点时中间节点的搜索范围,提高了DRNG算法的执行效率,节省了节点的能量消耗.
DRNG (directed relative neighborhood graph) is a localized topology control algorithm for heterogeneous wireless sensor networks with non-uniform transmission range. The network topology generated by DRNG preserves connectivity, hi-directionality and energy efficiency,but DRNG has high computation complexity when the antenna pattern is isotropic. In this paper, a modified DRNG algorithm is proposed to mitigate the complication of DRNG. Analysis made in this study shows that the modified DRNG algorithm reduces the number of neighbor nodes to be confirmed and the range of searching the middle node in confirmation of neighbor nodes, so the modified DRNG algorithm improves the implement efficiency and saves the processing energy of sensor nodes.
出处
《西南大学学报(自然科学版)》
CAS
CSCD
北大核心
2008年第11期160-164,共5页
Journal of Southwest University(Natural Science Edition)
基金
西南大学科技基金资助项目(SWUQ2006008)
关键词
DRNG
无线传感器网络
拓扑控制
directed relative neighborhood grahp wireless sensor networks
topology control