Wireless sensor networks (WSNs) are ad hoc networks usually made up of miniaturized autonomous units called sensor nodes that communicate in between by radio links. The WSN has attracted a lot of interests for scientific research, particularly because of new problems of routing under strong constraints of network lifetime and low processing capacity of the nodes. Many algorithms for routing such networks are proposed that are generally either network structured or protocol operated. This paper implies that regardless of routing algorithms studied and developed already in literature, all of the WSNs can be routed efficiently in long term if they are employed with uniformly distributed load balancing mechanisms reducing nodes failures in the neighborhood of sink node. To show this, first a WSN is modeled and distribution of nodes is illustrated using a defined overall point factor. Next, an algorithm is developed and simulated the underlying WSN model. Finally, near optimum solutions with their efficiency factors are extracted to deduce that it is possible to quickly route uniformly load balanced networks by random searching of a tiny margin of solutions space.

无线传感器网络（WSN）是ad hoc网络，通常由称为传感器节点的小型自治单元组成，它们之间通过无线电链路进行通信。WSN吸引了许多科学研究的兴趣，特别是由于在网络生命周期的强大约束和节点处理能力低下的路由新问题。提出了许多用于路由这样的网络的算法，这些算法通常是网络结构的或协议操作的。本文暗示，不管文献中已研究和开发的路由算法如何，如果所有WSN都采用统一的负载均衡机制来减少汇聚节点附近节点的故障，则可以长期有效地进行路由。为了证明这一点，首先，对WSN进行建模，并使用定义的总体点因子来说明节点的分布。接下来，开发一种算法并模拟基础的WSN模型。最后，提取具有效率因子的近乎最佳的解决方案，以推断通过随机搜索解决方案空间的一小部分裕量，可以快速路由均匀负载均衡的网络。