Overlapping clustering routing algorithm based on L-PLC meter reading system

In the meter reading system of low voltage power line communication (L-PLC), data signals are forwarded by relay nodes adopting routing algorithm. This paper puts forward a dynamic routing algorithm adapting to meter reading system of L-PLC. The algorithm is based on overlapping clustering, so it can establish multiple shortest routings. Then a new rule is given that a node can respond to clustering command from all nodes but its sub-nodes. As a result, the routing construction of net topology is got rather than a tree topology. Furthermore, in order to record information of all paths, we build a routing table as matrix, and acquire paths through searching the routing table. If one of the paths is broken, other paths as backup routing will be chosen. By this way, alternative paths are increased, which reduces network reconstruction and improves the reliability of communication. By sensing channel conditions, the algorithm could automatically inspect nodes which can execute communication directly, build dynamic network routing, search relay nodes and finish the communication.