Distributed channel allocation for wireless mesh networks based on hypergraph interference model

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wireless mesh networks (WMNs) are widely used to expand the current wireless network coverage. In this paper, we present a hypergraph-based channel selection method to allocate channels, which can be used to alleviate the accumulative interference from multiple weak interfering links in WMNs. Firstly, we build the ternary interference hypergraph model for all links in a WMN. Then we present a interference mitigating hypergraph game to solve the distributed channel selection problem. It is proved that the proposed game is an exact potential game with at least one Nash equilibrium (NE). Finally, a best reply (BR) based channel selection algorithm for the interference mitigating hypergraph game is presented to obtain NEs. Simulation results show that the presented channel selection method with hypergraph model has a lower global accumulate protocol interference than the existing method with binary graph model.

Cite

CITATION STYLE

APA

Pan, C., Cheng, Y., Wu, D., Zhao, L., & Zhang, Y. (2018). Distributed channel allocation for wireless mesh networks based on hypergraph interference model. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 251, pp. 181–189). Springer Verlag. https://doi.org/10.1007/978-3-030-00557-3_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free