Near Optimum Random Routing of Uniformly Load Balanced Nodes in Wireless Sensor Networks Using Connectivity Matrix

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.