Journal on Communications ›› 2016, Vol. 37 ›› Issue (4): 139-148.doi: 10.11959/j.issn.1000-436x.2016081

• academic paper • Previous Articles     Next Articles

Minimum number oriented relay node deployment algorithm in two-tiered WSN

Chun-yu MIAO1,2,Li-na CHEN1,Guo-yong DAI2,Fan YANG2,Qing-zhang CHEN2   

  1. 1 College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua 321004, China
    2 College of Computer,Zhejiang University of Technology, Hangzhou 310023, China
  • Online:2016-04-25 Published:2016-04-26
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;Opening Fund of Zhejiang Provincial Top Key Discipline of Computer Science and echnology at Zhejiang Normal University;Zhejiang Province Science Technology Department Public Welfare Technology Application Research Project

Abstract:

Aiming at minimizing the number of relay nodes distributed in the sensing area while keeping the feasible communication with at least one relay node for every sensor node, two algorithms (i.e. the integral linear programming optimal algorithm and the heuristic algorithm) were proposed. First, the integral linear programming optimal algorithm was designed to find the best region of deploying rela nodes within candidate regions through integer linear program-ming. In the large-scale wireless sensor network, the heuristic algorithm was proposed that found the best deployment re-gion through iteratively updating the deployment area luding the most relay nodes. Finally, simulation results show that the two proposed algorithms can minimize the number of relay nodes needed with the guarantee of serving all sensor nodes.

Key words: relay nodes, deployment algorithm, integer linear programming, heur ic algorithm, node coverage

No Suggested Reading articles found!