Optimization Problems in Wireless Sensor Networks

Abstract

The Wireless Sensor Networks (WSNs) design related questions give rise to new complex and difficult theoretical problems and challenges in operations research and optimization areas. As WSNs become increasingly pervasive, a good understanding of these problems in terms of theoretical complexity is of great help in designing appropriate algorithms. In this paper, we examine some of the most fundamental optimization problems related to coverage, topology control, scheduling, routing and mobility in WSNs. Then we focus on their complexity and analyze the differences that exist with the counter part conventional theoretical problems or those already studied in traditional networks. We present as well some of the main methods proposed in the literature and report some open issues regarding these problems.