NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-PATH TRANSFER OF DATA IN MULTI-HOPWIRELESS NETWORKS

CONTACT: PRAVEEN KUMAR. L (,+91 – 9791938249)
MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com
Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com
NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-
PATH TRANSFER OF DATA IN MULTI-HOPWIRELESS NETWORKS
Abstract
The emerging use of multi-homed wireless devicesalong with simultaneous multi-
path data transfer offers tremendouspotentials to improve the capacity of multi-
hop wirelessnetworks. The use of simultaneous data transfer over
separatedisjoint paths in multi-hop wireless networks to increase
networkcapacity is a less explored subject; mainly because of thechallenges it
triggers for the reliable transport layer protocols.Reliable transport layer
protocols generally use packet sequencenumber as a mean to ensure delivery. As
such, the out-of order packet arrival in reliable transport layer protocols
triggersreceiver buffer blocking that causes throughput degradation andprevents
the reliable multi-path transport layer protocol to realizeits vast potential. This
paper focuses on integrating networkcoding with a reliable multi-path transport
layer protocol toresolve the receiver buffer blocking problem. We propose
anadaptive network coding mechanism to desensitize the receiveragainst packet
reordering and consequently eliminate the receiverbuffer blocking problem. Our
state-of-the-art network codingscheme uses a combination of Q-learning and
logistic regressionfor rare data events to control the number of redundant
packetsbased on the network dynamics. We confirmed the veracity ofour

proposed scheme by a queuing theory based mathematicalmodel. Moreover, the
effectiveness of the proposed scheme isdemonstrated through simulations and
testbed experiments.
EXISTING SYSTEM:
The main objective of SCTP-CMT is to increase the applicationlayer throughput.
Multi-homing in SCTP enables thebinding of the transport layer connection to
more than one IPaddresses. CMT uses this feature to send new data to the
multihomed receiver through different destination addresses. TCPand SCTP rely
on Transmission Sequence Numbers (TSNs)for reliable data delivery. SCTP also
assigns an internal streamsequence number to each message within each sub-
flow. Onthe receiving side SCTP ensures the messages are deliveredto the
application layer in sequence within a given sub-flow.Hence, while one sub-flow
may be blocked waiting for thenext message, other sub-flows can still deliver data
to the upperlayer. The receiver buffer is shared among all sub-flows and
aselective acknowledgment scheme (SACK) is used to informthe sender on missed
messages [1].Sharing the receiver buffer among all sub-flows along withdifferent
characteristics of each path results in receiver bufferblocking. The available
literature on multi-path data transferindicates that receiver buffer blocking

caused by dissimilarpaths results in performance degradation in SCTP-CMT [2][3]
[15]. Authors of [15] suggested the application of an oldmethod in [16] to
decrease the possibility of receiver bufferblocking by reserving enough space in
receiver buffer duringthelife time of the transportconnection.
PROPOSED SYSETM:
In this paper, we propose a network coding scheme forSCTP-CMT that creates
cooperation among the multiple subflowsof an SCTP-CMT association to eliminate
the receiverbuffer blocking problem. The main cause of the receiver
bufferblocking in reliable transport layer protocols is the dependencyof the
congestion control mechanism on transmission sequencenumber of packets. The
proposed scheme eliminates the relianceof transport layer protocol on
transmission sequencenumber of packets using random linear network coding.
Randomlinear network coding (RLC) is a technique where allparticipating nodes
send out random linear combination of thepackets in hand to utilize the lossy
path capacity [5] [6]. RLCuses redundant packets to mask the random losses of
the pathand to guarantee that the receiver is capable of recoveringthe original
packets. Our proposed network coding schemeuses machine learning to control
the number of redundantpackets. In particular, we use a Q-learning mechanism
[7]along with a classifier inside the Q-learning mechanism todetermine when the
sender has to transmit redundant packetsand when otherwise. Our contributions

are as follows:_ We integrated network coding to the multi-path
transportprotocol SCTP-CMT (called coded SCTP-CMT)._ We proposed an
adaptive network coding scheme basedon a Q-learning algorithm [7] to control
the number ofredundant packets depending on the network dynamics._ Using a
queuing theory approach, we proved that ourcoded SCTP-CMT scheme reduces
the possibility ofreceiver buffer blocking._ Our coded SCTP-CMT scheme
outperforms the originalSCTP-CMT with a high margin (up to 62% dependingon
the path dissimilarities and receiver buffer size)._ We also set up a real testbed
and confirmed our theoreticaland simulation results.
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
 System : Pentium IV 2.4 GHz.
 Hard Disk : 40 GB.
 Floppy Drive : 1.44 Mb.
 Monitor : 15 VGA Colour.
 Mouse : Logitech.
 Ram : 512 Mb.

