Ke Zhang

Ke Zhang

Auto-generated profile, based on publicly available information

Ke Zhang

State Grid Electric Power Research Institute Co., Ltd., Hefei 230088, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
2 September 2024 in IEEE Sensors Journal
Verified
Journal Article
Closed access
YWYin Wang
Yin Wang
NXNa Xia
Na Xia
BCBin Chen
Bin Chen
YYYutao Yin
Yutao Yin
SWSizhou Wei
Sizhou Wei
KZKe Zhang
Ke Zhang
Due to the challenges of low bandwidth, high latency, and high communication energy costs in acoustic channel communication, data collection in underwater acoustic sensor networks remains severely restricted. The assistance of multiple autonomous underwater vehicles (AUVs) in data collection brings advantages of low latency and energy-efficient balance. However, existing AUV-assisted data collection schemes preplan paths and assume data transmission from all nodes, which is inefficient in information delay-sensitive monitoring scenarios. Furthermore, most schemes do not consider the influence of ocean currents when studying path planning. To solve these problems, this paper proposes a joint optimization scheme for multi-AUV cooperative data collection based on Stackelberg game, where the task allocation and path planning problems are formulated as the leader and follower of the Stackelberg game, respectively. At the leader level, a sequential game based algorithm is proposed, dynamically allocating cluster heads that require data transmission to different AUVs. At the follower level, the influence of ocean currents is considered, and an improved backtracking method is employed to plan the optimal path for each AUV. Experimental results show that the proposed method significantly improves network performance when compared with other representative underwater data collection methods.

18 July 2023 in Electronics
Verified
Journal Article
Open access
PDF file
NXNa Xia
Na Xia
LLlinmei luo
linmei luo
YWYin Wang
Yin Wang
KZKe Zhang
Ke Zhang
JYJun Yang
Jun Yang
CYChenguang Yuan
Chenguang Yuan
In underwater sensor networks, nodes are usually sparsely arranged, and autonomous underwater vehicles (AUVs) are often used to collect data by moving. However, it is a key problem for AUVs to shorten the path as much as possible to guarantee whole-network data acquisition. Aiming to solve this problem, this paper proposes an AUV underwater data collection method based on affinity propagation clustering. First, this clustering theory is used to select the nodes with large residual energy as cluster head nodes, and the clustering results are dynamically adjusted according to the communication radius of nodes to obtain the final clustering results. Finally, the cluster head nodes of the clusters are sequentially traversed using the traveling salesman problem, and an optimal path of AUV is planned to complete data collection for the whole network. A large number of simulation experiments verify that this method can effectively plan the mobile path of AUVs.

11 April 2022 in Electronics
Verified
Journal Article
Open access
PDF file
YGYufeng Gao
Yufeng Gao
JYJun Yang
Jun Yang
KZKe Zhang
Ke Zhang
HPHuaizhen Peng
Huaizhen Peng
YWYin Wang
Yin Wang
GYGang Yao
Gang Yao
Because the galloping of iced conductors is one of the main disasters in the State Grid, resulting in huge economic and property losses every year, the research on relevant monitoring methods is of great significance. The existing galloping monitoring technology is mainly based on the contact detection method, which presents potential electrical hazards and power supply problems. In this paper, a conductor galloping monitoring method based on the target detection of infrared sources is put forward to overcome the shortcomings of existing methods. In other words, an infrared source label is installed on the conductor spacer, high-definition night vision infrared cameras are installed on electric power towers to take video of the infrared source labels, and the characteristic amplitude of conductor galloping is calculated by an image recognition and tracking algorithm. The practical application results indicate that the method has the advantages of non-contact detection, safety and reliability, and high detection accuracy.

24 September 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
YWYin Wang
Yin Wang
NXNa Xia
Na Xia
BCBin Chen
Bin Chen
YYYutao Yin
Yutao Yin
LCLei Chen
Lei Chen
KZKe Zhang
Ke Zhang
To improve the reliability and efficiency of underwater acoustic sensor networks (UASNs) under limited node energy and network attacks, a joint scheme of enhancing robustness and extending network lifetime is proposed in this paper. Scale-free networks exhibit strong robustness against random failures, and because of the lower number of link connections, nodes consume energy more slowly. We first introduce a new scale-free topology evolution model that adjusts the initial number of nodes according to the characteristics of UASNs. This model incorporates factors such as flow load, energy consumption, and distance into the preferential attachment mechanism, balancing the network load and enhancing its resistance to attacks. Further, based on this topology, we propose a network flow adjustment algorithm that features the joint selection of paths and corresponding power levels. Energy consumption is balanced among nodes in proportion to their residual energy, rather than by minimizing the absolute consumed power. Numerical simulations show that different topologies significantly affect network lifetime, which is the longest when the number of links added is 2. The network lifetime of the proposed scheme surpasses the state-of-the-art schemes, such as ETFLA, Initial-BA, and VODA, by up to 37.18%, 46.23%, and 128.80%, respectively.

12 April 2023 in Electronics
Verified
Journal Article
Open access
PDF file
NXNa Xia
Na Xia
YLYu Li
Yu Li
KZKe Zhang
Ke Zhang
PWPeipei Wang
Peipei Wang
LLlinmei luo
linmei luo
JYJun Yang
Jun Yang
In wireless networks, multiple monitoring nodes are used to collect users’ transmission data in real time, which can be used for fault diagnosis and analytical feedback of the wireless network. Due to the limited number of monitoring nodes, key issues include how to optimize and schedule the channel resources of each node to cover more users, obtain more network data, and maximize the quality of network monitoring. In this paper, a channel allocation algorithm based on swarm intelligence—“discrete bacterial foraging optimization”—is proposed based on the classic bacterial foraging optimization algorithm. The position of each dimension in the iterative process is discretized to binary 0 or 1 to encode and express the channel allocation problem of wireless monitoring networks, and the channel allocation scheme is optimized by location updates guided by bacterial foraging. Many simulation and practical experiments have proved the effectiveness of the algorithm, and it also has low complexity and provable convergence. Compared with similar algorithms, this algorithm improves monitoring quality by 1.428% while boosting speed by up to 32.602%. The algorithm has lower complexity, higher performance, and can converge to the optimal solution at a faster rate.

17 February 2025 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
NXNa Xia
Na Xia
LCLei Chen
Lei Chen
MLMeng Li
Meng Li
YYYutao Yin
Yutao Yin
KZKe Zhang
Ke Zhang
In wireless networks, utilizing sniffers for fault analysis, traffic traceback, and resource optimization is a crucial task. However, existing centralized algorithms cannot be applied to high-density wireless networks. Therefore, distributed optimization of channel selection to maximize the monitoring rate of sensors in Wireless Monitoring Networks (WMNs) is a challenge. This paper proposes a joint double auction-based distributed channel selection algorithm (J2A-CS) to maximize overall quality of monitoring (QoM). First, sniffers are redundantly deployed in WMNs, and an initial channel allocation strategy is formulated. Subsequently, sniffers collectively act as buyers and sellers at different stages. Finally, buyers bid asynchronously, and sellers settle synchronously to maximize the seller’s marginal revenue and update the channel selection scheme. As a distributed channel selection algorithm, J2A-CS addresses the highest overall QoM issue in WMNs, demonstrating high scalability and fault tolerance. Simulation results show that J2A-CS significantly improves QoM compared to existing distributed algorithms and outperforms centralized algorithms in high-density scenarios.