On the Topologies of Local Minimum Spanning Trees
This paper is devoted to study the combinatorial properties of Local Minimum Spanning Trees (LMSTs), a geometric structure that is attracting increasing research interest in the wireless sensor networks community. Namely, we study which topologies are allowed for a sensor network that uses, for supporting connectivity, a local minimum spanning tree approach. First, we refine the current definition of LMST realizability, focusing on the role of the power of transmission (i.e., of the radius of the covered area). Second, we show simple planar, connected, and triangle-free graphs with maximum degree 3 that cannot be represented as an LMST. Third, we present several families of graphs that can be represented as LMSTs. Then, we show a relationship between planar graphs and their representability as LMSTs based on homeomorphism. Finally, we show that the general problem of determining whether a graph is LMST representable is NP-hard.
KeywordsPlanar Graph Minimum Span Tree Outerplanar Graph Hexagonal Grid Unit Disk Graph
Unable to display preview. Download preview PDF.
- 4.Cortese, P.F., Di Battista, G., Frati, F., Grilli, L., Lehmann, K.A., Liotta, G., Patrignani, M., Tollis, I.G., Trotta, F.: On the topologies of local minimum spanning tree. Technical Report RT-001-06, Dip. Ing. Elettr. e dell’Informaz., Univ. Perugia (2006)Google Scholar
- 6.Di Battista, G., Liotta, G., Whitesides, S.: The strength of weak proximity. In Graph Drawing, 178–189 (1995)Google Scholar
- 7.Dolev, D., Trickey, H.: On linear area embedding of planar graphs. Technical Report Report No. STAN-CS-81-876, Department of Computer Science, Stanford University (1981)Google Scholar
- 8.Gary, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)Google Scholar
- 11.Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit disk graph approximation. In: Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (2004)Google Scholar
- 12.Kuhn, F., Wattenhofer, R., Zollinger, A.: A worst-case optimal and average-case efficient geometric ad-hoc routing. In: ACM MobiHoc (2003)Google Scholar
- 14.Li, N., Hou, J.C., Sha, L.: Design and analysis of an mst-based topology control algorithm. In: INFOCOM (2003)Google Scholar
- 15.Li, X.Y.: Applications of computational geometry in wireless networks. In: Cheng, X., Huang, X., Du, D.Z. (eds.) Ad Hoc Wireless Networking. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
- 17.Li, X.Y., Song, W.Z., Wang, W.: A unified energy efficient topology for unicast and broadcast. In: Proc. MobiCom 2005 (2005)Google Scholar
- 20.Pinchasi, R., Smorodinsky, S.: On locally delaunay geometric graphs. In: Proc. 20th ACM Symposium on Computational Geometry (SoCG 2004), pp. 378–382 (2004)Google Scholar