Two-dimensional Matching Problem Research Articles

There is no stationary cyclically monotone Poisson matching in 2d

We show that there is no cyclically monotone stationary matching of two independent Poisson processes in dimension d=2. The proof combines the harmonic approximation result from Goldman et al. (Commun. Pure Appl. Math. 74:2483–2560, 2021) with local asymptotics for the two-dimensional matching problem for which we give a new self-contained proof using martingale arguments.

Interference-graph and fuzzy C-means based resource allocation scheme in LTE-V2V communication networks

In this paper, a framework is proposed to improve the effectiveness of the long-term-evolution vehicle-to-vehicle (LTE-V2V) communication system, where the uplink channel of the cellular user equipment (CUE) is reused by multiple V2V links. Since the orthogonal channels occupied by each CUEs are multiplexed by multiple V2V links, the serious interference is generated in the co-tier layer and cross-tier layer. In order to minimize the co-channel interference between CUE link and V2V links, an optimized resource sharing scheme is proposed. Firstly, Fuzzy C-means (FCM) algorithm is proposed to perform the clustering based on the geographical location characteristics of V2V links. In the FCM algorithm, the adjacent V2V links are grouped into a cluster to facilitate the solution of the channel allocation problem. Assuring the V2V links in the same cluster do not share the same channel, the adjacent V2V links are avoided to reuse the same channel. On this basis, the use of reasonable channel allocation scheme can effectively reduce the co-channel interference. Considering that the channel state information (CSI) of mobile links is slowly faded, the total system capacity is maximized by leveraging the CSI while the reliability can be guaranteed for all V2V links. The outage probability constraint is used to ensure the reliability of all V2V links. The channel assignment problem of V2V links is formulated as a weighted two-dimensional matching problem, and the interference bipartite graph is constructed. Finally, Kuhn Munkras (KM) algorithm is introduced to allocate the uplink orthogonal channel of CUEs for the V2V links in the same class in order to maximize the total system capacity. Numerical simulation results show that the algorithm can improve the total system capacity.

Deep Learning Based Resources Allocation for Internet-of-Things Deployment Underlaying Cellular Networks

Resources allocation (RA) is a challenging task in many fields and applications including communications and computer networks. The conventional solutions of such problems usually come with a time and memory cost, especially for massive networks such as Internet-of-Things (IoT) networks. In this paper, two RA deep network models are proposed for enabling a clustered underlay IoT deployment, where a group of IoT nodes are uploading information to a centralized gateway in their vicinity by reusing the communication channels of conventional cellular users. The RA problem is formulated as a two-dimensional matching problem, which can be expressed as a traditional linear sum assignment problem (LSAP). The two proposed models are based on the recurrent neural network (RNN). Specifically, we investigate the performance of two long short-term memory (LSTM) based architectures. The results show that the proposed techniques could be used as replacement of the well-known Hungarian algorithm for solving LSAPs due to its ability to find the solution for the problems with different sizes, high accuracy, and very fast execution time. Additionally, the results show that the obtained accuracy outperforms the state-of-the-art deep network techniques.

Access Control and Resource Allocation for M2M Communications in Industrial Automation

Machine-to-machine communication with autonomous data acquisition and exchange plays a key role in realizing the “control”-oriented tactile Internet applications such as industrial automation. In this paper, we develop a two-stage access control and resource allocation algorithm. In the first stage, we propose a contract-based incentive mechanism to motivate some delay-tolerant machine-type communication devices to postpone their access demands in exchange for higher access opportunities. In the second stage, a long-term cross-layer online resource allocation approach is proposed based on Lyapunov optimization, which jointly optimizes rate control, power allocation, and channel selection without prior knowledge of channel states. Particularly, the joint power allocation and channel selection problem is formulated as a two-dimensional matching problem, and solved by a pricing-based stable matching approach. Finally, the performance of the proposed algorithm is verified under various simulation scenarios.

QoE-Oriented Rate Control and Resource Allocation for Cognitive M2M Communication in Spectrum-Sharing OFDM Networks

With the development of wireless communication systems, it is particularly essential to maximize the quality of experience (QoE) of machine-to-machine (M2M) communication. In this paper, we propose a new QoE-oriented uplink rate control and resource allocation scheme for the Internet of Things (IoT) network, by introducing an evaluation model based on mean opinion score (MOS) for different machine-type communication (MTC) devices. The existing works are only dedicated to solving the short-term resource allocation problems by considering the current transmission time slots, which cannot handle long-standing problems. To this end, based on the recently developed Lyapunov optimization, we convert the original long-term optimization problem into the admission rate control subproblem and the resource allocation subproblem in each time slot. To solve the joint power optimization and sub-channel selection subproblems, Gale-Shapley algorithm is utilized to formulate it as a two-dimensional matching problem, and the preference lists are established by the transmission rate and signal to interference plus noise ratio (SINR). In the proposed algorithms, a priority mechanism is employed to ensure fairness. The simulation results demonstrate that without prior knowledge of the data arrivals and sub-channel statistics, the proposed algorithms can significantly improve the overall perceived quality from the users' perspective.