ID 原文 译文
4974 其次，考虑网络拓扑的离散性和节点资源的有限性，通过初始化、编码及修复环节生成卫星网络中的可用连接计划（CP）； Next, available contact plan (CP) in satellite network were generatedthrough initialization, coding and repairing by considering the discreteness of network topology and the limitation ofnode resources.
4975 再次，根据执行任务的特点设计评价函数以区分所生成的可用 CP 的优劣； Then, an evaluation function was designed according to the characteristics of the execution task to dis-tinguish whether the generated available CP was good or bad.
4976 最后，根据 CP 中链路稀疏的特点确定最差位置中待修正的比特，提出 BPSO 算法不断修正 CP 以优化空间数据传输性能。 Finally, the bits to be corrected in the worst location weredetermined according to the sparse characteristics of links in CP, and the CP was continuously modified by the proposedBPSO algorithm to optimize the performance of spatial data transmission.
4977 仿真结果表明，所提方案能够有效降低任务传输时间，提升任务到达率。 The simulation results show that the proposedBPSO-based CPD scheme can effectively reduce the task delivery time and increase the task arrival rate.
4978 邻居发现可以使网络中的节点通过简单的信息交互彼此发现对方，适用于新型的移动低占空比传感网（MLDC-WSN）。 Neighbor discovery enables nodes in the networks to discover each other through simple information interac-tion, which was suitable for the new mobile low duty cycle sensor network (MLDC-WSN).
4979 然而，由于 MLDC-WSN 中节点具有可随机移动、睡眠等特性，使网络拓扑频繁发生改变，导致部分节点需要花费很多的能量和时间才能发现邻居。 However, because the nodesin MLDC-WSN can move randomly and sleep, the network topology was changed frequently, which results in that somenodes need a lot of energy and time to find their neighbors.
4980 如何使网络中的全部节点实现快速邻居发现是目前研究的难点问题。 How to realize fast neighbor discovery for all nodes in thenetwork was a difficult problem in current research.
4981 为了解决这个难题，提出了一种新的基于多信标消息的低时延邻居发现算法，节点通过发送一种简短的信标消息来寻找自己的邻居，并且通过调整信标消息发送的时刻及发送的次数，从而获取较低的邻居发现时延。 To solve this problem, a new low-latency neighbor discovery algo-rithm based on multi-beacon messages was proposed. In this algorithm, the nodes were discovered by sending a shortbeacon message through their neighbor nodes, and by adjusting the time and frequency of beacon message sent, a lowerneighbor discovery delay was obtained.
4982 最后，通过定量分析和仿真实验发现，与已有算法相比，该算法能够在 MLDC-WSN 中以更小的能耗、更低的时延和更大的概率发现全部的邻居节点。 Eventually, through quantitative analysis and simulation experiments, it is foundthat compared with existing algorithms, this algorithm can find all neighbor nodes in MLDC-WSN with less energy con-sumption, lower latency and greater probability.
4983 提出了去中心化信贷系统，并给出了其构造应用。 A decentralized credit system was proposed and its construction application was given.