检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]天津工业大学计算机科学与软件学院,天津300387
出 处:《计算机工程》2017年第9期122-127,共6页Computer Engineering
基 金:天津市自然科学基金(11JCYBJC00800);天津市科技重大专项与工程项目(15ZXHLGX00390)
摘 要:链式路由协议(CRET)在建链阶段两次使用贪婪法选择节点以确保成链最短,但会引起多个节点发送的数据在同一节点集中处理,导致节点的能量过早耗尽,影响网络的使用寿命。针上述问题,提出一种链式路由改进算法。在建链阶段考虑节点间的平均距离和节点密度2个因素,选择加入位置以减少长链的产生。在链首选取阶段根据能量阈值、节点与基站的距离选取链首,并根据链首动态调整主链以达到均衡节点能量、减少通信开销的目的。实验结果表明,该算法在节点的生命周期、网络使用寿命等方面的性能优于CRET算法,同时当网络规模增大时具有更好的适应性。Chain Routing protocol based on D-S Evidence Theory( CRET) chooses the node according to greedy algorithm twice to the ensure building the shortest path,but this causes a problem that the data of multiple nodes are processed at the same node,this situation leads node to consume much energy than other nodes to die early and impacts network lifetime. Aiming at the problem,an improved Power-efficient Gathering in Sensor Information Systems( PEGASIS) protocol called Multi-chain structure Algorithm based on Distance and Density( MADD) is proposed. In the link establishment phase,MADD uses distance threshold and node density to decrease the formation of long link. At the stage of selecting leader node,the proposed protocol considers energy threshold and the distance between node and base to choose proper node and reduces re-elected rate. Meanwhile,the protocol selects different chain to be main chain as leader changes. The improved algorithm balances remain energy and saves energy consumption of node communication.Experimental results show that the proposed algorithm outperforms the CRET in node lifecycle and network lifetime and it has better adaptability when the network size increases.
关 键 词:无线传感器网络 路由协议 链式结构 数据聚合 距离门限 选取策略 能量均衡 网络生命周期
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117