Performance analysis of a random ARQ initialized cooperative communication protocol in shadowed Nakagami-<Emphasis Type="Italic">m</Emphasis> wireless channel

In this paper, we develop and analyze an energy efficient ARQ (automatic repeat request) initialized transmit diversity protocol for cooperative communications. Medium access control (MAC) layer packet retransmission limit (similar to aShortRetryLimit or aLongRetryLimit [802.11–1997]) has been used as an actuator for transmit cooperative diversity initialization. We take the channel state information (CSI) as a function of retransmission tries and the number of retransmission tries is modeled as a random variable. Relays close to the source node are chosen for the transmit cooperation. Closed form expressions are obtained for symbol error rate (SER), outage capacity and outage probability for the proposed scheme in shadowed fading channels. This cooperative scheme achieves lower signal-to-noise ratio (SNR), stumpy outage probability, higher bandwidth, and transmit energy efficiencies for desired average symbol error rate (ASER) than the preceding ARQ based cooperative protocols. Finally, the results of computer simulations are included to demonstrate the efficacy of the proposed scheme and to verify the accuracy of the analytical expressions. Supported by the National Natral Science Foundation of China (Grant No. 60602058), the National High Technology Research and Development Program of China (Grant No. 2006AA01Z257)     

A bandwidth efficient two-user cooperative diversity system with limited feedback

A two-user cooperative diversity system based on Alamouti signaling was proposed, which utilizes the orthogonal structure of Alamouti signaling to make cooperative users relay on the shared channel resources so that the spectral efficiency of the traditional cooperative system can be improved. When M-ary phase shift keying (M-PSK) modulation and an improved selection decode-and-forward (SDF) relaying protocol with limited feedback are used at the users and m(m ⩾1) receive antennas are configured at the base station, the average bit-error-rate (BER) system performance for statistically similar uplink channels was derived and it was verified by simulations. Under various channel scenarios of interest, numerical and simulation results show that the diversity gain achieved and the BER performance of the proposed system increase with the interuser channel quality, and the full transmit diversity order of two can be obtained for sufficiently high interuser signal-to-noise ratios (SNRs). Supported by the National High-Tech Research & Development Program of China (Grant No. 2006AA01Z270), the National Natural Science Foundation of China-Guangdong (Grant No. U0635003), the Natural Science Foundation of Shaanxi Province (Grant No. 2007F07), the “111” Project (Grant No. B08038), and the Open Research Fund of State Key Laboratory of Rail Traffic Control and Safety, Bejing Jiaotong University (Grant No. RCS2008K003)     

Globally exponentially attractive sets of the family of Lorenz systems

In this paper, the concept of globally exponentially attractive set is proposed and used to consider the ultimate bounds of the family of Lorenz systems with varying parameters. Explicit estimations of the ultimate bounds are derived. The results presented in this paper contain all the existing results as special cases. In particular, the critical cases, b→ 1^＋ and a→0^＋, for which the previous methods failed, have been solved using a unified formula.     

Power allocation for non-orthogonal decode-and-forward cooperation protocol

This paper studies the power allocation problem for the non-orthogonal decode-and-forward (NDF) cooperation protocol with selection relaying. With the availability of the magnitudes of all channel gains at the source, the power allocation is explored that maximizes the mutual information between the source and destination subject to a total power constraint. The minimum power that avoids the outage of the relay is set as a condition, under which the power allocation problem becomes one of selecting the optimal one from several allocation factor triplets. It is shown that the power allocation scheme can provide considerable performance gain, and the non-orthogonal cooperation protocol is superior to the orthogonal protocol and direct transmission. Supported by the Project of Natural Science Foundation of Jiangsu Province (Grant No. BK2006701), the National Natural Science Foundation of China (Grant No. 60672079), and the National High-Tech Research & Development Program of China (Grant No. 2007AA01Z267)     

无线网络协作MAC 机制

协作通信利用空闲节点的天线,构成虚拟的MIMO(multiple-input multiple-output)系统,从而对抗无线信道衰落,获取分集增益.协作通信是下一代无线移动网络的关键技术,也是近几年的一个研究热点.目前,已有的研究成果大多集中在如何根据信道状态选取合适的协作节点,以增加信道容量、减低能量消耗及减小中断概率等方面.但由于协作通信改变了以往的传统通信模式,因此需要设计新的MAC(medium access control)机制(协作MAC机制),以适应协作通信的特点.针对协作MAC机制进行综述,重点讨论了协作通信中MAC机制面临的问题,并对现有的协作MAC机制进行分析和比较,最后给出协作MAC的进一步的研究方向.     

