## 1 Introduction  
The diversification and integration of computing environments of wireless mobile terminals leads to large-scale wireless networks. With this evolution, one of the major challenges is to overcome frequent topology change and design a combinatorially stable multi-hop network. Frequent topology changes make it difficult to control large-scale wireless networks and cause significant performance degradation. Moreover, in combinatorially unstable wireless networks, global topology update messages lead to incorrect network topology by delivering imprecise information, thereby preventing loop-free path discovery and reducing the available bandwidth for user data [1].  
There has been considerable research aimed at solving these problems using zone-based routing approach [2; 3; 4; 5; 6; 7; 8]. The zone-based routing protocol (ZRP) [2; 3] maintains routing zones through a proactive component, the intrazone routing protocol (IARP). Additionally, it maintains routes to destinations beyond the routing zone through a reactive component--the interzone routing protocol (IERP). The zone-based hierarchical link-state routing (ZHLS) protocol [4] exploits geographical information for hierarchical routing by dividing the network into nonoverlapping areas and aggregating nodes into specific areas to conceal the details of the network topology. The hierarchical state routing (HSR) [5] uses a table-driven strategy to establish internal and inter-region routing. This reduces routing update delays, but increases routing overhead costs. The cluster-head gateway switch routing (CGSR) [6; 7] enables cluster-head-based routing; however, frequent cluster head changes can negatively affect routing performance by causing nodes to overselect cluster heads instead of relaying actual packets. The optimal spine routing (OSR) [8] uses a spine structure for path calculation and maintenance. Depending on the nature of the information stored in the spinal nodes, it can provide a near-optimal path, but it creates substantial overhead in the state and spine management. The authors of [2; 3; 4; 5; 6; 7; 8] solved some of the problems presented, but they have been unable to remove the _frequent cluster-head selection_ problem, the _minimum connected dominating set (MCDS)_ problem, and the _no set-covering_ problem, all of which are NP-hard [9; 10].  
Therefore, in this paper, we propose a simple but efficient protocol for large-scale wireless networks, namely localized virtual hub-based hierarchical information transmission control, which has the following benefits:  
* The proposed approach is a flooding-based reactive and redundant transmission scheme with both macroscopic and local transmission controls; it has no cluster head selection problem, no MCDS problem, and no set-covering problem.
* Macroscopic transmission control presents on-demand hub-based transmission, providing optimal hub routes with stochastic end-to-end delay guarantee, which is an important quality-of-service (QoS) factor for 5G services as network sizes become larger.
* Local control presents on-demand redundant-path-based transmission with strong, stable connections between virtual hub nodes and fast transmission-route reconfiguration at failure.
* As the network size grows, the proposed control gives higher throughput performance and lower management overhead.  
The remainder of this paper is organized as follows: Section 2 present system model. Sections 3 and 4 describe detailed algorithms and procedures of the proposed macroscopic and localized controls. Section 5 presents the performance evaluation. Finally, we present our conclusions in Section 6.