Share This Article:

Network Coding and Quality of Service for Mobile Ad Hoc Networks

Abstract Full-Text HTML XML Download Download as PDF (Size:2672KB) PP. 409-422
DOI: 10.4236/ijcns.2014.710042    2,708 Downloads   3,210 Views   Citations

ABSTRACT

Network Coding is a relatively new forwarding paradigm where intermediate nodes perform a store, code, and forward operation on incoming packets. Traditional forwarding approaches, which employed a store and forward operation, have not been able to approach the limit of the max-flow min-cut throughput wherein sources transmitting information over bottleneck links have to compete for access to these links. With Network Coding, multiple sources are now able to transmit packets over bottleneck links simultaneously, achieving the max-flow min-cut through-put and increasing network capacity. While the majority of the contemporary literature has focused on the performance of Network Coding from a capacity perspective, the aim of this research has taken a new direction focusing on two Quality of Service metrics, e.g., Packet Delivery Ratio (PDR) and Latency, in conjunction with Network Coding protocols in Mobile Ad Hoc Networks (MANETs). Simulations are performed on static and mobile environments to determine a Quality of Service baseline comparison between Network Coding protocols and traditional ad hoc routing protocols. The results show that the Random Linear Network Coding protocol has the lowest Latency and Dynamic Source Routing protocol has the highest PDR in the static scenarios, and show that the Random Linear Network Coding protocol has the best cumulative performance for both PDR and Latency in the mobile scenarios.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Hay, M. , Saeed, B. , Lung, C. , Kunz, T. and Srinivasan, A. (2014) Network Coding and Quality of Service for Mobile Ad Hoc Networks. International Journal of Communications, Network and System Sciences, 7, 409-422. doi: 10.4236/ijcns.2014.710042.

References

[1] Ahlswede, R., Cai, N., Li, S.-Y.R. and Yeung, R.W. (2000) Network Information Flow. IEEE Transactions on Information Theory, 46, 1204-1216. http://dx.doi.org/10.1109/18.850663
[2] MobiThinking (2012) Global Mobile Statistics 2012 Part A: Mobile Subscribers; Handset Market Share; Mobile Operators. http://mobithinking.com/
[3] Mohapatra, P., Li, J. and Gui, C. (2003) QoS in Mobile Ad Hoc Networks. IEEE Wireless Communications, 44-52.
[4] Zhang, S., Liew, S.C. and Lam, P. (2006) Physical-Layer Network Coding. Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, 358-365.
[5] Reed, S. and Solomon, G. (1960) Polynomial Codes Over Certain Finite Fields. Journal of the Society for Industrial and Applied Mathematics, 8, 300-304. http://dx.doi.org/10.1137/0108018
[6] Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Enger, S., Jain, K. and Tolhuizen, L. (2005) Polynomial Time Algorithms for Multicast Network Code Construction. IEEE Transactions on Information Theory, 51, 1973-1982. http://dx.doi.org/10.1109/TIT.2005.847712
[7] Li, E.L., Ramjee, R., Buddhikot, M.M. and Miller, S.C. (2007) Network Coding-Based Broadcast in Mobile Ad Hoc Networks. Proceedings of INFOCOM, Anchorage, 6-12 May 2007, 1739-1747.
[8] Koetter, R. and Medard, M. (2002) Beyond Routing: An Algebraic Approach to Network Coding. Proceedings of INFOCOM, 1, 122-130.
[9] Chou, P., Wu, Y. and Jain, K. (2003) Practical Network Coding. Proceedings of Allerton Conference on Communication, Control and Computing, October.
[10] Ho, T., Karger, D.R., Medard, M. and Koetter, R. (2003) Network Coding from a Network Flow Perspective. IEEE International Symposium on Information Theory, 29 June-4 July 2003, 441.
[11] Camp, T., Boleng, J. and Davies, V. (2002) A Survey of Mobility Models for Ad Hoc Network Research. Wireless Communications and Mobile Computing, 2, 483-502.
[12] Johansson, P., Larsson, T., Hedman, N., Mielczarek, B. and Degermark, M. (1999) Scenario-Based Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks. Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Seattle, 15-19 August 1999, 195-206.
[13] AODV (2003) Ad Hoc On-Demand Distance Vector (AODV) Routing. http://www.ietf.org/rfc/rfc3561.txt
[14] DSR (2007) The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4. http://www.ietf.org/rfc/rfc4728.txt
[15] OLSR (2003) Optimized Link State Routing Protocol (OLSR). http://www.ietf.org/rfc/rfc3626.txt
[16] Lou, W. and Wu, J. (2002) On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks. IEEE Transactions on Mobile Computing, 1, 111-122. http://dx.doi.org/10.1109/TMC.2002.1038347
[17] SMF (2012) Simplified Multicast Forwarding. http://tools.ietf.org/html/draft-ietf-manet-smf-14
[18] Katti, S., Rahul, H., Hu, W., Katabi, D., Medard, M. and Crowcroft, J. (2006) XORs in the Air: Practical Wireless Network Coding. Proceedings of SIGCOMM, 36, 243-254.
[19] Kunz, T. and Li, L. (2010) Broadcasting in Multihop Mobile Tactical Networks: To Network Code or Not. Proceedings of IWCMC, Caen, 28 June-2 July 2010, 676-680.
http://dx.doi.org/10.1145/1815396.1815551
[20] RLNC for NS2.27. http://telecom.dei.unipd.it/pages/read/58/
[21] Bai, F. and Helmy, A. (2004) A Survey of Mobility Models. Wireless Ad Hoc Networks.
[22] Bai, F., Sadagopan, N. and Helmy, A. (2003) The IMPORTANT Framework for Analyzing the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks. Ad Hoc Networks, 1, 383-403. http://dx.doi.org/10.1016/S1570-8705(03)00040-4
[23] BonnMotion. http://net.cs.uni-bonn.de/wg/cs/applications/bonnmotion/
[24] Gajic, B., Riihijrvi, J. and Mahonen, P. (2009) Performance Evaluation of Network Coding: Effects of Topology and Network Traffic for Linear and XOR Coding. Journal of Communications, 4, 885-893.

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.