Yuanchang Zhong

Prof. Yuanchang Zhong

School of Microelectronics and Communication Engineering, Chongqing University,China
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
14 July 2015 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
LYLiu Yang
Liu Yang
YLYinzhi Lu
Yinzhi Lu
YZYuanchang Zhong
Yuanchang Zhong
XWXue-Gang Wu
Xue-Gang Wu
SXShao-Jing Xing
Shao-Jing Xing

17 November 2017 in Sensors
Verified
Journal Article
Open access
PDF file
LYLiu Yang
Liu Yang
YLYinzhi Lu
Yinzhi Lu
LXLian Xiong
Lian Xiong
YTYang Tao
Yang Tao
YZYuanchang Zhong
Yuanchang Zhong
Clustering is an effective topology control method in wireless sensor networks (WSNs), since it can enhance the network lifetime and scalability. To prolong the network lifetime in clustered WSNs, an efficient cluster head (CH) optimization policy is essential to distribute the energy among sensor nodes. Recently, game theory has been introduced to model clustering. Each sensor node is considered as a rational and selfish player which will play a clustering game with an equilibrium strategy. Then it decides whether to act as the CH according to this strategy for a tradeoff between providing required services and energy conservation. However, how to get the equilibrium strategy while maximizing the payoff of sensor nodes has rarely been addressed to date. In this paper, we present a game theoretic approach for balancing energy consumption in clustered WSNs. With our novel payoff function, realistic sensor behaviors can be captured well. The energy heterogeneity of nodes is considered by incorporating a penalty mechanism in the payoff function, so the nodes with more energy will compete for CHs more actively. We have obtained the Nash equilibrium (NE) strategy of the clustering game through convex optimization. Specifically, each sensor node can achieve its own maximal payoff when it makes the decision according to this strategy. Through plenty of simulations, our proposed game theoretic clustering is proved to have a good energy balancing performance and consequently the network lifetime is greatly enhanced.

11 January 2022 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
HFHuilian Fan
Huilian Fan
YZYuanchang Zhong
Yuanchang Zhong
GZGuangpu Zeng
Guangpu Zeng
CGChenhao Ge
Chenhao Ge

16 August 2017 in Telecommunication Systems
Verified
Journal Article
Closed access
PDF file
LYLiu Yang
Liu Yang
YLYinzhi Lu
Yinzhi Lu
YZYuanchang Zhong
Yuanchang Zhong
Simon X. YangSimon X. Yang
Simon X. Yang

26 December 2015 in Sensors
Verified
Journal Article
Open access
PDF file
LYLiu Yang
Liu Yang
YLYinzhi Lu
Yinzhi Lu
YZYuanchang Zhong
Yuanchang Zhong
XWXuegang Wu
Xuegang Wu
Simon X. YangSimon X. Yang
Simon X. Yang
Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs) because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC) algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs) in the network act as routers to transmit data to base station (BS) cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols.

1 January 2014 in Abstract and Applied Analysis
Verified
Journal Article
Open access
PDF file
YZYuanchang Zhong
Yuanchang Zhong
LZLiang Zhang
Liang Zhang
SXShaojing Xing
Shaojing Xing
FLFachuan Li
Fachuan Li
BWBeili Wan
Beili Wan
Owing to the increase and the complexity of data caused by the uncertain environment, the water environment monitoring system in Three Gorges Reservoir Area faces much pressure in data handling. In order to identify the water quality quickly and effectively, this paper presents a new big data processing algorithm for water quality analysis. The algorithm has adopted a fast fuzzy C-means clustering algorithm to analyze water environment monitoring data. The fast clustering algorithm is based on fuzzy C-means clustering algorithm and hard C-means clustering algorithm. And the result of hard clustering is utilized to guide the initial value of fuzzy clustering. The new clustering algorithm can speed up the rate of convergence. With the analysis of fast clustering, we can identify the quality of water samples. Both the theoretical and simulated results show that the algorithm can quickly and efficiently analyze the water quality in the Three Gorges Reservoir Area, which significantly improves the efficiency of big data processing. What is more, our proposed processing algorithm provides a reliable scientific basis for water pollution control in the Three Gorges Reservoir Area.