一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

认知雷达抗干扰中的博弈论分析综述

雷达对抗的核心研究内容主要是干扰策略与抗干扰策略之间的对抗博弈,其作为电子战研究领域的热点一直备受学者们关注.该文综述了学者们利用合作与非合作博弈方法来分析雷达在进行目标探测和干扰抑制时所使用的策略,主要通过不同体制的雷达利用认知技术感知和学习外界复杂的电磁环境,合理地分配发射功率、控制编码序列、设计波形、研究检测和跟踪方法以及分配雷达通信资源等.这样雷达既节约发射所消耗的功率,又可以自适应地搜索和跟踪目标而不被敌方所发现,从而使雷达在复杂多变的现代战场环境中达到自身最优的性能.最后,对认知雷达抗干扰中的博弈论分析研究进行总结和展望,并指出了一些博弈论在认知雷达抗干扰策略应用中所面临的潜在问题和挑战.     

REATMENT AND RESOURCE REUSE OF 1,2,4-ACID PRODUCING EFFLUENT WITH MACROPOROUS POLYMERIC ADSORBENT

1. INTRODUCTION 1,2,4-acid (1-Amino-2-naphthol-4-sulfonic acid) is among the most important naphthalene derivatives which are widely used as the intermediates of dyestuffs. In its production process, however, high strength wastewater streams are gene…     

Machine learning in vehicular networking: An overview

As vehicle complexity and road congestion increase, combined with the emergence of electric vehicles, the need for intelligent transportation systems to improve on-road safety and transportation efficiency using vehicular networks has become essential. The evolution of high mobility wireless networks will provide improved support for connected vehicles through highly dynamic heterogeneous networks. Particularly, 5G deployment introduces new features and technologies that enable operators to capitalize on emerging infrastructure capabilities. Machine Learning (ML), a powerful methodology for adaptive and predictive system development, has emerged in both vehicular and conventional wireless networks. Adopting data-centric methods enables ML to address highly dynamic vehicular network issues faced by conventional solutions, such as traditional control loop design and optimization techniques. This article provides a short survey of ML applications in vehicular networks from the networking aspect. Research topics covered in this article include network control containing handover management and routing decision making, resource management, and energy efficiency in vehicular networks. The findings of this paper suggest more attention should be paid to network forming/deforming decision making. ML applications in vehicular networks should focus on researching multi-agent cooperated oriented methods and overall complexity reduction while utilizing enabling technologies, such as mobile edge computing for real-world deployment. Research datasets, simulation environment standardization, and method interpretability also require more research attention.     

A possible human counterpart of the principle of increasing entropy

It is well-known that the principle of increasing entropy holds for isolated natural systems that contain non-adaptive molecules. Here we present, for the first time, an experimental evidence for a possible human counterpart of the principle in an isolated social system that involves adaptive humans. Our work shows that the human counterpart is valid even though interactions among humans in social systems are distinctly different from those among molecules in natural systems. Thus, it becomes possible to understand social systems from this natural principle, at least to some extent.     

Mobile relays for enhanced broadband connectivity in high speed train systems

With the introduction of wireless modems and smart phones, the passenger transport industry is witnessing a high demand to ensure not only the safety of the trains, but also to provide users with Internet access all the time inside the train. When the Mobile Terminal (MT) communicates directly with the Base Station (BS), it will experience a severe degradation in the Quality of Service due to the path loss and shadowing effects as the wireless signal is traveling through the train. In this paper, we study the performance in the case of relays placed on top of each train car. In the proposed approach, these relays communicate with the cellular BS on one hand, and with the MTs inside the train cars on the other hand, using the Long Term Evolution (LTE) cellular technology. A low complexity heuristic LTE radio resource management approach is proposed and compared to the Hungarian algorithm, both in the presence and absence of the relays. The presence of the relays is shown to lead to significant enhancements in the effective data rates of the MTs. In addition, the proposed resource management approach is shown to reach a performance close to the optimal Hungarian algorithm.     

基于云计算的视频监控和资源整合优化系统

视频监控系统在日常生活中担当着越来越重要的作用,将云计算技术应用于视频监控系统中,以此构建了基于云计算的视频监控和资源整合优化系统;然后,改进了视频监控中的一个重要的算法—动态目标检测算法,以提高视频监控的准确性;最后,研究了如何对于云计算平台中的服务器资源进行整合优化,并对所实现的系统进行了测试,结果表明,该系统可以提高视频监控的准确性和服务器的响应时间.     

Joint relay selection and resource allocation in cooperative device-to-device communications

Device-to-device (D2D) communications allow proximate cellular user equipments (UEs) to communicate with each other directly under the control of base station (BS). In this paper, considering the selection relaying (SR) rule which allows a subset of potential relays to forward the source’s data to the corresponding destination, we first establish a multi-relay system model where a D2D UE can act as not only a source but also a potential relay for another D2D link, and then analyze the cooperation behaviors among selfish UEs. Next a simple strategy is proposed to deal with the relay selection problem, and then the fair and efficient resource sharing problem among cooperating D2D UEs is formulated as a bargaining game. Since the game function is non-convex, we turn to an iterative method by introducing an auxiliary function to get the proportional fair resource allocation results. The system efficiency and fairness are proved by numeral simulation results.     

Resource augmentation for online bounded space bin packing

We study online bounded space bin packing in the resource augmentation model of competitive analysis. In this model, the online bounded space packing algorithm has to pack a list L of items in (0,1] into a small number of bins of size b1. Its performance is measured by comparing the produced packing against the optimal offline packing of the list L into bins of size 1.We present a complete solution to this problem: For every bin size b1, we design online bounded space bin packing algorithms whose worst case ratio in this model comes arbitrarily close to a certain bound ρ(b). Moreover, we prove that no online bounded space algorithm can perform better than ρ(b) in the worst case.     

Design of an enhanced access point to optimize TCP performance in Wi-Fi hotspot networks

In the last years, the number of Wi-Fi hotspots at public venues has undergone a substantial growth, promoting the WLAN technologies as the ubiquitous solution to provide high-speed wireless connectivity in public areas. However, the adoption of a random access CSMA-based paradigm for the 802.11 MAC protocol makes difficult to ensure high throughput and a fair allocation of radio resources in 802.11-based WLANs. In this paper we evaluate extensively via simulations the interaction between the flow control mechanisms implemented at the TCP layer and the contention avoidance techniques used at the 802.11 MAC layer. We conducted our study considering initially M wireless stations performing downloads from the Internet. From our results, we observed that the TCP downlink throughput is not limited by the collision events, but by the inability of the MAC protocol to assign a higher chance of accessing the channel to the base station. We propose a simple and easy to implement modification of the base station’s behavior with the purpose of increasing the TCP throughput reducing useless MAC protocol overheads. With our scheme, the base station is allowed to transmit periodically bursts of data frames towards the mobile hosts. We design a resource allocation protocol aimed at maximizing the success probability of the uplink transmissions by dynamically adapting the burst length to the collision probability estimated by the base station. By its design, our scheme is also beneficial to achieve a fairer allocation of the channel bandwidth among the downlink and uplink flows, and among TCP and UDP flows. Simulation results confirm both the improvement in the TCP downlink throughput and the reduction of system unfairness.