ABSTRACT
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any point given the number of nodes lying up to a specific distance (2 units) from it, employing a graph representation where an edge exists between any two nodes close than 2 units from one another. The expected number of un-triangulated coverage holes, i.e. uncovered areas which cannot be triangulated by adjacent nodes, in a finite target area is derived. Simulation results corroborate the probabilistic analysis with low error, for any node density. These results will find applications in triangulation-based or trilateration-based pointing analysis, or any computational geometry application within the context of triangulation.
- Ahmed N., Kanhere S. S. and Jha S., "The Holes Problem in Wireless Sensor Networks: A Survey", ACM SIGMOBILE Review, Volume 9, Issue 2, April 2005. Google ScholarDigital Library
- Aurenhammer F., "Voronoi Diagrams - A Survey of Fundamental Geometric Data Structure", ACM Computing Surveys, vol. 23, no. 3, 1991, pp345--405. Google ScholarDigital Library
- Gibson D., Mobile Communications Handbook, Springer-Verlag, 1999. Google ScholarDigital Library
- Hall P., "Introduction to the Theory of Coverage Processes", John Wiley and Sons, 1988.Google Scholar
- Howard A., Mataric M. J. and Sukhatme G. S., "An Incremental Self-Deployment Algorithm for Mobile Sensor Networks", Autonomous Robots, Special Issue on Intelligent Embedded Systems, 2002. Google ScholarDigital Library
- Kumar S., Lai T. H. and Balogh J., "On k-coverage in a Mostly Sleeping Sensor Network", Proceedings of the Tenth Annual International Conference on Mobile Computing and Networking, Mobicom '04, pp144--158, 2004. Google ScholarDigital Library
- Li X. and Hunter D. K., "Distributed Coordinate-free Algorithm for Full Sensing Coverage", International Journal of Sensor Networks, 2008. Google ScholarDigital Library
- Li X. and Hunter D. K., Yang K., "Distributed Coordinate-Free Hole Detection and Recovery", IEEE GLOBECOM 2006, San Francisco, USA, 27th November - 1st December, 2006.Google Scholar
- Li X.-Y., Wan P.-J. and Frieder O., "Coverage in Wireless Adhoc Sensor Networks", IEEE Transactions on Computers, vol. 52, no. 6, pp753--763, 2003. Google ScholarDigital Library
- Megerian S., Koushanfar F. and Potkonjak M., "Worst and Best-case Coverage in Sensor Networks", IEEE Transactions on Mobile Computing, 2005. Google ScholarDigital Library
- Meguerdichian S., Koushanfar F., M. Potkonjak and Srivastava M., "Coverage Problems in Wireless Ad-hoc Sensor Network", IEEE INFOCOM, 2001, pp1380--1387.Google ScholarCross Ref
- Nicules D. and Nath B., "Ad-hoc Pointing System (APS) Using AoA", Proceedings of IEEE INFOCOM, 2003.Google Scholar
- Okabe A., Boots B. and K. Sugihara, "Spatial Tessellations: Concepts and Applications of Voronoi Diagrams", John Wiley & Sons, 1992. Google ScholarDigital Library
- Wan P.-J. and YIC.-W., "Coverage by Randomly Deployed Wireless Sensor Networks", IEEE Transactions on Information Theory, June 2006, vol. 52, no. 6.Google Scholar
- Wang G., Cao G. and T. Portala, "Movement-assisted Sensor Deployment", IEEE INFOCOM, 2004.Google Scholar
- Wu C.-H., Lee K.-C. and Chung Y.-C., "A Delaunay Triangulation Based Method for Wireless Sensor Network Deployment", Twelfth International Conference on Parallel and Distributed Systems, ICPADS 2006. Google ScholarDigital Library
- Zhang H. and Hou J., "On Deriving the Upper Bound of Lifetime for Large Sensor Networks", Fifth ACM International Symposium on Mobile ad-hoc Networking and Computing, May 24--26 2004, Roppongi Hills, Tokyo, Japan. Google ScholarDigital Library
- Zheng Y., Brady D. J. and Agarwal P. K., "Localization Using Boundary Sensors: an Analysis Based on Graph Theory", ACM Transactions on Sensor Networks, vol. 4, vol. 3, Article 21, October 2007. Google ScholarDigital Library
Index Terms
- Probabilistic model of triangulation
Recommendations
Delaunay triangulation by a technical insertion point applied for complexes geometries
Intelligent Systems and Knowledge Management (Part II)The present work consists to elaborate a computing program able to generate a Delaunay unstructured triangular meshes around the complex configurations applied in aerodynamics, like airfoil of aircraft, multi-elements airfoils, nacelle, fuselage, etc... ...
Localizing the Delaunay Triangulation and its Parallel Implementation
ISVD '12: Proceedings of the 2012 Ninth International Symposium on Voronoi Diagrams in Science and EngineeringWe show how to localize the Delaunay triangulation of a given planar point set, namely, bound the set of points which are possible Delaunay neighbors of a given point. We then exploit this observation in an algorithm for constructing the Delaunay ...
Efficient parallel geometric algorithms on a mesh of trees
ACM-SE 33: Proceedings of the 33rd annual on Southeast regional conferenceIn this paper, we present some efficient parallel geometric algorithms for computing the All Nearest Neighbors, Delaunay Triangulation, Convex Hull, and Voronoi Diagram of a point set S with N points in the plane. The algorithm of All Nearest Neighbors ...
Comments