Mathematical Modeling of Security Issues of WLAN’s using Space Time Processing in

Mathematical Modeling of Security Issues of
WLAN’s using Space Time Processing in DSP.
Ahmad Hweishel A.Alfarjat Prof.Sheshadri.H.S Dr.Hanumanthappa .J.
Research Scholar,E&CE Dept of E&CE Associate Professor,
PESCE,Mandya PESCE,Mandya DoS in Computer Science
University Of Mysuru. University Of Mysuru.
Mysuru-6.
ahmed_alfarajat@hotmail.com hssheshadri@gmail.com hanumsbe@gmail.com
Abstract
Due to an explosion of demand for high speed wireless
services such as wireless internet,email,stock quotes and cellular
video conferencing wireless communication has become one of the
important field in modern engineering.Wireless networks are broadly
classified into four different kinds such as wireless lans,satellite
networks,cellular networks and personal networks. In most of the
scenarios WLAN’s systems are based on single hop operation but in
now a day’s significant study has been done on WLAN’s with multi-
hop operation.In this research article we have studied the various
security issues of wlan especially with respect to bluetooth.wireless
local area networks are different from Wired networks in terms of
cost,security,high reliability,resource
sharing,scalability,communication media etc. One of the important
problem for wireless network is limited frequency spectrum. In now
a day’s wireless local area network consists of multiple stations that
coexist with in a limited geographic jurisdiction and share a common
wireless channel to communicate with each other.This research work
proposes a mathematical model based security issues of wlan by
investigating,design,implementation and performance analysis using
Digital Signal Processing(DSP) Space Time Processing.Space time
processing technology which uses more than one antennas
with an appropriate signaling and receiver methodology
provides a powerful tool for improving the performance of
WLAN’s.
Keywords:Bluetooth,WLAN,Security,Performance,Space time
Processing,Rayleigh fading,Maximal ratio combining etc.
I.Introduction
As we know that computer network is a collection of
heterogeneous systems or a homogenous computer systems
such as super computer,mini computer, micro
computer,laptop,desk top computer,printer,scanner etc. The
networks are broadly divided into three types such as local
area networks, metropolitan networks,wide area networks.
The local area networks are again broadly classified as wired
local networks and wireless local area networks. The wireless
local area networks in now a days is a commonly operated
internet access technologies but it is also enlarged across a
wide variety of markets such as mobile phones,consumer and
automobile technologies etc. With widespread deployment of
wireless local area networks in
offices,buildings,schools,university campsuses,hotels,railway
stations,bus stands,air ports and also in other public locations
it is highly essential to understand the basic performance
requirement of wlan’s which are based on the IEEE 802.11
standard technology and also to know how efficiently and
effectively design, deploy and manage them. As we know that
IEEE 802.11 supports two modes of operation such as ad-hoc
mode(infrastructure less) and the infrastructure mode. The
commercial and enterprise wireless local area networks are
usually operate in the infrastructure mode. In certain kind of
wireless networks one node is necessary to reach the mobile
terminal. The mobile terminal is a collection of mobile
desktop and mobile keypad. Usually in wireless networks ad-
hoc networks normally requires a multi-hop wireless path
from source location to the destination
International Journal of Computer Science and Information Security (IJCSIS),
Vol. 15, No. 8, August 2017
320 https://sites.google.com/site/ijcsis/
ISSN 1947-5500

location. The multi-hop mobile ad-hoc networks mainly
concentrate on the heterogeneous routing protocols and
medium access control methods. Several issues have been
considered into account while considering a wireless network.
The Quality-of-Service(QoS) is one such issue. The key
issues of wireless local area networks such as mobility of
users, bit errors and bugs in wireless channel, scarce wireless
services[17].
The trend for WLAN’s systems is growing rapidly in
the communication industry. It is very difficult to understand
the performance issues of WLAN’s when there is a great
demand for WLAN products. In computer networking
WLAN’s are mainly used to substitute wired LAN’s,or
extension of the wired LAN infrastructure. Network
connectivity is one of the basic performance metric of
wireless local area networks. The study of WLAN’s
performance enables better understanding of resource sharing
and network connectivity. The performance of WLAN’s is
calculated on the three main technologies such as analytical
modeling, direct measurements,simulation[17]. Network
mathematical analysis is performed for a specific scenario
with very limited and with very rigid conditions. Due to
higher bandwidth supported by the standards,WLAN’s are
mainly deployed for large number of users which consists of
applications such as browsing, email and database access. The
different types of protocols used in wireless local area
networks are Ad-hoc on demand distance
vector(Aodv),Temporarily ordered routing
algorithm(Tora),Dynamic source routing
protocol(Dsrp),Destination sequence distance vector(Dsdv)
etc. The popular physical layer and Medium Access
control(Mac) sub layer standard are provided by IEEE in the
notation of 802.11 protocols. The different types of factors
affecting the performance of WLAN’s are Radio Frequency
Interference,Physical layer technologies,hidden terminals.
The WLAN performance is also improved in a better manner
by fragmentation option which divided 802.11 data frames
into smaller pieces forward separately to the destination. The
different types performance model used in WLAN’s are TCP
congestion control in wireless environment, signal to noise
ratio estimate of 802.11g, performance enhancement of
WLAN systems using RTS/CTS and fragmented frames. In
wireless local networks communication terminals is supported
via two common network topologies such as ad-hoc mode and
structured mode[17]. The Fig.1 shows how to create wlan’s
by using structured network architecture and Fig.2.shows the
formation of wlan’s using ad-hoc network architecture
.
Fig.II.Ad-hoc network architecture of WLANs.
Fig.I.Structured network architecture of WLANs.
II.Related Work
We can find a couple works carried out in this direction.
Hanumanthappa.J[1][2][3][4] has studied in depth about
wireless local area networks,ip mobility,wlan
performance,an overview of security wireless
networks,wlan technologies,wireless security protocols,how
to transit from wlan’s to ad-hoc networks, peer to peer
approach for wlan’s,space time processing for wlan’s,wlan
Internet
Backbone Network
Base Station1 Base Station2
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

security,decreasing security risks of wlan,application of
wlan in telemedicine service etc. S.Alamouti[19] has also
proposed a simple transmit diversity methodology for
wireless communications. They have also presented a
simple two branch transmit diversity scheme. They have
also shown that a scheme may easily be generalized two
transmit antennas and M receive antennas to provide a
diversity order of 2M. Weifeng
Su,Stella.N.Batalama,Dimitris.A.Pados[23] have presented
a necessary and sufficient condition for any orthogonal
space time block code(stbc) to permit transceiver signal
linearization. He has also proved and confirmed that square
orthogonal stbc’s which satisfy the criteria that has rate that
goes to zero linearly with the number of transmit antenna’s.
Lori Anne Dalton[31] has presented complex full rate
codes, for four transmit antennas. By using carefully
tailored constellation phase relations, he has proved new
orthogonal space time bloc codes can achieve full diversity
for specialized PSK and PAM symbol constellations. The
ABBA code presented in[25] and similar codes[26 ] – [28]
have full rate but are quasi-orthogonal and offer a diversity
order of only 2. The STTD – OTD code[29] which provides
some diversity achievement by grouping symbols into
alamouti blocks and transforming using Walsh Hadamard
matrix.
III.Proposed Methodology
This research work proposes a mathematical modeling of
security issues of wlan’s using space time processing. The
focus of recent research in wireless networks especially on
wlan’s is to identify the different ways to increase
throughput and decreasing Bit-Error-Rate(BER). One of the
conventional approach to security issues of wlan’s is
increasing signal strength and thereby increasing signal-to
noise ratio. However it is not a practical approach in
WLAN’s. Because whenever output power increases for
one of the LAN cards this also increases the interference for
rest of the cards. Therefore it decreases overall throughput
of a system, moreover maximum bandwidth is
allocated[17]. As we know that the process of allocating
maximum bandwidth is also not a practical solution because
bandwidth is more costly. Therefore it raises a question in
our mind how decrease BER and effectively increase
throughput[17].This condition can be satisfied with
extensive error correction schemes and increase redundancy
in data. In BER the channel equalizers are mainly used to
nullify the effect of channel impurities up to a certain level.
In Multipath fading equalizers can be treated as an enemy
of a signal and are basically used to equalize the effect of
multipath fading. In Maximal Ratio Combining (MRC)
multipath property is used to maximize the throughput and
overall performance of a system. Space time coding is a
technique in WLAN’s to operate a signal in both time and
space[17].In Maximal Ratio Combining(MRC) which
consists of one transmitting and two receiving antennas.
The signal which reaches the two receivers by two different
paths namely h1 and h2.These two paths are modeled by two
complex quantities such as phase and a
magnitude[17][19].The Fig.3. shows alamouti space time
processing in WLAN’
jx1
jx2
Fig.3.Alamouti space time processing code in WLAN’s.
Space time
encoder
ModulatorInformation
Source
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

