MATROID-BASED TOPOLOGY CONTROL METHOD FOR MOBILE AD HOC NETWORKS
Computer systems and network · 2026-06 · 8 (1) · 244-253
DOI: 10.23939/csn2026.01.244 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer systems and network, 2026-06. Verfasst von I V Teleshko. Die Arbeit nennt 10 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper addresses the problem of reducing control (service) traffic in mobile Ad Hoc networks through topology control. A novel approach based on matroid theory is proposed for constructing a reduced network structure. The network is modeled as an undirected graph, where a graphical matroid is defined, and the optimization problem is formulated as the search for a minimum spanning tree representing a matroid basis. A centralized topology control algorithm is developed, providing minimization of the total communication cost while preserving network connectivity. In addition, a distributed version of the algorithm is proposed, which relies on local neighbor information and is suitable for dynamic network environments. The proposed matroid-based approach enables a significant reduction in control traffic without substantial degradation of key performance metrics, such as packet delivery ratio and end-to-end delay. The results demonstrate the applicability of the method for improving routing efficiency in mobile Ad Hoc networks. Keywords: Ad Hoc networks, control traffic, matroid theory, minimum spanning tree, routing, topology control
Zitieren
APA
Teleshko, I. V. (2026). MATROID-BASED TOPOLOGY CONTROL METHOD FOR MOBILE AD HOC NETWORKS. Computer systems and network, 8(1), 244-253. https://doi.org/10.23939/csn2026.01.244
Vancouver
Teleshko IV. MATROID-BASED TOPOLOGY CONTROL METHOD FOR MOBILE AD HOC NETWORKS. Computer systems and network. 2026;8(1):244-253. doi:10.23939/csn2026.01.244
BibTeX
@article{Teleshko2026,
author = {Teleshko, I V},
title = {MATROID-BASED TOPOLOGY CONTROL METHOD FOR MOBILE AD HOC NETWORKS},
journal = {Computer systems and network},
year = {2026},
volume = {8},
number = {1},
pages = {244--253},
doi = {10.23939/csn2026.01.244}
}
EUVIMED