The deployment algorithm based on cutting a triangle for wireless sensor networks

Liang Cheng Shiu, Chao Yang Lee, Chu Sing Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In a large monitored area, the static sensors are deployed by random. It is obvious there are coverage holes and a coverage hole can be polygonal. Because a polygon can be decomposed into a piece of triangles, triangles are considered, and the three nodes of triangles are the static sensors deployed randomly. This paper presents an efficiently deployment algorithm which is based on the coverage hole is a triangle. The triangle is cut into small triangles which contains at least one interior angles is equal to 60°. These small triangles with 60° angle can be guaranteed full coverage, and the rest area of the triangle is still a triangle. Continue the cutting until the triangle is small enough that the sensors on the three nodes can fully cover the area. As a result, the coverage hole of triangle can be full coverage. Beside, the x-y coordinates of each deployed sensor can be deduced.

Original languageEnglish
Title of host publication2010 International Conference on Information Science and Applications, ICISA 2010
DOIs
Publication statusPublished - 2010 Jul 15
Event2010 International Conference in Information Science and Applications, ICISA 2010 - Seoul, Korea, Republic of
Duration: 2010 Apr 212010 Apr 23

Publication series

Name2010 International Conference on Information Science and Applications, ICISA 2010

Other

Other2010 International Conference in Information Science and Applications, ICISA 2010
CountryKorea, Republic of
CitySeoul
Period10-04-2110-04-23

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'The deployment algorithm based on cutting a triangle for wireless sensor networks'. Together they form a unique fingerprint.

Cite this