h1=α1efθ1
------------(i)
h2=α2efθ2
------------(ii)
where α1,α2 are fading magnitudes and θ1,θ2 are phase
values.Noise is added at each receiver,so the received signal
at each receiver is specified by
y1=h1s+n1-----------(iii)
y2=h2s+n2----------(iv)
The equations(i),(ii),(iii) and (iv) are represented in the form
of matrix using equation(v)
y1 = S h1 + n1 -----------(v)
y2 h2 n2
The receiver side combines the two signals y1 and y2 as
follows[17].
s¯ =h1y1+h2y2-----------------(vi)
s‾=(h1sx+n1) +h2(h2s +n2)----------(vii)
s‾=(α1
2
+ α2
2
)S + h1n1+h2n2---------(viii)
By elaborating the equations(vi)(vii)(viii) we get and choose
Si iff
(α1
2
+ α2
2
)|Si|2
– s‾Si - s‾Si <= (α1
2
+ α2
2
)|Sk|2
- s‾ Sk - s‾Sk˅i#
k---------(ix).
3.1.Implementation of WLAN’s using Space time processing
using Two Transmitters and one Reciever.
The simple and a general space time code is specified by
alamouti[19]. During the first symbol period the two different
symbols are transmitted simultaneously from Tx1 and Tx2
respectively. During the next symbol period the transmitter
Tx1 and forwards –S2*,Tx2 forwards S1
*.
where * is a complex
conjugate.
The Table-1 shows the simple space time coding given by
alamouti[17][19]
Symbol period Tx1 Tx2
1 S1 S2
2 -S2
*
S1*
Table-1:Simple Space Time Coding for the security issues of WLAN’s.
Assume that channel response remains constant over the two
symbol periods,the two paths h1 and h2 are calculated as
follows.
h1(T=1)=h1(T=2)=α1efθ1
----------(x)
h2(T=1)=h2(T=2)=α2efθ2
----------(xi)
Now the received signals can be calculated as follows.
Y1=Y(T+1)=h1s1+h2s2 +n1---------------(xii)
Y2=Y(T+2)=-h1s2+h2s1+n2---------------(xiii)
The received signals are combined as follows to get S1 andS2
S¯
1=h1y1+ h2y2-------------(xiv)
S¯
2=h2y1 - h1y2--------------(xv)
S1
¯
=(α1
2
+ α2
2
)S1+h1n1+h2n2------------(xvi)
S2
¯
=(α1
2
+ α2
2
)S2-h1n2+h2n1 -----------(xvii)
3.2.The Space Time Processing based on alamouti code for
two antennas and two receivers.
The scenario for two transmitters and two receivers the
encoding and transmission methodology is same as that for
two transmitters and one receiver[17][19]. The difference in
this system is the number of channels have been increased to
four. The results computed by alamouti mechanism which
consists of two transmitters and two receivers is similar to
those calculated by four branch Maximal Receiver Ratio
Combining (MRRC). The power forwarded per antenna is
half as compared to the Maximal Ratio Combiner(MRC)[17].
One of the important result of alamouti technique was that
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

