IDSSRJ中的雷达干扰资源分配技术

雷达干扰资源分配是否合理是影响雷达干扰效果的重要因素,详细介绍了智能雷达干扰决策支持系统（IDSSRJ）中的几种雷达干扰资源分配技术,包括多级优化动态资源分配技术,全空间搜索以及随机抽样资源分配技术。     

一种雷达干扰资源动态优化分配技术

雷达干扰资源的分配问题一直是个十分棘手的问题。本文提出了一种雷达干扰资源动态优化分配技术，它将动态规划算法应用于解决雷达干扰资源分配问题，利用这种技术可以快速地、有效地进行干扰资源分配。     

无人机对组网雷达干扰资源分配建模

在分析组网雷达技术的基础上,以组网雷达融合中心检测概率为目标函数,建立针对组网雷达各级系统的干扰资源优化分配模型。结合电子对抗无人机平台的特点,分析电子对抗无人机在干扰组网雷达时的资源分配问题。     

基于作战任务的雷达干扰决策模型

在雷达对抗体系作战中雷达干扰决策是一个必须解决的问题。通常雷达干扰决策的模型只侧重于某一方面(如干扰效果评估、干扰资源分配),而实际体系作战条件下的雷达干扰决策是一个系统问题,它包括三方面的问题:威胁评估、干扰效果评估和干扰资源分配。只有从这三方面进行系统地考虑,才能较好地解决体系作战条件下雷达干扰决策问题。基于此,作了一些初步的尝试。     

一种雷达干扰资源分配算法

雷达干扰资源分配是电子对抗领域的一个重要研究课题，合理的干扰资源分配可以使有限的干扰资源发挥最佳的干扰效果。本文在运筹学的基础上，研究了一种干扰资源分配算法，称之为最大元素法。仿真结果表明该算法是可行、有效的。     

一种雷达干扰资源分配算法

雷达干扰资源分配是电子对抗领域的一个重要研究课题,合理的干扰资源分配可以使有限的干扰资源发挥最佳的干扰效果。本文在运筹学的基础上,研究了一种干扰资源分配算法,称之为最大元素法。仿真结果表明该算法是可行、有效的。     

基于深度强化学习的干扰资源分配方法

针对干扰机群掩护目标突防组网雷达场景下的干扰资源分配的问题,提出了一种基于深度强化学习的干扰资源分配方法。该文将干扰资源分配模型描述为一个马尔可夫决策过程,并提出了一种基于动作密钥编码的双延迟深度确定性策略梯度(AKE-TD3)网络训练算法,将混合整数优化问题转化为连续变量优化问题,解决了算法难以收敛的问题。仿真结果表明,文中所设计的干扰资源分配方法对组网雷达有更好的干扰效果,且稳定性更高,有效地提升了干扰机群的作战性能。     

基于动态选择遗传算法的雷达干扰资源分配

电子战中如何针对敌方目标雷达合理高效地分配己方干扰资源,对于获取最佳干扰效益能够起到重要的作用。文中针对雷达干扰资源分配的干扰效益建立评估模型,在模糊综合评估方法的基础上引入遗传算法进行最优解搜索,在遗传算法中关键的选择步骤运用动态选择概率代替了轮盘选择,从而得到了一种行之有效的雷达干扰资源分配方法,预防了经典遗传算法中的早熟收敛问题,使资源分配算法以更大概率收敛至全局最优解。通过进行大量仿真检验,验证了文中所提方法具有有效性和正确性。     

基于突防路线的雷达干扰效果评价指标

为了能够迅速准确地对进行支援干扰时的多部干扰机做出分配,以突防任务为作战前提,分别从干扰机的干扰程度、干扰位置部署和干扰角度3个方面设计了新的干扰效果评价指标,建立了针对突防路线的雷达干扰效果评价指标体系。应用新的干扰效果评价指标对干扰资源分配模型进行求解。通过仿真绘制了干扰区域图形并设计了突防航迹区域的GUI仿真界面,并由此得到新的干扰效果评价指标体系下的干扰资源分配。仿真结果表明,分配方案对执行突防路线规划任务前的雷达干扰资源分配更加具有针对性,同时也更加注重对突防路线的保护。     

基于改进遗传算法的干扰资源分配方法研究

针对分布式对抗系统对敌方分布式雷达的干扰效率问题，设计一种基于二进制编码的改进遗传算法，用于提高系统自主干扰资源分配效率。首先，通过前期侦察，获取雷达的性能参数，得到每部干扰机对每部雷达的干扰效能参数，生成干扰效能矩阵，以干扰总效能最大化为原则，构建目标效能函数；然后根据干扰机与雷达的数量差异建立干扰资源分配模型，确定约束条件；最后利用改进遗传算法，通过选择、交叉、变异、淘汰、继承等算子操作对模型的最优值进行求解，并给出具体算法流程。Matlab仿真结果表明，改进算法需要更少的迭代次数，能够得到最优解，能够较好地解决文中构设场景下的分布式协同干扰资源优化分配问题。     

基于遗传算法的光电干扰资源优化分配研究

结合光电信息系统作战运筹中目标分配原则，及军事运筹理论，建立了干扰资源优化分配模型。给出了基于遗传算法的模型求解方法及步骤，阐述了遗传算法在光电干扰资源分配中的应用，并进行了实例仿真，得出了最佳干扰资源分配方案。仿真结果证明，该方法对于约束条件复杂的优化模型求解是有效、可行的，为光电信息系统指挥控制决策提供了有力支持。     

