A distributed routing algorithm for L-PLC network

The routing algorithm for low voltage power line communication (L-PLC) network must copy with several special problems different from normal networks. This paper analyses the specialties of the L-PLC networks in the view of communication reliability firstly. Then, a dynamic and distributed routing algorithm for L-PLC network, combining regular communication with ant colony addressing, is proposed. With the algorithm, the status of channels is stored in a routing table and verified according to the result of every transmitting. The data in routing table is used not only for choosing optimal route in regular communication, direct or indirect, but also by ant colony addressing operation as pheromone data. Since all nodes run independently with the same algorithm, the routing control is distributed; the plug and play is realized for all nodes.