ID 原文 译文
5304 针对上述问题，设计了面向威胁监测的采集策略自动精化方法。 To address the above problem, a collection policy automatic refinement method was de-signed.
5305 首先，提出了采集策略层次模型； Firstly, a hierarchical model of collection policy was proposed.
5306 然后，将威胁类型到采集项的精化转化为采集收益和采集成本平衡的非线性优化问题，并利用遗传算法进行求解； Then, by transforming the policy refinement into anonlinear optimization problem, a genetic algorithm was designed to balance between collection revenue and collectioncost.
5307 最后，通过模拟实验，验证可根据高层监测需求自动生成采集方案。 Finally, simulation experiments verify that according to the requirements of high-level monitoring, the acquisitionscheme can be automatically generated.
5308 针对能量与计算能力受限的无线传感器网络因干扰引发能耗增加、网络生命期降低的问题，提出了联合功率控制与信道分配的生命期优化博弈算法——LOAPC。 Due to the problem of shortening the network lifetime which was caused by the big energy consumption forwireless sensor network (WSN) whose energy and computing power was limit, a lifetime optimization game algorithmcombined power control and channel allocation (LOAPC) was proposed.
5309 LOAPC 探索节点功率与剩余能量对节点干扰的影响，构建干扰影响度量模型， The influence of node power and residual ener-gy on the node interference was explored to construct an interference affection measurement model.
5310 并引入期望传输次数，建立新颖的节点生命期模型。 Then, expected transmission times was introduced to establish a novel node lifetime model.
5311 最后，LOAPC 以降低干扰与延长生命期为优化目标，以既保证网络连通又降低能耗功率作为可选功率集合，达到延长网络生命期的效果。 Finally, LOAPC aimed at reducing interfer-ence and prolonging lifetime, and the node power was limited by an optional power set which ensured the network con-nectivity and economized energy consumption, so as to prolong the network lifetime effectively.
5312 仿真结果表明，所提算法具有低干扰、低能耗并有效延长生命期的特性。 At the same time, the simulation results show that the algorithm has the characteristics of low interference, low energy consumption and effec-tively prolonging the lifetime of the network.
5313 随着区块链的发展，存储所有区块数据需要巨大的存储空间，而数据一旦写入链中就不能更改，可能会造成过期数据占用大量存储空间的问题。 With the development of blockchain, huge storage space is needed to store all of blockchain data. In addition,data can't be changed once it is packaged into the chain, and it may be possible for overdue data to take up large storagespace.