International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3329

MultipathSourceRouting with Jamming
Aware Traffic Allocation

Tirupathi Reddy.G
#1
, Kavitha.D
#2

#1
M.Tech, Computer Science Engineering, G.Pulla Reddy Engineering College (Autonomous) Kurnool, Andhra
Pradesh, India
#2
Professor, Department of CSE, G.Pullareddy Engineering College, Kurnool, Andhra Pradesh, India


Abstract -- Multi-path source routing is widely used in
networks. This kind of routing allows data to be
transferred from source to destination through multiple
paths. However, there might be jamming problems in
this kind of communication. Many existing solutions
have given approaches to provide jamming aware
allocation of traffic to multiple paths. Explored a new
jamming aware traffic allocation taking the support of
the concept of portfolio selection. We also explore the
problem of in-network inference. The jamming
statistics are updated and made available to the nodes
in the network. When a source node sends data to
destination node, it allocates traffic to various paths
based on the jamming aware knowledge and also
portfolio selection for best possible result. The aim of
this approach is to utilize the available paths optimally
besides reducing the possibility of jamming. The
experimental results revealed that the solution is
jamming aware and the portfolio selection concept has
improved that the performance of the network is
improved by maximizing throughput.

Index Terms In-network inference, jamming aware
traffic allocation, multipath source routing

I. INTRODUCTION
In any network jamming disrupts normal
communication flow by causing problems to the data
transfer. It also leads to various attacks such as
Denial of Service (DoS) [1]. Jamming occurs at
physical layer which has its impact on the network.
For this reason solutions pertaining to physical layer
are to be used to solve this problem. Solutions like
spread-spectrum and beamforming are some of the
examples for physical layer solutions. These
solutions discourage jamming attacks made by
adversaries. Recent incidents proved that jammers are
using cross layer protocol knowledge to make attacks
thus reducing the resource requirements for attack.
These attacks could reduce resource consumption to a
greater extent and thus made the process of attacking
as feasible as possible. Link layer and MAC
implementations are targeted by hacker [2], [3]. Error
detection mechanisms at link layer and correction
protocols were targeted by hackers [4]. This has led
to the research of anti-jamming in the respective
layers [5]. Sending network traffic around jammed
nodes is also another solution.


Fig. 1 Network with presence of a jammer
The existing anti-jamming methods are many and
diversified in their approaches. The diversity of the
approaches includes MAC channel, multiple routing
paths, and multiple frequency bands. Multiple routing
paths are the approach followed in this paper for anti-
jamming solution. There are many protocols for
multiple path source routing. They include DSR
(Dynamic Source Routing), MPDSR [6], and AODV
(Ad-Hoc On-Demand Distance Vector Protocol).
These protocols exhibit a common thread that is they
use source node to send data to destination through
multiple paths. Therefore it is essential to have a
robust mechanism for intelligent traffic
allocationamong the paths to avoid jamming. Based
on jamming statistics experienced earlier, it is
possible to have routingmechanisms as explored in
[7] where portfolio is used to choose the best routes.
Thus throughput of the network can be improved. For
source node it is important to send traffic to
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 3330

destination node with jamming awareness. However,
this ability depends on various factors which are
known and unknown. This is because the adversaries
change their strategies of jamming from time to time.
In this paper we implemented the jamming aware
traffic allocation mechanism presented in [7]. The
jamming awareness is based on the probabilistic
approach. Therefore it is non-deterministic. Therefore
a stochastic approach is followed in this paper which
has the following contributions.

Formulating the traffic allocation
mechanism that is jamming aware through
lossy network optimization.
We also implement the portfolio selection
process presented in [8].
For network utility maximization an
algorithm is presented [7].
We built a prototype application using NS2
that simulates the proposed network with
jamming awareness and portfolio selection.
In-network inference is also explored with
various parameters with assumptions
presented in [7].
The rest of the paper is organized as follows. Section
II reviews literature related work. Section III
provides our approach used for jamming aware traffic
allocation. Section IV provides experimental results
and evaluation. Section V provides conclusions.

II. RELATED WORK
First of all the effects of jamming attacks executed by
adversaries are presented in [9]. Jamming has its
impact on the network functioning and performance.
There is denial of service attack possibilities. These
attacks and their consequences and prevention
mechanisms were explored in [1] where end-to-end
communication is considered in experiments.
Different techniques were used by jammers and they
are constantly changing from time to time so as to
make the attacks successfully. MAC implementations
were also used by attackers as explored in [3] and
[10]. In link layer error correction protocols were
presented for anti-jamming [4]. Many researchers
investigated to know the ways and means to prevent
jamming attacks in the top layers of protocols [10],
[5].

