Affiliation:
1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China;
2. Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080
Abstract
In a minimum load spanning tree (MLST) problem, we are given an undirected graph and nondecreasing load functions for nodes defined on nodes’ degrees in a spanning tree, and the objective is to find a spanning tree that minimizes the maximum load among all nodes. We propose the first [Formula: see text] time exact algorithm for the MLST problem, where [Formula: see text] is the number of nodes and [Formula: see text] ignores polynomial factor. The algorithm is obtained by repeatedly querying whether a candidate objective value is feasible, where each query can be formulated as a bounded degree spanning tree problem (BDST). We propose a novel solution to BDST by extending an inclusion-exclusion based algorithm. To further enhance the time efficiency of the previous algorithm, we then propose a faster algorithm by generalizing the concept of branching walks. In addition, for the purpose of comparison, we give the first mixed integer linear programming formulation for MLST. In numerical analysis, we consider various load functions on a randomly generated network. The results verify the effectiveness of the proposed algorithms. Summary of Contribution: Minimum load spanning tree (MLST) plays an important role in various applications such as wireless sensor networks (WSNs). In many applications of WSNs, we often need to collect data from all sensors to some specified sink. In this paper, we propose the first exact algorithms for the MLST problem. Besides having theoretical guarantees, our algorithms have extraordinarily good performance in practice. We believe that our results make significant contributions to the field of graph theory, internet of things, and WSNs.
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Placement of UAVs to Reconnect Lost Subnetworks in Wireless Sensor Networks;2023 IFIP Networking Conference (IFIP Networking);2023-06-12
2. Monitoring routing status of UAV networks with NB-IoT;The Journal of Supercomputing;2023-05-25
3. Evaluation of TCP Variants on Dynamic UAV Networks;2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD);2023-05-24
4. Advanced Fast Recovery OLSR Protocol for UAV Swarms in the Presence of Topological Change;2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD);2023-05-24
5. Deploying the Minimum Number of Rechargeable UAVs for a Quarantine Barrier;ACM Transactions on Sensor Networks;2022-12-20