{'fraction_non_alphanumeric': 0.022792022792022793, 'fraction_numerical': 0.0014245014245014246, 'mean_word_length': 5.28955223880597, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Realizable Cross-Layer Architecture for Wireless Mesh Networks

A wireless mesh network (WMN) is an emerging technology to provide open access to the Internet with high bandwidth and low cost while covering a wide area without wiring. Compared to ad-hoc networks, traditionally focusing on military and specialized civilian applications, WMNs can be thought as the generalized one for fulfilling the actual user requirements. Accordingly, WMNs have become one of the most prospective candidates for the Future Internet technology. In the landmark paper [3], Tassiulas and Ephremides introduced throughput optimal technique of backpressure routing and maximum weight link scheduling which was shown to yield network stability whenever input rates are within the network capacity region. Specifically, the dynamic backpressure policy activates the non-interfering links by assigning high priority to those with large differential backlogs. The well-known further work is to combine flow control with routing and scheduling problem [2]. However, the backpressure policy has some critical problems that make it difficult to implement in practice. The first is low scalability with the increasing number of flows. Due to per-flow queueing, it requires considerable complexity in a large-scale network. Secondly, the policy requires unconventional rate control at each source, which means that users in the mesh network need to change their transport protocol into totally new one instead of TCP. Finally, an optimal scheduling requires centralized computation and even might be NP-hard in the worst case. In this paper, we propose a realizable mesh router architecture using dynamic backpressure policy against the above problems. Specifically, for multi-hop link scheduling we consider the Greedy Maximal Scheduling (GMS) which is regarded as a well-known suboptimal scheduling [1]. But it has not been implemented in practice despite lots of mathematical works so far. As an alternative, our paper focuses on the issues related to implementing GMS. For flow control, we separate the mesh router architecture