Next Article in Journal
Toward Autonomous UAV Localization via Aerial Image Registration
Next Article in Special Issue
autoCoin: Secure Content Sharing Based on Blockchain for Vehicular Cloud
Previous Article in Journal
First Demonstration of L-Band High-Power Limiter with GaN Schottky Barrier Diodes (SBDs) Based on Steep-Mesa Technology
Previous Article in Special Issue
Max-Min Fairness and Sum Throughput Maximization for In-Band Full-Duplex IoT Networks: User Grouping, Bandwidth and Power Allocation
 
 
Article

A Randomized Greedy Heuristic for Steerable Wireless Backhaul Reconfiguration

1
Department of Engineering and Applied Technologies, University Center of Defense, San Javier Air Force Base, MDE-UPCT, 30720 Murcia, Spain
2
BISDN GmbH, 10785 Berlin, Germany
3
School of Systems and Enterprises, Stevens Institute of Technology, Hoboken, NJ 07030, USA
4
Department of Mathematics and Computer Science, Karlstad University, 65188 Karlstad, Sweden
*
Author to whom correspondence should be addressed.
Academic Editor: Khaled Elleithy
Electronics 2021, 10(4), 434; https://doi.org/10.3390/electronics10040434
Received: 21 December 2020 / Revised: 1 February 2021 / Accepted: 5 February 2021 / Published: 10 February 2021
(This article belongs to the Special Issue Access Technology in 5G and Mobile Communication Networks)
In this paper, we consider the reconfiguration of wireless backhaul networks with mechanically steerable antennas in the presence of changing traffic demands. Reconfiguration requires the scheduling and coordination of several operations, including antenna alignment and link establishment/removal, with minimal disruption to existing user traffic. Previously, we proposed a Mixed Integer Linear Program (MILP) to orchestrate such reconfiguration with minimal packet loss. While the MILP solves the problem optimally for a limited number of discrete reconfiguration time slots, it does not scale well. In this paper, we propose an iterative randomized greedy algorithm to obtain suboptimal solutions in reduced time. The algorithm schedules the reconfiguration of wireless links by ranking them according to a set of attributes with associated weights and selecting them according to a randomized greedy function. Results on six different network scenarios indicate that the proposed algorithm can achieve good quality solutions in significantly less time. Furthermore, by extending the reconfiguration time beyond the maximum number of time slots solvable by the MILP, the proposed heuristic can obtain superior solutions for some problem instances. The number of iterations of the algorithm can be tuned for its applicability in both offline and online planning scenarios. View Full-Text
Keywords: wireless backhaul networks; reconfiguration; randomized greedy heuristic; mechanical steering wireless backhaul networks; reconfiguration; randomized greedy heuristic; mechanical steering
Show Figures

Figure 1

MDPI and ACS Style

Skorin-Kapov, N.; Santos, R.; Ghazzai, H.; Kassler, A. A Randomized Greedy Heuristic for Steerable Wireless Backhaul Reconfiguration. Electronics 2021, 10, 434. https://doi.org/10.3390/electronics10040434

AMA Style

Skorin-Kapov N, Santos R, Ghazzai H, Kassler A. A Randomized Greedy Heuristic for Steerable Wireless Backhaul Reconfiguration. Electronics. 2021; 10(4):434. https://doi.org/10.3390/electronics10040434

Chicago/Turabian Style

Skorin-Kapov, Nina, Ricardo Santos, Hakim Ghazzai, and Andreas Kassler. 2021. "A Randomized Greedy Heuristic for Steerable Wireless Backhaul Reconfiguration" Electronics 10, no. 4: 434. https://doi.org/10.3390/electronics10040434

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop