loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Authors: Pablo Adasme 1 and Ali Firoozabadi 2

Affiliations: 1 Department of Electrical Engineering, Universidad de Santiago de Chile, Avenida Ecuador 3519, Santiago, Chile ; 2 Department of Electricity, Universidad Tecnológica Metropolitana, Av. Jose Pedro Alessandri 1242, 7800002, Santiago, Chile

Keyword(s): Combinatorial Optimization, p-Median and Spanning Tree Problems, Mixed-integer Linear Programming, Wireless Sensor Networks, Local Search Algorithm.

Abstract: Let G = (V,E) be a complete graph with set of nodes V = {1,...,n} and edge set E = {1,...,m} representing a wireless sensor network. In this paper, we consider the problem of finding a minimum cost spanning tree backbone formed with p ∈ Z+ out of n nodes where p < n in such a way that the n − p remaining nodes of G are connected to the leaf nodes of the backbone structure at minimum connectivity cost. Notice that this problem arises as a combination of two classical combinatorial optimization problems, namely the p-Median and spanning tree problems. We propose two mixed-integer linear programming (MIP) formulations for this problem as well as a local search heuristic. The proposed models and algorithm can be used as a reference source for comparison purposes when designing future network protocols. We consider complete graph instances with Euclidean and random uniform costs. Our preliminary numerical results indicate that one of the proposed models performs slightly better than the other one in terms of solution quality and CPU times obtained with the Gurobi solver. Finally, the proposed heuristic allows one to obtain near-optimal solutions in remarkably less CPU time compared to the MIP models. (More)

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 54.144.55.253

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:
Adasme, P. and Firoozabadi, A. (2021). On a Wireless Sensor Network Problem with Spanning Tree Backbone. In Proceedings of the 18th International Conference on Wireless Networks and Mobile Systems - WINSYS, ISBN 978-989-758-529-6; ISSN 2184-948X, pages 76-82. DOI: 10.5220/0010569700760082

@conference{winsys21,
author={Pablo Adasme. and Ali Firoozabadi.},
title={On a Wireless Sensor Network Problem with Spanning Tree Backbone},
booktitle={Proceedings of the 18th International Conference on Wireless Networks and Mobile Systems - WINSYS,},
year={2021},
pages={76-82},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010569700760082},
isbn={978-989-758-529-6},
issn={2184-948X},
}

TY - CONF

JO - Proceedings of the 18th International Conference on Wireless Networks and Mobile Systems - WINSYS,
TI - On a Wireless Sensor Network Problem with Spanning Tree Backbone
SN - 978-989-758-529-6
IS - 2184-948X
AU - Adasme, P.
AU - Firoozabadi, A.
PY - 2021
SP - 76
EP - 82
DO - 10.5220/0010569700760082

0123movie.net