Low complexity K-covered deployment methods for wireless sensor networks

Hsu Yang Kung, Chung-Ming Huang, Hao Hsiang Ku, Ming Jen Hsu

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)


One of the fundamental issues in the wireless sensor networks is the deployment problem. In past researches, three deployment methods are widely used, which are the random deployment, the computed deployment and the deployment by graphic theory. All of them have high time complexity and unsuitable for the k-covered sensor deployment. To effectively evaluate the performance of wireless sensor networks, this study firstly concludes nine evaluation factors. Furthermore, to achieve scalable and efficient deployment, this study proposes two novel topology deployment methods, which are the slow-start d square-encircled methods. Without the necessity of pre-analyzing unknown environments, the proposed deployment methods successfully prove a k-covered scenario with minimal overlapping area using three different power capabilities of sensors. Finally, the simulation results reveal the efficiency and effectiveness of the proposed deployment schemes.

頁(從 - 到)209-219
期刊Journal of Internet Technology
出版狀態Published - 2007 4月 1

All Science Journal Classification (ASJC) codes

  • 軟體
  • 電腦網路與通信


深入研究「Low complexity K-covered deployment methods for wireless sensor networks」主題。共同形成了獨特的指紋。