2. Personal Data
Father’s Name : C.N.Athimoolam
Mother’s Name : A.Sumathi
Date of Birth : 17-03-1992
Age : 22 yrs
Sex : Female
Nationality : Indian
Marital Status : Single
Permanent Address
No 16/7B,Kamaleeshwaran koil st,
Chidambaram,
Pin code- 608 001
Languages Known
Tamil, English.
Career Objective
To become a versatile and resourceful professional, working
for the growth of the organisation and able to grow along with it.
Educational Qualification
Technology
I have knowledge on the below mentioned software products,
tools and methods.
Programming Languages : C,C++,java
Database : SQL ,Oracle
Operating Systems : Windows 7, 8,XP
DEGREE COLLEGE /
SCHOOL
YEAR OF
PASSING
MARKS
IN %
MCA
Annamalai University,
Chidambaram.
2015
80
(upto 5th
sem)
B.Sc(CS)
Shree Raghavendra Arts
and Science College,
Chidambaram
2012
76
H.S.C
Govt.Girls.Hr.Sec
School,Chidambaram
2009 59
S.S.L.C
Govt.Girls.Hr.Sec
School,Chidambaram 2007 68
3. Personal Skill
Comprehensive problem solving abilities
Ability to deal with people diplomatically
Willingness to learn team facilitator
Hard worker
Leadership skills
Teaching skills
Hobbies
Reading Books
Surfing the Net
Listening music.
Dancing
Project Profile
Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With
Collisions
It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve
the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One
important but idealized assumption is that the sensing time is negligible, so that there is no collision. In this paper,
we study more practical CSMA-based scheduling algorithms with collisions. First, we provide a Markov chain
model and give an explicit throughput formula that takes into account the cost of collisions and overhead. The
formula has a simple form since the Markov chain is “almost” time-reversible. Second, we propose transmission-
length control algorithms to approach throughput-optimality in this case. Sufficient conditions are given to ensure
the convergence and stability of the proposed algorithms. Finally, we characterize the relationship between the
CSMA parameters (such as the maximum packet lengths) and the achievable capacity region.
Declaration
I hereby declare that the information furnished above is true to the best of my knowledge.
Date : Yours truly
Place : Chidambaram (Kowsalya.A)
