This paper derives highly accurate and effective closed-form formulas for the average upper bound on the pairwise error probability (PEP) of the multi-carrier index keying orthogonal frequency division multiplexing (MCIK-OFDM) system with low-complexity detection (i.e., greedy detection) in two-wave with diffuse power (TWDP) fading channels. To be specific, we utilize an exact moment generating function (MGF) of the signal-to-noise ratio (SNR) under TWDP fading to guarantee highly precise investigations of error probability performance; existing formulas for average PEP employ the approximate probability density function (PDF) of the SNR for TWDP fading, thereby inducing inherent approximation error. Moreover, some special cases of TWDP fading are also considered. To quantitatively reveal the achievable modulation gain and diversity order, we further derive asymptotic formulas for the upper bound on the average PEP. The obtained asymptotic expressions can be used to rapidly estimate the achievable error performance of MCIK-OFDM with the greedy detection over TWDP fading in high SNR regimes.

The 1-bit band-pass delta-sigma modulator (BP-DSM) achieves high resolution if it uses an oversampling technique. This method can generate concurrent dual-band RF signals from a digitally modulated signal using a 1-bit digital pulse train. It was previously reported that the adjacent channel leakage ratio (ACLR) deteriorates owing to the asymmetrical waveform created by the pulse transition mismatch error of the rising and falling waveforms in the time domain and that the ACLR can be improved by distortion compensation. However, the reported distortion compensation method can only be performed for single-band transmission, and it fails to support multi-band transmission because the asymmetrical waveform compensated signal extends over a wide frequency range and is itself a harmful distortion outside the target band. Unfortunately, the increase of out-of-band power causes the BP-DSM unstable. We therefore propose a distortion compensator for a concurrent dual-band 1-bit BP-DSM that consists of a noise transfer function with a quasi-elliptic filter that can control the out-of-band gain frequency response against out-of-band oscillation. We demonstrate that dual-band LTE signals, each with 40MHz (2×20MHz) bandwidth, at 1.5 and 3.0GHz, can be compensated concurrently for spurious distortion under various combinations of rising and falling times and ACLR of up to 48dB, each with 120MHz bandwidth, including the double sided adjacent channels and next adjacent channels, is achieved.

A novel adaptive code division multiplexing system with hybrid electrical and optical codes is proposed for flexible and dynamic resource allocation in next generation asynchronous optical access networks. We analyze the performance of a 10Gbps × 12 optical node unit, using hierarchical 8-level optical and 4-level electrical phase shift keying codes.

Information-centric networking (ICN) has gained attention from network research communities due to its capability of efficient content dissemination. In-network caching function in ICN plays an important role to achieve the design motivation. However, many researchers on in-network caching due to its ability to efficiently disseminate content. The in-network caching function in ICN plays an important role in realizing the design goals. However, many in-network caching researchers have focused on where to cache rather than how to cache: the former is known as content deployment in the network and the latter is known as cache replacement in an ICN router. Although the cache replacement has been intensively researched in the context of web-caching and content delivery network previously, networks, the conventional approaches cannot be directly applied to ICN due to the fine granularity of chunks in ICN, which eventually changes the access patterns. In this paper, we argue that ICN requires a novel cache replacement algorithm to fulfill the requirements in the design of a high performance ICN router. Then, we propose a novel cache replacement algorithm to satisfy the requirements named Compact CLOCK with Adaptive Replacement (Compact CAR), which can reduce the consumption of cache memory to one-tenth compared to conventional approaches. In this paper, we argue that ICN requires a novel cache replacement algorithm to fulfill the requirements set for high performance ICN routers. Our solution, Compact CLOCK with Adaptive Replacement (Compact CAR), is a novel cache replacement algorithm that satisfies the requirements. The evaluation result shows that the consumption of cache memory required to achieve a desired performance can be reduced by 90% compared to conventional approaches such as FIFO and CLOCK.

Efficiently locating nodes and allocating demand has been a significant problem for telecommunication network carriers. Most of location models focused on where to locate nodes and how to assign increasing demand with optical access networks. However, the population in industrialized countries will decline over the coming decades. Recent advance in the optical amplifier technology has enabled node integration; an excess telecommunication node is closed and integrated to another node. Node integration in low-demand areas will improve the efficiency of access networks in this approaching age of depopulation. A dynamic node integration problem (DNIP) has been developed to organize the optimal plan for node integration. The problem of the DNIP was that it cannot consider the requirements of network carriers. In actual situations, network carriers often want to specify the way each node is managed, regardless of the mathematical optimality of the solution. This paper proposes a requirement modeling language (RML) for the DNIP, with which the requirements of network carriers can be described. The described statements are used to solve the DNIP, and consequently the calculated optimal solution always satisfies the requirements. The validity of the proposed method was evaluated with computer simulations in a case study.

