State Key Laboratory of Integrated Services Networks

Fengcheng, China

State Key Laboratory of Integrated Services Networks

Fengcheng, China
Time filter
Source Type

Guo Y.,State Key Laboratory of Integrated Services Networks | Guo Y.,Xidian University | Yang Q.,State Key Laboratory of Integrated Services Networks | Yang Q.,Xidian University | Kwak K.S.,Inha University
IEEE Transactions on Vehicular Technology | Year: 2017

In this paper, we propose a resource management scheme for on-demand video streaming in orthogonal frequency-division multiple access (OFDMA) networks with both time-varying channels and a user's personalized quality requirement. We design a user quality satisfaction model to evaluate the degree of the user quality satisfaction with respect to his/her personalized quality requirement. To perform the dynamic resource management, we propose a joint rate control (RC) associated with the quality adjustment at the application layer and resource allocation (RA) associated with the power allocation and subcarrier assignment at the physical layer. By using the Lyapunov optimization technique, we develop a joint RC and RA (JRCRA) algorithm to maximize the time-averaged quality satisfaction of all users (QSAU). We show that the QSAU achieved by the JRCRA algorithm without any prior knowledge of the channel statistics can arbitrarily attain the optimal QSAU achieved by the algorithm with a complete knowledge of the channel statistics. Simulation results verify the advantages of the proposed JRCRA algorithm. © 2016 IEEE.

Zeng M.,Shanghai JiaoTong University | Zeng M.,State Key Laboratory of Integrated Services Networks | Luo Y.,Shanghai JiaoTong University | Luo Y.,China Mobile | Gong G.,University of Waterloo
IEEE International Symposium on Information Theory - Proceedings | Year: 2012

A well-known operator of vectors over finite field is the derivative, which is used to investigate the complexity of vectors in game theory, communication theory and cryptography. According to the operator, a corresponding complexity of the vector is called (the first) depth, which also contributes to two other definitions (the second and the third depths) by using polynomial factor and high order difference, respectively. For an n-dimensional vector over F q (a finite field with q elements and characteristic p), the three depths are the same as its linear complexity if n = p r (r ≥ 0). In this paper, by investigation on vectors s of length n (or equivalent sequences of period n) with infinite third depth, and the cyclic-left-shift-difference operator E-1 on s, long least ultimate period sequences {(E-1) i(s)} i≥0 are constructed with high probability over big alphabet using lightweight calculation. Furthermore, distributions of sequences s with period n = p r-1 (r > 0), are described in terms of the least ultimate periods of {(E-1) i (s)} i≥0. In addition, we depict circulant matrix structure of the operator (E - 1) i for 0 < i < n and determine its rank. Some upper bounds on the ultimate period of {(E-1) i (s)} i≥0 and a method to determine the least ultimate period are provided. The least ultimate period presents an adversary a sufficient condition to win the rotating-table game with rapid counteraction (RGRC). © 2012 IEEE.

Wang Y.,Shanghai JiaoTong University | Wang Y.,State Key Laboratory of Integrated Services Networks | Chen W.,Shanghai JiaoTong University | Chen W.,China Mobile | Tellambura C.,University of Alberta
IEEE Communications Letters | Year: 2010

The partial transmit sequence (PTS) technique has received much attention in reducing the high peak to average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. However, the PTS technique requires an exhaustive search of all combinations of the allowed phase factors, and the search complexity increases exponentially with the number of sub-blocks. In this paper, a novel method based on parametric minimum cross entropy (PMCE) is proposed to search the optimal combination of phase factors. The PMCE algorithm not only reduces the PAPR significantly, but also decreases the computational complexity. The simulation results show that it achieves more or less the same PAPR reduction as that of exhaustive search. © 2010 IEEE.

Zhuang Z.,Shanghai JiaoTong University | Zhuang Z.,State Key Laboratory of Integrated Services Networks | Luo Y.,Shanghai JiaoTong University | Luo Y.,Nanjing Southeast University | And 2 more authors.
Designs, Codes, and Cryptography | Year: 2013

