The capacity of hierarchical wireless networks

Authors:
Yu Genjian;Lin Wenzhong
Affiliations:
Department of Computer Science, Minjiang University, Fuzhou, China;Department of Computer Science, Minjiang University, Fuzhou, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 5
Cited 0

A novel random wireless packet multiple access method using CDMA

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation

IEEE Transactions on Information Theory
The transport capacity of wireless networks over fading channels

IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

This This paper addresses the lower and upper bound of transmission capacity of hierarchical wireless networks from the views of information theory, and draws the conclusion that the lower bound capacity is the information rate defined in the paper, and the upper bound capacity, if the wireless channel is symmetric fading in the broad sense, will not exceed the term T(n5/ 2).