Lot of research went on jamming attacks and
selective jamming attacks in the networks where
multiple path source routing takes place. The
protocols used in that care are MPDSR, DSR, and
AODV [11], [6]. Jamming aware allocation of traffic
through multiple paths with a portfolio selection
concept is used in [7]. This approach maximized the
throughput even in the presence of jammers over the
network. The portfolio selection concept is explored
in [8] and [12] as it can give best ways to do in case
of jammers present in the network. Actually the
portfolio selection theory is taken from finance
domain where investments are made based on
different portfolio for maximizing profits. In the
same fashion in [7] the approach is explored to
ensure best utilization of jamming aware traffic
allocation. This paper practically implements the
jamming aware traffic allocation concept with
portfolio selection process using NS2.

III. FINDING THE IMPACT OF
JAMMING
System Model and Characterization
Experiments are made on a wireless network. The
experiments are on the jamming aware traffic
allocation where a source node uses proposed
algorithm that can help in allocating traffic to various
routes in the presence of jammers. The source node
sends data to destination through multiple paths
based on the portfolio selection process which tells
which path is best. We assume in this paper that the
source node S can perform jamming aware traffic
allocation without the prior knowledge about the
jammer and its goals including location of jammer
and so on. Fig. 2 illustrates the communication
network using wireless media and also process of
multi-path source routing which also has jammers.

Fig. 2 Source and destination with multiple paths
As shown in fig. 2, it is evident that there are six
nodes in the network. There are labeled source and
destination nodes too. The source node is supposed to
send data to destination node through multiple paths
with portfolio selection process and jamming
awareness for traffic allocation. The assumption in
this paper is that the rate 300 a source node sends
data to destination node. After computing jamming
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 3331

awareness, the traffic is allocated among the paths
based on the portfolio selection theory.
The network nodes continuously monitor the
presence of jammers in the network and also record
statistics pertaining to jammers. After having details
of jamming awareness, the analysis is made to
estimate traffic allocation and thus traffic is allocated
which is likely to reach the destination successfully.
Many factors are considered in the experiments of
this paper. They include path loss behavior, presence
of jammer, signal power of jammer, and the presence
of jammers in the network, in-network inference, and
the distance between the source node and the jammer.
In this paper as mentioned earlier, source node is not
at all aware of the location of jammers. An analytical
model is used to realize and characterize the network
and its jamming aware traffic allocation with
portfolio selection criteria. A source node is supposed
to estimate the packet success rate, other parameters
and also in-network inference prior to taking
decisions on the jamming aware traffic allocation.
Recursive update is followed in this paper in order to
update information from time to time. This
information helps in jamming aware traffic allocation
which will prevent packet loss and ensures high
growth in reliable transmission of data. The update
mechanism is taken from [13]. The estimation
approach followed is known as sequential estimation
process which is based on the concept of RTT
(Round Trip Time).

IV. JAMMING-AWARE TRAFFIC
ALLOCATION
In this section we describe the jamming aware traffic
allocation procedure which also makes use of
portfolio selection mechanism originally proposed for
investment options. We also consider the in-network
correlation among various variables. Sending data
from source to destination takes place in the presence
of jammers. The network support multiple-path
source routing where a source node sends data to
destination though multiple paths. However, the
source node has to be jamming aware in order to
ensure that it does not send data through jammers
present in the network. There are some constraints
considered such as source data rate constraints, link
capacity constraints, and traffic flow reduction.
Based on these constraints, the decisions are made
part of jamming aware traffic allocation. Depending
on the capacity constraints presented in [5] packet
success rate concept is used in order to compensate
randomness. Further to allocate traffic over available
paths where jammers do not exist, a portfolio
selection process is employed [8], [12]. Portfolio
selection is a real world theory used for financial
investments and making corresponding decisions.
The portfolios of financial domain and the traffic
allocation concepts are presented in table 1.

Portfolio Selection Traffic Allocation
Funds to be invested
Financial assets
Excepted Asset return
Investment portfolio
Portfolio return
Portfolio risk
Source data rate
Routing paths
Excepted packet success rate
Traffic Allocation
Mean throughput
Estimation variance

Table 1 Traffic Allocation and Portfolio Selection Comparison
As shown in table 1, the real world portfolios for
financial investment are presented with
corresponding mapping with the traffic allocation
concepts in the proposed network. Every portfolio
has its advantages and risks. In the same fashion,
various paths available to source node are to be
evaluated to know which one isbased on the portfolio
selection process. The best portfolio is utilized by the
source node for jamming aware traffic allocation. In
this paper we implement the jamming aware traffic
allocation with portfolio selection using NS2.

