Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2016, Vol. 39 ›› Issue (3): 91-94,104.doi: 10.13190/j.jbupt.2016.03.016

• Reports • Previous Articles     Next Articles

Relay Node Placement Algorithm under the Condition of Multi Greedy Criterion

WANG Zhu1, HU Pin1, DONG Meng-meng1, TONG Xiao-jun2   

  1. 1. School of Computer Science and Technology, Harbin Institute of Technology at Weihai, Shandong Weihai 264209, China;
    2. School of Information and Electrical Engineering, Harbin Institute of Technology at Weihai, Shandong Weihai 264209, China
  • Received:2015-06-10 Online:2016-06-28 Published:2016-06-28

Abstract:

In order to solve the problem of high cost of network construction and low lifetime of network, it is a problem to solve the problem of high cost of network construction and low network lifetime of relay nodes in wireless sensor network,this article proposed a new relay node placement algorithm based on the greedy criterion. By adopting the performance evaluation criteria of the balanced energy consumption rate and the total energy consumption of the network, the algorithm contrasts the recent greedy criterion, the directional greedy criterion and the minimum angle of greedy criterion respectively, and then constrains and optimizes the data transmission path of node by introducing data flow restriction, communication capacity and maximum data transfer times. Experiments show that, the recent greedy criterion has less energy consumption, and can balance the energy consumption of each node in the network. Moreover, this recent greedy criterion can not only give proper location of each node, but also reduce the energy consumption of the whole network effectively.

Key words: wireless sensor network, relay node placement, greedy criterion, network lifetime, balanced energy consumption

CLC Number: