International Conference on Computing, Communication and Automation (ICCCA2017)
Comparative Study of TCP Variants for Congestion
Control in Wireless Network
Pooja Chaudhary
Department of Computer Science & Engineering
Ajay Kumar Garg Engineering College
Ghaziabad, India
pujjaa19@gmail.com
Abstract-Transmission Control Protocol (TCP) is a network
transmission protocol that implement a consistent information
transmission over the computer network.TCP selects array to
setup their integrity and transfer operation measures from
timeouts and retransmission to maintain efficiency. It also
provides stream control, congestion control and fault control
mechanism. Congestion is a situation in which node or link
carries so much data that deteriorate the performance of
network structure such as packet deficit, queuing interruption
and block new connections. This paper demonstrates the basic
congestion control strategy. In past year, there have been many
variations in TCP algorithms originating from the essential TCP
which has exclusively Slow Start and Congestion Avoidance
mechanism to the variation and extension of latest mechanism.
Now TCP occur in distinct variants that incorporate TCP
Tahoe, Reno, New Reno, Vegas and Dynamic Vegas. Every of
this TCP variant has its characteristics and drawbacks.
This paper describes the comparative study of five TCP
variants such as TCP Tahoe, TCP Reno, TCP New Reno, TCP
Vegas and TCP Dynamic Vegas, their slow start ,congestion
avoidance and Congestion detection algorithm and also analyze
the best extensively used TCP variant abstractly and further
investigate the possible future research field.
Keywords- TCP Tahoe; TCP Reno; TCP New Reno; TCP Vegas;
TCP Dynamic Vegas; Congestion Control.
I. INTRODUCTION
TCP [12] is an association oriented, consistent, procedure-to-
procedure, flow-adapted protocol. It was invented to build an
essential channel among two TCP to transmit information.
Reliability is a process which ensures that the data transmit
from one node (sender) is acquired by the node (receiver) and
in a condition where the input gets misplaced in
communication, there is an approach in place which upgrades
the sender about it and the data is retransmitted. Series
number is designated to every byte of sending input; relevant
acknowledgement is more required to be transmitting behind
the sender. The upcoming data to be transmitting to the
recipient is included in the acknowledgement (ACK) to the
sender .In TCP, buffer are used to collect information being
transmit as a result of that the sender and the receiver may not
be creating and analysis at the identical velocity. There is a
transmitting and inheriting buffer at both end nodes.
ISBN: 978-1-5090-6471-7/17/$31.00 ©2017 IEEE
Sachin Kumar
Department of Computer Science & Engineering
Ajay Kumar Garg Engineering College
Ghaziabad, India
imsachingupta@rediffmail.com
On account of the receiver interpret input on a First Come
First Serve whatever the ratio at that the sender transmits
input is quicker than the ratio at that the receiver obtain input,
this will provide an input queue that will eventually cause
congestion and input will begin discarding of the queue. In an
arrangement to assure this doesn’t occur, each sender and
receiver would functioning at the identical velocity or they
need to be a scheme in place to assure there is no congestion
by allow the sender realize there is a queue build up,
consequently the sender can diminish the ratio for
transmitting the packets. TCP has designed various stream
control and congestion control techniques to prevent the
stream of data and reduce packet dropping appropriately.
Below are some of the most important features of TCP:
x Connection oriented protocol
x End-to-end explication
x Identify duplicate data
x Full duplex associativity
x Implement flow control and congestion control.
Therefore, in this paper, different TCP Variants are examined
and also analyze the comparison between these TCP variant.
The remaining paper is systematized in such a way: In
Section II explains Congestion in wireless network, Section
III defines TCP congestion control in detail, Section I V
explains TCP Variants for congestion control, Section V
explain the related work and Section VI describes bandwidth
estimation technique in detail. Finally, Section VII concludes
the paper.
II. CONGESTION IN WIRELESS NETWORK
Congestion is a situation in which node or network
connection carries so much data that decline the
performance of network design such as packet failure,
queuing disruption and block new network connection. In
TCP, congestion emerge when sender acquired three
duplicate ACK or when a packet loss appear, resulting in the
decrement of resources.
Congestion can also be started as the following situations.
x When routers are too slow to eliminate a task.
641
 International Conference on Computing, Communication and Automation (ICCCA2017)
x Packet arrival rate transcends the outgoing
connection capacity.
x The output capacity of router is smaller than the
aggregate of input.
x Overloading on the network connection.
III. TCP CONGESTION CONTROL
TCP accomplish a congestion control mechanism in 3
phases: Slow Start, Congestion Avoidance and Congestion
Detection [1]. TCP uses acknowledgement (ACK) to
examine packet deficit and discover lag of packet.
Figure1. Phases of TCP Congestion Control
A. Slow Start – Exponential Increase
Slow Start [4] mechanism initiates Congestion Window
(CWND) to the transmitter node. They used source based
stream management mechanism. The Slow start stage begins
with the transmitter transmitting one packet, so that forming
the dimension of the CWND is one packet. The CWND
dimension is maximize exponentially though an ACK of the
transmitting packet has been obtained by the transmitter node.
A threshold value is steady called Slow Start threshold
(SSTHRESH), the significance of the threshold value is to
terminate the slow start phase. The slow start mechanism end
while the dimension of the CWND arrives at the steady
threshold and the Congestion Avoidance stage start. Slow
start do not prohibit congestion however it prohibit
instantaneous congestion through ensure that the transmitter
does not transmit an abundant data.
B. Congestion Avoidance – Additive Increase
Although the window dimension arrive the steady threshold,
the Slow Start step and the Congestion Avoidance step start.
Congestion Avoidance implement Additive Increment
scheme that prohibits congestion against arriving rapidly by
slow down the amount of increment of CWND from
exponential increment in Slow Start stage to linearly
increment in Congestion Avoidance stage.
C. Congestion Detection- Fast Transmission and Fast
Recovery
There are two methods TCP detects congestion such as three
duplicate acknowledgements and retransferred timeout
642
Congestion detection over timeout, vacant the transmission
direction by decreasing the congestion window to one
section through producing an extensive rate in large
bandwidth interruption product links, as a result of this
drawback, congestion avoidance algorithm was improved to
avoid this. It interpreted through which three duplicate ACK
effort and whereby it recognizes congestion since the
termination of retransferred time. Fast Retransmission is an
improvement of Congestion Avoidance mechanism where
congestion is recognized over three duplicate ACK.
IV. TCP VARIANTS
A.TCP Tahoe
TCP Tahoe [3][4] is one of the congestion control
mechanisms that enhance the earlier TCP execution by
combined the slow start, congestion avoidance and fast
retransmit phase to TCP. It works on the packet preservation
technique. This technique is executed by using
acknowledgments (ACK) to clock outgoing packets. It also
provides a congestion window (CWND) that reflects the
network size. Tahoe established slow start threshold
(SSTHRESH) to partial the congestion window (CWND) and
steady CWND to one. It arrives in the slow start phase later
an ACK of the resending packet has been obtained. If the
length of the CWND is not improve the current SSTHRESH,
congestion window dimension maximize exponentially.
Further slow start sender node enter in congestion avoidance
stage and along the dimension of CWND rises by using
1/CWND for every acquired acknowledgement.
The shortcoming with TCP Tahoe is that it holds an entire
time-out interval to identify packet losses. When the packet
loss is identified, the behavior of TCP Tahoe is too slow. Due
to the fact that the flow of transmission is minimized.
B. TCP Reno
The TCP Reno[3][4] utilization preserve the improvement
integrated into Tahoe, but change the fast retransmit process
to fast recovery, the latest mechanism prohibits the
transmission route from going idle. Fast recovery mechanism
attained by presumption of each equal acknowledgement
received which provide a distinct portion carrying left the
tube. Hence in fast recovery the sender is set to determine the
number of effective data. For example in fast recovery, it is
inscribed by a TCP sender node later achieving an initiative
threshold of duplicate ACK. This threshold value is normally
fixed to three. When the threshold of duplicate
acknowledgement is obtained, the sender retransfers 1 packet
and diminish its CWND by one halve. However, it undergo
with performance problem when several packets are released
from a window as it discovers only small packet losses.
 International Conference on Computing, Communication and Automation (ICCCA2017)