the combined signals from two receiving antennas were
computed by the simple addition of combined signals from
each receiving antenna. The epilogue was that by using two
transmitting and m receiving antennas when each of the m
antenna has its own combiner. By adding the output of all
combiners we get the same diversity order as 2m branch
MRC[17][19].
3.3.The Space time Processing based on alamouti code for
four transmitter and one receiver antenna.
When a symbol period is given,the four different
signals are transmitted simultaneously from four transmit
antennas. The signal one which transmitted from antenna one
is called Tx1 is specified by s1,the signal from antenna two
Tx2 is represented by s2,the signal from antenna three Tx3 is
shown by s3 and finally the signal from antenna four Tx4 is
represented by s4. This mechanism will continue on in a same
manner until transmitting the last row of the G4 transmission
matrix as shown in equation. This matrix has a rate of
half(1/2) encoding and is used as a space time processing(stc)
encoder to forward any complex signal constellations. The
space time processing encoding and mapping for four
forwarder antennas using complex signals. The four transmit
and one receive antenna channel coefficients are specified by
complex multiplicative distortions such as j1 for the first
antenna,j2 for the second antenna,j3 for the third antenna and
j4 for the fourth transmit antenna.
The various channel coefficients for the alamouti code with
four transmit and one receive antenna is beautifully explained
in Table-3. The various benefits of the space time processing
are as follows[31].
i.Improved performance with Diversity:-Space time
processing is mainly used to improve the performance
such as diversity[31]. Diversity is the amount of average
number of channels fully utilized by each piece of
information transmitted. The maximum amount diversity
of space time processing is specified by NtNr,where NtNr
is the total number of channels available between receiver
and transmitter. Diversity if Rayleigh fading channel is
directly calculated from error probability[31]. The
diversity of any Wireless local area network system is
represented by error probability salient feature as
SNR ͚ --------(xviii)
i.e probability(error)= Kρ
-D
------------(xix)
where D is called as Diversity order in rayleigh fading
model,ρ is Signal Noise Ratio(SNR) and K is a Coding
gain constant[31].
ii. Higher datarate,Capacity and Spectral efficiency:Higher
data rate,capacity and spectral efficiency is also consider
as the second important benefit of space time processing
in Digital Signal Processing. The datarate of space time
processing is computed by average number of symbols
sent per time epoch[31].
R=L/T------------------------------(xx)
ἡ=Datarate/Bandwidth----------(xxi)
The spectral efficiency of a space time processing using a
two dimensional constellation with M points to be
ἡ=Rlog2M bits/sec/Hz-------(xxii)
iii.Simpler handheld design:Simpler handheld is also one of
an important benefits which belongs to space time
processing[31]. It is also possible to increase diversity in all
subscriber units by fixing one antenna to the base
station,instead of new antenna to each receiving unit[31].In
Multiple Input Multiple Output(MIMO) channel with
Gaussian fading is[31]
C= EH log det ( INr + ρ/ Nt HH
H ------(xxiii)
= EH log det ( INt + ρ/ Nt HHH
------- (xxiv)
Tx1 Tx2 Tx3 Tx4
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

Table-2:Four transmit and one receive antenna encoding and mapping of space time processing using complex signals.
Rx
Tx1 j1
Tx2 j2
Tx3 j3
Tx4 j4
Table-3:Four transmit and one receive antenna channel coefficients.
Let us assume rayleigh fading channel is constant over the four
consecutive symbols and the channel coefiicients are specified
by xx,xxvi,xxvii,xxviii.
j1(t)=j1(t+T)=j1= |j|ejθ2
----------(xx)
----------(xxvi)
----------(xxvii)
j4(t)=j4(t+T)=j4=|j|ejθ4
----------(xxviii)
where |hi| and θi i=1,2,3 and 4 are amplitude and phase shift for
the path from transit antenna i to receive antenna j. The receiver
will receive eight different signals[31].
IV.Results and Discussion
As we know that in space time processing based on alamouti
code is one which supports for orthogonal scheme. Orthogonal
space time processing is mainly used to achieve full transmit
diversity of Nt=2. The Bit-Error-Rate(BER) versus Signal-to-
Noise Ratio(SNR) performance for alamouti transmit diversity
technique on low fading rayleigh channel is evaluated by
Matlab. This research work simulation results by using
Rayleigh fading channel for alamouti transmit diversity
methodology confirms that the Bit-Error-Rate(BER) decreases
with respect to the Signal-to-Noise Ratio(SNR). As we know
that space time processing which supports multiple antennas
along with an appropriate methodology becomes an important
powerful tool to improve the security issues of WLAN’s. The
future research issues in Wireless Local Area Networks offers
Multiple Input Multiple Output(MIMO) technique which is
planned for mobile networks using Wireless Local Area
Networks[17][19]. A plot of capacity for different kinds of
receive antennas is shown in Fig.4.
t s1 s2 s3 s4
t+T -s2 s1 -s4 s3
t+2T -s3 s4 s1 -s2
t+3T -s4 -s3 s2 s1
t+4T s1* s2* s3* s4*
t+5T -s2* s1* -s4* s3*
t+6T -s3* s4* s1* -s2*
t+7T -s4* -s3* s2* s1*
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

0 5 10 15 20 25 30 35
0
10
20
30
40
50
60
70
80
90
Signal to Noise Ratio(SNR)(dB)
Capacity(Bits)
(Nr,Nt)(2,2)
(Nr,Nt)(1,1)
(Nr,Nt)(4,4)
(Nr,Nt)(8,8)
Fig.4.Capacity for various systems with Nr=Nt receive antennas.
The Fig.4.briefly elaborates the capacity of different
systems with Nr=Nt receives antennas and it compares the
signal to noise ratio for 0,5,10,15,20,25,30 and 35 decibels
with capacity of systems for 0,10,20,30,40,50,60,70,80 etc for
2 antennas,2 receivers,1 antenna,1 receiver,4 antennas and 4
receivers,8 antennas and 8 receivers.
0 2 4 6 8 10 12 14
0
2
4
6
8
10
12
14
SER(Log Scale)
SNR/informationbit(dB)
New Code I with QPSK
MRC + 6dB
Fig.5.Performance of Maximal Ratio Combining(MRC) and QPSK non linear orthogonal code with full diversity.
The figure-5 illustrates very briefly how to compute the
performance issues of Maximal Ratio Combining vs QPSK
non-linear orthogonal code with full diversity. Most
simulations forward 2bits/sec/Hz with QPSK for 1 rate codes.
Performance is also computed for MRC with Signal to
Noise(SNR) normalized by a factor of 6dB(Nt=4). The curve
specifies a performance aim analogous to MRC with
Alamouti Code in two transmit antenna case.
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

-4.5 -4 -3.5 -3 -2.5 -2 -1.5 -1 -0.5 0 0.5
x 10
5
-5
-4
-3
-2
-1
0
1
x 10
5
Signal-to-Noise Ratio(SNR)
BitErrorRate
Matlab Sim(nTx=2,nRx=1,alamouti)
Theory (nTx=1,nRx=2,MRC)
Fig.6.Performance comparison of Alamouti Scheme.
V. Epilogue and Future research issues.
In this research paper we have simulated the security issues of
wlan’s using space time processing based on alamouti code.
This research also elaborates space time processing as a
concept to implement the security issues of wlan’s by
presenting Alamouti technique. In this research work it also
possible to increase number of antennas at both transmitter
and receiver without using interference in between antennas is
also one of the important technique to improve the security
issues of WLAN’s. This paper is also possible to extended for
further research work by applying amplitude
modulation,frequency modulation,phase keying modulation
etc. in this research work manuscript we have simulated the
research work result to improve security issues of WLAN’s
by increasing throughput and decreasing Bit-Error-
Rate(BER).We have also decided to extend the proposed
class-II non linear orthogonal code to more than four transmit
antennas. We have already learnt that full rate delay optimal
orthogonal codes are not square unless Nt=2. The process of
constructing full rate non square orthogonal codes for Nt >2
remains an interesting research challenge in WLAN’s and
Digital Signal Processing. In this research work also we have
computed Performance of Maximal Ratio Combining(MRC)
and QPSK non linear orthogonal code with full diversity and
also Capacity for various systems with Nr=Nt receive
antennas. Finally our research work proves and confirms that
security issues of WLAN’s are easily implemented by Space
Time Processing of Digital Signal Processing(DSP)
technique.
Acknowledgement
The First author would like to thank Dr.Hanumanthappa
.J.,Associate Professor,DoS in CS,Uni of Mysuru and
Dr.Sheshadri.H.S,Retired Professor,E&C Dept,PES College
of Engineering,Mandya,for his valuable guidance and helpful
comments throughout writing of this journal paper. The
author also would like to thank the all the reviewer’s of this
Journal paper.
References
[1].Hanumanthappa.J.,Ahmed Hweishel A.Alfarjat,Prof.H.S.Sheshadri,”A
Mathematical model to the Security issues of Bluetooth using Elliptic Curve
Cryptography,International Journal of Computer Applications(IJCA)(0975-
8887),Vol.161-No.8,March.2017.
[2].Hanumanthappa.J.,Ahmed Hweishel A.Alfarjat,”A Survey over the
Security Issues of Bluetooth Using Elliptic Curve Cryptography”,IJCA(0975-
8887),Vol.150,No.8.,Sept-2016.
[3].Andrew S.Tanenbaum,"Computer Networks",Pearson Education
Inc,FourthEdition,2003.
[4].ANSI/IEEE 802.11 Standard Part 11:WLAN Medium Access
Control(MAC) and Physical specifications,1999 ed 1999.
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

[5].Hanumanthappa.J.”Comparison and Contrast between the Performance
issues of T-SEP and E-SEP in Energy Efficient Wireless Sensor
Networks(EFWSN’s)”,in proceedings of the UGC Sponsored State Level
Conference on Next-Gen Computing(NGC-2015):Challenges and
Opportunities,Post Graduate Department of Computer Science,SBRR
Mahajana First Grade College,pp:89-101.
[6].Hanumanthappa.J.”Performance and Evaluation of a IntraCluster and
InterCluster Novel Graph Theoretic Routing Algorithm(GTRA) in
MANET’s”,in proceedings of the UGC Sponsored State Level Conference on
Next-Gen Computing(NGC-2015):Challenges and Opportunities,Post
Graduate Department of Computer Science,SBRR Mahajana First Grade
College,pp:109-115.
[7].Hanumanthappa.J.,”Mathematical modeling of k-CCP protocol of
coverage and connectivity in wireless sensor networks”,in Proceedings of the
National Conference on Computer Science and its Applications(NCCSA-
2015),Dept of CS,Shri Shiradi Saibaba College of Engineering,Bengaluru.
[8].Hanumanthappa.J.,Abdul Malek Maresh Hasan Ali,2017,Node
multihoming based policy routing using Mobile IPv6 in ns2,in proceedings of
the national conference on advanced information technology(NCAIT-
2017),SJBIT,Bengaluru.
[9].Hanumanthappa.J.,Abdul Malek Maresh Hasan Ali,2017,Comparison and
Contrast between the performance issues of mDBR and mCoDBR novel
cooperative routing protocols in under water sensor networks(UWSN’s),in
International Journal Of Research Science,Engineering Technology(IJRSET).
[10].Hanumanthappa.J.,Investigations Into The Design,Performance And
Evaluation Of A Novel Energy Efficient Multipath Routing Algorithms in
Wireless Sensor Networks,in Proceedings of National Conference on
Computer Science and its Applications(NCCSA-2015),Dept of CS,Shri
Shiradi Saibaba College of Engineering,Bengaluru.
[11].Ondiwa Nashon Odhiambo,E.Biermann,G.Goel,An integrated security
model for WLAN,in proceedings of the IEEE(AFRICON-2009),23-
25,September,2009,Nairobi,Kenya,pp:1-6.
[12].Hanumanthappa.J.,”An Investigations Into The Design, Performance
And Evaluation Of A Novel Energy Efficient Multipath Routing Algorithms
in Wireless Sensor Networks”,in Proceedings of the National Conference on
Computer Science and its Applications,2015.
[13].M.K.Panda,Anurag kumar.Kumar,Modeling multi-cell IEEE 802.11
WLAN’s with application to channel assignment in:Modeling and
optimization in mobile ad-hoc and wireless networks,2009,Wi opt,2009,7th
International Symposium on IEEE,pp:1-10.
[14].Anurag Kumar,K.P.Naveen,Eitan Altman,2017.Competitive Selection of
Ephemeral Relays in Wireless Networks,IEEE Journal on Selected Areas in
Communication,Special Issue on Game Theory for
Networks,vol.35.,no.3.,pp:586-600.
[15].R.Bruno.M.Conti,E.Gregori,an accurate close-form formula for the
throughput of long lived TCP connections in IEEE 802.11
WLAN’s,computer networks 52(2008),199-212.
[16].G.Kuriakose,S.Harsha,A.Kumar,V.Sharma,analytical models for
capacity estimation of IEEE 802.11 wlan’s using DCF for internet
applications,wireless networks 15(2009),259-277.
[17].Mohammad Ilyas and Syed Ahson,2005.,Handbook of Wireless Local
Area Networks,Taylor and Francis,ISBN:978-0-8493-2323-29(Hardcover).
[18].William Stallings,IEEE 802.11:Moving closer to practical WLAN’s,IT
Professional,vol.3.,Issue.3.,May-June,2001,pp:17-23.
[19].S.Alamouti,A Simple transmit diversity technique for Wireless
communications,IEEE Journal in selected areas in
communication,October,1998.
[20].T.S.Rapport,Wireless communications:Principles and Practice,second
edition,prentice hall,upper saddle river,NJ,2001.
[21].LAN MAN standard committee of the IEEE computer society,Wireless
LAN Medium Access Control(MAC) and Physical layer specifications,IEEE
standard 802.11,1999.
[22].Weifeng Su,Stella.N.,Batalama,Dimitris.A.Pados,On orthogonal space
time block codes and transceiver signal linearization,in IEEE
communications Letters,vol.10,no.2,2006,pp:91-93.
[23].Hanumanthappa.J.,An Innovative Simulation,Comparison Methodology
& Framework for evaluating the Performance evaluation metrics of a Novel
IPv4/IPv6 Transition Mechanisms:BD-SIIT vs.DSTM,in proceedings of the
IEEE First International Conference on Integrated Intelligent
Computing(ICIIC-2016),SJBIT,Bengaluru,pp:258-263.
[24].Hanumanthappa.J.,“A Simulation study on the performance of Divide-
and-Conquer based IPv6 Address LPR in BD-SIIT IPv4/IPv6 transition using
a Novel Reduced Segment Table(RST) algorithm in BD-SIIT
Translator”,Proceedings of International Conference on Computer’s and
Computing(ICCC’11),May,27-29,2011,Lanzarote,Canary
Islands,Spain(ISBN:978-1-61804-0008).
[25].O.Tirkkonen,A.Boariu,A.Hottinen,Minimal non-orthogonality rate 1
space-time block code for 3+ Tx,in IEEE Int.Symposium Spread spectrum
techniques and applications,New Jersey,USA,Sept,2000,pp:429-432.
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

[26].H.Jafarkhani,a quasi-orthogonal space time block code,IEEE
Transactions on Communications,vol.49,pp:1-4,Jan,2001.
[27].C.B.Papadias,G.J.Foschini,a space time coding approach for systems
employing four transmit antennas,in Proc.IEEE Int.Conf.Acoust.Speech
Signal Processing,Salt lake city,Utah,May,2001,pp:2481-2484.
[28].L.M.A.Jalloul,K.Rohani,K.Kuchi,J.Chen,performance analysis of
CDMA transmit diversity methods,in Proc Vehicular
Tech.Conf(VTC),Amsterdam,Netherlands,Oct.1999,pp:1326-1330.
[29].P.Ding,J.Holliday,A.Celik,Improving security of WLAN’s by managing
802.1x Disassociation,IEEE consumer communications and Networking
conference(CCN04),pp.53-58,Jan.2004.
[30].C.He,J.C.Mitchell,Security analysis and improvements for IEEE
802.11i,the 12th
Annual network and Distributed system security
symposium(NDSS’05),pp:90-110,Feb.2005.
[31].Lori Anne Dalton,New orthogonal space time block codes with full
diversity,Master of Science Thesis,2002.
[32].Hanumanthappa.J.,2009,Economical and Technical costs for the
Transition of IPv4–to-IPv6 Mechanisms[ETCTIPv4 to ETCTIPv6],in
proceedings of NCWNT-09,Nitte-574110,Karnataka,INDA-12-17.
[33].Hanumanthappa.J,2008,A Study on Comparison and Contrast between
IPv4 and IPv6 Feature sets.in Proceedings of ICCNS’08,2008,Pune,297-302.
[34].Hanumanthappa.J.,2008,Transition of IPv4 Network Applications to
IPv6 Applications,In Proceedings of ICETiC-09,2009,S.P.G.C.
Nagar,VirudhaNagar-626 001,Tamil Nadu,INDIA-35-40.
[35].Hanumanthappa.J.,An Overview of Study on Smooth Porting process
scenario during IPv6 Transition(TIPv6),in Proceedings of IEEE IACC-
09,Patiala,Punjab,INDIA-6-7,March-2009,pp:2217-2222.
[36].Hanumanthappa.J.,”IPv6 and IPv4 Threat reviews with Automatic
Tunneling and Configuration Tunneling Considerations Transitional Model:
-A Case Study for University of Mysore Network”,International Journal of
Computer Science and Information Security,vol.3.,No.1.,2009,pp.1-12.
[37].Hanumanthappa.J.,A Simulation study on the performance of divide-
and-conquer based IPv6 Address LPR in BD-SIIT IPv4/IPv6 transition using
a Novel Reduced Segment Table(RST) algorithm in BD-SIIT
Translator,Proceedings of International Conference on Computer’s and
Computing(ICCC’11),May,27-29,2011,Lanzarote,Canary
Islands,Spain(ISBN:978-1-61804-0008).
[38].Hanumanthappa.J.,A Mathematical model to realize the parallel
computing based diminution tree with List Ranking based BD-TTCS as a
new IPv4/IPv6 Transition mechanism,in proceedings of Springer ADCONS
2011,LNCS 7135,pp.460-470,2012.
[39].Hanumanthappa.J.,A New Scheme for IPv6 BD-TTCS Translator,in
proceedings of Springer ICDCIT 2012,LNCS 7154,pp.106-116,2012.
[40].Hanumanthappa.J.,IPv4/IPv6 Transition using Singly linked
list,International Journal of Engineering Innovation and
Research(IJSER),Vol.1.,Issue.2.,ISSN:2277-5668.
[41].Hanumanthappa.J.,A New Scheme for IPv6 BD-TTCS Translator : A
Section Division Approach,International Journal of Computer
Applications,vol.46,no.5.,may,2012,pp:7-15.
[42].Hanumanthappa.J.,A Multihoming based IPv4/IPv6 Migration
expenditure model:Multicost6,International Journal of Computer Science
and Artificial Intelligence,Vol.2.,Iss.3.,Sept 2012,PP:24-31.
[43].Hanumanthappa.J.,An Explicit link failure notification with dynamic
cache update scheme to improve TCP Performance using DSR Protocol in
MANET’s,International Journal of Engineering,Science and
Technology,vol.2(6),2010,PP:2263-2271.
[44].Hanumanthappa.J.,Role of IPv6 over Fibre(FIPv6) : Issues and
Challenges,International Journal on Computer Science and
Engineering,Vol.2.,No.4,2010,993-1002.
[45].Hanumanthappa.J.,”DW&C:Dollops Wise Curtail IPv4/IPv6 Transition
Mechanism Using NS2”,InterNational Journal Of Engineering Trends and
Technology(IJETT),Vol.14,Number.6.,Aug-2014.
[46].Hanumanthappa.J.,”IPv4/IPv6 Transition Expenses Paradigm Using a
Node Multihoming Approach(Multihmcost6)”,InterNational Journal of
Computational Engineering and
Management(IJCEM),Vol.16,Issue.3.,May.2013.
[47].Hanumanthappa.J.,”A Novel IPv4/IPv6 Transition Scenarios in 4G
Networks.”,Journal of Software Project Management and Quality
Assurance(JSMQA),Volume.1,Number.2,July-Dec.2010,pp.65-77.
[48].Hanumanthappa.J.,”An Innovative Simulation of IPv4 to IPv6 BD-SIIT
Transition Mechanism Methodology between IPv4 Hosts in an Integrated
IPv6/IPv4 Network”,International Journal of Computer and Network
Security(IJCNS),Vol.2.,Number-7,ISSN:ISSN Print:2076-2739 ISSN
Online:2076-9199,June2010.
[49].Dr.Hanumanthappa.J.,Ahmed Hweishel A.Alfarjat,”Security issues of
Bluetooth based on Digital Signature using Elliptic Curve
Cryptography(SBECDSA)”,InterNational Journal of Current
Multidisciplinary Studies”,Vol.1.,Issue.01,July-2017,pp:1-7.
[50].Dr.Hanumanthappa.J.,IPv4/IPv6 Transition expenses paradigm using a
Node Multihoming approach(Multihmcost6),International Journal of
Computational Engineering and
Management(IJCEM),Vol.16,Issue.3.,May,2013.
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

[51].Dr.Hanumanthappa.J.,Investigations into the Design,Performance
Evaluation of a Novel IPv4/IPv6 transition scenarios in 4G networks
advanced wireless networks in proceedings of the national conference on
Knowledge,Knowledge Banks and Information Networking(KKBNET-
2010),organized by National Institute of Technology
(NIT),Suratkal,Mangalore,Karnataka,India,April 8th
-9th
,2010.
[52].Hanumanthappa.J.,“IPv6 Tunneling Algorithms in 4G
Networks”,Proceedings of the National Conference on
Knowledge,Knowledge Banks and Information Networking(KKBNET-
2010),organized by National Institute of Technology
(NIT),Suratkal,Mangalore,Karnataka,India,April 8th
-9th
,2010.
[53].Hanumanthappa.J.,“Implementation,Comparative and Performance
Analysis of IPv6 over IPv4 QoS metrics in 4G Networks:Single-source-
destination paths Delay,Packet Loss Performance and Tunnel Discovery
Mechanisms”, Proceedings of the International Conference on Information
Science and Applications (ICISA-2010) organized by Dept.of Master of
Computer Applications,Panimalar Engineering College,Chennai-
600123,Tamilnadu,India,February-06-2010,[Paper code ICISA-293(with
serial no-101)].
[54].Hanumanthappa.J.,IPv4–to-IPv6 Threat reviews with Dual Stack
Transition Mechanism Considerations a Transitional threat model in 4G
Wireless networks Proceedings of the International Conference on Emerging
Trends in Computer Science,Communication and Information
Technology,(CSCIT2010)organized by Dept of CS and Information
Technology,Yeshwanth Mahavidyalaya,Nanded,Maharastra,India,January
09-11,2010,[Paper code CSCIT-157] [CSCITOP115].
[55].Hanumanthappa.J.,A Study on IPv6 in IPv4 Static Tunneling threat
issues in 4G Networks using OOAD Class and Instance Diagrams”,
Proceedings of the International Conference on Emerging Trends in
Computer Science, Communication and Information
Technology,(CSCIT2010)organized by Dept of CS and Information
Technology,Yeshwanth Mahavidyalaya,Nanded,Maharastra,India,January
09-11,2010,[Paper code CSCIT-152][CSCITOP113].
[56].Hanumanthappa.J.,“Evaluating DSTM IPv4-in-IPv6 Tunneled Header
Vs BD-SIIT IPv4-to-IPv6 Header in IPv4/IPv6 Transition
Mechanisms”,Proceedings of the International Conference on Fifth
Innovative Conference on Embedded Systems,Mobile Communication and
Computing,July 26th
-28th
2010,PESIMSR,Kuppam,Andra Pradesh,India.
[57].Hanumanthappa.J.,“On the Investigations of Design,
Implementation,Performance and Evaluation Issues of a Novel BD-SIIT
Stateless IPv4/IPv6 Translator”,Proceedings of the International Conference
on Computers,Communication and Intelligence(ICCCI-2010),July 22nd
-23rd
2010,Velammal College of Engineering and Technology,Madurai-625
009,TamilNadu,India[Paper ID-Comp 128].
Vol. 15, No. 8, Augus 2017
ISSN 1947-5500

Mathematical Modeling of Security Issues of WLAN’s using Space Time Processing in

More Related Content

What's hot (19)

Similar to Mathematical Modeling of Security Issues of WLAN’s using Space Time Processing in (20)

Recently uploaded (20)

Mathematical Modeling of Security Issues of WLAN’s using Space Time Processing in