Virtual Cooperation for Throughput Maximization in Distributed Large-Scale Wireless Networks

  • Jamshid Abouei1Email author,

    Affiliated with

    • Alireza Bayesteh2,

      Affiliated with

      • Masoud Ebrahimi2 and

        Affiliated with

        • Amir K. Khandani2

          Affiliated with

          EURASIP Journal on Advances in Signal Processing20102011:184685

          DOI: 10.1155/2011/184685

          Received: 28 May 2010

          Accepted: 29 October 2010

          Published: 3 November 2010

          Abstract

          A distributed wireless network with http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq1_HTML.gif links is considered, where the links are partitioned into http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq2_HTML.gif clusters each operating in a subchannel with bandwidth http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq3_HTML.gif . The subchannels are assumed to be orthogonal to each other. A general shadow-fading model described by the probability of shadowing http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq4_HTML.gif and the average cross-link gains http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq5_HTML.gif is considered. The main goal is to find the maximum network throughput in the asymptotic regime of http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq6_HTML.gif , which is achieved by: (i) proposing a distributed power allocation strategy, where the objective of each user is to maximize its best estimate (based on its local information) of the average network throughput and (ii) choosing the optimum value for http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq7_HTML.gif . In the first part, the network throughput is defined as the average sum-rate of the network, which is shown to scale as http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq8_HTML.gif . It is proved that the optimum power allocation strategy for each user for large http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq9_HTML.gif is a threshold-based on-off scheme. In the second part, the network throughput is defined as the guaranteed sum-rate, when the outage probability approaches zero. It is demonstrated that the on-off power scheme maximizes the throughput, which scales as http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq10_HTML.gif . Moreover, the optimum spectrum sharing for maximizing the average sum-rate and the guaranteed sum-rate is achieved at http://static-content.springer.com/image/art%3A10.1155%2F2011%2F184685/MediaObjects/13634_2010_Article_3031_IEq11_HTML.gif .

          Publisher note

          To access the full article, please see PDF.

          Authors’ Affiliations

          (1)
          Department of Electrical Engineering, Yazd University
          (2)
          Department of Electrical and Computer Engineering, University of Waterloo

          Copyright

          © Jamshid Abouei et al. 2011

          This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.