V. SIMULATION RESULTS
The Simulations are made in NS2. Between a source
node and destination node, jamming aware traffic
allocation is made. This is facilitated by a portfolio
section process internally. Fig. 2 shows the network
with communication between source and destination.


Fig. 3 Network with normal traffic allocation
As can be seen in fig. 3, it is evident that the network
has many nodes and two nodes are considered from
source and destination. At present traffic allocation is
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 3332

done normally based on the availability of routes.
When jamming aware traffic allocation mechanism is
applied, the traffic allocation is done based on the
jamming statistics and portfolio selection mechanism.

Fig. 4 J amming aware traffic allocation
As can be seen in fig. 4, the traffic allocation is
performed with jamming statistics. The jammer is
present in the network. When the jammer presence is
identified and jamming statistics are known, the
traffic allocation is made differently without causing
problems to traffic. The portfolio based, jamming
aware traffic allocation ensures that all packets will
reach the destination.

VI. EVALUATION OF EMPERICAL
RESULTS
We have implemented the jamming aware traffic
allocation concept using NS2 simulator. The
simulation shows that a source node is able to
allocate traffic to different paths in the context of
multiple-path source routing. The source node is
jamming aware and also uses portfolio selection
process. Various techniques were evaluated for
optimal traffic allocation. However, the focus is on
portfolio selection along with known jamming
statistics stochastically collected from time to time.
Traffic allocation is made in two ways. The first way
ignores the presence of jammers while the second
assumes jammers are present in the network.







Parameter Value
Network area
Radio range
Number of Sources
Number of Nodes
MaximumSource Data
Transmission power
Pathloss Exponent
Link Capacity
200 mX 500 m
100 m
|s|=1
|N|=6
Rs=100 pkts/s
Pt=1 mW(0 dBm)
V=2.7
Cij=200 pkts/s
Table 2 Simulation Parameters
As shown in the above table 2 represents the
parameters and their values.
This paper has explored the jamming aware traffic
allocation with portfolio selection in the presence of
jammers in the wireless network. The empirical
results are presented in a series of fig. 3.

Fig. 5 Packet success rate estimation
As shown in fig. 5, the Y axis represents estimation
of success rate while the X axis shows the time in
seconds. Source node in the network uses the details
for jamming aware traffic allocation.


Fig. 6 EWMA coefficients
As shown in fig. 6, the X axis shows time in seconds
while the Y axis shows the success rate estimation
details.

0
0.2
0.4
0.6
0.8
1
1 2 3 4 5 6 7 8 9101112
E
s
t
i
m
a
t
e

U
i
j

-
T
=
0
.
5
0
,
a
=
0
.
3
0
.
b
=
0
.
7
0
Time(seconds)
Tx=10.0
Tx=5.0
Tx=1.0
True value
of Xij
0
0.2
0.4
0.6
0.8
1
1 2 3 4 5 6 7 8 9101112
E
s
t
i
m
a
t
e
U
i
j

-
T
s
=
1
.
0
,

T
=
0
.
5
0
,

b
=
0
.
7
0
Time(seconds)
a=0.70
a=0.50
a=0.30
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 3333


Fig. 7 Packet success rate with variance
As seen in fig. 7, the X axis shows the time in
seconds while the Y axis shows the success rate
variance.

Fig. 8 Estimation of Update Period
As seen in fig. 8, the update period estimate is shown
in Y axis while the time in seconds is shown in X
axis.


Fig. 9 EWMA coefficients
As seen in fig. 9, the X axis shows time in seconds
while the Y axis shows packets per second or
throughput.


Fig. 10 Simulated throughput
As shown in fig. 10, the X axis shows time in
seconds while the Y axis shows the packets per
second or throughput.

Fig. 11 Updated relay and throughput
As shown in fig. 11, the X axis shows time in
seconds while the Y axis shows the packets per
second or throughput.


Fig. 12 Updated relay and throughput
As seen in fig. 12, the X axis shows time in seconds
while the Y axis shows throughput.
0
0.005
0.01
0.015
0.02
0.025
0.03
1 3 5 7 9 11
E
s
t
i
m
a
t
i
o
n

V
a
r
i
a
n
c
e

U
i
j

-
t
=
0
.
5
0
,
a
=
0
.
3
0
,
b
=
0
.
7
0
Time(seconds)
Tx=10.0
Tx=5.0
Tx=1.0
0
0.05
0.1
0.15
0.2
0.25
0.3
0.35
0.4
1 3 5 7 9 11 13
E
s
t
i
m
a
t
e

U
i
j
-
T
s
=
1
.
0
0
,

a
=
0
.
3
0
,

