Beihua Ying

Tsinghua University, Beijing, Beijing Shi, China

Are you Beihua Ying?

Claim your profile

Publications (5)1.74 Total impact

  • Article: An Energy Efficient Sensor Network Processor with Latency-Aware Adaptive Compression.
    IEICE Transactions. 01/2011; 94-C:1220-1228.
  • Source
    Article: Evaluation of tunable data compression in energy-aware wireless sensor networks.
    [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.
    Sensors 01/2010; 10(4):3195-217. · 1.74 Impact Factor
  • Conference Proceeding: Accurate modeling for predicting cryptography overheads on wireless sensor nodes
    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.
    Advanced Communication Technology, 2009. ICACT 2009. 11th International Conference on; 03/2009
  • Conference Proceeding: Energy-efficient node-level compression arbitration for wireless sensor networks
    [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.
    Advanced Communication Technology, 2009. ICACT 2009. 11th International Conference on; 03/2009
  • Conference Proceeding: Energy efficient architecture of sensor network node based on compression accelerator.
    Proceedings of the 19th ACM Great Lakes Symposium on VLSI 2009, Boston Area, MA, USA, May 10-12 2009; 01/2009

Top Journals

Institutions

  • 2009–2010
    • Tsinghua University
      • Department of Electronic Engineering
      Beijing, Beijing Shi, China