МATROID-BASED TOPOLOGY CONTROL FOR REDUCING SERVICE TRAFFIC IN MOBILE AD HOC NETWORKS

Abstract

This research addresses reducing control overhead in mobile Ad Hoc networks (MANETs) through topology management. A novel method based on matroid theory is proposed to construct a simplified network structure. The network is modeled as an undirected graph, to which a graphical matroid is applied. The primary optimization objective is to identify a minimum spanning tree that forms the foundation of the matroid-based approach.The research presents a centralized topology control algorithm designed to minimize overall communication costs while maintaining network connectivity. A distributed variant of the algorithm is also introduced. This distributed approach utilizes local neighbor information to achieve efficient performance in the dynamic environments characteristic of mobile networks.Simulation results indicate that the proposed approach achieves a 30–50% reduction in control message volume compared to standard routing protocols, and an average decrease of 25–40% in routing overhead. The packet delivery ratio remains at 90–95%, comparable to conventional methods. The increase in end-to-end delay does not exceed 5–10%, which is generally acceptable for most applications.In summary, the findings demonstrate that the matroid-based model effectively reduces control message volume without significantly affecting key performance metrics, including packet delivery ratio and end-to-end delay. This approach offers considerable potential for improving routing efficiency in MANETs