Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
 
Articles by Jingyu Hua
Total Records ( 14 ) for Jingyu Hua
  Kai Zhou , Limin Meng , Zhijiang Xu , Gang Li and Jingyu Hua
  Wireless sensor networks (WSN) is an energy limited system, thus this study presents an energy-aware quality of service (QoS) routing algorithm for it, which can also run efficiently with best-effort traffic. Furthermore, our work differs from existing algorithms in two ways: (1) We improve the first order energy consumption model with dynamic clustering; (2) We use clustering to build the multi-objectives programming model to support QoS. Simulations and comparisons with some typical route algorithms show that our algorithm is robust and effective.
  Limin Meng , Jingyu Hua , Ying Zhang , Zhijiang Xu and Gang Li
  This study presents a novel initial frame synchronization scheme of TD-SCDMA system. This algorithm uses the implicit power transition in the special frame structure and introduces a different power ratio detector comparing with the conventional non-coherent algorithms, which makes it less complicated and more reliable. We verify our algorithm by computer simulations and the results show a good and robust performance in a wide range of signal-to-noise ratios (SNRs).
  Limin Meng , Weihuang Fu , Zhijiang Xu , Jiangxing Zhang and Jingyu Hua
  This study presents a novel Ad hoc On-Demand Vector (AODV) routing protocol based on mobility prediction, named as MAODV. The algorithm controls route discovery, route keeping and route switching according to the distance and mobility estimation of the neighbor nodes. Simulations demonstrate that MAODV reduces the end-to-end delay effectively and enhance the real-time characteristics.
  Limin Meng , Jingyu Hua , Zhijiang Xu and Gang Li
  In this study, we propose a novel estimator under the time-varying multi-path channel and with its performance robust to Signal-to-Noise Ratio (SNR). This estimator is derived with the help of noise influence analysis and realized through the iterative process. We verify our algorithm by computer simulations and observe a great performance improvement in a wide range of velocities and SNRs.
  Wen Zhuge and Jingyu Hua
  Writing has been considered as an effective way to measure a language learner’s language proficiency. With labor and resources saved, writing test is entering into an era in need of Automated Essay Scoring (AES). However, its further promotion in China is limited by the negative transfer of non-native learners. Therefore, this study proposed a new way to identify Chinglish, which obstructs the development of AES in China. This WordNet-based method starts with dealing with semantic relations between English verbs, calculates semantic distances between subjects and objects and then realizes the identification of Chinglish by threshold. Experiments conducted in one university show that the proposed way performs well in identifying Chinglish in college students’ English essays.
  Fangfang Chen , Jingyu Hua , Cheng Zhao and Shouli Zhou
  In modern spread spectrum communications, how to generate spread spectrum sequence quickly is important in system modeling and design and therefore has received wide attentions. Accordingly, this study investigates the fast generation of Bent sequences, where we use a single generator to generate multiple Bent sequences simultaneously and therefore significantly reduce the realization cost. The proposed fast generator comes from the intrinsic relations between the m-sequence and the Bent sequence, i.e., the m-sequence and its shift versions can construct a trace based generator of Bent sequence family with sequence number approaching 2n/2. Moreover, we realize such fast generators in Agilent ADS (Advanced Design System) 2005A software and two examples are provided: four order Bent sequence and twelve order Bent sequence. Then, both fast generators are verified by comparing the simulated autocorrelation and crosscorrelation with the corresponding theoretical values and the results prove that the proposed method is effective and beneficial for spread spectrum communications.
  Lei Tong , Fangfang Chen , Jingyu Hua , Limin Meng and Shouli Zhou
  In modern Spread Spectrum (SS) communications, how to generate spread spectrum sequence quickly is important in system modeling and design, and therefore has received wide attentions. Moreover, since ADS (Advanced Design System) software had been a widely used simulation tool in industrial areas and there was only the m-sequence (low linear complexity) in the SS sequence library, this paper investigates the generation of Gordon-Mills-Welch (GMW) sequence (high linear complexity) and designs GMW sequence in ADS software, which will enrich the sequence library of ADS and provide more security in information encryption when engineers design SS systems by ADS. In addition, after analyzing the correlation property, we also study a low-correlation GMW generator based on sequence pair choice. The results show that though original GMW sequences have poor cross-correlation, the latter presents good correlation performance and therefore is beneficial for spread spectrum communications.
  Jingyu Hua , Zheng Gao , Wankun Kuang , Zhijiang Xu and Chengfeng Ruan
  The Weighted Least Squares (WLS) principle is popular in filter design due to its flexibility, where it can output equiripple filters with appropriate target function and weighted function. Therefore, this research studies the influence of the target function in linear phase Finite-Impulse-Response (FIR) filter design by comparing different target functions in WLS iterations. Compared with the traditional one, simulations show that the proposed target function can obtain more accurate stopband start frequencies which will be useful if the stopband start frequency must be precise in applications.
  Qionghua Zhu , Yuan Wu , Peng Hong , Liping Qian , Jingyu Hua , Zhijiang Xu and Limin Meng
  This study investigates the joint sensing assignment and resource allocations for Cognitive Radio (CR) systems where multiple Secondary Users (SUs) opportunistically share the channels of Primary System (PS) through cooperative sensing. The key questions concerned here are how to assign different SUs to sense different channels and how to allocate the transmission power and bandwidth for SUs such that the detected idle channels of PS are fully utilized. Specifically, the cooperative spectrum sensing improves the detection accuracy and reduces the potential interference to PS due to mis-detection. However, the cooperative spectrum sensing and the consequent reports of sensing results consume additional energy which should be taken account of in the SU resource allocations. Hence, the coupling effect between the spectrum sensing and the consequent resource allocations is critical for CR to optimize its performance. Based on these considerations, the problem of joint sensing assignment and resource allocations for CR is formulated as a mixed binary nonlinear programming problem and a two-layer procedure is proposed to obtain the optimal solutions. The extensive results show that due to the energy overhead for sensing and reporting, the optimal number of SUs assigned to sense the PU channel does not increase in the idle probability of the channel monotonically. Meanwhile, to maximize the SUs throughput, the consequent optimal transmission power and bandwidth allocations heavily depend on the sensing accuracy determined by the optimal sensing assignment.
  Xutao Yu , Xiaoxiang Shi and Jingyu Hua
  Multi-channel can increase the network throughput but require new algorithm to allocate channels. This study proposed a new distributed channel allocation algorithm which utilizes multi-channel to improve network performances, such as network throughput, end to end delay. The algorithm is based on contention graph and adopts contention factor to evaluate conflicts in a channel. In a local contention graph, the link with maximal degree is assigned to channel with minimal contention factor. Simulation results show that the proposed algorithm improves the network throughput and end to end delay. Especially, with the increase of network load, the improvement increases significantly.
  Wankun Kuang , Jingyu Hua , Chengfeng Ruan , Zheng Gao and Yuan Wu
  The minimax optimization is widely used in wireless communications to design the equiripple lowpass filter, such as the Linear Programming (LP) method. However, the conventional LP method suffered from its large computation loads. Hence, this study investigates an iterative LP method, in which constraints are iteratively thrown on the non-uniformly distributed frequency grid to reduce the problem scale as much as possible, resulting in much lower computations. Moreover, since the non-uniform frequency grid allows us to precisely control the ripple, the proposed method also yields a better equiripple result compared to the conventional LP method and the Particle Swarm Optimization (PSO) algorithm.
  Jingyu Hua , Zhilong Zheng , Bin Jiang , Kai Zhou and Guomin Zhong
  Non-line-of-sight (NLOS) errors which derived from the blocking of direct paths have been considered as the dominant problem in the mobile position estimation. Therefore, this study presented a study on the residual weighting algorithm (RWGH). First, the drawback of the traditional RWGH was investigated and then a base station selection strategy was proved to be effective. Moreover, the weight determination also plays an important role in the RWGH and the conventional reciprocal weight performs poor when the number of Line-of-sight (LOS) base station is small. Thus, some new weight computing schemes were proposed and compared, resulting in better performance at the case with few LOS base stations. The proposed algorithm was tested by computer simulations and the result showed better performance and smaller complexity compared with the conventional one.
  Zhijiang Xu , Jing Yuan , Kang Wang , LiMin Meng and Jingyu Hua
  A novel structure of secure communication system is proposed. The alpha stable noise sequence which is used for random carrier, is modulated by the binary message sequence to achieve the purpose of secure communication in some scenarios, such as military communications. The correlation between the first and the latter half symbol period of a stable non-Gaussian noise sequence carries the binary information. The receiver of the proposed random communication system demodulates the received signal by calculating the correlation coefficient between the first and the latter half sybmol period of the transmitted noise sequence to recover the binary message sequence. The proposed communication system significantly simplifies the structure of the transceiver because only one alpha-stable noise source in the transmitter and a simple non-coherent demodulation in the receiver are required. To evaluate the proposed system, the Bit Error Rate (BER) performance under additive white Gaussian noise channel is analyzed. And simulation results show that the BER of the system is very low, thus proving that system proposed is rational and secure.
  Xuejun Wu , Minghua Zhou , Limin Meng , Jingyu Hua , Kai Zhou and Ting Wu
  The invulnerability of mobile ad hoc network is very important to the routing protocol. This study presents a mathematically tractable model of node motion to derive a precise relationship between mobility and connection stability. We improve the first order energy consumption model with dynamic clustering first and then build an incidence matrix to depict the connectivity of the network nodes in a dynamic network model. Finally, this study simulates the network invulnerability related to time. As a result, it validates the high invulnerability of the dynamic clustering ad hoc networks.
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility