Relay Node Placement Algorithm Based on Grid in Wireless Sensor Network

Reasonable relay node setting has an important influence on reducing network energy consumption and prolonging network lifetime in wireless sensor network. Due to the complication of node placement environment, locations of relay nodes are restricted in the application. To solve this problem, the paper presents a two-tiered relay node placement algorithm. The algorithm specifies grid intersection points as candidate locations of relay nodes, uses the constraints(the maximum hop count, communication path selection criteria and relay node communication capacity) to optimize relay node placement model, and formulates the nearest mechanism greedy rule. The network connectivity is guaranteed by fewer relay nodes as far as possible. Finally according to characteristics of the algorithm, the paper puts forward ways to reduce energy consumption. Experimental results show that the performance of the algorithm is more superior to greedy algorithm, which uses the nearest greedy rule.