Using dynamic programming to solve the Wireless Sensor Network Configuration Problem. (1st April 2017)

• Record Type: Journal Article
• Authors: Gogu, Ada; Nace, Dritan; Natalizio, Enrico; Challal, Yacine
• Is Part Of: Journal of network and computer applications. Volume 83(2017)
• Page Start: 140
• Page End: 154
• Publication Date: 2017-04-01
• Subjects: WSN -- Dynamic programming -- Sensor placement -- Network configuration; Microcomputers -- Periodicals; Computer networks -- Periodicals; Application software -- Periodicals; Micro-ordinateurs -- Périodiques; Réseaux d'ordinateurs -- Périodiques; Logiciels d'application -- Périodiques; Application software; Computer networks; Microcomputers; Periodicals; 004.05; 004
• DOI: 10.1016/j.jnca.2017.01.022
• Languages: English
• ISSNs: 1084-8045

Abstract

Abstract: This work studies the problem of network configuration for Wireless Sensor Networks (WSN), consisting of two interdependent problems: sensor placement and topology control, by taking into consideration both the traffic load and the transmission range assignment. The design objectives are (i) reducing the overall energy consumption and (ii) ensuring node energy consumption fairness between the sensors. First, the problem of placing the sensors in the optimal positions is studied and then a power control scheme is put in place to manage the topology of the network. For both the two sub-problems, we first consider the one dimensional (or linear) network case and next the two-dimensional case. The two sub-problems are considered within a unifying mathematical framework based on dynamic programming, in order to guarantee the optimality of the solution. The method can easily be adapted to solve the problem for discrete values of transmission range. The method presented in this work shows a low computational complexity in comparison to other methods, and, due to its implementation simplicity, it may be of great help to network designers in the planning phase of WSN deployment.