Results for Two Random Network Models
Mathematics of Relaying and Cooperation in Communication Networks
April 10,2006 04:30 PM to 05:00 PM
Speakers:
Hassibi, Babak
|
 |
Abstract: |
We will discuss some capacity results for two classes of wireless networks. The first are wireless erasure networks where links are possibly correlated erasure channels. Such models may be appropriate for systems where communication is packet-based and where some form of error correction is used to detect packet erasures. For problems with single source and multiple destinations all requiring the same information, we obtain an exact capacity result independent of the network topology. We will discuss interpretations and implications of the result, as well as connections to areas such as network coding. The second are so-called random wireless networks where each link is a fading channel drawn iid from a given distribution. Such models may be appropriate for networks of small physical size where the strength of a connection depends more on a random event (such as the existence of an obstacle), rather than on the distance between the transmitter and receiver. These networks are closely related to the classical Erdos random graph, and we show achievable throughputs that scale almost linearly in the number of nodes, a significant improvement over results obtained from the geometric Gupta-Kumar models. We discuss scenarios where such models may be reasonable, as well a multi-scale network model where the fading coefficients are iid at a local scale and obey a path-loss model at a global scale. |
|
|
