| 引用本文: | 温开云,赵洪山,赵仕策.面向变电站环境的无线传感网络分簇路由算法[J].电力系统保护与控制,2025,53(18):64-73.[点击复制] |
| WEN Kaiyun,ZHAO Hongshan,ZHAO Shice.Clustering-based routing algorithm for wireless sensor networks in substation environments[J].Power System Protection and Control,2025,53(18):64-73[点击复制] |
|
| 摘要: |
| 当前无线传感器网络路由协议众多，但没有充分考虑无线通信方式的传输距离、传感器所处环境的电磁干扰，导致其无法应用在电力行业。提出一种计及传感节点密度、通信距离以及链路质量的无线传感网络路由策略。针对输变电场景传感器众多、不具备组网能力的问题，提出利用计算能力较强的汇聚节点接收传感器信息，并对其进行组网的解决方案。首先，根据实际传感器部署位置，通过密度可达原则及通信距离约束对传感节点进行合理分簇，并为每个簇分配能量充足且具有一定计算能力的汇聚节点。然后，结合汇聚节点之间的通信距离及链路质量，构建汇聚节点网络的赋权有向图，通过Dijkstra算法求解最优路径从而获得路由表。最后，仿真结果表明，在50%节点失效时，所提算法的网络生存时间相较于低功耗自适应集簇分层协议、集中式自适应集簇分层协议以及改进型自适应集簇分层协议分别延长了72.5%、82.8%、52.1%。此外，在实验室搭建了简单的无线传感网络，验证了算法的可行性。 |
| 关键词: 输变电场景 无线传感网络 路由算法 链路质量 |
| DOI：10.19783/j.cnki.pspc.241307 |
| 投稿时间：2024-09-26修订日期：2025-02-21 |
| 基金项目:国家自然科学基金项目资助(51277074)；国家电网公司总部科技项目资助(5700-202255222A-1-1-ZN) |
|
| Clustering-based routing algorithm for wireless sensor networks in substation environments |
| WEN Kaiyun1,ZHAO Hongshan1,ZHAO Shice2,3 |
| (1. North China Electric Power University, Baoding 071003, China; 2. Hebei Provincial Collaborative Innovation Center
of Transportation Power Grid Intelligent Integration Technology and Equipment, Shijiazhuang Tiedao University,
Shijiazhuang 050043, China; 3. School of Electrical and Electronic Engineering,
Shijiazhuang Tiedao University, Shijiazhuang 050043, China) |
| Abstract: |
| Although there are many wireless sensor network (WSN) routing protocols, most fail to fully consider the effects of communication distance and electromagnetic interference in the sensor environment, making them unsuitable for power industry applications. This paper proposes a WSN routing protocol that considers sensor node density, communication distance, and link quality. Given the problem that numerous sensors in power transmission and substation scenarios do not have networking capability, a solution is proposed in which more powerful sink nodes are used to receive sensor data and establish the network. First, according to the actual sensor deployment location, clustering is performed according to the density-reachability principle and communication distance constraints, and each cluster is assigned a sink node with sufficient energy and certain computing capacity. Then, considering the communication distance and link quality between the sink nodes, a weighted directed graph of the sink node network is constructed, and the optimal routing paths are obtained using Dijkstra’s algorithm to build the routing table. Finally, simulation results show that when 50% of nodes fail, the proposed algorithm extends network lifetime by 72.5%, 82.8%, and 52.1% compared with the classical low energy adaptive clustering hierarchy, centralized low energy adaptive clustering hierarchy, and improved low energy adaptive clustering hierarchy protocols, respectively. In addition, a simple WSN is built in the laboratory to verify the feasibility of the algorithm. |
| Key words: transformer substation wireless sensor network routing algorithm link quality |