The relative generalized Hamming weight (RGHW) of a linear code C and a subcode C 1 is an extension of generalized Hamming weight. The concept was firstly used to protect messages from an adversary in the wiretap channel of type II with illegitimate parties. It was also applied to the wiretap network II for secrecy control of network coding and to trellis-based decoding algorithms for complexity estimation. For RGHW, bounds and code constructions are two related issues. Upper bounds on RGHW show the possible optimality for the applications, and code constructions meeting upper bounds are for designing optimal schemes. In this article, we show indirect and direct code constructions for known upper bounds on RGHW. When upper bounds are not tight or constructions are hard to find, we provide two asymptotically equivalent existence bounds about good code pairs for designing suboptimal schemes. Particularly, most code pairs (C, C 1) are good when the length n of C is sufficiently large, the dimension k of C is proportional to n and other parameters are fixed. Moreover, the first existence bound yields an implicit lower bound on RGHW, and the asymptotic form of this existence bound generalizes the usual asymptotic Gilbert-Varshamov bound. © 2012 Springer Science+Business Media, LLC.

Ma C.,Guilin University of Electronic Technology | Ma C.,State Key Laboratory of Integrated Services Networks | Ao J.,Guilin University of Electronic Technology
Journal of Convergence Information Technology | Year: 2011

In this paper, we present an improved Rivest's ring signature scheme. In our scheme, the size of the signature is only related to the ring members, and the signer needs no to publish amount of random numbers. On this basis, we propose a group-oriented ring signature. In this scheme, only the person who belongs to the designated group can verify the validity of the ring signature. The security of these two schemes can be proved by using Forking Lemmas.

Su C.-M.,Guilin University of Electronic Technology | Su C.-M.,State Key Laboratory of Integrated Services Networks | Wei Y.-Z.,Guilin University of Electronic Technology | Wei Y.-Z.,CAS Institute of Software | Ma C.-B.,Guilin University of Electronic Technology
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology | Year: 2012

3D cipher is a new block cipher with Substitution-Permutation Network (SPN) structure. Unlike the Advanced Encryption Standard (AES), 3D cipher uses a 3-dimensional state. Based on the structure of 3D cipher, a 5-round meet-in-the-middle distinguisher and a new attack on 10-round 3D are found. It is shown that the attack requires a data complexity of about 2 128 chosen plaintexts and a time complexity of about 2 331.1 10-round 3D encryptions. Compared with the previous published cryptanalytic results, the attack reduces the data complexity and time complexity efficiently.

Ding Y.,South China University of Technology | Ding Y.,State Key Laboratory of Integrated Services Networks | Ding Y.,Sino French Research Center in Information and Communication | Li N.,South China Normal University | And 5 more authors.
IEEE Transactions on Signal Processing | Year: 2016

This paper investigates the widely linear processing (WLP) for the detection of circular signals such as M-ary phase shift keying (MPSK) signals, M-ary quadrature amplitude modulation (MQAM) signals. Firstly, a unified mathematical model is derived to describe the conjugate symmetry of general MPSK/MQAM signals. In the unified model, a phase-rotation matrix (PRM) is introduced to partition the constellation of multipleinput multiple-output (MIMO) signals into subsets. Signals in a subset share the same PRM. Secondly, a widely linear receiver is proposed in each subset for MIMO detection. To avoid repetitive WLP in each subset, a widely linear sphere decoder (WLSD) is further proposed for MIMO systems. WLSD transforms the traditional SD searching for a true transmitted vector into a shrunk one by searching for the corresponding phase-rotation vector. Finally, the diversity order of WLSD is proven to be more than NR - NT-1/2 and less than NR, where NT (or NR) denotes the number of transmitting (or receiving) antennas. Additional performance analysis is also conducted to quantify the signal-tonoise ratio (SNR) improvement. The complexity analysis reveals that the candidate phase-rotation vectors of WLSD are no more than (1/2)NT of the SD candidates. Simulation results show that the proposed WLSD can achieve quasi-optimal bit error rate (BER) performance, while the computational complexity is reduced by more than a half compared with the Schnorr-Euchner sphere decoder (SESD). © 2016 IEEE.

