Research On Multi-heads Of Cluster Route Algorithm In Power Line Carrier Sensor Network

Power Line Carrier Sensor Network (PLCSN) based on electric distribution network uses electric wireas transmission medium, which is a new network with Power Line communication, sensor technology andnetwork techniques. PLCSN has no need to construct line due to electric-power line’s wide distribution.PLCSN is widely used in an important way of digital communication building automation, securitymonitoring, office automation, remote meter reading and other fields instead of special network. Howeverpower channel has characteristics of low impedance, high attenuation, high interference, fast time-varyingcharacteristics of the low-voltage power line network, furthermore electrical load access and leaverandomly without regular pattern, therefore channel environment is severe and network topology is timevarying in PLCSN. Therefore it is very important to select a suitable for China’s characteristic of thepower line routing algorithm.The thesis study the low-voltage power line communication network clustering algorithm. About nonoverlapping clustering routing algorithm, Path is single and time-consuming is long time; Because of lowvoltage power line high attenuation, interference, fast work environment and low impedance, it is verydifficult to guarantee the reliability of network communication; About overlapping clustering algorithm,each node can belong to more than one cluster head, which has multiple routing paths in the network.Compared with end-to-end packet delivery ratio of non overlapping clustering routing algorithm, it hasbeen improved, but overlapping clustering algorithm did not put forward the network reconfigurationalgorithm effectively, and the network structure is complex and not easy to maintain. Traditional clusteringalgorithm based on logical structure is very unstable in the complicated channel environment.In view of the low voltage power line of traditional clustering algorithm of network instability and thealgorithm to reconstruct the time-consuming problem, The thesis put a multiple cluster routingalgorithm-PLCSN-MHCRA and network reconfiguration algorithm. Algorithm avoids the different branches joining in the same cluster using the branch signal intensity discrimination method; The size ofthe weights is to be the cluster head selection basis weight by weighting the received signal strength andnoise.When the cluster head is down, the network can immediately switch to other cluster head; In fixedsignal strength of the cluster head range, the nodes will become a cluster member nodes of the cluster head.Multi-Heads of Cluster Route Algorithm is proposed to ensure correct data transmission package. Routingmaintenance are divided into two kinds: the one is adding new nodes (free nodes join the network), theother is exiting the network nodes (nodes offline nodes become cluster head); The cluster head willperiodically send maintenance data packet, a new node will choose to join the cluster head with maximumweight and the cluster head will get rid of the offline nodes from its own cluster member list. The proposedrouting maintenance algorithm will be reduced to a single cluster reconstruction, avoid route reconstructionof the whole network, reduce the reconstruction time and ensure the integrity of the network.Simulation results show that the PLCSN-MHCRA communication success rate is higher than thetraditional clustering algorithm. Network reconfiguration algorithm of location of ID can be reduced to asingle cluster reconstruction, reduce the reconstruction time and ensure the integrity of the originalnetwork.