Distributed self-optimizing interference management in ultra-dense networks with non-orthogonal multiple access

Both non-orthogonal multiple access (NOMA) and ultra-dense network (UDN) are promising technologies in future wireless networks. However, considering the overlapped coverage of small base stations (SBSs) and the spectrum sharing with NOMA, interference management (IM) becomes a more complex and fundamental problem. Moreover, considering the massive SBSs and dynamic network conditions in UDN, more efficient mechanisms need to be designed to deal with the IM issue. Thus, we propose a distributed self-optimizing interference management approach to address both the intra-cell interference caused by NOMA and the inter-cell interference among dense deployed SBSs. Aiming to minimize the interference and guarantee the users’ requirements, we mathematically formulate the joint resource allocation and user selection problem with consideration of the diverse user requirements, complicated interference topology, and limited resources. Furthermore, we consider the imperfections of successive interference cancellation at receivers for separating and decoding superimposed signals and analyze the impacts of residual interference and outage probability in NOMA-based UDNs. For tractability purpose, we introduce interference graph and satisfaction game theory and propose distributed algorithms to solve the problem. Simulation results show that interference can be reduced significantly in UDNs with NOMA compared with the traditional IM approaches.

     

MLAS: Multiple level authentication scheme for VANETs

The vehicular ad hoc network (VANET) is an emerging type of network which enables vehicles on roads to inter-communicate for driving safety. The basic idea is to allow arbitrary vehicles to broadcast ad hoc messages (e.g. traffic accidents) to other vehicles. However, this raises the concern of security and privacy. Messages should be signed and verified before they are trusted while the real identity of vehicles should not be revealed, but traceable by authorized party. Existing solutions either rely too heavily on a tamper-proof hardware device, or do not have an effective message verification scheme. In this paper, we propose a multiple level authentication scheme which still makes use of tamper-proof devices but the strong assumption that a long-term system master secret is preloaded into all tamper-proof devices is removed. Instead the master secret can be updated if needed to increase the security level. On the other hand, messages sent by vehicles are classified into two types – regular messages and urgent messages. Regular messages can be verified by neighboring vehicles by means of Hash-based Message Authentication Code (HMAC) while urgent messages can only be verified with the aid of RSUs nearby by means of a conditional privacy-preserving authentication scheme. Through extensive simulation, we show that our multiple level authentication scheme is much more efficient that those RSU-aided authentication scheme as long as the proportion of urgent messages is less than 100%. The verification delay required can be up to 110 times smaller than other protocols. Our implementation shows that batch verification may not be as efficient as expected. In case without batch verification, the verification delay required by our scheme can even be up to 173 times smaller.     

Wireless link prediction and triggering using modified Ornstein–Uhlenbeck jump diffusion process

Through time domain observation, typical wireless signal strength values seems to exhibit some forms of mean-reverting and discontinuous “jumps” behaviour. Motivated by this fact, we propose a wireless link prediction and triggering (LPT) technique using a modified mean-reverting Ornstein–Uhlenbeck (OU) jump diffusion process. The proposed technique which we refer as OU-LPT is an integral component of wireless mesh network monitoring system developed by ICT FP7 CARrier grade wireless MEsh Network project. In particular, we demonstrate how this technique can be applied in the context of wireless mesh networks to support link switching or handover in the event of predicted link degradation or failure. The proposed technique has also been implemented and evaluated in a real-time experimental testbed. The results show that OU-LPT technique can significantly enhance the reliability of wireless links by reducing the rate of false triggers compared to a conventional linear prediction technique and therefore offers a new direction on how wireless link prediction, triggering and switching process can be conducted in the future.     

Hierarchical Asymptotic Methods in the Theory of Cluster Free Electron Lasers

We describe an algorithm for the hierarchic method of averaged characteristics and discuss a practical application of this concept. The application of this method opens new prospects for the solutions of many difficult electrodynamic problems, which, until recently, were considered “unsolved”. We illustrate this method with the example of the effect of plural multi-harmonic parametric resonance of electron-beam waves. This effect can take place within high-current electron beams in the case of the realization of two-stream instability. The considered relativistic beam-model is treated as a model for the transit section of relevant klystron Cluster Two-stream Free Electron Laser (CTSFEL).     

Improved Merkle Hash Tree-Based One-Time Signature Scheme for Capability-Enhanced Security Enforcing Architecture for Named Data Networking

