Premium
Configuration‐based approach for topological problems in the design of wireless sensor networks
Author(s) -
Morais Vinicius,
Mateus Geraldo Robson
Publication year - 2019
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12615
Subject(s) - cardinality (data modeling) , computer science , column generation , wireless sensor network , integer programming , mathematical optimization , linear programming , routing (electronic design automation) , network topology , network planning and design , wireless network , distributed computing , integer (computer science) , wireless , topology (electrical circuits) , computer network , mathematics , algorithm , telecommunications , combinatorics , data mining , programming language
In this paper, we deal with two routing problems that integrate coverage and cardinality constraints to optimize the wireless sensor networks lifetime. Problems based on arborescence and cycle topologies are defined on the design of that kind of network. We propose configuration‐based linear integer programming formulations and devise column‐and‐row generation (CRG) algorithms to evaluate the bounds. Computational experiments showed that configuration‐based formulations dominate the formulations being compared and indicate CRG as an alternative to solve related location–allocation problems in transportation and telecommunication networks.