检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:焦雄飞[1] JIAO Xiong-fei(Information Management Division,Hebei Children's Hospital,Shijiazhuang 050031 China)
机构地区:[1]河北省儿童医院信息管理处,河北石家庄050031
出 处:《自动化技术与应用》2023年第4期114-117,175,共5页Techniques of Automation and Applications
摘 要:为解决能量消耗快、使用寿命短的问题,提出一种医院无线传感网络分区节点能耗动态均衡算法。计算医院内大流数据传输产生拥挤概率,明确候选路径选取最优结果,调度拥堵概率小的大数据流,建立节点能耗模型,计算节点跳转合作间能量消耗,凭借振动补给模型补充部分节点能量。受距离影响,节点间的补给程度不同,需计算单元中簇头数量迭代关系,利用簇点间传输数据融合率,确定单元个数及各单元簇头节点个数,平衡各节点耗能。实验结果证明,动态均衡算法节点能量消耗均衡,能有效延长节点使用时间,提高网络吞吐量、缩短时延。In order to solve the problem of fast energy consumption and short service life,a dynamic equilibrium algorithm for energy consumption of partition nodes in hospital wireless sensor networks is proposed.It calculates the congestion probability of large-stream data transmission in the hospital,clarifies the optimal result of the candidate path selection,dispatches the large data stream with low congestion probability,establishes the node energy consumption model,calculates the energy consumption between node jumps and cooperation,and supplements some nodes with the vibration replenishment model energy.Affected by the distance,the degree of replenishment between nodes is different.It is necessary to calculate the iterative relationship of the number of cluster heads in the unit,use the transmission data fusion rate between cluster points,determine the number of units and the number of cluster head nodes in each unit,and balance the energy consumption of each node.The experimental results prove that the dynamic equalization algorithm method has balanced energy consumption of nodes,can effectively extend the use time of nodes,increase network throughput,and shorten the time delay.
分 类 号:TP393.01[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.190.49