A Dijkstra-based cluster routing algorithm for wireless sensor networks (DCRA) is proposed to address challenges such as high system energy consumption, short node life cycles, and low network throughput in practical applications of wireless sensor networks (WSNs). The algorithm comprises two phases: an initial phase and a data transmission phase. During the initial phase, the focus is primarily on establishing clusters, while in the data transmission phase, efforts are made to equalize the cluster head (CH) load. For this purpose, we globally consider the optimal transmission distance with respect to the distance between the CH and the base station (BS) and use Dijkstra’s algorithm to plan the CH routing. Simulation experiments are conducted in a consistent network environment to evaluate the proposed algorithm. The results demonstrate that compared to LEACH and DMH-LEACH algorithms, the DCRA algorithm effectively balances energy consumption among nodes, extends node life cycle, and enhances network throughput.