Xiaomei Zhang

Xiaomei Zhang

Auto-generated profile, based on publicly available information

Xiaomei Zhang

School of Electronic & Electrical Engineering

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
18 March 2020 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
ZSZhicai Shi
Zhicai Shi
XZXiaomei Zhang
Xiaomei Zhang
JLJin Liu
Jin Liu
In many fields, multiple RFID tags are often combined into a group to identify an object. An RFID grouping-proof protocol is utilized to prove the simultaneous existence of a group of tags. However, many current grouping-proof protocols cannot simultaneously provide privacy preserving, forward security, and the authentication between reader/verifier and tags, which are vulnerable to trace attack, privacy leakage, and desynchronization attack. To improve the secure performance of the current grouping-proof protocols, we propose two provable lightweight grouping-proof protocols that provide forward security, identity authentication, and privacy preserving. Our protocols involve a trusted reader and an untrusted reader, respectively. In order to avoid verifying some invalid evidences, our protocols complete the authentication of the verifier to the trusted reader and the verified tags before the verifier verifies the grouping-proof evidence. Each tag uses parallel mode to complete its signature to improve the efficiency of the protocols. Moreover, the activate-sleep mechanism and the filtering operation are proposed to effectively reduce the collision probability and computing load of tags. Our protocols complete the authentication to tags twice by a verifier and a trusted reader, respectively. They can resist various attacks such as eavesdropping, replay, trace, and desynchronization. The protocols are proven to be secure, flexible, and efficient. They only utilize some lightweight operations. Therefore, they are very suitable to the low-cost RFID systems.

20 September 2017 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
XZXiaomei Zhang
Xiaomei Zhang
XDXiaolei Dong
Xiaolei Dong
JWJie Wu
Jie Wu
ZCZhenfu Cao
Zhenfu Cao
CLChen Lyu
Chen Lyu
Wireless sensor networks (WSNs) are increasingly used in smart cities which involve multiple city services having quality of service (QoS) requirements. When misbehaving devices exist, the performance of current delivery protocols degrades significantly. Nonetheless, the majority of existing schemes either ignore the faulty behaviors’ variability and time-variance in city environments or focus on homogeneous traffic for traditional data services (simple text messages) rather than city services (health care units, traffic monitors, and video surveillance). We consider the problem of fault-aware multiservice delivery, in which the network performs secure routing and rate control in terms of fault activity dynamic metric. To this end, we first design a distributed framework to estimate the fault activity information based on the effects of nondeterministic faulty behaviors and to incorporate these estimates into the service delivery. Then we present a fault activity geographic opportunistic routing (FAGOR) algorithm addressing a wide range of misbehaviors. We develop a leaky-hop model and design a fault activity rate-control algorithm for heterogeneous traffic to allocate resources, while guaranteeing utility fairness among multiple city services. Finally, we demonstrate the significant performance of our scheme in routing performance, effective utility, and utility fairness in the presence of misbehaving sensors through extensive simulations.

17 September 2017 in Scientific Programming
Verified
Journal Article
Open access
PDF file
XZXiaomei Zhang
Xiaomei Zhang
QCQiang Chen
Qiang Chen
ZSZhicai Shi
Zhicai Shi
JLJianru Liang
Jianru Liang
With the rapid development of cloud computing and big data, diverse types of traffic generated from heterogeneous data sources are delivered throughout communication networks, which consist of various node kinds such as digital sensors and smart actuators, and different applications. Due to the shared medium, communication networks are vulnerable to misbehaving nodes, and it is a crucial aspect to maintain an acceptable level of service degradation. This paper studies the fault-aware resource allocation problem by exploiting multipath routing and dynamic rate assignment for heterogeneous sources. We estimate the impacts of faults and formulate the resource allocation as a lossy network flow optimization problem based on these estimates. The traditional flow optimization solutions focus on homogeneous traffic. In our work, we model the performance of heterogeneous applications as a relaxed utility function and develop an effective utility framework of rate control for heterogeneous sources with multipath routing in presence of misbehaving nodes. We design a distributed algorithm to decide the routing strategy and obtain the rate assignments on the available paths in a lossy utility fair manner. Extensive performance evaluations corroborate the significant performance of our algorithm in effective utility and utility fairness in the presence of misbehaving nodes.

1 April 2013
Verified
Conference Paper
Closed access
CLChen Lyu
Chen Lyu
DGDawu Gu
Dawu Gu
XZXiaomei Zhang
Xiaomei Zhang
SSShi-Feng Sun
Shi-Feng Sun
YTYinqi Tang
Yinqi Tang
Vehicular Ad Hoc Networks (VANETs) enable vehicle-to-vehicle communication to enhance road safety and improve driving experience. To secure periodic single-hop beacon messages for VANET applications, digital signature is one of the fundamental security approaches. However, it is vulnerable as excessive signatures would exhaust the computational resources of vehicles. In this paper, we propose a novel authentication mechanism VSPT, VANET authentication with Signatures and Prediction-based TESLA, which combines the advantages of both Elliptic Curve Digital Signature Algorithm (ECDSA) and Prediction-based TESLA. Although ECDSA is computationally expensive, it provides authentication and non-repudiation. Prediction-based TESLA enables fast and efficient verification by exploiting the sender's ability to predict its own future beacons. Both theoretical analysis and simulation results show that VSPT outperforms either the signature or TESLA in not only lossless situations but also lossy environments.