The tens of billions of devices expected to be connected to the Internet will include so many sensors that the demand for sensor-based services is rising. The task of effectively utilizing the enormous numbers of sensors deployed is daunting. The need for automatic sensor identification has expanded the need for research on sensor similarity searches. The Internet of Things (IoT) features massive non-textual dynamic data, which is raising the critical challenge of efficiently and effectively searching for and selecting the sensors most related to a need. Unfortunately, single-attribute similarity searches are highly inaccurate when searching among similar attribute values. In this paper, we propose a group-fitting correlation calculation algorithm (GFC) that can identify the most similar clusters of sensors. The GFC method considers multiple attributes (e.g., humidity, temperature) to calculate sensor similarity; thus, it performs more accurate searches than do existing solutions.

Network function virtualization improves the flexibility of infrastructure resource allocation but the application of commodity facilities arouses new challenges for systematic reliability. To meet the carrier-class reliability demanded from the 5G mobile core, several studies have tackled backup schemes for the virtual network function deployment. However, the existing backup schemes usually sacrifice the efficiency of resource allocation and prevent the sharing of infrastructure resources. To solve the dilemma of balancing the high level demands of reliability and resource allocation in mobile networks, this paper proposes an approach for the problem of pooling deployment of virtualized network functions in virtual EPC network. First, taking pooling of VNFs into account, we design a virtual network topology for virtual EPC. Second, a node-splitting algorithm is proposed to make best use of substrate network resources. Finally, we realize the dynamic adjustment of pooling across different domains. Compared to the conventional virtual topology design and mapping method (JTDM), this approach can achieve fine-grained management and overall scheduling of node resources; guarantee systematic reliability and optimize global view of network. It is proven by a network topology instance provided by SNDlib that the approach can reduce total resource cost of the virtual network and increase the ratio of request acceptance while satisfy the high-demand reliability of the system.

This paper proposes route advertisement policies (RAP) and an inbound traffic engineering (ITE) technique for a multihomed autonomous system (AS) employing the Border Gateway Protocol (BGP) and provider aggregatable (PA) addressing. The proposed RAP avail the advantage of address aggregation benefit of PA addressing. If multiple address spaces are allocated to each of the ASes that are multihomed to multiple upstream ASes, reduction of the forwarding information base (FIB) and quick convergence are achieved. However, multihoming based on PA addressing raises two issues. First, more specific address information is hidden due to address aggregation. Second, multiple allocated address spaces per AS does not provide the capability of ITE. To cope with these two limitations, we propose i) RAP to ensure connectivity among ASes with fewer routes installed in the FIB of each top-tier AS, and ii) an ITE technique to control inbound routes into multihomed ASes. Our ITE technique does not increase the RIB and FIB sizes in the Internet core. We implement the proposed RAP in an emulation environment with BGP using the Quagga software suite and our developed Hierarchical Automatic Number Allocation (HANA) protocols. We use HANA as a tool to automatically allocate hierarchical PA addresses to ASes. We confirm that with our proposed policies the FIB and RIB (routing information base) sizes in tier-1 ASes do not change with the increase of tier-3 ASes, and the number of BGP update messages exchanged is reduced by up to 69.9% from that achieved with conventional BGP RAP. We also confirmed that our proposed ITE technique, based on selective prefix advertisement, can indeed control inbound traffic into a multihomed AS employing PA addressing.

In this paper, a compact controlled reception pattern antenna (CRPA) array based on a mu-zero resonance (MZR) antenna is proposed for a global positioning system (GPS). The MZR antenna can be minimized by designing structure based in mu-negative (MNG) transmission line. The MNG transmission line can be implemented by a gap structure for the series capacitance and a shorting via for a short-ended boundary condition. The CRPA array, which operates in L₁ (1.57542GHz) and L₂ (1.2276GHz) bands, is designed as a cylinder with a diameter and a height of 127mm (5 inches) and 20mm, respectively, and is composed of seven radiating elements. To design the compact CRPA array with high performance attributes such as an impedance matching (VSWR) value of less than 2, an isolation between array elements (<-12dB), an axial ratio (<5dB), and a circular polarization (CP) gain (>-1dBic: L₁ band and >-3dBic: L₂ band), we employ two orthogonal MZR antennas, a superstrate, and chip couplers. The performances of the CRPA antenna are verified and compared by an analytic analysis, a full-wave simulation, and measurements.

