Yanxiang He

Yanxiang He

Auto-generated profile, based on publicly available information

Yanxiang He

Wuhan University

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 March 2009 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
FWFuru Wei
Furu Wei
WLWenjie Li
Wenjie Li
QLQin Lu
Qin Lu
YHYanxiang He
Yanxiang He

1 June 2006 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
BXBin XIAO
Bin XIAO
WCWei Chen
Wei Chen
YHYanxiang He
Yanxiang He

26 September 2014 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
QLQingan Li
Qingan Li
YHYanxiang He
Yanxiang He
JLJianhua Li
Jianhua Li
LSLiang Shi
Liang Shi
YCYiran Chen
Yiran Chen
CXChun Jason Xue
Chun Jason Xue
Spin-transfer torque RAM (STT-RAM) has been proposed to build on-chip caches because of its attractive features such as high storage density and ultra low leakage power. However, long write latency and high write energy are the two challenges for STT-RAM. Recently, researchers propose to improve the write performance of STT-RAM by relaxing its non-volatility property. To avoid data losses resulting from volatility, refresh schemes have been proposed. However, refresh operations consume additional overhead. In this paper, we propose to significantly reduce the number of refresh operations through re-arranging program data layout at compilation time. An N-refresh scheme is also proposed to further reduce the number of refreshes. Experimental results show that, on average, the proposed methods can reduce the number of refresh operations by 84.2 percent, and reduce the dynamic energy consumption by 38.0 percent for volatile STT-RAM caches while incurring only 4.1 percent performance degradation.

1 May 2017 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
Libing WuLibing Wu
Libing Wu
LNLei Nie
Lei Nie
FJFan Jing
Fan Jing
YHYanxiang He
Yanxiang He
QLQin Liu
Qin Liu
Dan WuDan Wu
Dan Wu
Black-burst based multi-hop broadcast protocols are effective means to disseminate Emergency messages (EMs) in Vehicular ad hoc networks (VANETs). However, Clear to broadcast (CTB) collision will happen and reduce propagation speed. Aiming at this problem, we propose a Black-burst and multi-channel based multihop broadcast (BMMB) protocol. Vehicles with multiple antennas can transmit and sense black-burst at different channels simultaneously based on multi-channel technology. Compared with existing black-burst based methods, BMMB shortens the iterative procedure to find out the optimal segment. Only one relay vehicle can be rapidly selected within the optimal segment without CTB collision. BMMB enables alternative broadcast methods, i.e., unidirectional broadcast and multi-directional broadcast for straight roads and intersections respectively. Theoretical analysis is done for performance evaluation of BMMB, and simulation results demonstrate that BMMB performs better in terms of average one-hop delay and propagation speed.

2 February 2008 in Computer Communications
Verified
Journal Article
Closed access
JXJun Xiao
Jun Xiao
Neal XiongNeal Xiong
Neal Xiong
Laurence YangLaurence Yang
Laurence Yang
YHY. He
Y. He

9 May 2022 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
FSFajun Sun
Fajun Sun
JHJing Selena He
Jing Selena He
XZXiaotong Zhang
Xiaotong Zhang
JZJun Zhang
Jun Zhang
QLQingan Li
Qingan Li
YHYanxiang He
Yanxiang He
The secure authenticated key establishment between nodes in Wireless Sensor Networks (WSNs) has not been fully solved in the existing schemes. It’s a good idea to apply the Diffie-Hellman protocol to address it perfectly, but the existing authenticated Diffie-Hellman (ADH) protocols are not perfect because their authentication are partial or delayed. In this paper, we first present a concept of full authentication and propose a new fully authenticated Diffie-Hellman (FADH) prototype with light-certificate-based authentication. And then based on the theory of elliptic curve cryptography, we construct the TinyADH (Tiny Authenticated Diffie-Hellman) protocol with applying the FADH in WSNs. Compared with the existing similar solutions, TinyADH has lower communication overload, is easier to implement into existing standards, and more secure under equivalent computational complexity. The experimental results show that using this scheme for a successful key agreement between two nodes averagely takes about 54 seconds on TelosB. Moreover, the simulation results indicate that repeated key agreement can improve the secure connectivity rate. However, considering the cost performance ratio, it is advisable to take 2 runs of the negotiation.