A Framework for Solving the Configuration Problem in Wireless Sensor Networks

Wireless Sensor Network Configuration Problem seeks to dimension a WSN while taking into account both the traffic pattern, data aggregation and the transmission range assignment. Regarding the objectives of the problem, we first intend to minimize the overall energy consumption of the network and next to guarantee node energy consumption fairness between the sensors. Previously, we discussed this problem for the linear network. Herein, we consider a two-dimensional network where sensors are uniformly placed in the target area. The network is divided into cells and the Network configuration problem has to determine the number of cells and their respective sizes such that the above objectives are met. A framework, based on the dynamic programming algorithm, is proposed to solve this problem. This framework provides optimal solution, is scalable and has a low computational complexity.