Chunyang Lei

Dr. Chunyang Lei

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
18 July 2016 in Sensors
Verified
Journal Article
Open access
PDF file
CLChunyang Lei
Chunyang Lei
HBHongxia Bie
Hongxia Bie
GFGengfa Fang
Gengfa Fang
Elena GauraElena Gaura
Elena Gaura
JBJames Brusey
James Brusey
EDEryk Dutkiewicz
Eryk Dutkiewicz
Super dense wireless sensor networks (WSNs) have become popular with the development of Internet of Things (IoT), Machine-to-Machine (M2M) communications and Vehicular-to-Vehicular (V2V) networks. While highly-dense wireless networks provide efficient and sustainable solutions to collect precise environmental information, a new channel access scheme is needed to solve the channel collision problem caused by the large number of competing nodes accessing the channel simultaneously. In this paper, we propose a space-time random access method based on a directional data transmission strategy, by which collisions in the wireless channel are significantly decreased and channel utility efficiency is greatly enhanced. Simulation results show that our proposed method can decrease the packet loss rate to less than 2 % in large scale WSNs and in comparison with other channel access schemes for WSNs, the average network throughput can be doubled.

3 December 2015 in Sensors
Verified
Journal Article
Open access
PDF file
CLChunyang Lei
Chunyang Lei
HBHongxia Bie
Hongxia Bie
GFGengfa Fang
Gengfa Fang
XZXuekun Zhang
Xuekun Zhang
Super dense and distributed wireless sensor networks have become very popular with the development of small cell technology, Internet of Things (IoT), Machine-to-Machine (M2M) communications, Vehicular-to-Vehicular (V2V) communications and public safety networks. While densely deployed wireless networks provide one of the most important and sustainable solutions to improve the accuracy of sensing and spectral efficiency, a new channel access scheme needs to be designed to solve the channel congestion problem introduced by the high dynamics of competing nodes accessing the channel simultaneously. In this paper, we firstly analyzed the channel contention problem using a novel normalized channel contention analysis model which provides information on how to tune the contention window according to the state of channel contention. We then proposed an adaptive channel contention window tuning algorithm in which the contention window tuning rate is set dynamically based on the estimated channel contention level. Simulation results show that our proposed adaptive channel access algorithm based on fast contention window tuning can achieve more than 95 % of the theoretical optimal throughput and 0 . 97 of fairness index especially in dynamic and dense networks.

1 May 2016
Verified
Conference Paper
Closed access
PDF file
CLChunyang Lei
Chunyang Lei
HBHongxia Bie
Hongxia Bie
XZXuekun Zhang
Xuekun Zhang
Estimation-based backoff algorithms for channel access are being widely studied to solve the wireless channel accessing problem especially in super dense wireless networks. In such algorithms, the accuracy of the channel state estimation seriously determines the performance. How to make the accurate estimation in an efficient way to meet the system requirements is essential in designing new channel access algorithms. In this paper, we study the confidence level of the information about the channel state which the sampled channel parameters can provide and propose a weight-based backoff algorithm in which a weight system is constructed to assign weights to different sample values according to such confidence levels to improve the estimation accuracy. Simulation results show that owing to the improved estimation accuracy, our proposed algorithm not only can provide stable throughput and fairness performance in networks with different densities, but also can achieve excellent contention window tuning speed in ever-changing networks.