loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ons Abdelkhalek 1 ; Saoussen Krichen 2 and Adel Guitouni 3

Affiliations: 1 University of Tunis, Tunisia ; 2 University of Jendouba, Tunisia ; 3 University of Victoria, Canada

ISBN: 978-989-758-017-8

Keyword(s): Heterogeneous Network Management, Tabu Search Algorithm, Multi-Objective Optimization Problem, Genetic Algorithm.

Related Ontology Subjects/Areas/Topics: Agents ; Applications ; Artificial Intelligence ; Bioinformatics ; Biomedical Engineering ; Decision Support Systems ; Enterprise Information Systems ; Information Systems Analysis and Specification ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Mathematical Modeling ; Mathematical Programming ; Methodologies and Technologies ; Network Optimization ; Operational Research ; Optimization ; Pattern Recognition ; Simulation ; Software Engineering ; Symbolic Systems

Abstract: The Multi--objective Node Placement (MONP) problem focuses on extending an existing communication infrastructure with new wireless heterogeneous network components while achieving cost effectiveness and ease of management. This extention aims to broaden the coverage and handle demand fluctuations. In this paper, the MONP problem is modeled as a multi--objective optimization problem with three objectives: maximizing the communication coverage, minimizing active nodes and communication devices costs and maximizing of the total capacity bandwidth in the network. As the MONP problem is ${\cal NP}$--Hard, we present a meta--heuristic based on the Tabu Search approach specifically designed for multi--objective problems in wireless networks. An empirical validation of the model is defined based on a selection of a real and large set of instances and supported by a performance comparison between the suggested algorithm and a multi--objective genetic algorithm (MOGA). All tests are performed on a real simulation environment for the maritime surveillance application. We show empirically that the proposed approach is more relevant to solve the MONP problem regarding each objective in term of cardinality-based performance index. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.204.176.189

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Abdelkhalek, O.; Krichen, S. and Guitouni, A. (2014). An Adaptive Tabu Search Algorithm for the Multi-Objective Node Placement Problem In Heterogeneous Networks.In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 249-256. DOI: 10.5220/0004834102490256

@conference{icores14,
author={Ons Abdelkhalek. and Saoussen Krichen. and Adel Guitouni.},
title={An Adaptive Tabu Search Algorithm for the Multi-Objective Node Placement Problem In Heterogeneous Networks},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={249-256},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004834102490256},
isbn={978-989-758-017-8},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - An Adaptive Tabu Search Algorithm for the Multi-Objective Node Placement Problem In Heterogeneous Networks
SN - 978-989-758-017-8
AU - Abdelkhalek, O.
AU - Krichen, S.
AU - Guitouni, A.
PY - 2014
SP - 249
EP - 256
DO - 10.5220/0004834102490256

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.