Abstract:
The relay node placement problem in wireless sensor networks strongly depends on the data traffic patterns, which can be dynamically changing and not known with precision...Show MoreMetadata
Abstract:
The relay node placement problem in wireless sensor networks strongly depends on the data traffic patterns, which can be dynamically changing and not known with precision in advance. In our work, locations of the relay nodes need to be defined with the aim of improving network performance. While in current literature a uniform and constant traffic generation is usually assumed, we propose a robust optimization methodology to deal with the uncertainty in nodes' traffic generation. Solving to optimality the resulting robust optimization problem would be extremely expensive in computational terms, therefore we propose a distinctive robustness measure aiming at dramatically reducing computational costs without sacrificing robustness. The resulting optimization problem is tackled using a bio-inspired meta-heuristic, namely a genetic algorithm. The approach is validated through extensive simulation experiments. Results show that the performance degradation of the robust solutions is minimized in comparison with the solutions obtained ignoring the uncertainty.
Published in: 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt)
Date of Conference: 13-17 May 2013
Date Added to IEEE Xplore: 08 August 2013
ISBN Information:
Conference Location: Tsukuba, Japan