Issue No. 05 - May (2013 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2012.57
Dezun Dong , Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
Xiangke Liao , Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
Yunhao Liu , Sch. of Software, Tsinghua Univ., Beijing, China
Xiang-Yang Li , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
Zhengbin Pang , Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topology extraction are often based on ideal assumptions, such as UDG communication model and accurate node location measurements. To make these protocols work effectively in practice, we need extract a planar topology in a location-free and distributed manner with small stretch factors. The planar topologies constructed by current location-free methods often have large stretch factors. In this paper, we present a fine-grained and location-free network planarization method under ρ-quasi-UDG communication model with ρ≥1/√2. Compared with existing location-free planarization approaches, our method can extract a provably connected planar graph, called topological planar simplification (TPS), from the connectivity graph in a fine-grained manner using local connectivity information. We evaluate our design through extensive simulations and compare with the state-of-the-art approaches. The simulation results show that our method produces high-quality planar graphs with a small stretch factor in practical large-scale networks.
Wireless sensor networks, Planarization, Network topology, Topology, Algorithm design and analysis, Protocols
Dezun Dong, Xiangke Liao, Yunhao Liu, Xiang-Yang Li and Zhengbin Pang, "Fine-Grained Location-Free Planarization in Wireless Sensor Networks," in IEEE Transactions on Mobile Computing, vol. 12, no. 5, pp. 971-983, 2013.