基于身份加密的无线传感器网络密钥分配方法

由于无线传感器网络在电源、计算能力和内存容量等方面的局限性,传统的网络密钥分配和管理方法已不适用.本文从基于身份密钥体系出发,提出了一种适用于无线传感器网络的密钥预分配方法.首先简要介绍了身份密钥体系,特别是Boneh-Franklin算法,然后基于身份密钥系统和Diffie-Hellman算法,给出我们的密钥分配方法,并从方法的复杂性、安全性、健壮性和内存需求等方面,与随机算法等进行了分析比较,结果表明我们的算法在这些方面有一定的优势.最后我们讨论了可进一步研究的内容.     

LTE系统中上行调度的研究与实现

LTE系统中的资源十分有限,在保持高速数据传输的同时还需要保证数据传输的有效性和可靠性,因此对资源的调度就显得尤为重要.LTE系统主要采用动态资源分配机制,而上行调度是动态资源分配的一个非常重要的部分,重点研究了LTE系统中上行调度过程的设计,并详细分析了仿真结果.     

Provisioning services on digital switching systems

The overall service provisioning process is functionally decomposed into three phases. The first is service negotiation, in which the customer's request is translated into machine-readable form (as a service order). The service order is the input to the second phase, assignment. If network resources are needed to satisfy the service request, the assignment process selects then from its inventory. The third phase is service activation. Attention is focused on the assignment phase, but emerging relationships among the three phases are also covered. The discussion begins with progress to date. Capabilities that have recently become available in Bellcore's operations systems using the flexible entity approach, are described. Issues and problems that arise as the switched network evolves to a greater degree of intelligence are considered, covering provisioning for ISDN, load balancing, service negotiation and assignment, customers doing their own provisioning, and physical and logical provisioning     

基于哈希算法的动态TDMA时隙分配研究

动态时隙分配机制是Ad Hoc网络提高组网效率的重要方面。提出了一种基于哈希算法的动态时隙资源分配机制-HP_TDMA算法。该算法将节点的时隙需求划分为3种情况:节点不需要使用时隙、只需要使用主时隙和需要竞争额外时隙。在时隙竞争阶段采用哈希算法获得节点对时隙使用的优先级顺序表,按照优先级表配置节点对时隙的使用。经过仿真分析得出采用哈希算法的时隙分配策略能够高效地利用时隙资源,提高信道利用率。     

Adaptive routing and wavelength assignment method based on SDN

Routing and wavelength assignment is an important resource allocation method of all-optical network.Aiming at the problem of traditional method combined with the new architecture,an adaptive multi-objective routing and wavelength assignment method based on SDN was proposed,which could realize the allocation of link resources of all-optical network through self-regulation.Based on the SDN service function chain model,service scheduling time and link service quality were taken as the scheduling objective,routing and wavelength assignment problem was constructed as the 0-1 integer programming problem,meanwhile,binary hybrid topology particle swarm optimization algorithm was used to optimize the network resources for optimal scheduling.The simulation results show that the proposed method is superior to the traditional classical algorithms in the test of recovery time,blocking rate and resource utilization.     

Priority Channel Assignment in Tandem DSI

DSI (digital speech interpolation) is a technique for increasing the utilization of telephone transmission facilities by allocating transmission channels during intervals of active speech (talkspurts) only. The use of DSI for tandem connections, where DSI links are connected in cascade via circuit switching, poses a problem, however, since the voice-quality degradation that is inevitable in each DSI link can be accumulated to an unacceptable level as the number of DSI links in an end-to-end call connection increases. To cope with this problem, we propose the use of a priority channel assignment technique. An example of such a technique is one that provides preference in channel assignment at each DSI process in a network to calls that have passed through at least one prior DSI link. We evaluate the performance of priority assignment schemes for TASI-type DSI analytically and show that the overall voice-quality degradation of a multi-DSI link call can be improved significantly through the use of priority assignment.     

A heuristic technique for assigning frequencies to mobile radio nets

In preparing or revising an RF channel plan for a group of mobile radio nets operating in the same region, the order in which the nets are assigned channels can be crucial to success. One well-known principle for selecting such an assignment sequence is to rank the channel requirements of the various nets in descending order of "assignment difficulty." This paper describes an easily automated heuristic assignment technique in which the channel requirements that prove themselves to be "difficult," through repeated failures to be assigned channels, rise rapidly toward the top of the list of requirements. The heuristic technique is useful in solving complex frequency-assignment problems that involve cochannel, adjacent-channel, spurious and intermodulation interference; nonrepetitive zone structures; fixed pre-existing frequency assignments; and frequency-resource lists that contain gaps and vary from zone to zone.     

A fair protocol for fast resource assignment in wireless PCS networks

Efficient sharing of communication resources is essential to PCS networks since the wireless bandwidth is limited. The Resource Auction Multiple Access (RAMA) protocol was recently proposed for fast resource assignment and handover in wireless PCS networks. The RAMA protocol assigns available communication resources (e.g., TDMA time slots or frequency channels) to subscribers one at a time using a collision resolution protocol based on subscriber ID's. However, the RAMA protocol encounters an unfairness problem; furthermore, performance results also indicate that it is inefficient at transmitting fixed-length subscriber ID's. Moreover, the emerging services such as teleconferencing have been presenting new challenges to dynamic-priority resource assignment. In this paper, we propose a modification to the RAMA protocol to improve its performance and resolve the unfairness problem. The proposed protocol also adopts dynamic priority assignment to improve the QOS for subscribers in overload environments.