Đang chuẩn bị liên kết để tải về tài liệu:
Báo cáo hóa học: " Research Article Virtual Cooperation for Throughput Maximization in Distributed Large-Scale Wireless Networks"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Virtual Cooperation for Throughput Maximization in Distributed Large-Scale Wireless Networks | Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2011 Article ID 184685 19 pages doi 10.1155 2011 184685 Research Article Virtual Cooperation for Throughput Maximization in Distributed Large-Scale Wireless Networks Jamshid Abouei 1 Alireza Bayesteh 2 Masoud Ebrahimi 2 and Amir K. Khandani2 1 Department of Electrical Engineering Yazd University P.O. Box 98195-741 Yazd Iran 2 Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada N2L 3G1 Correspondence should be addressed to Jamshid Abouei abouei@yazduni.ac.ir Received 28 May 2010 Revised 12 September 2010 Accepted 29 October 2010 Academic Editor Robert Schober Copyright 2011 Jamshid Abouei et al. 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. A distributed wireless network with K links is considered where the links are partitioned into M clusters each operating in a subchannel with bandwidth W M. The subchannels are assumed to be orthogonal to each other. A general shadow-fading model described by the probability of shadowing a and the average cross-link gains ữ 1 is considered. The main goal is to find the maximum network throughput in the asymptotic regime of K 00 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 M. In the first part the network throughput is defined as the average sum-rate of the network which is shown to scale as 0 log K . It is proved that the optimum power allocation strategy for each user for large K is a threshold-based on-off scheme. In the second part the network throughput is defined as the guaranteed sumrate when the outage probability approaches zero. It is .