Earticle

초록

영어

Wireless sensor networks are being applied to a wider and wider range and better quality of network service is becoming increasingly important. Node deployment has been a key point of research on development of wireless sensor network. In essence, the problem node deployment of wireless sensor networks calculates the position where sensors are placed in regions to satisfy specific demands of network. This problem has been proved to be a NP-complete one. This thesis proposes node deployment algorithm about wireless sensor networks based on Steiner tree algorithm. On the basis of the triangle Steiner tree algorithm, it considers the two aspects algorithm complexity and practical topology to design improvement strategies. The algorithm can ensure high arithmetic speed and better results to solve node deployment based on network connectivity.

목차

Abstract
 1. Introduction
 2. Overview on the Triangle Steiner Tree Algorithm
  2.1 The Triangle Steiner Tree Algorithm and Related Definitions
  2.2 Application and Limitation of the Triangle Steiner Tree Algorithm
 3. Description about the Node Deployment Algorithm Based on Improved Steiner Tree
  3.1 DISTA Detailed Design
  3.2 DISTA Algorithm Flow
 4. Simulation Results and Experimental Analysis
  4.1 Analysis about Node Deployment Results of DISTA under the Condition of Set I
  4.2 Analysis about Node Deployment Results of DISTA Under the Condition of Set II
  4.3 Analysis about DISTA Effectiveness
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Xuemei Sun [ School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin, China Bo Yan, School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605