Feng Li
Jun Luo
ABSTRACT
A wireless sensor network becomes dynamic if it is monitoring a time-variant event (e.g., expansion of oil spill in ocean). In such applications, on-line boundary detection is a crucial function, as it allows us to track the event variation in a timely fashion. However, the problem becomes very challenging as it demands a highly efficient algorithm to cope with the dynamics introduced by the evolving event. Moreover, as many physical events occupy volumes rather than surfaces (e.g., oil spill again), the algorithm has to work for 3D cases. To this end, we propose UNiform Fast On-Line boundary Detection (UNFOLD) to tackle the challenge. The essence of UNFOLD is to inverse node coordinates such that a "notched" surface is "unfolded" into a convex one, which in turn reduces boundary detection to simple convexity test. UNFOLD is uniform as every node behaves the same (performing coordinate inversion and convexity test), and it is super fast as both computation and communication involve only one-hop neighbors. We prove the correctness and efficiency of UNFOLD; we also use simulations and implementations to evaluate its performance, which demonstrates that UNFOLD is 100 times more time and energy efficient than the most up-to-date proposal.
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2 edition, 2001. Google Scholar
Digital Library
- M. Ding, D. Chen, K. Xing, and X. Cheng. Localized Fault-Tolerant Event Boundary Detection in Sensor Networks. In Proc. of the 24th IEEE INFOCOM, 2005.Google Scholar
- D. Dong, Y. Liu, and X. Liao. Fine-Grained Boundary Recognition in Wireless Ad Hoc and Sensor Networks by Topological Methods. In Proc. of the 10th ACM MobiHoc, 2009. Google ScholarDigital Library
- S. Durocher, D. Kirkpatrick, and L. Narayanan. Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. In Proc. of the 9th ICDCN, 2008. Google ScholarDigital Library
- H. Edelsbrunner, D. Kirkpatrick, and R. Seidel. On the Shape of a Set of Points in the Plane. IEEE Trans. on Information Theory, 29(4):551--559, 1983.Google ScholarDigital Library
- M. Fayed and H. Mouftah. Localised Alpha-Shape Computations for Boundary Recognition in Sensor Networks. Elsevier Ad Hoc Networks, 7(6):1259--1269, 2009. Google ScholarDigital Library
- R. Ghrist and A. Muhammad. Coverage and Hole-Detection in Sensor Networks via Homology. In Proc. of the 4th ACM/IEEE IPSN, 2005. Google ScholarDigital Library
- D. Goldenberg, P. Bihler, M. Cao, J. Fang, B. Anderson, A. S. Morse, and Y. R. Yang. Localization in Sparse Networks using Sweeps. In Proc. of the 12th ACM MobiCom, 2006. Google ScholarDigital Library
- B. Joe. Three-Dimensional Triangulations from Local Transformations. SIAM J. Sci. Stat. Comput., 10(4):718--741, 1989. Google ScholarDigital Library
- S. Katz, A. Tal, and R. Basri. Direct Visibility of Point Sets. In Proc. of the 34th ACM SIGGRAPH, 2007. Google ScholarDigital Library
- A. Kröller, S. Fekete, D. Pfisterer, and S. Fischer. Deterministic Boundary Recognition and Topology Extraction for Large Sensor Networks. In Proc. of the 17th ACM/SIAM SODA, 2006. Google ScholarDigital Library
- J. Luo and Y. He. GeoQuorum: Load Balancing and Energy Efficient Data Access in Wireless Sensor Networks. In Proc. of the 30th IEEE INFOCOM (mini-conference), 2011.Google ScholarCross Ref
- J. Luo, F. Li, and Y. He. 3DQS: Distributed Data Access in 3D Wireless Sensor Networks. In Proc. of the IEEE ICC, 2011.Google ScholarCross Ref
- J. Luo, H. V. Shukla, and J.-P. Hubaux. Non-Interactive Location Surveying for Sensor Networks with Mobility-Differentiated ToA. In Proc. of the 25th IEEE INFOCOM, 2006.Google Scholar
- R. Nowak and U. Mitra. Boundary Estimation in Sensor Networks. In Proc. of the 2nd ACM/IEEE IPSN, 2003. Google ScholarDigital Library
- A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic Routing without Location Informtion. In Proc. of the 9th ACM MobiCom, 2003. Google ScholarDigital Library
- Y. Shang and W. Ruml. Improved MDS-Based Localization. In Proc. of the 23rd IEEE INFOCOM, 2004.Google ScholarCross Ref
- S. Subramanian, S. Shakkottai, and P. Gupta. Optimal Geographic Routing for Wireless Networks with Near-arbitrary Holes and Traffic. In Proc. of the 27th IEEE INFOCOM, 2008.Google ScholarCross Ref
- G. Tan, H. Jiang, S. Zhang, and A.-M. Kermarrec. Connectivity-based and Anchor-Free Localization in Large-Scale 2D/3D Sensor Networks. In Proc. of the 11th ACM MobiHoc, 2010. Google ScholarDigital Library
- Y. Wang, J. Gao, and J. Mitchell. Boundary Recognition in Sensor Networks by Topological Methods. In Proc. of the 12th ACM MobiCom, 2006. Google ScholarDigital Library
- L. Xiang, J. Luo, and A. Vasilakos. Compressed Data Aggregation for Energy Efficient Wireless Sensor Networks. In Proc. of the 8th IEEE SECON (to appear), 2011.Google ScholarCross Ref
- C. Zhang, Y. Zhang, and Y. Fang. Localized Algorithms for Coverage Boundary Detection in Wireless Sensor Networks. Springer Wireless Networks, 15(1):3--20, 2009. Google ScholarDigital Library
- H. Zhou, S. Xia, M. Jin, and H. Wu. Localized Algorithm for Precise Boundary Detection in 3D Wireless Networks. In Proc. of the 30th IEEE ICDCS, 2010. Google ScholarDigital Library
Index Terms
- UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks
Recommendations
LBDP: localized boundary detection and parametrization for 3-D sensor networks
Many applications of wireless sensor networks involve monitoring a time-variant event (e.g., radiation pollution in the air). In such applications, fast boundary detection is a crucial function, as it allows us to track the event variation in a timely ...
Three-dimensional greedy routing in large-scale random wireless sensor networks
In this paper, we investigate how to design greedy routing to achieve sustainable and scalable in a large-scale three-dimensional (3D) sensor network. Several 3D position-based routing protocols were proposed to seek either delivery guarantee or energy-...
Optimal Extension Field Inversion in the Frequency Domain
WAIFI '08: Proceedings of the 2nd international workshop on Arithmetic of Finite FieldsIn this paper, we propose an adaptation of the Itoh-Tsujii algorithm to the frequency domain for efficient inversion in a class of Optimal Extension Fields . To the best of our knowledge, this is the first time a frequency domain finite field ...
Comments