SOFTWARE REQUIREMENTS:
 Operating system : Windows XP/7/LINUX/UBUNTU
 Implementation : NS2
 NS2 Version : NS2.2.28
 Front End : OTCL (Object Oriented Tool Command
Language)
 Tool : Cygwin (To simulate in Windows OS)
CONCLUSION
Network coding is shown to enhance the capacity of multihopwireless networks.
In this work, we showed that networkcoding can also be used as a tool to
eliminate the inheritreceiver buffer blocking issue during the concurrent multi-
pathtransfer of data and hence improve throughput.We proposed anadaptive
network coding scheme for SCTP-CMT, called codedSCTP-CMT, and used an
adaptive Q-learning algorithm tocontrol the number of redundant packets to
effectively recoverthe lost packets. Our coded SCTP-CMT is highly effective
inalleviating the receiver buffer blocking. Our coded SCTP-CMToutperforms the
original SCTP-CMT in terms of throughputup to 62% depending on the receiver

buffer size and pathdissimilarities. Testbed findings support the simulation
andtheoretical results.
REFERENCES
[1] E. R. Stewart, “Stream control transmission protocol,” Network WorkingGroup
at IETF, Tech. Rep., 2007.
[2] J. Iyengar, K. Shah, P. Amer, and R. Stewart, “Concurrent multipathtransfer
using SCTP multihoming,” in Presented at International Symposiumon
Performance Evaluation of Computer and TelecommunicationSystems
(SPECTS’04), San Jose, CA, July 2004.
[3] J. Iyengar, P. Amer, and R. Stewart, “Concurrent Multipath TransferUsing SCTP
Multihoming Over Independent End-to-End Paths,”IEEE/ACM Transactions on
Networking, vol. 14, no. 5, pp. 951 –964,October 2006.
[4] T. Yang, L. Pan, L. Jian, H. Hongcheng, and W. Jun, “Reducing receivebuffer
blocking in cmt based on sctp using retransmission policy,” inIEEE 3rd
International Conference on Communication Software andNetworks (ICCSN
2011), 2011, pp. 122–125.

[5] Lun, Desmond S and M´edard, Muriel and Koetter, Ralf and Effros,Michelle,
“On coding for reliable communication over packet networks,”Physical
Communication, vol. 1, no. 1, pp. 3–20, 2008.
[6] Lun, D.S. and Medard, M. and Koetter, R. and Effros, M., “Furtherresults on
coding for reliable communication over packet networks,”in Information Theory,
2005. ISIT2005.Proceedings. InternationalSymposiumon, 2005, pp. 1848–1852.
[7] C. Watkins and P. Dayan, “Technical note: Q-learning,” MachineLearning, vol.
8, no. 3-4, pp. 279–292, 1992.
[8] R. Ahlswede, N. Cai, S.-Y. Li, and R. Yeung, “Network informationflow,” IEEE
Trans. Inf. Theory, vol. 46, no. 4, pp. 1204 –1216, July2000.
[9] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading structurefor
randomness in wireless opportunistic routing,” ACM SIGCOMMComputer
Communication Review, vol. 37, pp. 169–180, October 2007.1536-1233 (c) 2016
IEEE. Personal use is permitted, but republication/redistribution requires IEEE
permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for
more information.

[10] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft,“XORs in the
Air: Practical Wireless Network Coding,” IEEE/ACMTrans. Netw., vol. 16, no. 3, pp.
497 –510, June2008.
[11] D. Lun, M. Medard, R. Koetter, and M. Effros, “Further results on codingfor
reliable communication over packet networks,” in Proceedings.International
Symposium on Information Theory, 2005 (ISIT2005),Adelaide, Australia, 2005, pp.
1848–1852.

NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-PATH TRANSFER OF DATA IN MULTI-HOPWIRELESS NETWORKS

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Viewers also liked

Viewers also liked (6)

Similar to NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-PATH TRANSFER OF DATA IN MULTI-HOPWIRELESS NETWORKS

Similar to NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-PATH TRANSFER OF DATA IN MULTI-HOPWIRELESS NETWORKS (20)

More from Nexgen Technology

More from Nexgen Technology (20)

Recently uploaded

Recently uploaded (20)

NETWORK CODING AS A PERFORMANCE BOOSTER FORCONCURRENT MULTI-PATH TRANSFER OF DATA IN MULTI-HOPWIRELESS NETWORKS