A restricted delaunay triangulation graph based algorithm for self-deployment in mobile sensor networks

Jun Li, Baihai Zhang*, Lingguo Cui

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

Self-deployment is one of the main research issues in wireless mobile sensor networks. It determines quality of service of networks, such as coverage and connectivity. A suitable topology is very important for self-deployment based on virtual force. In this paper, we discussed the performances of topology graph by theory analysis. Then we presented a restricted Delaunay triangulation graph based algorithm (RDTG) for self-deployment in mobile sensor networks. RDTG constructs a logical topology graph without intersection of edges, and tries to make the node's neighbor equal to 6 by moving the node according the property of maximum the minimum angle of the triangles in TDG. Simulation results show that self-deployment by virtual force based on RTDG is effective to reach the ideal deployment with good performances.

Original languageEnglish
Pages (from-to)3155-3162
Number of pages8
JournalJournal of Computational Information Systems
Volume6
Issue number10
Publication statusPublished - Oct 2010

Keywords

  • Mobile sensor networks
  • Restricted delaunay triangulation graph
  • Self-deployment
  • Virtual force

Fingerprint

Dive into the research topics of 'A restricted delaunay triangulation graph based algorithm for self-deployment in mobile sensor networks'. Together they form a unique fingerprint.

Cite this