A moving object segmentation algorithm for static camera via active contours and GMM

Moving object segmentation is one of the most challenging issues in computer vision. In this paper, we propose a new algorithm for static camera foreground segmentation. It combines Gaussian mixture model (GMM) and active contours method, and produces much better results than conventional background subtraction methods. It formulates foreground segmentation as an energy minimization problem and minimizes the energy function using curve evolution method. Our algorithm integrates the GMM background model, shadow elimination term and curve evolution edge stopping term into energy function. It achieves more accurate segmentation than existing methods of the same type. Promising results on real images demonstrate the potential of the presented method. Supported by National Basic Research Program of China (Grant No. 2006CB303105), the Chinese Ministry of Education Innovation Team Fund Project (Grant No. IRT0707), the National Natural Science Foundation of China (Grant Nos. 60673109 and 60801053), Beijing Excellent Doctoral Thesis Program (Grant No. YB20081000401), Beijing Municipal Natural Science Foundation (Grant No. 4082025), and Doctoral Foundation of China (Grant No. 20070004037)     

When bode meets shannon: control-oriented feedback communication schemes

In this paper, we show a general equivalence between feedback stabilization through an analog communication channel, and a communication scheme based on feedback which is a generalization of that of Schalkwijk and Kailath. We also show that the achievable transmission rate of the scheme is given by the Bode's sensitivity integral formula, which characterizes a fundamental limitation of causal feedback. Therefore, we can now use the many results and design tools from control theory to design feedback communication schemes providing desired communication rates, and to generate lower bounds on the channel feedback capacity. We consider single user Gaussian channels with memory and memory-less multiuser broadcast, multiple access, and interference channels. In all cases, the results we obtain either achieve the feedback capacity, when this is known, recover known best rates, or provide new best achievable rates.     

Optimal MAC based cooperative spectrum sensing in cognitive radio networks

This paper considers a cognitive radio (CR) system in non-ideal fading wireless channels and pro-poses cooperative spectrum sensing schemes based on coherent multiple access channels (MAC),serving as an alternative way to improve the cooperative spectrum sensing performance and provide space diversity for spec-trum sensing.Sufficient statistics are transmitted using a common channel from the secondary users (SUs) to a fusion center (FC) where the global decision is obtained.The optimal scaling factors of the proposed schemes are obtained by maximizing the detection probability under a target false alarm probability and a transmit power constraint.Because the proposed optimal MAC scheme has high computational complexity,a sub-optimal solu-tion based on maximization of the deflection coefficient (DC) is also proposed.Simulation results show that the proposed algorithms can significantly improve the spectrum sensing performance and approach the detection baseline.     

Performance of multiple access CSK communication system with DF cooperative strategy

A multiple access chaos shift keying cooperative communication (MA-CSK-CC) system over Rayleigh fading channels and in the presence of Gaussian white noise is investigated in depth in this paper. The simplified half-duplex with a single relay decode-and-forward (DF) cooperative strategy is proposed to illustrate and analysis as an example. Exact and approximation bit-error-ratio (BER) performance expressions are derived. Simulation results demonstrate that the proposed system has a prominent advantage of high BER performance over the conventional multiple access CSK systems that have a single path to transmit signal at the same data rate over Rayleigh fading channels with additive Gaussian white noise. Moreover, based on the BER performance analysis, some useful results are also derived such as the relationships between BER versus spread spectrum factors, BER versus the number of users, etc.     

Capacity of orthogonal space-time block codes in MISO fading channels with co-channel interference and noise

Orthogonal space-time block codes(OSTBCs) are an efficient mean in order to exploit the diversity offered by the wireless multiple-input multiple-output(MIMO) channel. This paper considers capacity problems of OSTBCs over spatially correlated multiple-input single-out(MISO) Rayleigh fading channels in the presence of spatially correlated Rayleigh co-channel interference and additive Gaussian noise,and derives exact expressions of the ergodic capacity and outage probability(capacity distribution) for such OS...     

