Degree-bounded minimum spanning tree for unit disk graph

Authors:
Hongli Xu;Liusheng Huang;Wang Liu;Yindong Zhang;Yanjing Sun
Affiliations:
School of Computer Science & Technology, University of Science & Technology of China, Hefei 230027, PR China and Suzhou Institute for Advanced Study, University of Science & Technology of China, S ...;School of Computer Science & Technology, University of Science & Technology of China, Hefei 230027, PR China and Suzhou Institute for Advanced Study, University of Science & Technology of China, S ...;School of Computer Science & Technology, University of Science & Technology of China, Hefei 230027, PR China and Suzhou Institute for Advanced Study, University of Science & Technology of China, S ...;School of Computer Science & Technology, University of Science & Technology of China, Hefei 230027, PR China and Suzhou Institute for Advanced Study, University of Science & Technology of China, S ...;School of Information and Electrical Engineering, China University of Mining & Technology, Xuzhou 221116, PR China
Venue:
Theoretical Computer Science
Year:
2012

Citing 10
Cited 0

Transitions in geometric minimum spanning trees

Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
A network-flow technique for finding low-weight bounded-degree spanning trees

Journal of Algorithms
The Cricket location-support system

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless sensor networks for habitat monitoring

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Low-Degree Spanning Trees of Small Weight

SIAM Journal on Computing
Data Gathering Algorithms in Sensor Networks Using Energy Metrics

IEEE Transactions on Parallel and Distributed Systems
Euclidean Bounded-Degree Spanning Tree Ratios

Discrete & Computational Geometry
Smart Environments: Technology, Protocols and Applications (Wiley Series on Parallel and Distributed Computing)

Smart Environments: Technology, Protocols and Applications (Wiley Series on Parallel and Distributed Computing)
A cone-based distributed topology-control algorithm for wireless multi-hop networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	5.23

Visualization

Abstract

Degree-bounded minimum spanning tree (DBMST) has been widely used in many applications of wireless sensor networks, such as data aggregation, topology control, etc. However, before construction of DBMST, it is NP-hard to determine whether or not there is a degree-k spanning tree for an arbitrary graph, where k is 3 or 4. The wireless sensor network is usually modeled by a unit disk graph (UDG), where two vertices are connected in UDG G(R) if their Euclidean distance is not more than a given constant R in the field. The previous works have predicated the necessary conditions for the existence of DBMST on UDG. Given that sub-graphs G(R/2) and G(R/3) can keep connected, there exist degree-3 or degree-4 spanning trees for UDG G(R). In this paper, we design two algorithms to construct the degree-3 and degree-4 spanning trees for UDG respectively. The more relaxed conditions are explored for the existence of DBMST for unit disk graphs according to the proposed algorithms. That is, given that sub-graphs G(R/1.81) and G(R/2) keep connected, the existence of degree-3 and degree-4 spanning trees is guaranteed for UDG G(R). The theoretical analyses show that the performances of constructed degree-3 and degree-4 spanning trees are at most (4+6^@a)/4 and (1+2^@a)/2 times as that of minimum spanning tree (MST) respectively, where @a=2 is a constant. The simulation results show the high efficiency of two proposed algorithms. For example, total link weights of degree-3 and degree 4 spanning trees are about 1.05 and 1.01 times as that of MST where @a is 2.