b
=
0
.
7
0
Time(seconds)
T=0.50
T=0.20
T=0.05
0
50
100
150
200
250
300
350
400
1 3 5 7 9 11 13
T
h
r
o
u
g
h
p
u
t
(
P
a
c
k
e
t
/
s
e
c
o
n
d
s
)
Time (seconds)
Ignoring
Jamming
Max
throughpu
t, Ks=0
Maxthrou
ghput with
true x
0
20
40
60
80
100
120
140
1 3 5 7 9 11 13
T
h
r
o
u
g
h
p
u
t
Time (sec)
Min risk-
return ,
Ks=0.005
Max
throughput,
Ks=0
0
2
4
6
8
10
12
14
16
1 2 3 4 5 6 7 8 9 101112
T
h
r
o
u
g
h
p
u
t

s
h
a
r
p
e

R
a
t
i
o
Update Relay Period Ts
Ignoring
Jamming
Max
throughput
, Ks=0
Min risk
return,
Ks=0.005
0
5
10
15
20
1 3 5 7 9 11
T
h
r
o
u
g
h
p
u
t

s
h
a
r
p
e

R
a
t
i
o
Update Relay Period Ts
Ignoring
Jamming
Max
throughput
, Ks=0
Min risk
return,
Ks=0.005
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 9 Sep 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 3334


VII. CONCLUSION
In this paper we implement multi-path source routing
with jamming aware traffic allocation. We consider a
network in the presence of jammers. The proposed
network is built using NS2 which demonstrate the
total traffic allocation among available paths.
However, the network considers jamming statistics to
make decisions for allocating traffic. Hence it is
known as jamming aware traffic allocation. The
proposed solution also makes use of portfolio
selection theory which was originally developed for
making decisions on financial investments. The
portfolio selection theiroy makes the network to be
more robust to jamming. While making routing
decisions, the source node considers jamming
statistics and also portfolio selection approach for
efficient traffic allocation which improves throughput
and reduces congestion or jamming possibilities. The
simulation results reveal that the proposed
mechanism is effective can improve the performance
of network.

REFERENCES
[1] R. Anderson, Security Engineering: A Guide to Building
Dependable Distributed Systems. J ohn Wiley & Sons, Inc., 2001.
[2] J . Bellardo and S. Savage, 802.11 denial-of-service attacks:
Real vulnerabilities and practical solutions, in Proc. USENIX
Security Symposium, Washington, DC, Aug. 2003, pp. 1528.
[3] D. J . Thuente and M. Acharya, Intelligent jamming in wireless
networks with applications to 802.11b and other networks, in
Proc. 25
th
IEEE Communications Society Military
Communications Conference (MILCOM06), Washington, DC,
Oct. 2006, pp. 17.
[4] G. Lin and G. Noubir, On link layer denial of service in data
wireless LANs, Wireless Communications and Mobile
Computing, vol. 5, no. 3, pp. 273284, May 2005.
[5] W. Xu, K. Ma, W. Trappe, and Y. Zhang, J amming sensor
networks: Attack and defense strategies, IEEE Network, vol. 20,
no. 3, pp. 4147, May/J un. 2006
[6] R. Leung, J . Liu, E. Poon, A.-L. C. Chan, and B. Li, MP-DSR:
A QoSaware multi-path dynamic source routing protocol for
wireless ad-hoc networks, in Proc. 26th Annual IEEE Conference
on Local Computer Networks (LCN01), Tampa, FL, USA, Nov.
2001, pp. 132141.
[7] Patrick Tague, Sidharth Nabar, J ames A. Ritcey, and Radha
Poovendran, J amming-Aware Traffic Allocation for Multiple-
Path Routing Using Portfolio Selection, IEEE/ACM
TRANSACTIONS ON NETWORKING, VOL. 19, NO. 1, FEB
2011.
[8] H. Markowitz, Portfolio selection, The J ournal of Finance,
vol. 7, no. 1, pp. 7792, Mar. 1952.
[9] E. M. Sozer, M. Stojanovic, and J . G. Proakis, Underwater
acoustic networks, IEEE J ournal of Oceanic Engineering, vol. 25,
no. 1, pp. 7283, J an. 2000
[10] A. D. Wood and J . A. Stankovic, Denial of service in sensor
networks, IEEE Computer, vol. 35, no. 10, pp. 5462, Oct. 2002.
[11] E. M. Royer and C. E. Perkins, Ad hoc on-demand distance
vector routing, in Proc. 2nd IEEE Workshop on mobile
Computing Systems and Applications (WMCSA99), New
Orleans, LA, USA, Feb. 1999, pp. 90100.
[12] S. Boyd and L. Vandenberghe, Convex Optimization.
Cambridge, 2004
[13] S. W. Roberts, Control chart tests based on geometric
moving averages, Technometrics, vol. 42, no. 1, pp. 97101, Feb.
2000.