SAM-MAC: An efficient channel assignment scheme for multi-channel ad hoc networks

Using multi-channel MAC protocols in mobile ad hoc networks (MANETs) is a promising way to improve the throughput performance. Channel assignment, which directly determines the efficiency of the frequency utilization, is the critical part of multi-channel schemes. Current 802.11-like schemes of multi-channel MAC do not efficiently use the multiple channels due to the overhead caused by channel assignment. Moreover, the control channel saturation problem limits the number of channels of these previous schemes. In this paper, we propose a new scheme called SAM-MAC (Self-Adjustable Multi-channel MAC), which features with one common channel and two half-duplex transceivers for each node. A method called self-adjustment is used to reassign the channels and balance the traffic on different channels. Due to less contention in common channel and smaller channel assignment overhead, this scheme increases the throughput compared with previous approaches. Control channels are free from saturation problem and can furthermore be used for data transmission.     

Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document

In many applications, XML documents need to be modelled as graphs. The query processing of graph-structured XML documents brings new challenges. In this paper, we design a method based on labelling scheme for structural queries processing on graph-structured XML documents. We give each node some labels, the reachability labelling scheme. By extending an interval-based reachability labelling scheme for DAG by Rakesh et al., we design labelling schemes to support the judgements of reachability relationships for general graphs. Based on the labelling schemes, we design graph structural join algorithms to answer the structural queries with only ancestor-descendant relationship efficiently. For the processing of subgraph query, we design a subgraph join algorithm. With efficient data structure, the subgraph join algorithm can process subgraph queries with various structures efficiently. Experimental results show that our algorithms have good performance and scalability. Support by the Key Program of the National Natural Science Foundation of China under Grant No.60533110; the National Grand Fundamental Research 973 Program of China under Grant No. 2006CB303000; the National Natural Science Foundation of China under Grant No. 60773068 and No. 60773063.     

Performance analysis of ad-hoc routing in heterogeneous clustered multi-hop wireless networks

This paper analyzes the performance of clustered decode-and-forward multi-hop relaying (CDFMR) wireless Rayleigh fading networks, and sheds light on their design principles for energy and spectral efficiency. The focus is on a general performance analysis (over all SNR range) of heterogeneous wireless networks with possibly different numbers of relays in clusters of various separations. For clustered multi-hop relaying systems, hop-by-hop routing is known as an efficient decentralized routing algorithm which selects the best relay node in each hop using local channel state information. In this article, we combine hop-by-hop routing and cooperative diversity in CDFMR systems, and we derive (i) a closed-form expression for the probability distribution of the end-to-end SNR at the destination node; (ii) the system symbol error rate (SER) performance for a wide class of modulation schemes; and (iii) exact analytical expressions for the system ergodic capacity, the outage probability and the achievable probability of the SNR (power) gain. We also provide simple analytical asymptotic expressions for SER and the outage probability in high SNR regime. Numerical results are provided to validate the correctness of the presented analyses.     

相关衰落信道下的安全协作系统及中断性能

基于相关的瑞利衰落信道,研究安全协作系统的安全中断性能。假定发送端知道全部信道的信道状态信息,系统中存在单个窃听节点以及多个进行协作的中继节点,某个中继节点被选择作为干扰者来发送干扰信号,合法信道与干扰节点到目的节点的信道相关,窃听信道与干扰节点到窃听节点的信道也相关。在此类协作场景中,分析了信道相关性对安全协作系统安全性能的影响,获得了安全中断概率表达式。数值结果表明信道相关对安全协作系统的安全性能存在显著影响。     

Error bounds for Newton refinement of solutions to algebraic riccati equations

Recent error bounds derived from the Schur method of solving algebraic Riccati equations (ARE) complement residual error bounds associated with Newton refinement of approximate solutions. These approaches to the problem of error estimation not only work well together but also represent the first computable error bounds for the solution of Riccati equations. In this paper the closed-loop Lyapunov operator is seen to be central to the question of whether Newton refinement will improve an approximate solution (region of convergence), as well as providing a means of bounding the actual error in terms of the residual error. In turn, both of these issues are related to the condition of the ARE and the damping of the associated closed-loop dynamical system. Numerical results are given for seven problems taken from the literature. This research was supported by the National Science Foundation (and AFOSR) under Grant No. ECS87-18897 and the National Science Foundation under Grant No. DMS88-00817.     

