Maximum Matching in Multi-Interface Networks
In heterogeneous networks, devices can communicate by means of multiple wireless interfaces. By choosing which interfaces to switch on at each device, several connections might be established. That is, the devices at the endpoints of each connection share at least one active interface.
In this paper, we consider the standard matching problem in the context of multi-interface wireless networks. The aim is to maximize the number of parallel connections without incurring in interferences. Given a network G = (V,E), nodes V represent the devices, edges E represent the connections that can be established. If node x participates in the communication with one of its neighbors by means of interface i, then another neighboring node of x can establish a connection (but not with x) only if it makes use of interface j ≠ i. The size of a solution for an instance of the outcoming matching problem, that we call Maximum Matching in Multi-Interface networks (3MI for short), is always in between the sizes of the solutions for the same instance with respect to the standard matching and its induced version problems. However, we prove that 3MI is NP-hard even for proper interval graphs and for bipartite graphs of maximum degree Δ ≥ 3. We also show polynomially solvable cases of 3MI with respect to different assumptions.
KeywordsPolynomial Time Algorithm Match Problem Interval Graph Maximum Match Complete Bipartite Graph
Unable to display preview. Download preview PDF.
- 6.Caporuscio, M., Charlet, D., Issarny, V., Navarra, A.: Energetic Performance of Service-oriented Multi-radio Networks: Issues and Perspectives. In: Proceedings of the 6th International Workshop on Software and Performance (WOSP), pp. 42–45. ACM Press (2007)Google Scholar
- 7.Cavalcanti, D., Gossain, H., Agrawal, D.: Connectivity in multi-radio, multi-channel heterogeneous ad hoc networks. In: Proceedings of the IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1322–1326. IEEE (2005)Google Scholar
- 10.Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 114–128. ACM (2004)Google Scholar
- 13.Faragó, A., Basagni, S.: The effect of multi-radio nodes on network connectivity—a graph theoretic analysis. In: Proceedings of the IEEE International Workshop on Wireless Distributed Networks (WDM). IEEE (2008)Google Scholar
- 14.Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), pp. 448–456. ACM (1983)Google Scholar