The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2013 vol.12)
pp: 971-983
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
ABSTRACT
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.
INDEX TERMS
Wireless sensor networks, Planarization, Network topology, Topology, Algorithm design and analysis, Protocols,topological planar simplification, Wireless sensor networks, planarization, location-free, connectivity, fine grained
CITATION
Dezun Dong, Xiangke Liao, Yunhao Liu, Xiang-Yang Li, Zhengbin Pang, "Fine-Grained Location-Free Planarization in Wireless Sensor Networks", IEEE Transactions on Mobile Computing, vol.12, no. 5, pp. 971-983, May 2013, doi:10.1109/TMC.2012.57
REFERENCES
[1] P. Bose, P. Morin, I. Stojmenović, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Proc. ACM Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM), 1999.
[2] B. Karp and H. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom, 2000.
[3] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing,” Proc. ACM MobiHoc, 2003.
[4] S. Funke and N. Milosavljevic, “Guaranteed-Delivery Geographic Routing under Uncertain Node Locations,” Proc. IEEE INFOCOM, 2007.
[5] D. Moore, J. Leonard, D. Rus, and S. Teller, “Robust Distributed Network Localization with Noisy Range Measurements,” Proc. ACM Second Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2004.
[6] Y. Wang, J. Gao, and J.S. Mitchell, “Boundary Recognition in Sensor Networks by Topological Methods,” Proc. ACM MobiCom, 2006.
[7] J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Geometric Spanner for Routing in Mobile Networks,” Proc. ACM MobiHoc, 2001.
[8] X.-Y. Li, G. Calinescu, P.-J. Wan, and Y. Wang, “Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 10, pp. 1035-1047, Oct. 2003.
[9] Y. Kim, R. Govindan, B. Karp, and S. Shenker, “Geographic Routing Made Practical,” Proc. Second Conf. Symp. Networked Systems Design and Implementation (NSDI), 2005.
[10] J. Chen, A. Jiang, I. Kanj, G. Xia, and F. Zhang, “Separability and Topology Control of Quasi Unit Disk Graphs,” Proc. IEEE INFOCOM, 2007.
[11] Y. Wang, “Topology Control for Wireless Sensor Networks,” Wireless Sensor Networks and Applications, chapter 5, pp. 113-147, Springer, 2008.
[12] G. Mao, B. Fidan, and B. Anderson, “Wireless Sensor Network Localization Techniques,” Computer Networks, vol. 51, no. 10, pp. 2529-2553, 2007.
[13] S. Funke and N. Milosavljevic, “Network Sketching or: How Much Geometry Hides in Connectivity?-Part II,” Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2007.
[14] F. Zhang, A. Jiang, and J. Chen, “Robust Planarization of Unlocalized Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2008.
[15] D. Dong, M. Li, Y. Liu, X.-Y. Li, and X. Liao, “Topological Detection on Wormholes in Wireless Ad Hoc and Sensor Networks,” IEEE/ACM Trans. Networking, vol. 19, no. 6, pp. 1787-1796, Dec. 2011.
[16] Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang, “GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks,” Proc. IEEE INFOCOM, 2005.
[17] A. Nguyen, N. Milosavljevic, Q. Fang, J. Gao, and L.J. Guibas, “Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks” Proc. IEEE INFOCOM, 2007.
[18] D. Dong, X. Liao, Y. Liu, C. Shen, and X. Wang, “Edge Self-Monitoring for Wireless Sensor Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 3, pp. 514-527, Mar. 2011.
[19] S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie, “New Constructions of ($\alpha$ , $\beta$ )-Spanners and Purely Additive Spanners,” Proc. Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 2005.
[20] D. Dong, X. Liao, K. Liu, Y. Liu, and W. Xu, “Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches,” IEEE Trans. Computers, vol. 61, no. 10, pp. 1417-1428, Oct. 2012.
[21] V. de Silva and G. Carlsson, “Topological Estimation Using Witness Complexes,” Proc. Symp. Point-Based Graphics, 2004.
[22] J. Schneider and R. Wattenhofer, “A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs,” Proc. ACM 27th ACM Symp. Principles of Distributed Computing (PODC), 2008.
[23] A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic Routing without Location Information,” Proc. ACM MobiCom, 2003.
[24] T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms. Elsevier Science, 1988.
[25] N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa, “A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees,” J. Computer and System Sciences, vol. 30, no. 1, pp. 54-76, 1985.
[26] J. Pach and G. Toth, “Which Crossing Number Is it Anyway?” J. Combinatorial Theory, Series B, vol. 80, no. 2, pp. 225-246, 2000.
48 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool