Zhe ZHANG Xin CHEN De-jun QIAN Chen HU
Dynamic Voltage Scaling (DVS) is a well-known low-power design technique, which adjusts the clock speed and supply voltage dynamically to reduce the energy consumption of real-time systems. Previous studies considered the probabilistic distribution of tasks' workloads to assist DVS in task scheduling. These studies use probability information for intra-task frequency scheduling but do not sufficiently explore the opportunities for the system workload to save more energy. This paper presents a novel DVS algorithm for periodic real-time tasks based on the analysis of the system workload to reduce its power consumption. This algorithm takes full advantage of the probabilistic distribution characteristics of the system workload under priority-driven scheduling such as Earliest-Deadline-First (EDF). Experimental results show that the proposed algorithm reduces processor idle time and spends more busy time in lower-power speeds. The measurement indicates that compared to the relative DVS algorithms, this algorithm saves energy by at least 30% while delivering statistical performance guarantees.
Ha X. NGUYEN Ha H. NGUYEN Tho LE-NGOC
A stochastic quasi-gradient algorithm is applied to design linear dispersion (LD) codes for two-way wireless relay networks under Rayleigh fading channels. The codes are designed to minimize an upper bound of the average pairwise error probability. Simulation results show that the codes obtained by the optimization technique achieve a coding gain over codes that are randomly generated based on the isotropic distribution.
Lei WANG Baoyu ZHENG Qingmin MENG Chao CHEN
Based on Free Probability Theory (FPT), which has become an important branch of Random Matrix Theory (RMT), a new scheme of frequency band sensing for Cognitive Radio (CR) in Direct-Sequence Code-Division Multiple-Access (DS-CDMA) multiuser network is proposed. Unlike previous studies in the field, the new scheme does not require the knowledge of the spreading sequences of users and is related to the behavior of the asymptotic free behavior of random matrices. Simulation results show that the asymptotic claims hold true even for a small number of observations (which makes it convenient for time-varying topologies) outperforming classical energy detection scheme and another scheme based on random matrix theory.
Trung Quang DUONG Le-Nam HOANG Vo Nguyen Quoc BAO
The performance of two-way amplify-and-forward (AF) relay networks is presented. In particular, we derive exact closed-form expressions for symbol error rate (SER), average sum-rate, and outage probability of two-way AF relay systems in independent but not identically distributed (i.n.i.d.) Rayleigh fading channels. Our analysis is validated by a comparison against the results of Monte-Carlo simulations.
Ryo NOMURA Toshiyasu MATSUSHIMA Shigeichi HIRASAWA
The joint source-channel coding problem is considered. The joint source-channel coding theorem reveals the existence of a code for the pair of the source and the channel under the condition that the error probability is smaller than or equal to ε asymptotically. The separation theorem guarantees that we can achieve the optimal coding performance by using the two-stage coding. In the case that ε = 0, Han showed the joint source-channel coding theorem and the separation theorem for general sources and channels. Furthermore the ε-coding theorem (0 ≤ ε <1) in the similar setting was studied. However, the separation theorem was not revealed since it is difficult in general. So we consider the separation theorem in this setting.
Recently proposed coded bi-directional relaying protocols increase the spectral efficiency by using network codes, which rely on joint packet encoding and exploitation of previously transmitted and stored information. In this letter, we derive the cumulative density function (CDF) and the probability density function (PDF) of received signal-to-noise ratios (SNRs) for two-phase and three-phase bi-directional coded relaying protocols, respectively, over Rayleigh fading channels. Using these results, we compare the outage performances as well as the average capacities of the protocols. From the numerical observations, we can see that the two-phase protocol has better link-level performances than the three-phase protocol when required data rate is greater than 2 for outate performance and transmit SNR at each node is greater than 18 dB for average capacity, respectively. Otherwise, the three-phase protocol performs better.
Hui HUI Shihua ZHU Gangming LV
In this letter, power allocation methods are devised for Amplify-and-Forward (AF) opportunistic relaying systems aiming at minimizing the outage probability. First, we extend the result on outage probability in and develop an approximate expression to simplify the power allocation problem. A corresponding optimization problem is constructed and proved to be convex. Then an iterative numerical method is proposed to find the optimal power allocation factor. We also propose a near-optimal method which can directly calculate the power allocation factor to reduce computational complexity. Numerical results show that the proposed methods have a similar performance with the ideal one, and outperform equal power allocation significantly with little overhead.
Bao Quoc VO-NGUYEN Hyung Yun KONG
This letter provides a study on the end-to-end performance of multi-hop wireless communication systems equipped with re-generative (decode-and-forward) relays over Rayleigh fading channels. More specifically, the probability density function (pdf) of the tightly approximated end-to-end signal-to-noise ratio (SNR) of the systems is derived. Using this approximation allows us to avoid considering all possible combinations of correct and erroneous decisions at the relays for which the end-to-end transmission is error-free. The proposed analysis offers a simple and unifying approach as well as reduces computation burden in evaluating important multi-hop system's performance metrics. Simulations are performed to verify the accuracy and to show the tightness of the theoretical analysis.
Katsumi SAKAKIBARA Jumpei TAKETSUGU
We propose the use of an invertible code in cooperative multi-hop relaying networks. The effect of the code on the probability that an information block is undelivered to the destination is analyzed at the link level with a simple network topology. Numerical results indicate that significant improvement is feasible by an incorporation of an invertible code, since an information block can be reproduced by correcting channel errors in the received blocks at a relaying node.
It has been proved that wireless network coding can increase the throughput of multi-access system [2] and bi-directional system [5] by taking the advantage of the broadcast nature of electromagnetic waves. In this paper, we introduce the wireless network coding to cooperative multicast system. We establish a basic 2-source and 2-destination cooperative system model with arbitrary number of relays (2-N-2 system). Then two regenerative network coding (RNC) protocols are designed to execute the basic idea of network coding in complex field (RCNC) and Galois field (RGNC) respectively. We illuminate how network coding can enhance the throughput distinctly in cooperative multicast system. Power allocation schemes as well as precoder design are also carefully studied to improve the system performance in terms of system frame error probability (SFEP).
This letter derives the packet error rate (PER) in terms of the retry limit and the channel error probability in wireless local area networks (WLANs), when an additional number of retries is allocated to a block of packets to be transmitted. We prove that the lower bound of the PER is the dropping probability which is defined as the probability of any given packet being dropped after its retry limit has been reached.
The binary exponential back-off mechanism is one of the basic elements that constitute the IEEE 802.11 protocol. The models of the back-off mechanism have been developed with the assumption that collisions occur only due to nodes within the carrier sensing range and the collision probability is constant in steady-state. However, the transmission collisions can occur due to hidden nodes and these tend to occur consecutively, contrary to the collisions due to nodes within the carrier sensing range. Consecutive collisions increase the back-off time exponentially, resulting in less frequent transmission attempts. Ignoring this collision characteristic in modeling the back-off mechanism can produce large errors in the performance analysis of networks. In this paper, we model the back-off process as a Markov renewal process by taking into account such consecutive collisions due to hidden nodes, and then compare this result with NS2 simulation results. According to the simulation results, the proposed model reduces the relative error in the attempt probability by more than 90% in the grid topology. We also propose a new collision model for a simple network considering consecutive collisions due to hidden nodes, and analyze the network under saturated traffic condition using the proposed models. The attempt and collision probabilities are estimated with high accuracy.
Mariusz GABOWSKI Maciej STASIAK Arkadiusz WINIEWSKI Piotr ZWIERZYKOWSKI
This article proposes a method that can calculate the blocking probability of multi-service cellular systems with Wideband Code Division Multiple Access radio interface. The method considers a finite and an infinite source population and takes into account the interdependency of calls service processes in neighboring cells and in both the uplink and the downlink directions. The basis of the proposed method is the fixed-point methodology. A comparison of the results of analytical calculations to those of simulations confirms the accuracy of the proposed method. The proposed scheme can realize cost-effective radio resource management in 3G mobile networks and can be easily applied to network capacity calculations.
In this paper, we derive the exact average symbol error probability (SEP) of M-ary phase-shift keying and quadrature amplitude modulation signals over Stacy fading channels. The Stacy fading is modelled by a three-parameter generalized gamma or physically α-µ fading distribution, spanning a wide range of small-scale fading such as Rayleigh, Nakagami-m, and Weibull fading. The average SEP is generally expressed in terms of (generalized) Fox's H-functions, which particularizes to the previously known results for some special cases. We further analyze the diversity order achieved by orthogonal space-time block codes in multiple-input multiple-output (MIMO) Stacy fading channels.
Nurilla AVAZOV Yun Hee KIM Iickho SONG
In this letter, we propose a multi-cell cooperation method for broadcast packet transmission in the OFDM-based cellular system with multiple transmit antennas. In the proposed method, to transmit two streams of spatially demultiplexed or transmit diversity coded symbols, we divide a coded packet into subparts to each of which different cell group and antenna pairs are assigned. It is shown that the proposed method reduces the outage probability with only negligible increase in channel estimation.
Hirokazu OZAKI Atsushi KARA Zixue CHENG
In this paper we investigate the reliability of general type shared protection systems i.e. M for N (M:N) that can typically be applied to various telecommunication network devices. We focus on the reliability that is perceived by an end user of one of N units. We assume that any failed unit is instantly replaced by one of the M units (if available). We describe the effectiveness of such a protection system in a quantitative manner. The mathematical analysis gives the closed-form solution of the availability, the recursive computing algorithm of the MTTFF (Mean Time to First Failure) and the MTTF (Mean Time to Failure) perceived by an arbitrary end user. We also show that, under a certain condition, the probability distribution of TTFF (Time to First Failure) can be approximated by a simple exponential distribution. The analysis provides useful information for the analysis and the design of not only the telecommunication network devices but also other general shared protection systems that are subject to service level agreements (SLA) involving user-perceived reliability measures.
Wannaree WONGTRAIRAT Pornchai SUPNITHI
In this paper, we derive the average bit error probability (BEP) for common digital modulation schemes and the outage probability of double Nakagami-m channels with MRC diversity. First, the probability density function (PDF) and moment generating function (MGF) of received signal with maximal ratio combining (MRC) receiver diversity are computed. The derived MGF results are simplified in terms of a generalized hypergeometric function 2F0. The derived BEP expressions find applications in existing wireless systems such as satellite mobile communication system, mobile-to-mobile communication system and multiple-input multiple-output (MIMO) wireless communication system. In addition, the obtained general MGF expression considers combined Rayleigh Nakagami-m, double Rayleigh, single Rayleigh, single Nakagami-m, and non-fading or additive white Gaussian noise (AWGN) channels as special cases. The simulation results agree well with the theoretical results.
Taegeun OH Sanghoon LEE Gye-Tae GIL
A cell planning and resource allocation scheme called EBRD (Enhanced Bandwidth and Region Division) is presented for improving channel capacity and for maintaining a proper QoS (Quality of Service) over the downlink OFDMA (Orthogonal Frequency Division Multiple Access) system. Through an optimal combination of sectorization and frequency overlay, the EBRD scheme improves both channel capacity and outage probability. In order to analyze the performance of the proposed algorithm, the outage probability is obtained as a closed numerical form. In the simulation, the EBRD scheme outperforms 3-sectorization in terms of throughput and outage probability.
Hitomi TAMURA Kenji KAWAHARA Yuji OIE
Traffic Engineering (TE) is important for improving QoS in forwarding paths by efficient use of network resources. In fact, MPLS allows several detour paths to be (pre-)established for some source-destination pair as well as its primary path of minimum hops. Thus, we focus on a two-phase path management scheme using these two kinds of paths. In the first phase, each primary path is allocated to a flow on a specific source-destination pair if the path is not congested, i.e., if its utilization is less than some predetermined threshold; otherwise, as the second phase, one of the detour paths is allocated randomly if the path is available. Therefore, in this paper, we analytically evaluate this path management scheme by extending the M/M/c/c queueing system, and through some numerical results we investigate the impact of a threshold on the flow-blocking probability. Through some numerical results, we discuss the adequacy of the path management scheme for MPLS-TE.
Won Joon LEE Jaeyoon LEE Dongweon YOON Sang Kyu PARK
In a multi-user orthogonal frequency division multiplexing (OFDM) system, efficient resource allocation is required to provide service to more users. In this letter, we propose an improved subcarrier allocation algorithm that can increase the spectral efficiency and the number of total transmission bits even if the number of users is too large. The proposed algorithm is divided into two stages. In the first stage, a group of users who are eligible for services is determined by using the bit error rate (BER), the users' minimum data rate requirement, and channel information. In the second stage, subcarriers are first allocated to the users on the basis of channel state, and then the reallocation is performed so that resource waste is minimized. We show that the proposed algorithm outperforms the conventional one on the basis of outage probability, spectral efficiency, and the number of total transmission bits through a computer simulation.