Wang Y.,Xi'an Jiaotong University | Wang Y.,State Key Laboratory of Integrated Services Networks | Ren P.,Xi'an Jiaotong University | Su Z.,Waseda University
IEICE Transactions on Communications | Year: 2011

Utilizing available channels to improve the network performance is one of the most important targets for the cognitive MAC protocol design. Using antenna technologies is an efficient way to reach this target. Therefore, in this paper, we propose a novel cognitive MAC protocol, called Polarization-based Long-range Communication Directional MAC Protocol (PLRC-DMAC), for Cognitive Ad Hoc Networks (CAHNs). The proposed protocol uses directional antennas to acquire better spatial reuse and establish long-range communication links, which can support more nodes to access the same channel simultaneously. Moreover, the PLRCDMAC also uses polarization diversity to allow nodes in the CAHN to share the same channel with Primary Users (PUs). Furthermore, we also propose a Long-range Orientation (LRO) algorithm to orient the long-range nodes. Simulation results show that the LRO algorithm can accurately orient the long-range nodes, and the PLRC-DMAC can significantly increase the network throughput as well as reduce the end-to-end delay. Copyright © 2011 The Institute of Electronics, Information and Communication Engineers.

Yin W.,Xi'an Jiaotong University | Yin W.,State Key Laboratory of Integrated Services Networks | Ren P.,Xi'an Jiaotong University | Su Z.,Waseda University | Ma R.,Xi'an Jiaotong University
IEICE Transactions on Communications | Year: 2011

Multiple antenna is introduced into spectrum sensing in cognitive radios recently. However, conventional multiple antenna spectrum sensing schemes exploited only space diversity. In this paper, we propose a new multiple antenna sensing scheme based on space and time diversity (MASS-BSTD). First, the primary user signal to be sensed is oversampled at each antenna, and signal samples collected at the same time instant from different antennas are stacked into a column vector. Second, each column vector is utilized to estimate space correlation matrix that exploits space diversity, and two consecutive column vectors are utilized to estimate time correlation matrix that exploits time diversity. Third, the estimated space correlation matrix and time correlation matrix are combined and analyzed using eigenvalue decomposition to reduce information redundancy of signals from multiple antennas. Lastly, the derived eigenvalues are utilized to construct the test statistic and sense the presence of the primary user signal. Since the proposed MASS-BSTD exploits both space diversity and time diversity, it achieves performance gain over the counterparts that only exploit space diversity. Furthermore, the proposed MASS-BSTD requires no prior information on the primary user, the channel between primary user transmitter and secondary user receiver, and is robust to noise uncertainty. Theoretical analysis and simulation results show that the proposed MASS-BSTD can sense the presence of primary user signal reliably. Copyright © 2011 The Institute of Electronics, Information and Communication Engineers.

Wang Y.,Xi'an Jiaotong University | Wang Y.,State Key Laboratory of Integrated Services Networks | Ren P.,Xi'an Jiaotong University | Su Z.,Waseda University
IEICE Transactions on Communications | Year: 2011

In this letter, we propose a Partially Observable Markov Decision Process (POMDP) based Distributed Adaptive Opportunistic Spectrum Access (DA-OSA) Strategy for Cognitive Ad Hoc Networks (CAHNs). In each slot, the source and destination choose a set of channels to sense and then decide the transmission channels based on the sensing results. In order to maximize the throughput for each link, we use the theories of sequential decision and optimal stopping to determine the optimal sensing channel set. Moreover, we also establish the myopic policy and exploit the monotonicity of the reward function that we use, which can be used to reduce the complexity of the sequential decision. Copyright © 2011 The Institute of Electronics, Information and Communication Engineers.

Loading State Key Laboratory of Integrated Services Networks collaborators
Loading State Key Laboratory of Integrated Services Networks collaborators