Priority-Based Redeployment Algorithm for Decentralized Nodes in xG Access Networks

Redeployment of decentralized nodes in xG access networks becomes necessary when there are disruptions to availability and accessibility for communications. This article proposes a priority-based node redeployment algorithm with minimum availability assurance. A set of nodes are selected from the access network to function as a core network. The decentralized nodes are considered subnetworks which seeks one-hop connectivity to the aforementioned core network. Prior information of a core network structure is necessary to ensure minimum availability. The proposed solution is suitable for decentralized xG access network architectures which demands a minimum availability requirement and maximum possible core node selection in spite of restructuring the network due to redeployment.