The fifth generation (5G) system using millimeter waves is considered for application to high traffic areas with a dense population of pedestrians. In such an environment, the effects of shadowing and scattering of radio waves by human bodies (HBs) on propagation channels cannot be ignored. In this paper, we clarify based on measurement the characteristics of waves scattered by the HB for typical non-line-of-sight scenarios in street canyon environments. In these scenarios, there are street intersections with pedestrians, and the angles that are formed by the transmission point, HB, and reception point are nearly equal to 90 degrees. We use a wide-band channel sounder for the 67-GHz band with a 1-GHz bandwidth and horn antennas in the measurements. The distance parameter between antennas and the HB is changed in the measurements. Moreover, the direction of the HB is changed from 0 to 360 degrees. The evaluation results show that the radar cross section (RCS) of the HB fluctuates randomly over the range of approximately 20dB. Moreover, the distribution of the RCS of the HB is a Gaussian distribution with a mean value of -9.4dBsm and the standard deviation of 4.2dBsm.

This paper proposes a novel access technique that enables uplink multiuser multiple input multiple output (MU-MIMO) access with small overhead in distributed wireless networks. The proposed access technique introduces a probe packet that is sent to all terminals to judge whether they have the right to transmit their signals or not. The probe packet guarantees high quality MU-MIMO signal transmission when a minimum mean square error (MMSE) filter is applied at the access point, which results in high frequency utilization efficiency. Computer simulation reveals that the proposed access achieves more than twice of the capacity obtained by the traditional carrier sense multiple access/collision avoidance (CSMA/CA) with a single user MIMO, when the access point with 5 antennas is surrounded by the terminals with 2 antennas.

Heterogeneous Small Cell Network (HSCN) will have wide application given its ability to improve system capacity and hot spot coverage. In order to increase the efficiency of spectrum and energy, a great deal of research has been carried out on radio resource management in HSCN. However, it is a remarkable fact that the user experience in terms of traffic rate demands has been neglected in existing research with excessive concentration on network capacity and energy efficiency. In this paper, we redefined the energy efficiency (EE) and formulate the joint optimization problem of user experience and energy efficiency maximization into a mixed integer non-linear programming (MINLP) problem. After reformulating the optimization problem, the joint subchannel (SC) allocation and power control algorithm is proposed with the help of cluster method and genetic algorithm. Simulation results show that the joint SC allocation and power control algorithm proposed has better performance in terms of user experience and energy consumption than existing algorithms.

Cellular heterogeneous networks (HetNets) with densely deployed small cells can effectively boost network capacity. The co-channel interference and the prominent energy consumption are two crucial issues in HetNets which need to be addressed. Taking the traffic variations into account, this paper proposes a theoretical framework to analyze spectral efficiency (SE) and energy efficiency (EE) considering jointly further-enhanced inter-cell interference coordination (FeICIC) and spectrum allocation (SA) via a stochastic geometric approach for a two-tier downlink HetNet. SE and EE are respectively derived and validated by Monte Carlo simulations. To create spectrum and energy efficient HetNets that can adapt to traffic demands, a non-convex optimization problem with the power control factor, resource partitioning fraction and number of subchannels for the SE and EE tradeoff is formulated, based on which, an iterative algorithm with low complexity is proposed to achieve the sub-optimal solution. Numerical results confirm the effectiveness of the joint FeICIC and SA scheme in HetNets. Meanwhile, a system design insight on resource allocation for the SE and EE tradeoff is provided.

