Beihua Ying

Tsinghua University, Peping, Beijing, China

Are you Beihua Ying?

Claim your profile

Publications (6)2.53 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposed a novel platform for sensor nodes to resolve the energy and latency challenges. It consists of a processor, an adaptive compressing module and several compression accelerators. We completed the proposed chip in a 0.18 mu m HJTC CMOS technology. Compared to the software-based solution, the hardware-assisted compression reduces over 98% energy and 212% latency. Besides, we balanced the energy and latency metric using an adaptive module. According to the scheduling algorithm, the module tunes the state of the compression accelerator, as well as the sampling frequency of the online sensor. For example, given a 9 mu s constraint for a 1-byte operation, it reduces 34% latency while the energy overheads are less than 5%.
    No preview · Article · Jul 2011 · IEICE Transactions on Electronics
  • Source
    Beihua Ying · Yongpan Liu · Hui Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: Previous studies have indicated that data compression in wireless sensor networks is not always beneficial to energy conservation due to the additional computational energy costs. This work gives an energy-efficient arbitration mechanism that enhances the performance of compression algorithms by avoiding unnecessary energy losses. The adaptive compression arbitration system uses a new prediction modeling and adaptation. Tests show that the modeling method gives better predictions with the adaptive mechanism needing less data for modeling, which allows on-line prediction modeling instead of an off-line training process. Moreover, adaptive adjustments of the model parameters enable the system to keep good arbitration precision even as the data characteristics or applications change.
    Full-text · Article · Apr 2010 · Tsinghua Science & Technology
  • Source
    Beihua Ying · Yongpan Liu · Huazhong Yang · Hui Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: Energy is an important consideration in wireless sensor networks. In the current compression evaluations, traditional indices are still used, while energy efficiency is probably neglected. Moreover, various evaluation biases significantly affect the final results. All these factors lead to a subjective evaluation. In this paper, a new criterion is proposed and a series of tunable compression algorithms are reevaluated. The results show that the new criterion makes the evaluation more objective. Additionally it indicates the situations when compression is unnecessary. A new adaptive compression arbitration system is proposed based on the evaluation results, which improves the performance of compression algorithms.
    Full-text · Article · Apr 2010 · Sensors
  • Beihua Ying · Wei Liu · Yongpan Liu · Huazhong Yang · Hui Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: Energy efficiency is one of the most important design metrics for wireless sensor networks. As sensor data always have redundancies, compression is introduced for energy savings. However, in some cases, it is unlikely to be wise to trade computation energy for communication savings. In this paper, a novel node-level compression arbitration mechanism is proposed, which is applied to improve compression algorithms by avoiding unnecessary energy losses. Experimental results show that the highest percent savings of energy can reach 10% ~ 30% for different kinds of datasets. Furthermore, the overhead introduced by our proposed scheme is expected to be negligible approximately.
    No preview · Conference Paper · Mar 2009
  • Wei Liu · Beihua Ying · Huazhong Yang · Hui Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: Resource constraints make it considerably difficult to implement and optimize cryptography algorithms on sensor nodes. In order to provide guidelines for design, it is necessary to predict overheads of these algorithms without final implementations and optimizations. In this paper, a mathematical model based on overheads of basic operations frequently used in cryptography algorithms is presented for predicting overheads of these algorithms. Simulation results of practical implementations of several popular algorithms verify that this model is very accurate. Because these basic operations cannot be ignored when implementing cryptography algorithms, the prediction results can be used as lower bounds of overheads. More importantly, as these basic operations are also elements of other applications such as data processing, their overheads can also be used to predict overheads of those applications using the same method.
    No preview · Conference Paper · Mar 2009
  • Jue Wang · Beihua Ying · Yongpan Liu · Huazhong Yang · Hui Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose an energy efficient architecture of wireless sensor network node. It consists of a general-purpose processor and several compression accelerators. To verify the low energy consumption of this architecture, we implement a baseband chip of sensor node by 1-poly 6-metal 0.18um CMOS technology, in which a hardware accelerator is realized based on a distributed wavelet compression algorithm. Our measurements show that the compression accelerator based architecture reduces over 98% energy consumption compared with the traditional solution.
    No preview · Conference Paper · Jan 2009