Distributed wireless information flow allocation in multiple access networks

  • PDF / 818,489 Bytes
  • 18 Pages / 595.276 x 793.701 pts Page_size
  • 62 Downloads / 220 Views

DOWNLOAD

REPORT


RESEARCH

Open Access

Distributed wireless information flow allocation in amultiple access networks Xingqin Lin* and Tat Ming Lok

Abstract We present a general framework for distributed wireless information flow allocation problem in multiple access networks, where the end users (EUs) can seek wireless flows from multiple access points (APs). We aim to minimize the power consumption while satisfying each EU’s minimum data rate requirement but not violating peak power constraint of each AP and interference constraint monitored by regulatory agents. Toward this end, we model the flow allocation problem as a game which is proved to be a best-response potential game. Then based on potential game theory, we show the existence and uniqueness of Nash equilibrium in the formulated game. Moreover, we demonstrate that the Nash equilibrium is actually the globally optimal solution to our problem. Besides, we propose two distributed algorithms along with convergence analysis for the network to obtain the Nash equilibrium. Meanwhile, we reveal the interesting layered structure of the problem in question. Extensive numerical results are conducted to demonstrate the benefits obtained by flow allocation, as well as the effectiveness of our proposed algorithms. Introduction During the past two decades, we have witnessed an ever increasing demand of high data rate services in wireless communications. An end user (EU) is normally just associated with one access point (AP) in today’s wireless networks such as Wireless Local Area Networks (WLANs) to access the Internet. However, researchers realize that the performance of this classic scheme may be unsatisfactory to meet the demand of high data rate services from EUs. Besides, this single-AP based scheme may be prone to suffer from fading due to the single link between EU and the corresponding AP [1]. As a result, more flexible WLANs, where EUs can be associated with multiple APs to get access to the Internet, are drawing increasingly interests from both academia and industry (see, e.g., [2] and references therein). Another practical motivation comes from the recent interests in femtocell networks, in which consumers can install home base stations (BSs) for better indoor wireless voice and data communications [3]. However, an EU in femtocell networks tends to suffer from low throughput due to the limited capacity of backhaul connection to legacy cellular networks. Therefore, allowing * Correspondence: [email protected] Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

the EUs to simultaneously access different home BSs in femtocell networks becomes a natural solution to aggregate sum rates of different backhaul links and thus avoid traffic bottleneck [4]. For simplicity, we also refer to this multiple home BSs access scheme in femtocell networks as multi-AP based scheme. In spite of the potentials of multi-AP based scheme, the resource allocation problem in such scenarios is challenging. In particular, how the resources at APs ca