In this paper, we study simultaneous wireless information and power transfer (SWIPT) in two-way relay channels where two users exchange information with each other via a multi-antenna relay node. The signals forwarded by the relay node are also used to supply the power to two users. We formulate a max-min optimization problem aiming to maximize the minimum harvested energy between two users to achieve fairness. We jointly optimize the relay beamforming matrix and allocating powers at the two users subject to the quality of service (QoS) constraints. To be specific, we consider the amplify-and-forward (AF) relay strategy and the time splitting SWIPT strategy. To this end, we propose two different time splitting protocols to enable relay to supply power to two users. To solve the non-convex joint optimization problem, we propose to split the original optimization problem into two subproblems and solving them iteratively to obtain the final solution. It is shown that the first subproblem dealing with the beamforming matrix can be optimally solved by using the technique of relaxed semidefinite programming (SDR), and the second subproblem, which deals with the power allocation, can be solved via linear programming. The performance comparison of two schemes as well as the one-way relaying scheme are provided and the effectiveness of the proposed schemes is verified.

Regarding IEEE 802.11 wireless local area networks (WLANs), many researchers are focusing on signal-to-noise ratio (SNR)-based rate adaptation schemes, because these schemes have the advantage of accurately selecting transmission rates that suit the channel. However, even SNR-based rate adaptation schemes work poorly in a rapidly varying channel environment. If a transmitter cannot receive accurate rate information due to fast channel fading, it encounters continuous channel errors, because the cycle of rate adaptation and rate information feedback breaks. A well-designed request-to-send/clear-to-send (RTS/CTS) frame exchange policy that accurately reflects the network situation is an indispensable element for enhancing the performance of SNR-based rate adaptation schemes. In this paper, a novel rate adaptation scheme called adaptive RTS/CTS-exchange and rate prediction (ARRP) is proposed, which adapts the transmission rate efficiently for variable network situations, including rapidly varying channels. ARRP selects a transmission rate by predicting the SNR of the data frame to transmit when the channel condition becomes worse. Accordingly, ARRP prevents continuous channel errors through a pre-emptive transmission rate adjustment. Moreover, ARRP utilizes an efficient RTS/CTS frame exchange algorithm that considers the number of contending stations and the current transmission rate of data frames, which drastically reduces both frame collisions and RTS/CTS-exchange overhead simultaneously. Simulation results show that ARRP achieves better performance than other rate adaptation schemes.

We target the estimation of antenna patterns of distributed array antenna (DAA) systems for satellite communications. Measuring DAA patterns is very difficult because of the large antenna separations involved, more than several tens of wavelengths. Our goal is to elucidate the accuracy of the DAA pattern estimation method whose inputs are actual antenna pattern data and array factors by evaluating their similarity to actually measured DAA radiation patterns. Experiments on two Ku band parabolic antennas show that their patterns can be accurately estimated even if we change the conditions such as frequency, antenna arrangement and polarization. Evaluations reveal that the method has high estimation accuracy since its errors are better than 1dB. We conclude the method is useful for the accurate estimation of DAA patterns.

This paper proposes multiple-input multiple-output (MIMO) radar waveforms consisting of Doppler-offset orthogonal complementary codes (DO-OCC) for raising the Doppler resilience of MIMO radar systems. The DO-OCC waveforms have low cross-correlation among multiplexed waves and a low autocorrelation peak sidelobe level (PSL) even in the Doppler shift condition. They are verified by computer simulations and measurements. Computer simulations show that the peak sidelobe ratio (PSR) of the DO-OCC exceeds over 60dB and the desired to undesired signal power ratio (DUR) is over 60dB in the case that the Doppler shift is 0.048 rad per pulse repetition interval (PRI). And through the experimental measurements, it has been verified that the PSR of the DO-OCC is over 40dB and the DUR is over 50dB in the case that Doppler shift is 0.05 rad per PRI and that The DO-OCC waveforms enable to maintain the direction of arrival (DOA) estimation accuracy for moving targets as almost same as the one for static targets. The results prove the effectiveness of the proposed MIMO waveforms in achieving Doppler tolerance while maintaining orthogonality and autocorrelation properties.

There is a strong demand for super-resolution time of arrival (TOA) estimation techniques for radar applications that can that can exceed the theoretical limits on range resolution set by frequency bandwidth. One of the most promising solutions is the use of compressed sensing (CS) algorithms, which assume only the sparseness of the target distribution but can achieve super-resolution. To preserve the reconstruction accuracy of CS under highly correlated and noisy conditions, we introduce a random resampling approach to process the received signal and thus reduce the coherent index, where the frequency-domain-based CS algorithm is used as noise reduction preprocessing. Numerical simulations demonstrate that our proposed method can achieve super-resolution TOA estimation performance not possible with conventional CS methods.