C. TCP New Reno
TCP New Reno [3] is a small improvement through TCP
Reno. It is able to recognize several packet deficits and hence
it is more effective than TCP Reno in the case of several
packet deficits. TCP New Reno and TCP Reno both coincide
to go through fast retransmit during several duplicate packet
is acquired , but it does not reach out from fast recovery
phase before all excellent data was not obtained. It indicates
that in TCP New Reno, insufficient ACK do not hold TCP
out of fast recovery but they behaves as a signal or that the
packet in the series field has been lost and become
retransferred. During several packets are deficit from a
distinct window of data, now TCP New Reno can enhance
beyond retransfer time out. It exists in fast recovery phase till
every data is added into network and still awaiting for an
ACKs that fast recovery was originated. The problem with
New Reno is that it takes single RTT to recognize each
packet deficit, as it utilized high bandwidth.
D. TCP Vegas
TCP Vegas [3][4] is an improvement of TCP Reno. It reduces
the issue of demanding adequate duplicate acknowledgement
to discover a packet deficit, and it further proposed an
enhanced slow start mechanism that prohibits it from
blockage the network. It detects congestion since the packet
losses arise. There are three technique that Vegas used to
maximized the throughput and minimized losses
x A modified Slow Start technique
x An enhanced Congestion Avoidance technique
x A modified New Re- Transmission technique.
TCP Vegas upgrade the congestion window from the
following rule
x Expected rate = CWND (t)/Base RTT,
x Actual rate = CWND (t)/RTT,
x Diff = Expected rate – Actual rate
x Using the value of Diff the CWND is adapted as:
x If Diff < α, TCP Vegas increases CWND linearly
x If Diff > β, TCP Vegas decreases the CWND
linearly.
x If α < Diff < β, TCP Vegas leaves the CWND
E.TCP Dynamic Vegas
TCP Dynamic Vegas [2][3] is the modification of TCP Vegas
that modify the basic TCP Vegas in slow start and congestion
avoidance stage. It dynamically determines slow start
mechanism and adapt minimum and maximum ratio in
congestion avoidance stage in accordance with a particular
network surrounding. Table I shows a comparison of different
TCP variants for congestion control in wireless network on
the basis of different parameter.

In this paper, we compared the following TCP Variants on the basis of different parameter, such as feedback signal, fast
recovery mechanism, estimation of RTT, ACK format, packet sending approaches and the characterizes of TCP variants.
TABLE 1. TCP VARIANTS COMPARISON

TCP
Parameter Variants

TCP Tahoe TCP Reno TCP New Reno TCP Vegas TCP Dynamic Vegas

In Slow Start,
CWND upgrade CWND+1 CWND+1 CWND+1 Increase each other RTT Increase CWND every
with each two RTT
ACKs when

In Congestion Increase linearly if CWND remains

Avoidance, CWND+1/CWND CWND+1/CWND CWND+1/CWND Actual rate-Expected rate < α unchanged if δ > α
CWND upgrade And decrease linearly if > β Or if δ < β
with each ACKs
when

Modification Same,but Expected rate – Actual rate < γ CWND= SSTHRESH/2

from Slow start CWND=SSTHRESH CWND=SSTHRESH SSTHRESH may
to Congestion be estimated
avoidance as

Fast Recovery No Recovery Phase Terminate it with Continue with Retransmit it with Duplicate Retransmit it with
Limited or limited ACK if RTT > timeout Duplicate ACK
full ACK ACK if RTT > timeout

RTT Estimation Less Accurate Less Accurate Less Accurate More Accurate More Accurate

643
 International Conference on Computing, Communication and Automation (ICCCA2017)

