Should we break a wireless network into sub-networks?

In this paper we show that to achieve capacity of a wireless network, the global structure of the network should be considered. In other words, achieving capacity on the sub-networks of a wireless network does not guarantee achieving capacity globally. We illustrate this fact by some examples. Then we consider packet erasure wireless networks with limited sets of operations allowed at each node. We pose some interesting problems related to the optimal achievable rate of these networks and provide partial answers to some of them.

[1]  Tracey Ho,et al.  Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding , 2003, Advances in Network Information Theory.

[2]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[4]  Babak Hassibi,et al.  Is broadcast plus multiaccess optimal for Gaussian wireless networks? , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[5]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[6]  Muriel Médard,et al.  Beyond routing: an algebraic approach to network coding , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..