Abstract
Many problems in science and engineering can be simplified into the form of a perfect binary tree. This paper discusses our study entitled Perfect Binary Tree Sequence (PBTS) which transforms a perfect binary tree into the single-row network. The transformation is necessary in applications such as in the assignment of telephone channels to caller–receiver pairs roaming in cells in a cellular network on real-time basis. In this application, each caller and receiver in a call forms a node, while their pair connection forms the edge. A specific case of the graph in the form of a binary tree is then transformed into its corresponding single-row network for assigning the channels to the caller–receiver pairs. PBTS starts with the formation of the spine from a perfect binary tree through the insertion mechanism, and this leads to the expansion of the spine into one or more zones in the single-row network. This is followed by the formation of terminals and intervals for optimal transformation into the nets of the single-row network using our earlier method called ESSR. The numerical experiment results support our hypothesis that PBTS transforms the tree into its single-row network efficiently.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Japan Journal of Industrial and Applied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.