The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - Jan. (2014 vol.25)
pp: 191-199
Deze Zeng , The University of Aizu, Aizu-Wakamatsu
Song Guo , The University of Aizu, Aizu-Wakamatsu
Yong Xiang , Deakin University, Geelong
Hai Jin , Huazhong University of Science and Technology, Wuhan
ABSTRACT
Network coding has shown the promise of significant throughput improvement. In this paper, we study the network throughput using network coding and explore how the maximum throughput can be achieved in a two-way relay wireless network. Unlike previous studies, we consider a more general network with arbitrary structure of overhearing status between receivers and transmitters. To efficiently utilize the coding opportunities, we invent the concept of network coding cliques (NCCs), upon which a formal analysis on the network throughput using network coding is elaborated. In particular, we derive the closed-form expression of the network throughput under certain traffic load in a slotted ALOHA network with basic medium access control. Furthermore, the maximum throughput as well as optimal medium access probability at each node is studied under various network settings. Our theoretical findings have been validated by simulation as well.
INDEX TERMS
Relays, Throughput, Receivers, Transmitters, Encoding, Network coding, Unicast, slotted ALOHA, Performance analysis, network coding
CITATION
Deze Zeng, Song Guo, Yong Xiang, Hai Jin, "On the Throughput of Two-Way Relay Networks Using Network Coding", IEEE Transactions on Parallel & Distributed Systems, vol.25, no. 1, pp. 191-199, Jan. 2014, doi:10.1109/TPDS.2013.187
REFERENCES
[1] R. Ahlswede, N. Cai, S.-Y.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[2] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, "XORs in the Air: Practical Wireless Network Coding," Proc. ACM SIGCOMM '06, pp. 243-254, 2006.
[3] S.-Y.R. Li, R.W. Yeung, and N. Cai, "Linear Network Coding," IEEE Trans. Information Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
[4] Q. Dong, J. Wu, W. Hu, and J. Crowcroft, "Practical Network Coding in Wireless Networks," Proc. ACM Mobicom '07, pp. 306-309, 2007.
[5] J. Liu, D. Goeckel, and D. Towsley, "Bounds on the Gain of Network Coding and Broadcasting in Wireless Networks," Proc. IEEE INFOCOM '07, pp. 724-732, May 2007.
[6] J. Le, J.C.S. Lui, and D.M. Chiu, "How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding," Proc. IEEE INFOCOM '08, pp. 371-375, Apr. 2008.
[7] P. Chaporkar and A. Proutiere, "Adaptive Network Coding and Scheduling for Maximizing Throughput in Wireless Networks," Proc. ACM Mobicom '07, pp. 135-146, 2007.
[8] Y. Kim and G.D. Veciana, "Is Rate Adaptation Beneficial for Inter-Session Network Coding?," Proc. Military Comm. Conf. (MILCOM '08), pp. 1-7, Nov. 2008.
[9] Y. Kim and G.D. Veciana, "Is Rate Adaptation Beneficial for Inter-Session Network Coding?," IEEE J. Selected Areas in Comm., vol. 27, no. 5, pp. 635-646, June 2009.
[10] S. Sengupta, S. Rayanchu, and S. Banerjee, "An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing," Proc. IEEE INFOCOM '07, pp. 1028-1036, May 2007.
[11] H. Seferoglu, A. Markopoulou, and K.K. Ramakrishnan, "I2NC: Intra- and Inter-Session Network Coding for Unicast Flows in Wireless Networks," Proc. IEEE INFOCOM '11, pp. 1035-1043, Apr. 2011.
[12] A. Khreishah, J. Wu, P. Ostovari, and I.M. Khalil, "Flow Based XOR Network Coding for Lossy Wireless Networks," Proc. Global Telecomm. Conf. (GLOBECOM '11), pp. 1-5, Dec. 2011.
[13] J. Le, J.C.S. Lui, and D.M. Chiu, "On the Performance Bounds of Practical Wireless Network Coding," IEEE Trans. Mobile Computing, vol. 9, no. 8, pp. 1134-1146, Aug. 2010.
[14] D. Zeng, S. Guo, H. Jin, and S. Yu, "On the Maximum Throughput of Two-Hop Wireless Network Coding," Proc. Wireless Comm. and Networking Conf. (WCNC '11), pp. 416-421, Mar. 2011.
[15] D. Umehara, T. Hirano, S. Denno, M. Morikura, and T. Sugiyama, "Wireless Network Coding in Slotted ALOHA with Two-Hop Unbalanced Traffic," IEEE J. Selected Areas in Comm., vol. 27, no. 5, pp. 647-661, June 2009.
[16] D. Umehara, S. Denno, M. Morikura, and T. Sugiyama, "Performance Analysis of Slotted ALOHA and Network Coding for Single-Relay Multi-User Wireless Networks," Ad Hoc Networks, vol. 9, pp. 164-179, Mar. 2011.
[17] M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge Univ. Press, 2005.
[18] S. Eidenbenz and C. Stamm, "Maximum Clique and Minimum Clique Partition in Visibility Graphs," Proc. Int'l Conf. IFIP on Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics, pp. 200-212, 2000.
[19] M.R. Cerioli, L. Faria, T.O. Ferreira, and F. Protti, "On Minimum Clique Partition and Maximum Independent Set on Unit Disk Graphs and Penny Graphs: Complexity and Approximation," Electronic Notes in Discrete Math., vol. 18, pp. 73-79, 2004.
[20] A. Dumitrescu and J. Pach, "Minimum Clique Partition in Unit Disk Graphs," Graphs and Combinatorics, vol. 27, pp. 399-411, 2011.
51 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool