Sangho NAM Kyunbyoung KO Daesik HONG
This letter presents a method for obtaining an exact average symbol error rate (ASER) of M-phase shift keying (M-PSK) transmission for the Nth best opportunistic amplify-and-forward (OAF) relay systems over Rayleigh fading channels. This approach begins with deriving the relay selection probability when a relay is selected as the Nth best one with respect to the received signal-to-noise ratio. We then derive the modified moment generating function (MGF) for the Nth best OAF relay systems by taking the given Nth best-relay selection probability into consideration. Based on the modified MGF, we derive the exact ASER which accurately explicates the Nth best OAF relay system characteristics. Simulation results confirm the exactness of the analysis results for M-PSK transmission with respect to the number of relays, the Nth best relay selection, and the relay position.
To overcome the shortcomings of conventional cellular positioning, a novel cooperative location algorithm that uses the available peer-to-peer communication between the mobile terminals (MTs) is proposed. The main idea behind the proposed approach is to incorporate the long- and short-range location information to improve the estimation of the MT's coordinates. Since short-range communications among MTs are characterized by high line-of-sight (LOS) probability, an improved spring-model-based cooperative location method can be exploited to provide low-cost improvement for cellular-based location in the non-line-of-sight (NLOS) environments.
Minseok KIM Yohei KONISHI Jun-ichi TAKADA Boxin GAO
This letter proposes an automatic IQ imbalance compensation technique for quadrature modulators by means of spectrum measurement of RF signal using a spectrum analyzer. The analyzer feeds back only magnitude information of the frequency spectrum of the signal. To realize IQ imbalance compensation, the conventional method of steepest descent is modified; the descent direction is empirically determined and a variable step-size is introduced for accelerating convergence. The experimental results for a four-channel transmitter operating at 11 GHz are presented for verification.
Kyungchul SHIN Youngsun KIM Chul-Hee KANG
This letter considers problems with an efficient link layer multicasting technique in a wireless personal area network environment using a directional antenna. First, we propose an adaptive directional multicast scheme (ADMS) for delay-sensitive applications in mmWave WPAN with directional antenna. Second, the proposed ADMS aims to improve throughput as well as satisfy the application-specific delay requirements. We evaluate the performances of legacy Medium Access Control, Life Centric Approach, and adaptive directional multicast schemes via QualNet 5.0. Our results show that the proposed scheme provides better performance in terms of total network throughput, average transmission time, packet delivery ratio and decodable frame ratio.
Chien-Sheng CHEN Jium-Ming LIN Wen-Hsiung LIU Ching-Lung CHI
To achieve more accurate measurements of the mobile station (MS) location, it is possible to integrate many kinds of measurements. In this paper we proposed several simpler methods that utilized time of arrival (TOA) at three base stations (BSs) and the angle of arrival (AOA) information at the serving BS to give location estimation of the MS in non-line-of-sight (NLOS) environments. From the viewpoint of geometric approach, for each a TOA value measured at any BS, one can generate a circle. Rather than applying the nonlinear circular lines of position (LOP), the proposed methods are much easier by using linear LOP to determine the MS. Numerical results demonstrate that the calculation time of using linear LOP is much less than employing circular LOP. Although the location precision of using linear LOP is only reduced slightly. However, the proposed efficient methods by using linear LOP can still provide precise solution of MS location and reduce the computational effort greatly. In addition, the proposed methods with less effort can mitigate the NLOS effect, simply by applying the weighted sum of the intersections between different linear LOP and the AOA line, without requiring priori knowledge of NLOS error statistics. Simulation results show that the proposed methods can always yield superior performance in comparison with Taylor series algorithm (TSA) and the hybrid lines of position algorithm (HLOP).
The quasi-ARX neurofuzzy (Q-ARX-NF) model has shown great approximation ability and usefulness in nonlinear system identification and control. It owns an ARX-like linear structure, and the coefficients are expressed by an incorporated neurofuzzy (InNF) network. However, the Q-ARX-NF model suffers from curse-of-dimensionality problem, because the number of fuzzy rules in the InNF network increases exponentially with input space dimension. It may result in high computational complexity and over-fitting. In this paper, the curse-of-dimensionality is solved in two ways. Firstly, a support vector regression (SVR) based approach is used to reduce computational complexity by a dual form of quadratic programming (QP) optimization, where the solution is independent of input dimensions. Secondly, genetic algorithm (GA) based input selection is applied with a novel fitness evaluation function, and a parsimonious model structure is generated with only important inputs for the InNF network. Mathematical and real system simulations are carried out to demonstrate the effectiveness of the proposed method.
Jianfeng LU Ruixuan LI Jinwei HU Dewu XU
Separation-of-Duty (SoD) is a fundamental security principle for prevention of fraud and errors in computer security. It has been studied extensively in traditional access control models. However, the research of SoD policy in the recently proposed usage control (UCON) model has not been well studied. This paper formulates and studies the fundamental problem of static enforcement of static SoD (SSoD) policies in the context of UCONA, a sub-model of UCON only considering authorizations. Firstly, we define a set-based specification of SSoD policies, and the safety checking problem for SSoD in UCONA. Secondly, we study the problem of determining whether an SSoD policy is enforceable. Thirdly, we show that it is intractable (coNP-complete) to direct statically enforce SSoD policies in UCONA, while checking whether a UCONA state satisfies a set of static mutually exclusive attribute (SMEA) constraints is efficient, which provides a justification for using SMEA constraints to enforce SSoD policies. Finally, we introduce a indirect static enforcement for SSoD policies in UCONA. We show how to generate the least restrictive SMEA constraints for enforcing SSoD policies in UCONA, by using the attribute-level SSoD requirement as an intermediate step. The results are fundamental to understanding SSoD policies in UCON.
In this paper, we derive a simple formula to generate a wide-sense systematic generator matrix(we call it quasi-systematic) B for a Reed-Solomon code. This formula can be utilized to construct an efficient interpolation based erasure-only decoder with time complexity O(n2) and space complexity O(n). Specifically, the decoding algorithm requires 3kr + r2 - 2r field additions, kr + r2 + r field negations, 2kr + r2 - r + k field multiplications and kr + r field inversions. Compared to another interpolation based erasure-only decoding algorithm derived by D.J.J. Versfeld et al., our algorithm is much more efficient for high-rate Reed-Solomon codes.
Hee-Suk PANG Jun-Seok LIM Oh-Jin KWON Bhum Jae SHIN
We propose an iterative frequency estimation method for accuracy improvement of discrete Fourier transform (DFT) phase-based methods. It iterates frequency estimation and phase calculation based on the DFT phase-based methods, which maximizes the signal-to-noise floor ratio at the frequency estimation position. We apply it to three methods, the phase difference estimation, the derivative estimation, and the arctan estimation, which are known to be among the best DFT phase-based methods. Experimental results show that the proposed method shows meaningful reductions of the frequency estimation error compared to the conventional methods especially at low signal-to-noise ratio.
This study shows a fast simulation method of turbo codes over slow Rayleigh fading channels. The reduction of the simulation time is achieved by applying importance sampling (IS). The conventional IS method of turbo codes over Rayleigh fading channels focuses only on modification of additive white Gaussian noise (AWGN) sequences. The proposed IS method biases not only AWGNs but also channel gains of the Rayleigh fading channels. The computer runtime of the proposed method is about 1/5 of that of the conventional IS method on the evaluation of a frame error rate of 10-6. When we compare with the Monte Carlo simulation method, the proposed method needs only 1/100 simulation runtime under the condition of the same accuracy of the estimator.
This letter proposes two efficient schemes for the joint estimation of symbol timing offset (STO) and carrier frequency offset (CFO) in orthogonal frequency division multiplexing (OFDM) based IEEE 802.16e systems. Avoiding the effects of inter symbol interference (ISI) over delay spread by the multipath fading channel is a primary purpose in the letter. To do this, the ISI-corrupted CP is excluded when a correlation function is devised for both schemes, achieving the improved performance. To demonstrate the efficiency of the proposed methods, the performance is compared with the conventional method and is evaluated by the mean square error (MSE), acquisition range of CFO, and complexity comparison.
Kenji LEIBNITZ Tetsuya SHIMOKAWA Hiroaki UMEHARA Tsutomu MURATA
Network structures can be found in almost any kind of natural or artificial systems as transport medium for communication between the respective nodes. In this paper we study certain key topological features of brain functional networks obtained from functional magnetic resonance imaging (fMRI) measurements. We compare complex network measures of the extracted topologies with those from Internet service providers (ISPs). Our goal is to identify important features which will be helpful in designing more robust and adaptive future information network architectures.
Yusuke SAKUMOTO Hiroyuki OHSAKI Makoto IMASE
In this paper, we investigate the performance of Thorup's algorithm by comparing it to Dijkstra's algorithm for large-scale network simulations. One of the challenges toward the realization of large-scale network simulations is the efficient execution to find shortest paths in a graph with N vertices and M edges. The time complexity for solving a single-source shortest path (SSSP) problem with Dijkstra's algorithm with a binary heap (DIJKSTRA-BH) is O((M + N) log N). An sophisticated algorithm called Thorup's algorithm has been proposed. The original version of Thorup's algorithm (THORUP-FR) has the time complexity of O(M + N). A simplified version of Thorup's algorithm (THORUP-KL) has the time complexity of O(M α(N) + N) where α(N) is the functional inverse of the Ackerman function. In this paper, we compare the performances (i.e., execution time and memory consumption) of THORUP-KL and DIJKSTRA-BH since it is known that THORUP-FR is at least ten times slower than Dijkstra's algorithm with a Fibonaccii heap. We find that (1) THORUP-KL is almost always faster than DIJKSTRA-BH for large-scale network simulations, and (2) the performances of THORUP-KL and DIJKSTRA-BH deviate from their time complexities due to the presence of the memory cache in the microprocessor.
Hiroaki MUKAI Fumihiko TANO Masaki TANAKA Seiji KOZAKI Hideaki YAMANAKA
PON (Passive Optical Network) achieves FTTH (Fiber To The Home) economically, by sharing an optical fiber among plural subscribers. Recently, global climate change has been recognized as a serious near term problem. Power saving techniques for electronic devices are important. In PON system, the ONU (Optical Network Unit) power saving scheme has been studied and defined in XG-PON. In this paper, we propose an ONU power saving scheme for EPON. Then, we present an analysis of the power reduction effect and the data transmission delay caused by the ONU power saving scheme. According to the analysis, we propose an efficient provisioning method for the ONU power saving scheme which is applicable to both of XG-PON and EPON.
Gilnam KIM Hyoungjoo LEE Kwang Bok LEE
The future wireless mobile communication networks are expected to provide seamless wireless access and data exchange to mobile users. In particular, it is expected that the demand for ubiquitous data exchange between mobile users will increase with the widespread use of various wireless applications of the intelligent transportation system (ITS) and intelligent vehicles. Mobile ad hoc networks (MANETs) are one of the representative research areas pursuing the technology needed to satisfy the increasing mobile communication requirements. However, most of the works on MANET systems do not take into account the continuous and dynamic changes of nodal mobility to accommodate system design and performance evaluation. The mobility of nodes limits the reliability of communication between the source and the destination node since a link between two continuously moving nodes is established only when one node enters the transmission range of the other. To alleviate this problem, mobile relay has been studied. In particular, it is shown that relay selection is an efficient way to support nodal mobility in MANET systems. In this paper, we propose a mobility-based relay selection algorithm for the MANET environment. Firstly, we define the lifetime as the maximum link duration for which the link between two nodes remains active. Therefore, the lifetime indicates the reliability of the relay link which measures its capability to successfully support relayed communication when requested by the source node. Furthermore, we consider a series of realistic scenarios according to the randomness of nodal mobility. Thus, the proposed algorithm can be easily applied in practical MANET systems by choosing the appropriate node mobility behavior. The numerical results show that the improved reliability of the proposed algorithm's relayed communication is achieved with a proper number of mobile relay nodes rather than with the conventional selection algorithm. Lastly, we show that random mobility of the individual nodes enhances reliability of the network in a sparse network environment.
Mankyu PARK Minsu SHIN Deockgil OH Doseob AHN Byungchul KIM Jaeyong LEE
A transmission control protocol (TCP) using an additive increase multiplicative decrease (AIMD) algorithm for congestion control plays a leading role in advanced Internet services. However, the AIMD method shows only low link utilization in lossy networks with long delay such as satellite networks. This is because the cwnd dynamics of TCP are reduced by long propagation delay, and TCP uses an inadequate congestion control algorithm, which does not distinguish packet loss from wireless errors from that due to congestion of the wireless networks. To overcome these problems, we propose an exponential recovery (ER) TCP that uses the exponential recovery function for rapidly occupying available bandwidth during a congestion avoidance period, and an adaptive congestion window decrease scheme using timestamp base available bandwidth estimation (TABE) to cope with wireless channel errors. We simulate the proposed ER-TCP under various test scenarios using the ns-2 network simulator to verify its performance enhancement. Simulation results show that the proposal is a more suitable TCP than the several TCP variants under long delay and heavy loss probability environments of satellite networks.
Kenji HASHIMOTO Hiroto KAWAI Yasunori ISHIHARA Toru FUJIWARA
This paper discusses verification of the security against inference attacks on XML databases in the presence of a functional dependency. So far, we have provided the verification method for k-secrecy, which is a metric for the security against inference attacks on databases. Intuitively, k-secrecy means that the number of candidates of sensitive data (i.e., the result of unauthorized query) of a given database instance cannot be narrowed down to k-1 by using available information such as authorized queries and their results. In this paper, we consider a functional dependency on database instances as one of the available information. Functional dependencies help attackers to reduce the number of the candidates for the sensitive information. The verification method we have provided cannot be naively extended to the k-secrecy problem with a functional dependency. The method requires that the candidate set can be captured by a tree automaton, but the candidate set when a functional dependency is considered cannot be always captured by any tree automaton. We show that the ∞-secrecy problem in the presence of a functional dependency is decidable when a given unauthorized query is represented by a deterministic topdown tree transducer, without explicitly computing the candidate set.
Jeonghwa YOO Sangho CHOE Nazcar PINE
We present MIMO-OFDM based broadband power line communication (BPLC) that uses antenna and fading diversity. We evaluate the proposed MIMO-OFDM over BPLC channels, with or without cross-talk between antenna paths. The proposed scheme employs maximum ratio combining (MRC) that effectively combines both multiple antenna diversity gain and multipath fading diversity gain over 3-phase (22 MIMO, outdoor) or 1-phase (SISO, indoor) power line channels. Simulation results prove the performance advantage of the proposed scheme, whether or not cross-talk exists, over existing schemes.
In this work, the effect of device dimension variation and metal wiring scheme on the RF performance of MOSFETs based on 0.13-µm RFCMOS technology has been investigated. Two sets of experiments have been carried out. In the first experiment, two types of source metal wiring options, each with various gate poly pitches, have been investigated. The results showed that the extrinsic capacitances (Cegs, Cegd) and parasitic resistances tend to increase with increasing gate poly pitch. Both cutoff frequency (fT) and maximum oscillation frequency (fmax) showed substantial degradation for the larger gate poly pitches. Based on measurement, we propose a simplified model for extrinsic parasitic capacitance as a function of gate poly pitch with different source metal wiring schemes. For the second experiment, the impact of gate metal wiring scheme and the number of gate fingers Nf on the RF performance of MOSFET has been studied. Two different types of gate metal wiring schemes, one with poly layer and the other with M2 layer, are compared. The measurement showed that the capacitance is slightly increased, while gate resistance significantly reduced, with the M2 gate wiring. As a result, fT is slightly degraded but fmax is significantly improved, especially for larger Nf, with the M2 gate wiring. The results in this work provide useful information regarding device dimension and metal wiring scheme for various RF applications of RF CMOS technology.
Yung-Yi WANG Hsu-Jah HU Yen-Lin CHEN
In this study, a precoding scheme based on QR-decomposition is proposed for mitigating the inter-carrier-interference (ICI) in orthogonal-frequency-division-multiplexing (OFDM) systems. The proposed approach first subjects the ICI matrix to QR decomposition so that the ICI effect is transformed into its spectrally causal equivalent. With this causality, the precoding can then be conducted based on the resultant spectrally causal matrix. In addition, by using the stationary property of the ICI factors, in conjunction with zero padding, we implement the QR-based precoding in a segmentation manner which can significantly alleviate the computational complexity imposed by QR decomposition while eliminating ICI within each segment. This study also analyzes the residue interference power induced by the segmentation. The residue interference power is then accordingly used to determine the order of zero padding. Computer simulations support the validity of the proposed approach.