检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001
出 处:《黑龙江科技学院学报》2013年第1期89-93,共5页Journal of Heilongjiang Institute of Science and Technology
基 金:国家自然科学基金项目(61102105;61102106;60775060);中国博士后科学基金项目(20080440840);教育部博士点基金项目(20102304120014;20102304110006);黑龙江省自然科学基金项目(F201029)
摘 要:为解决无线传感器网络分簇路由算法因簇间长距离通信而带来的高能耗以及路由寻址复杂的问题,提出了一种基于分层的非均匀分簇路由算法。该算法对非均匀分簇算法进行了改进,在竞争半径的计算上同时考虑了节点的位置和剩余能量,以使簇头的负载更加均衡。采用层间多跳通信方式进行数据传输,不仅避免了节点的长距离通信问题,而且简化了数据转发过程。仿真实验表明:与低功耗自适应分簇路由算法和非均匀分簇算法相比,该算法能够有效地节约簇头的能耗,减少网络的系统能量开销,延长网络的工作周期。Aimed at seeking an alternative to clustering routing algorithms available for wireless sensor network, which suffer from a greater energy consumption caused by long-distance communication and consequent routing and addressing complexity, this paper proposes a layer-based uneven clustering routing algorithm. As an improved alternative to uneven clustering algorithms, this algorithm is distinguished by the concurrent consideration of the position and residual energy of node in calculating the competitive radius so as to make all cluster head loads more balanced, and the data transmission performed by using the multi-hop way among layers, thus not only eliminating the node long-distance communication, but also simplifying the data forwarding process. Simulation experiments show that the algorithm features a more effective reduction in the energy dissipation of cluster heads, lower energy costs of network system, and a longer working time of networks, as compared with low energy adaptive clustering algorithm and uneven clustering algorithm.
分 类 号:TH393.03[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112