Guang Tan
Abstract
When a sensor network grows large, or when its topology becomes complex (e.g., containing many holes), network algorithms designed with a smaller or simpler setting in mind may be rendered rather inefficient. We propose to address this problem using a divide and conquer approach: the network is divided into convex pieces by a distributed convex partitioning protocol, using connectivity information only. A convex network partition exhibits some desirable properties that allow traditional algorithms to work to their full advantage. Based on this, we can achieve relatively high performance for an algorithm by combining algorithmic actions within individual partitions. We consider two important applications: virtual-coordinate-based geographic routing and connectivity-based localization. The former benefits from convex partition's friendliness to network embedding, which is crucial to generating accurate virtual coordinates for the nodes, while the latter leverages the fact that shortest paths are largely straight for node pairs within a convex partition. Experimental results show that the convex partition approach can significantly improve the performance of both applications in comparison with state-of-the-art solutions.
- N. Arad and Y. Shavitt. 2006. Minimizing recovery state in geographic ad-hoc routing. In Proceedings of ACM MobiHoc. Google Scholar
Digital Library
- A. Arora, R. Ramnath, and P. Sinha. 2005. Project exscal. In Proceedings of the 1st International IEEE Conference on Distributed Computing in Sensor Systems (DCOSS). Google ScholarDigital Library
- J. Bruck, J. Gao, and A. Jiang. 2005. MAP: Medial axis based geometric routing in sensor networks. In Proceedings of ACM MOBICOM. Google ScholarDigital Library
- Q. Cao and T. Abdelzaher. 2004. A scalable logical coordinates framework for routing in wireless sensor networks. In Proceedings of IEEE Real-Time Systems Symposium (RTSS). Google ScholarDigital Library
- A. Caruso, A. Urpi, S. Chessa, and S. De. 2005. GPS free coordinate assignment and routing in wireless sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
- F. Dabek, R. Cox, F. Kaashoek, and R. Morris. 2004. Vivaldi: A decentralized network coordinate system. In Proceedings of ACM SIGCOMM. Google ScholarDigital Library
- Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang. 2005. GLIDER: Gradient landmark-based distributed routing for sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
- S. P. Fekete, A. Kroeller, D. Pfisterer, S. Fischer, and C. Buschmann. 2004. Neighborhood-based topology recognition in sensor networks. In Proceedings of Algorithmic Aspects of Wireless Sensor Networks: First International Workshop (ALGOSENSOR).Google Scholar
- R. Fonseca, S. Ratnasamy, J. Zhao, C. T. Ee, D. Culler, S. Shenker, and I. Stoica. 2005. Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In Proceedings of USENIX NSDI. Google ScholarDigital Library
- S. Funke. 2005. Topological hole detection in wireless sensor networks and its applications. In Proceedings of the Joint Workshop on Foundations of Mobile Computing (DIALM-POMC). Google ScholarDigital Library
- H. Jiang, T. Yu, C. Tian, G. Tan, and C. Wang. 2012. CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
- B. Karp and H. T. Kung. 2000. GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of ACM MOBICOM. Google ScholarDigital Library
- A. Kroller, S. Fekete, D. Pfisterer, and S. Fischer. 2006. Deterministic boundary recognition and topology extraction for large sensor networks. In Proceedings of ACM-SIAM SODA. Google ScholarDigital Library
- F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. 2003. Geometric ad-hoc routing: Of theory and practice. In Proceedings of ACM PODC. Google ScholarDigital Library
- F. Kuhn, R. Wattenhofer, and A. Zollinger. 2002. A asymptotically optimal geometric mobile ad hoc routing. In Proceedings of ACM DIALM-POMC Joint Workshop on Foundations of Mobile Computing. Google ScholarDigital Library
- S. Lederer, Y. Wang, and J. Gao. 2008. Connectivity-based localization of large scale sensor networks with complex shape. In Proceedings of IEEE INFOCOM.Google Scholar
- B. Leong, B. Liskov, and R. Morris. 2007. Greedy virtual coordinates for geographic routing. In Proceedings of IEEE ICNP.Google Scholar
- Mo Li and Yunhao Liu. 2007. Rendered Path: Range-free localization in anisotropic sensor networks with holes. In Proceedings of ACM MOBICOM. Google ScholarDigital Library
- J-M Lien and N. M. Amato. 2004. Approximate convex decomposition of polygons. In Proceedings of ACM Symposium on Computational Geometry (SoCG). Google ScholarDigital Library
- A. Lingas. 1982. The power of non-rectilinear holes. In Proceedings of the 9th International Colloqnium Automata Languages Program. Google ScholarDigital Library
- W. Liu, D. Wang, H. Jiang, W. Liu, and C. Wang. 2012. Approximate convex decomposition based localization in wireless sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
- Y. Lu, J.-M. Lien, M. Ghosh, and N. Amato. 2012. Alpha-decomposition of polygons. In Proceedings of Shape Modeling International.Google Scholar
- J. Newsome and D. Song. 2003. GEM: Graph embedding for routing and data-centric storage in sensor networks without geographic information. In Proceedings of ACM SENSYS. Google ScholarDigital Library
- A. Nguyeny, N. Milosavljevic, Q Fang, J. Gao, and L. J. Guibas. 2008. Landmark selection and greedy landmark-descent routing for sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
- A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica. 2003. Geographic routing without location information. In Proceedings of ACM MOBICOM. Google ScholarDigital Library
- Z. Ren, J. Yuan, C. Li, and W. Liu. 2011. Minimum near-convex decomposition for robust shape representation. In Proceedings of ICCV. Google ScholarDigital Library
- J.-R. Sack and J. Urrutia. 2000. Handbook of Computational Geometry. Elsevier Science Publishers, B. V. North-Holland, Amsterdam. Google ScholarDigital Library
- Y. Shang and W. Ruml. 2004. Improved MDS-based localization. In Proceedings of IEEE INFOCOM.Google Scholar
- Y. Shang, W. Ruml, Y. Zhang, and M. P. J. Fromherz. 2003. Localization from mere connectivity. In Proceedings of ACM MOBIHOC. Google ScholarDigital Library
- M. Tsai, H. Yang, and W. Huang. 2008. Axis-based virtual coordinate assignment protocol and delivery-guaranteed routing protocol in wireless sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
- Y. Wang, J. Gao, and J. S. B. Mitchell. 2006. Boundary recognition in sensor networks by topological methods. In Proceedings of ACM MOBICOM. Google ScholarDigital Library
- Y. Wang, S. Lederer, and J. Gao. 2009. Connectivity-based sensor network localization with incremental delaunay refinement method. In Proceedings of IEEE INFOCOM.Google Scholar
- Y. Zhao, B. Li, Q. Zhang, Y. Chen, and W. Zhu. 2005. Hop ID based routing in mobile ad hoc networks. In Proceedings of IEEE ICNP. Google ScholarDigital Library
- X. Zhu, R. Sarkar, and J. Gao. 2008. Shape segmentation and applications in sensor networks. In Proceedings of IEEE INFOCOM.Google Scholar
Index Terms
- Convex Partitioning of Large-Scale Sensor Networks in Complex Fields: Algorithms and Applications
Recommendations
Partitioning a graph into convex sets
Let G be a finite simple graph. Let S@?V(G), its closed interval I[S] is the set of all vertices lying on shortest paths between any pair of vertices of S. The set S is convex if I[S]=S. In this work we define the concept of a convex partition of ...
Routing with hexagonal virtual coordinates in wireless sensor networks
Using geographic routing, like GPSR, is efficient for ad hoc and wireless sensor networks, but it requires that nodes be aware of their physical positions. However, if there are holes in the network, routing across them using GPSR will lead to a lot of ...
Comments