CSpace
On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks
Xie, LL; Kumar, PR
2006-06-01
Source PublicationIEEE TRANSACTIONS ON INFORMATION THEORY
ISSN0018-9448
Volume52Issue:6Pages:2313-2328
AbstractWireless networks with a minimum inter-node separation distance are studied where the signal attenuation grows in magnitude as 1/p delta, with distance p. Two performance measures of wireless networks are analyzed. The transport capacity is the supremum of the total distance-rate products that can be supported by the network. The energy cost of information transport is the infimum of the ratio of the transmission energies used by all the nodes to the number of bit-meters of information thereby transported. If the phases of the attenuations between-node pairs are uniformly and independently distributed, it is shown that the expected transport capacity is upper-bounded by a multiple of the total of the transmission powers of all the nodes, whenever delta > 2 for two-dimensional networks or delta > 5/4 for one-dimensional networks, even if all the nodes have full knowledge of all the phases, i.e., full channel state information. If all nodes have an individual power constraint, the expected transport capacity grows at most linearly in the number of nodes due to the linear growth of the total power. This establishes the best case order of expected transport capacity for these ranges of Oath-loss exponents since linear scaling is also feasible. If the phases of the attenuations are arbitrary, it is shown that the transport capacity is upper-bounded by a multiple of the total transmission power whenever delta > 5/2 for two-dimensional networks or delta > 3/2 for one-dimensional networks, even if all the nodes have full channel state information. This shows that there is indeed a positive energy cost which is no less than the reciprocal of the above multiplicative constant. It narrows the transition regime where the behavior is still open, since it is known that when delta < 3/2 for two-dimensional networks, or delta < 1 for one-dimensional networks, the transport capacity cannot generally be bounded by any multiple of the total transmit power.
Keywordad hoc networks capacity of wireless networks cut-set bound max-flow min-cut bound multiuser information theory network information theory scaling laws transport capacity wireless networks
DOI10.1109/TIT.2006.874519
Language英语
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Information Systems ; Engineering, Electrical & Electronic
WOS IDWOS:000238319400004
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/3819
Collection中国科学院数学与系统科学研究院
Corresponding AuthorXie, LL
Affiliation1.Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China
2.Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
Recommended Citation
GB/T 7714
Xie, LL,Kumar, PR. On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2006,52(6):2313-2328.
APA Xie, LL,&Kumar, PR.(2006).On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks.IEEE TRANSACTIONS ON INFORMATION THEORY,52(6),2313-2328.
MLA Xie, LL,et al."On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks".IEEE TRANSACTIONS ON INFORMATION THEORY 52.6(2006):2313-2328.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Xie, LL]'s Articles
[Kumar, PR]'s Articles
Baidu academic
Similar articles in Baidu academic
[Xie, LL]'s Articles
[Kumar, PR]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Xie, LL]'s Articles
[Kumar, PR]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.