检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:潘琢金 石多文 罗振 杨华 Pan Zhuojin;Stuart D.Semujju;Luo Zhen;Yang Hua(School of Computer Science,Shenyang Aerospace University,Shenyang 110136,China)
机构地区:[1]沈阳航空航天大学计算机学院,辽宁沈阳110136
出 处:《系统仿真学报》2019年第4期765-770,共6页Journal of System Simulation
基 金:Science and Technology Foundation from the Liaoning Education Department(L201626);AVIC Aeronautical Science Foundation(2014ZC54012);Science and Technology Foundation of Liaoning Province(2013024002)
摘 要:在无线传感器网络中,为了使节点能量消耗最小,本文提出一种节能休眠调度树形路由协议(EESSTBRP),其修改PEGASIS中链的形成,依据距离和感测范围创建网络中成对和不成对的节点。成对节点在活动和休眠模式间切换,从而消除冗余数据,节省电池能量;为减少节点在模式之间切换消耗的能量,该协议利用节点能量接近耗尽的点完成转换;为进一步减少能量消耗,该协议利用基于Prim算法的最小生成树机制将数据从活动节点路由到基站。仿真结果表明,与PEGASIS相比,该协议能够提高网络寿命。In order to minimize energy consumption of sensor nodes in wireless sensor networks, this paper presents an Energy Efficient Sleep-Scheduled Tree-Based Routing Protocol(EESSTBRP) that modifies the chain formation in PEGASIS to create a set of paired and unpaired nodes in the network based on a distance and sensing range threshold. The paired nodes switch between active and sleep modes so as to remove redundant data and save battery power. To minimize energy consumption as nodes switching between the modes, this scheme considers the transitioning to be done based on a point of near depletion of the nodes’ residual energy. To further reduce energy consumption during transmission, this protocol utilizes prim’s minimum spanning tree mechanism to route data from the active nodes to the Base Station(BS). Simulation results show that this proposed mechanism can significantly improve network lifetime in comparison to PEGASIS.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.190.207.221