Multi-spectral image fusion method based on two channels non-separable wavelets

A construction method of two channels non-separable wavelets filter bank which dilation matrix is [1, 1; 1,-1] and its application in the fusion of multi-spectral image are presented. Many 4×4 filter banks are designed. The multi-spectral image fusion algorithm based on this kind of wavelet is proposed. Using this filter bank, multi-resolution wavelet decomposition of the intensity of multi-spectral image and panchromatic image is performed, and the two low-frequency components of the intensity and the panchromatic image are merged by using a tradeoff parameter. The experiment results show that this method is good in the preservation of spectral quality and high spatial resolution information. Its performance in preserving spectral quality and high spatial information is better than the fusion method based on DWFT and IHS. When the parameter t is closed to 1, the fused image can obtain rich spectral information from the original MS image. The amount of computation reduced to only half of the fusion method based on four channels wavelet transform.     

Implementation of low-swing differential interface circuits for high-speed on-chip asynchronous interconnection

A novel low-swing interface circuit for high-speed on-chip asynchronous interconnection is proposed in this paper. It takes a differential level-triggered latch to recover digital signal with ultra low-swing voltage less than 50 mV, and the driver part of the interface circuit is optimized for low power using the driver-array method, With a capacity to work up to 500 MHz, the proposed circuit, which is simulated and fabricated using SMIC 0.18-pm 1.8-V digital CMOS technology, consumes less power than previously reported designs.     

Low-complexity distributed differential spacetime coding scheme for amplify-and-forward cooperative networks

By introducing a space-time coding scheme based on amicable orthogonality, we develop a distributed differential space-time coding scheme with the amplify-and-forward (AF) method for wireless cooperative networks. The scheme requires no knowledge of the channel state information at both transmitters and receivers, and effectively decreases the realization complexity due to no channel estimation. Moreover, it has lower decoding complexity and higher coding advantage than the existing scheme, thus avoiding the shortcoming of exponential decoding complexity of some existing schemes. According tothe pairwise error probability (PEP) analysis of the system, the power allocations of source and relay terminals are jointly optimized, and as a result, the PEP is minimized, which will provide a helpful guideline for system design. Numerical calculation and simulation results show that the developed scheme is superior to the existing scheme. Moreover, the scheme with optimal power allocation yields obvious performance improvement over that with equal power allocation. Supported partially by the China Postdoctoral Science Foundation (Grant No. 2005038242) and the startup fund of Nanjing University of Aeronautics and Astronautics (Grant No. S0855-041)     

A digital authentication watermarking scheme for JPEG images with superior localization and security

The drawbacks of the current authentication watermarking schemes for JPEG images, which are inferior localization and the security flaws, are firstly analyzed in this paper. Then, two counterferiting attacks are conducted on them. To overcome these drawbacks, a new digital authentication watermarking scheme for JPEG images with superior localization and security is proposed. Moreover, the probabilities of tamper detection and false detection are deduced under region tampering and collage attack separately. For each image block, the proposed scheme keeps four middle frequency points fixed to embed the watermark, and utilizes the rest of the DCT coefficients to generate 4 bits of watermark information. During the embedding process, each watermark bit is embedded in another image block that is selected by its corresponding secret key. Since four blocks are randomly selected for the watermark embedding of each block, the non-deterministic dependence among the image blocks is established so as to resist collage attack completely. At the receiver, according to judging of the extracted 4 bits of watermark information and the corresponding 9-neighbourhood system, the proposed scheme could discriminate whether the image block is tampered or not. Owing to the diminishing of false detection and the holding of tamper detection, we improve the accuracy of localization in the authentication process. Theoretic analysis and simulation results have proved that the proposed algorithm not only has superior localization, but also enhances the systematic security obviously. Supported by the National Natural Science Foundation of China (Grant No. 60572027), the Program for New Century Excellent Talents in University of China (Grant No. NCET-05-0794), the Sichuan Youth Science & Technology Foundation (Grant No. 03ZQ026-033), the National Defense Pre-research Foundation of China (Grant No. 51430804QT2201) and the Application Basic Foundation of Sichuan Province, China (Grant No. 2006 J13-10)