V. RELATED WORK
Congestion Control is the mechanism is used to upgrade the The Comparative Analysis of TCP Variant (New Reno, Reno
and Tahoe) in Self-Similar Traffic (Alghawli et al., 2013) [6]
efficiency of network.TCP congestion control technique for
has been organized along with the testing of different TCP
different network( Chen Li et al., 2016 ) [1]describe an
available Round Trip Time Estimator (RTTE) and packet algorithms of these protocols activity. The use of TCP Vegas
has been confirmed to be the most persuasive
deficit ratio may differ along numerous orders of size, that
designate the variation of the computer network. To maintain
The satellite network is distinct from connected or
the diversity in congestion control, they suggest a modified
disconnected networks. (M. Nirmala et al. (2015) [7].The
TCP mechanism. They offer an adjusting increment factor to
the development function to assure that the screen performance of TCP in connected network as fine as in
disconnected network are distinct from one another. Example
development ratio meet the route circumstances and that
improve factor determines the trail situation using an the TCP/IP protocol was not builds to perform fine with high-
latency and noisy medium so its performance over satellite
observed capacity of this accessible bandwidth and least
networks are totally distinct. The efficiency of different TCP
RTT.
congestion control mechanism, TCP Reno and Vegas are
taken for similarity on the simulated satellite network and the
TCP Vegas is observed as equalized congestion control
mechanism, still drawbacks such as utilization of small accomplishment of these algorithms under the satellites
network are calculated using appropriate metrics.
bandwidth, unfairness while allocating connection along
TCP Reno. They reconsider these problems and proposed a
modified mechanism called Dynamic Vegas (Zhou Keren et A new delay based congestion control technique , named
FAST FIT(J. Wang,et al., 2010) [8] the author proposed
al., 2014) [2] which modify a primary TCP Vegas in slow
start and congestion avoidance stage. It dynamically adapt FAST FIT congestion control algorithm that uses queue
wait as a basic input for managing TCP congestion window.
slow start mechanism and modify minimize and maximize
ratio in congestion avoidance stage according to different
connection of network. A.Sawarkar et al., 2016[9] describes the efficiency of distinct
TCP variants such as Tahoe, Reno, New Reno and Vegas
Simulation study of new TCP variants (Chicco Jacopo et al.,
2010) [3] .In this paper the author examine the behavior of under bottleneck condition. They use NS-2 environment to
new TCP variant recently used in computer network and that carry out simulation of these TCP variants and determine the
results with respect to throughput, packet loss rate and latency
evenly reinstate TCP New Reno, as they are previously
initiated by error in system software and network equipment. to determine if there is an overall effective TCP variant.

TCP protocol performs a crucial role in the protection and
consistency of the information transmission. An approach for
reliability and expansion of TCP is provided by novel Quick
Start (QS) mechanism for evolution of TCP (Xiang Wang et
al., 2015)[4] discussed the traditional TCP algorithm Reno,
Westwood, Tahoe, and Vegas. Vegas are the best in all
traditional algorithms for improve TCP, but it is not useful for
Navigation Satellite System (NSS). So, they presented new
Quick Sort (QS) mechanism for evolution of TCP in satellite
system to solve this issue later examining the shortcoming of
conventional method.
The author designs a TCP congestion control algorithms in
order to enhance the protection of online communication.
They uses Fluid Flow Similarity of TCP Reno and TCP
Vegas congestion control approach( Domanski, Adam et al.,
2016 )[5] to determine the impact of Reno and Vegas
congestion control approach on CWND development, queue
size and packet delay ratio.
TCP-F and ELFN are cross layer method for enhancing TCP
performance in wireless connection (M.Hardik and R.
Agrawal, 2015) [10]. Both are based on route recreation after
route loss. TCP- F adapt intermediate node to persist with any
alternative route if it knows while ELFN doesn’t persist any
alternative route.
A novel AQM scheme called CHOKeR (Lu Lingyun, Du
Haifeng et al., 2014) [11] is implemented to protect TCP
flows efficiently. They adopt a process from CHOKeR to
choose multiple packets unexpectedly against the output
buffer. In order to demonstrate the characteristics
of CHOKeR, an analytical model is used.
Shih-Hao Ou et al. (2016) [12]emphasis on the
development of cellular information technologies, mobile
devices are normally combine with multiple network
interfaces and accouter to take transport arriving protocols
such as Multiple path Transmission Control Protocol
(MTCP). This protocol is more efficient in computer
network applications that are flow from scientific delay.

644
 International Conference on Computing, Communication and Automation (ICCCA2017)
The author present two modifications which is depend on
MAC & TCP layer( Kothari N. et al., 2011)[13] .To make
TCP adjustable to cellular scheme & enhance end to end
efficiency where networks deteriorate from network loss .It
improve network utilization and reduce the number of TCP
retransmissions..
Wireless bandwidth estimation is an analytical issue for
Quality of Service (Quos) provisioning in IEEE 802.11
WLANs. (Yuan, Zhenhui, et al., 2012)[14] Current
bandwidth estimation solutions focus on either probing
approach or cross-layer approach and either requires
important bandwidth resources. To solve these problems, the
author proposes a systematic Model-based Bandwidth
Evaluation algorithm (MBE) for multimedia services among
the WLANs networks.
VI. BANDWIDTH ESTIMATION TECHNIQUE FOR
CONGESTION CONTROL IN TCP
A. Time -Interval based Bandwidth Evaluation Technique
(TIBET)
It is a bandwidth evaluation technique that can be executed
within the TCP congestion management process, that
accurately evaluate the bandwidth used by the TCP sender
node, even in the presence of bundle of packet and
acknowledgement reduction.
B. Adaptive Response Rate Adjustment (ARRA) technique
In the real world accomplishment, the network scenario is
uniformly changed, and the lag of cellular connection is
enormous, so the evaluated network bandwidth may be
deformed. It consequence the transportations ratio if assign it
accurately, so it is essential to build a smoothing around the
evaluated value, in which the method we can also make it
reply rapidly during the network bandwidth modify. ARRA
technique is designed to conclude the evaluated value of
bandwidth according to the actual time modification of
network.[4]
C. Core-Stateless Fair Queuing (CSFQ)
It is a rapid movement estimation scheme; assign it in router
that is used to determine problems of unfairness among
interconnections keeping distinct RTT. It has the great benefit
of moving flows to impartially distribute bandwidth even
while the congestion management technique of the transit
protocol is not specific.[4]
D. Packet- pair bunches Probe (PP) technique
This technique is used to evaluate the accessible bandwidth in
the receiver boundary. In this technique the origin node
transmits several pair of packets to the end node.
645
E. Self- Loading Periodic Streams
In this technique a sequence of equivalent sized packet probe
bunches is transmitting at a specific ratio. Build upon the
trend of single way wait practiced by the flow, the source
node changes its transmitting ratio and effort to lead the flow
velocity close to the accessible bandwidth.
F. Double Filtering Technique
This technique determines an accurate and essential run-time
evaluation of the usual bandwidth of a TCP origin node. It is
depend on isolated filtrate of both the intermission among
transmitting period of TCP packets.
VII. CONCLUSION
The purpose of this review paper is to compare and
investigate the different existing TCP Variants in the area
of the wireless network. Hence to decrease the issue of
congestion in the network, various TCP variants have been
used. Nevertheless, it is important to know which TCP
variant is sufficient in which network. Here, we investigate
the working of five TCP variant, viz. TCP Tahoe, TCP
Reno, TCP New Reno and TCP Vegas, TCP Dynamic
Vegas. It can be concluded that TCP Tahoe is a very simple
variant, it take an exhaustive time-out to recognize a packet
deficit. It does not transmit an instant acknowledgement,
every period a packet is deficit it waits for a time-out and
the channel is vacant. This causes a large bandwidth loss
and minimizes the transmission velocity.TCP Reno
accomplishes well as the number of packets loss is small.
Although in multiple packet loss, it does not perform too
well and it behavior is identical as TCP Tahoe. In several
packet losses, the behavior of TCP New Reno is best.
The shortcoming with TCP New Reno is that it hold single
RTT to discover packet defecit.TCP Vegas perform best in
high congested network, it recognize congestion before it
arise. But still there are many issues in TCP Vegas, when
TCP Vegas share a same bottleneck connection with TCP
Reno, it build rerouting, fairness problem. TCP Dynamic
Vegas has is more aggressive than TCP Vegas in dissimilar
network connection. TCP Dynamic Vegas congestion
window does not create relevant modification as TCP Reno
adds in the network that enhances TCP Vegas strength and
fairness. TCP Dynamic Vegas will cause to few packets
loss as it uses mid-speed begin algorithm that utilized more
bandwidth in start phase.
 International Conference on Computing, Communication and Automation (ICCCA2017)
VIII. FUTURE SCOPE
[11] Du Haifeng and R. Ping Liu, Lu Lingyun, “CHOKeR: A New AQM
In future, we propose a novel bandwidth estimation
technique and also compare TCP Variants with this new
bandwidth Estimation technique in order to enhance the
efficiency of network. This new technique is also used
for resolving TCP Slow Start problem, in which there is
a distinct lag in TCP start up phase , we will try to
eliminate this lag with new bandwidth estimation
mechanism .It has an enhanced Slow Start stage and
recognize a new Congestion Avoidance stage.
[14] P. Dalal, N. Kothari, et al., “Enhancing TCP performance over
ACKNOWLEDGMENT
[15] Zhenhui, Yuan, Hrishikesh Venkataraman, et al., “Model-Based
I would like to show my deep appreciation to my guide Dr.
Sachin Kumar, for her excellent guidance, valuable feedback
and for the continuous support of my research work. His advice
[16] Kothari N., Sarkar M., Dasgupta K. “An Adaptive TCP A Sender Side
will encouraged me in all the time for writing Review Paper
.His discerning judgment kept me working to make this
Review paper in a much better method. Working under him
was an intensely scholarly experience for me.
REFERENCES
[1] Chen Li, Zeng Xiaoping, et al., "TCP congestion control mechanism
for heterogeneous network connection." Journal of Computer
Applications and Networks, 2016, pp: 56-64.
[2] Qian Yu, Keren Zhou, Liu and Wenjia Keren Zhou “Dynamic Vegas:
A Competitive Congestion Control Strategy, proceeding of
International Conference on Computer Network and Information
Technology, advance in computing intelligent system255, DOI:
10.1007/978-81-3221759_40, springer India 2014.
[3] Denies Collange, and A. Blanc, Chicco Jacopo, “Simulation analysis
of new TCP variants,” in 2010 IEEE Symposium on Computers
Network and Communications, pp. 50–55, 2010.
[4] Wang X., K. Zheng, et al.,”Novel Quick Sort (QS) approach for
optimization of TCP “in proceeding of Springer science business
media New York, 2015.
[5] J. Pagano, Domanski, Adaman, Domanska et al., “The Fluid Flow
Similarity of the TCP Vegas and Reno Congestion Control
Technique”. In International Symposium on Information and
Computer Sciences, 2016, pp. 193-200.
[6] A. Alghawli, "Comparative Study of TCP Variants in Self-Similar
Traffic," Communications and Network, Vol.5 No. 2, 2013, pp. 148-
156.
[7] V.Pujeri, M. Nirmala “Behaviour of TCP Bic, TCP Reno and TCP
Vegas congestion control mechanism on satellite network,”
International Journal of Computer Network and Information Security,
2015, Vol. 4, pp. 40–49.
[8] J. Wen., J. Zang, Y. Han., J. Wang, “TCP-FIT- A novel TCP
congestion control algorithm for Wireless Networks”, IEEE
Globecom Workshop on Advances in Communications and Networks,
2010.
[9] H. Saraswat, A. Sawarkar, “Performance Analysis of TCP Variants”,
International Journal of Engineering Science and Network Security,
Vol.16 No.4, April 2016.
[10] R. Agrawal, M. Hardik et al.”A comprehensive study of cross layer
mechanism for enhancing TCP performance in Cellular Networks”,
International Conference on Computing and Communication
Technology, 2015.
646
Algorithm with Equivalent Bandwidth Distribution and TCP
Protection”, IEEE Trans. Industrial Informatics, Vol. 10, No. 1,
pp.637–644, Feb2014.
[12] N. Godfrey, F.Opara et al.,”Survey on Transmission Control Protocol
on wireless network”, International Journal of Academic Research,
2011.
[13] Shih-Hao Ou, Kuan Huang et al. "Out-of-order Transmission
facilitates Scheduling and Congestion Management for Multipath
TCP." In IEEE International Conference on Mobile Computing and
Wireless Communications, 2016.
cellular network with persistent disconnections”, International Journal
of Computer Networks & Communications, Vol. 3 No. 6, 2011.
available bandwidth Evaluation for IEEE 802.11 data
communications." Vehicular Technology, IEEE Transactions on 61.5
(2012): 2158-2171.
Strategy with Dynamic Adjustment of Congestion Control Parameters
for Performance Enhancement in WLAN. Int. J. Communications,
Network and System Sciences, 8 (2015):130-145.
AUTHORS PROFILE
Pooja Chaudhary, is a Research scholar,
M.Tech student at the Department of
Computer Science and Engineering,A.K.G.E.C
college. She presented an article on "Dynamic
Programming Approach for Topology
Optimization in Interconnection Network”. Her
current research includes congestion control,
networking, multiconnection wireless network,
dynamic programming approach. She presented
an article on "Dynamic Programming Approach
for Topology Optimization in an Interconnection
Network.
Dr. Sachin Kumar is a Ph.d, Associate
Professor at the Department Computer
Science, A.K.G.E.C College. His current
research interest includes data mining
technique, wireless sensor network, fuzzy
time series, and congestion control. He is an
Editorial Committee member of 2013 3rd
IEEE International Advance Computing
Conference. He published a paper on
“Extending the Network Lifetime of
Wireless Sensor “in AEEE, 2013-14. His
work has been published in various
International journals.