The concept of network caching is determined to be the potential requirement of named data networks (NDN) for enhancing the capabilities of the traditional IP networking. It is responsible for location independent data accesses and optimal bandwidth utilization in multi-path data dissemination. However, the network caching process in NDN introduces security challenges such as content cache poisoning, malicious injection or flooding of the packets and violation in accessing content packets. In this paper, an Improved Merkle Hash Tree-based one-time signature scheme for capability-enhanced security enforcing architecture (IMHT-OTSS-CSEA) is proposed for provisioning data authenticity in a distributed manner for leveraging the capabilities to inform the access privileges of the packets during the process of data dissemination. It is proposed for permitting the routers to verify the forwarded packets’ authenticity in NDN. It is capable in handling the issues that emerge from unsolicited packets during a flooding-based denial of service attacks by supporting the indispensable verification process in routers that confirms the timeliness of packets. The simulation experiments conducted using the open source CCNs platform and Planetlab confirmed a significant mean reduction in delay of 14.61%, superior to the benchmarked schemes. It is identified to minimize the delay incurred in generating bit vectors by a average margin of 13.06%, excellent to the baseline approaches. It also confirmed a mean increase in the true positive rate of 5.42%, a mean increase in the precision rate of 6.04%, decrease in false positive rate of 6.82% and increase in F-measure of 5.62% compared to the baseline approaches in the context of detecting content cache pollution attack respectively.

     

雷达微多普勒信号特征的原理与应用

目标的微多普勒信号特征表现为不同的复杂频率调制,它由目标部件产生,用联合时间-多普勒频域进行描述,可以揭示目标独特的特性。介绍雷达微多普勒效应的基本原理与应用,描述来自刚体和非刚体的微多普勒信号特征。文中还讨论雷达微多普勒特征的研究现状、面临挑战与未来前景。     

Managing the Public Sphere: Journalistic Construction of the Great Globalization Debate

There is little consensus on what constitutes open, deliberative media discourse. We offer a simple, measurable, and comparative model based on 3 aspects of source and issue construction in news accounts: access, recognition, and responsiveness. The model is applied to coverage of 2001–2003 World Economic Forum (WEF) meetings and protests against the organization's role in global economic policies. Both demonstrators and WEF participants were granted news access, but WEF actors were recognized more formally and given greater input in news content, including ownership claims to many activist issue positions. Journalistic deference to the WEF communication agenda limited mutual responsiveness. The journalistic process systematically managed the debate about globalization on terms that favored elites over citizen-activists.     

Mechanism of Crystallization and Implications for Charge Transport in Poly(3‐ethylhexylthiophene) Thin Films

In this work, crystallization kinetics and aggregate growth of poly(3‐ethylhexylthiophene) (P3EHT) thin films are studied as a function of film thickness. X‐ray diffraction and optical absorption show that individual aggregates and crystallites grow anisotropically and mostly along only two packing directions: the alkyl stacking and the polymer chain backbone direction. Further, it is also determined that crystallization kinetics is limited by the reorganization of polymer chains and depends strongly on the film thickness and average molecular weight. Time‐dependent, field‐effect hole mobilities in thin films reveal a percolation threshold for both low and high molecular weight P3EHT. Structural analysis reveals that charge percolation requires bridged aggregates separated by a distance of ≈2–3 nm, which is on the order of the polymer persistence length. These results thus highlight the importance of tie molecules and inter‐aggregate distance in supporting charge percolation in semiconducting polymer thin films. The study as a whole also demonstrates that P3EHT is an ideal model system for polythiophenes and should prove to be useful for future investigations into crystallization kinetics.     

Dynamic Reservation Multiple Access (DRMA): A new multiple access scheme for Personal Communication System (PCS)

To improve the spectrum efficiency of integrated voice and data services in Personal Communication System (PCS), several reservation-type multiple access schemes, such as Packet Reservation Multiple Access (PRMA), Dynamic Time Division Multiple Access (D-TDMA), Resource Auction Multiple Access (RAMA), etc., have been proposed. PRMA uses the data packet itself to make a channel reservation, and is inefficient in that each unsuccessful reservation wastes one slot. However, it does not have a fixed reservation overhead and offers shorter access delay. On the other hand, fixed reservation overhead is unavoidable in both RAMA and D-TDMA. Compared to D-TDMA and PRMA, RAMA is superior in the sense that its slot assignment is independent of the traffic load. But its implementation is difficult. With these observations, a new reservation protocol, called Dynamic Reservation Multiple Access (DRMA), is proposed in this paper. With this new protocol, the success probability of channel access is greatly improved at the expense of slightly increased system complexity. It solves the problem of inefficiency in PRMA, but without introducing the fixed reservation overhead as in D-TDMA and RAMA. In addition, it is more suited to the dynamic behavior of the integrated traffic because there is no fixed boundary between voice and data slots (which is mandatory in D-TDMA and RAMA). Our numerical results indicate that its performance is superior to the existing reservation protocols, especially in the integrated traffic scenario. Moreover, the soft capacity feature is exhibited when the traffic load increases.