Mini Project 2011-'12 Online Voting System

Mini Project 2011-12
Online Voting System
1.INTRODUCTION
Jamming point-to-point transmissions in a wireless mesh network or underwater acoustic network can have debilitating effects on data transport through the network. The effects of jamming at the physical layer resonate through the protocol stack, providing an effective denial-of-service (DoS) attack on end-to-end data communication. The simplest methods to defend a network against jamming attacks comprise physical layer solutions such as spread-spectrum or beam forming, forcing the jammers to expend a greater resource to reach the same goal. However, recent work has demonstrated that intelligent jammers can incorporate cross-layer protocol information into jamming attacks, reducing resource expenditure by several orders of magnitude by targeting certain link layer and MAC implementations as well as link layer error detection and correction protocols. Hence, more sophisticated antijamming methods and defensive measures must be incorporated into higher layer protocols, for example channel surfing or routing around jammed regions of the network.
The majority of antijamming techniques make use of diversity. For example, antijamming protocols may employ multiple frequency bands, different MAC channels, or multiple routing paths. Such diversity techniques help to curb the effects of the jamming attack by requiring the jammer to act on multiple resources simultaneously. This paper consider the antijamming diversity based on the use of multiple routing paths. Using multiple-path variants of source routing protocols such as Dynamic Source Routing (DSR) or Ad Hoc On-Demand Distance Vector (AODV), for example the MP-DSR protocol, each source node can request several routing paths to the destination node for concurrent use. To make effective use of this routing diversity, however, each source node must be able to make an intelligent allocation of traffic across the available paths while considering the potential effect of jamming on the resulting data throughput. In order to characterize the effect of jamming on throughput, each source must collect information on the impact of the jamming attack in various parts of the network.
Department of Computer Science and Engineering.
College of Engineering, Cherthala
However, the extent of jamming at each network node depends on a number of unknown parameters, including
the strategy used by the individual jammers and the relative location of the jammers with respect to each transmitterreceiver pair. Hence, the impact of jamming isprobabilistic from the perspective of the network,1 and the characterization of the jamming impact is further complicated by the fact that the jammers strategies may be dynamic and the jammersthemselves may be mobile.2 In order to capture the nondeterministic and dynamic effects of the jamming attack, model the packet error rate at each network node as a random process. At a given time, the randomness in the packet error rate is due to the uncertainty in the jamming parameters, while the time variability in the packet error rate is due to the jamming dynamics and mobility. Since the effect of jamming at each node is probabilistic, the end-to-end throughput achieved by each sourcedestination pair will also be nondeterministic and, hence, must be studied using a stochastic framework. This paper investigate the ability of network nodes to characterize the jamming impact and the ability of multiple source nodes to compensate for jamming in the allocation of traffic across multiple routing paths. Contributions to this problem are as follows. Formulate the problem of allocating traffic across multiple routing paths in the presence of jamming as a lossy network flow optimization problem and map the optimization problem to that of asset allocation using portfolio selection theory. Formulate the centralized traffic allocation problem for multiple source nodes as a convex optimization problem. Show that the multisource multiple-path optimal traffic allocation can be computed at the source nodes using a distributed algorithm based on decomposition in network utility maximization (NUM). Propose methods that allow individual network nodes to locally characterize the jamming impact and aggregate this information for the source nodes. Demonstrate that the use of portfolio selection theory allows the data sources to balance the expected data throughput with the uncertainty in achievable traffic rates.
The remainder of this paper is organized as follows. In Section II states the network model and assumptions about the jamming attack. To motivate the formulation, in Section III, present methods that allow nodes to characterize the local jamming impact. These concepts are
required to understand the traffic allocation optimization and the mapping of this problem to Portfolio selection. Section IV formulate the optimal multiple path traffic allocation problem for multisource networks. Section V evaluate the performance of the optimal traffic allocation formulation. Summarize the contributions in Section VI.
2. SYSTEM MODEL AND ASSUMPTIONS

The wireless network of interest can be represented by a directed graph G=(N,). the vertex set represents the network nodes, and an ordered pair ( i , j ) of nodes is in the edge set if and only if node j can receive packets directly from node i. Assume that all communication is unicast over the directed edges in , i.e., each packet transmitted by node i N is intended for a unique node j N with( i , j ) . The maximum achievable data rate, or capacity, of each unicast link ( i , j ) in the absence of jamming is denoted by the predetermined constant rate cij in units of packets per second.3 Each source node in a subset generates data for a single destination node ds N. We assume that each source node constructs multiple routing paths to ds using a route request process similar to those of the DSR or AODV protocols. We let denote the collection of loop-free routing paths for
source , noting that these paths need not be disjoint as in MP-DSR. Representing each path
by a subset of directed link set directed subgraph *
, the subnetwork of interest to source is given by the
(1)
of the graph . Fig. 1 illustrates an example network with sources The subgraph consists of the two routing paths
and the subgraph
consists of the two routing paths
In this paper, we assume that the source nodes
in have no prior knowledge about the
jamming attack being performed. That is, we make no assumption about the jammers goals, method of attack, or mobility patterns. We assume that the number of jammers and their locations are unknown to the network nodes. Instead of relying on direct knowledge of the jammers, we suppose that the network nodes characterize the jamming impact in terms of the empirical packet delivery rate. Network nodes can then relay the relevant information to the source nodes in order to assist in optimal traffic allocation. Each time a new routing path is requested or an existing routing path is updated, the responding nodes along the path will relay the necessary parameters to the source node as part of the reply message for the routing path. Using the information from the routing reply, each source node is thus provided with additional information about the jamming impact on the individual nodes.
3. CHARACTERIZING THE IMPACT OF JAMMING

In this section, we propose techniques for the network nodes to estimate and characterize the impact of jamming and for a source node to incorporate these estimates into its traffic allocation. In order for a source node to incorporate the jamming impact in the traffic allocation problem, the effect of jamming on transmissions over each link be estimated and relayed to must
. However, to capture the jammer mobility and the
dynamic effects of the jamming attack, the local estimate need to be continually updated. We begin with an example to illustrate the possible effects of jammer mobility on the traffic allocation problem and motivate the use of continually updated local estimates.
3.1.Illustrating the Effect of Jammer Mobility on Network Throughput

Asingle-sourcenetwork with three routing paths P1={(s,x),(x,b),(b,d)}, is the
P2={(s,y),(y,b),(b,d)} and P3={(s,z),(z,b),(b,d)}. The label on each edge
link capacity indicating the maximum number of packets per second (pkts/s) that can be transported over the wireless link. In this example, we assume that the source is generating data at a rate of 300 pkts/s. In the absence of jamming, the source can continuously send 100 pkts/s over each of the three paths, yielding a throughput rate equal to the source generation rate of 300 pkts/s. If a jammer near node is transmitting at high power, the probability of successful packet reception, referred to as the packet success rate, over the link drops to nearly zero, and the traffic flow to node
reduces to 200 pkts/s. If the source node becomes aware of this effect, the allocation of traffic can be changed to 150 pkts/s on each of paths and , thus recovering from the jamming attack at node x .However, this one-time reallocation by the source node does not adapt to the potential mobility of the jammer. If the jammer moves to node y ,
the packet success rate over
returns to 1, and that over
drops to zero,
reducing the throughput to node to 150 pkts/s, which is less than the 200 pkts/s that would be achieved using the original allocation
of 100 pkts/s over each of the three paths. Hence, each node must relay an estimate of its packet success rate to the source node , and the source must use this information to reallocate traffic in a timely fashion if the effect of the attack is to be mitigated. The relay of information from the nodes can be done periodically or at the instants when the packet success rates change significantly. These updates must be performed at a rate comparable to the rate of the jammer movement to provide an effective defense against the mobile jamming attack. Next, suppose the jammer continually changes position between nodes x andy , causing the packet success rates over links and to oscillate between
zero and one. This behavior introduces a high degree of variability into the observed packetsuccess rates. However, since the packet success rate over link has historically been more steady, it may be a more reliable option. Hence, the source can choose to fill to its capacity and partition the remaining 100 pkts/s equally over p1 andp2 . This solution takes into account the historic variability in the packet success rates due to jamming mobility. In the following section, we build on this example, providing a set of parameters to be estimated by network nodes and methods for the sources to aggregate this information and characterize the available paths on the basis of expected throughput.
3.2. Estimating Local Packet Success Rates

We let denote the packet success rate over link at timet , noting that
can be computed analytically asa function of the transmitted signal power of node , the signal power of the jammers, their relative distances from node , and the path loss behavior of the wireless medium. In reality, however, the locations of mobile jammers are often unknown, and, hence, the use of such an analytical model is not applicable. Due to the uncertainty in the jamming impact, we model the packet success rate as a random process and allow the network nodes to collect empirical data in order to characterize the process.We suppose that each node maintains an estimate of the packet success rate as well as a variance parameter
to characterize the estimate uncertainty and process variability.4 We propose the use of a recursive update mechanism allowing each node to periodically update the estimate as a function of time. As illustrated in Fig. 3, after each update period of s
we suppose that each node updates theestimate and relays the estimate to each
relevant source node after each updaterelay period
of s. The shorter
update period of s allows each node to characterize the variation in overthe update relay period of s, a key factor in .
We propose the use of the observed packet delivery ratio (PDR) to compute the estimate . While the PDR incorporates additional factors such as congestion, it
has been shown by extensive experimentation that such factors do not affect thePDR in a similar manner. Furthermore, we propose to average the empirical PDR values over time to smooth out the relatively short-term variations due to noise or fading. During the update period represented by the time interval record the number number detection check.5 The PDR over link denoted of packets received over link , each node can and the
of valid packets that pass an error for the update period ,
, is thus equal to the ratio
(2)
This PDR can be used to update the estimate
at the end of the update period. and to include
In order to prevent significant variation in the estimate
memory of the jamming attack history, we suggest using an exponential weighted moving average (EWMA) estimate as to update the estimate as a function of the previous
(3) where is a constant weight indicating the relative preference between current and historic samples. We use a similarEWMAprocess to update the end of each update relay period of variance at the
. Since this variance is intended to capture , we consider the sample
the variation in the packet success rate over the last
variance of the set of packet delivery ratios computed using (1) during the interval as
(4) The estimation variance variance as is thus defined as a function of the previous
(5) Where is a constant weight similar to in (3).The EWMA method is
widely used in sequential estimation processes, including estimation of the round-trip time (RTT) in TCP .We note that the parameters in (3) and in (5) allo w for design
of the degree of historical content included in the parameter estimate updates, and these parameters can themselves be functions example, decreasing the parameter allows the mean of time. For to change more
rapidlywith the PDR due to jammer mobility, and decreasing the parameter allows the variance to give more preference tovariation in the most recent update
relay period over historical variations. We further note that the update
10
period and update relay period between subsequent updates of the parameter estimateshave significant influence on the quality of the estimate. In particular, if the update period is too large, the relayed estimates before the subsequentupdate at and will be outdated
time . Furthermore, if the update period T at each node is too large, the dynamics of the jamming attack may be averaged out over the large number of samples . The update periods T and must thus be short enough
to capturethe dynamics of the jamming attack. However, decreasing the update period between successive updates to the source node necessarily increases the communication overhead of the network. Hence, there exists a tradeoff between performance and overhead in the choice of the update period design of the update relay period . We note that the
depends on assumed path-loss and jammer is not
mobility models. The application-specific tuning of the update relay period further herein.
Using the above-mentioned formulation, each time a new routing path is requested or an existing routing path is updated, the nodes along the path will include the estimates and as part of the reply message. In what follows, we show how the
source node uses these estimates to compute the end-to-end packet success rates over each path.
3.3.Estimating End-to-End Packet Success Rates

Given the packet success rate estimates in a routing path for the links
, the source needs to estimate the effective end-to-end packet
success rate to determine the optimal traffic allocation. Assuming the total time required to transport packets from each source to the corresponding destination is
11
negligible compared to the update relay period
, we drop the time index and address . The
the end-to-end packet success rates in terms of the estimates end-to-end packet success rate for path can be expressed as the product
(6)
which is itself a random variable6 due to the randomness in each denote the expected value of for paths
. We let
denote the covariance of . Due to the computational burden
associated with in-network inferenceof correlation between estimated random variables, welet the source node s assume the packet success rates as mutually
independent, even though they are likely correlated. We maintain this independence assumption throughout this work, yielding a feasible approximation to the complex reality of correlated random variables, and the case of in-network inference of the relevant correlation is left as future work. Under this independence assumption, the mean of given in (6) is equal to the product of estimates as
(7) and the covariance given by is similarly
(8)
In (8),
denotes the exclusive-OR set operator such that an element is in
if
it is in either Aor B but not both. The covariance formula in (8) reflects the fact that the end-to-end packet success rates and of paths and with shared
12
links are correlated even when the rates are independent.We note that the variance of the end-to-end rate can Let denote the be computed using (8) with .
vector of estimated end-to-end packet success rates denote the covariance matrix with provides the
computed using (7), and let
entry computed using (8). The estimate pair
sufficient statistical characterization of the end-to-end packet success rates for source to allocate traffic to the paths in . Furthermore, the off-diagonal elements in .
denote the extent ofmutual overlap between the paths in
4. OPTIMAL JAMMING-AWARE TRAFFIC ALLOCATION
13
In this section, we present an optimization framework forjamming-aware traffic allocation to multiple routing paths in for each source node . We
develop a set of constraintsimposed on traffic allocation solutions, and then formulate autility function for optimal traffic allocation by mapping theproblem to that of portfolio selection in finance. Letting denote the traffic rateallocated to path
by the source node ,the problem of interest is thus for each source to determine theoptimal rate allocation vector subject to network flowcapacity constraints ofthe end-to-end packet success rates
using the available statistics under jamming.
4.1. Traffic Allocation Constraints

In order to define a set of constraints for the multiple-pathtraffic allocation problem, we must consider the source data rateconstraints, the link capacity constraints, and the reduction oftraffic flow due to jamming at intermediate nodes. The trafficrate allocation vector is trivially constrained to the nonnegativeorthant, i.e.,
, as traffic rates are nonnegative. Assuming data generation at source is limited to a maximumdata rate , the rate allocation vector is also constrained as of feasible
. These constraints define the convex space allocation vectors characterizing rate allocation solutionsfor source .
Due to jamming at nodes along the path, the traffic rate ispotentially reduced at each receiving node as packets are lost.Hence, while the initial rate of the path, theresidual traffic rate forwarded by node along the path than . Letting is allocated to maybe less
denote the subpath of fromsource to the intermediate node , , where is
the residual traffic rate forwardedby node i is given by computedusing (6) with replaced by the subpath
.The capacity constraint
on the total traffic traversing a link
thus imposes the stochastic constraint
14
(9) on the feasible allocation vectors . To compensate for the randomnessin the with a and variance
capacity constraint in (9), we replace the residualpacket success rate function of its expected valueand variance. The mean
can be computed using (7) and (8), respectively, with replaced bythe subpath , where . We thus replace in (9) with the statistic
is a constant that can be tuned basedon tolerance denote the and
to delay resulting from capacity violations.7We let
weighted link-path incidence matrixfor source with rows indexed by links columns indexedby paths andcolumn of . The element in row
is thus given by
(10) Letting denote the vector of link capacities for ,
the link capacity constraint in (9) including expectedpacket loss due to jamming can be expressed by thevector inequality
(11) which is a linear constraint in the variabl . We note thatthis statistical constraint
formulation generalizes the standardnetwork flow capacity constraint corresponding to the case of for all in which the incidence matrix
isdeterministic and binary.
15
4.2. Optimal Traffic Allocation Using Portfolio Selection Theory

In order to determine the optimal allocation of traffic to thepaths in chooses a utility function , each source
that evaluates the total data rate, or throughput, . In defining our utility function
successfully deliveredto the destination node
, we present an analogy between traffic allocationto routing paths and allocation of funds to correlated assets infinance. In Markowitzs portfolio selection theory an investoris interested in allocating funds to a set of financial assetsthat have uncertain future performance. The expected performanceof each investment at the time of the initial allocationis expressed in terms of return and risk. The return on the assetcorresponds to the value of the asset and measures the growth ofthe investment. The risk of the asset corresponds to the variancein the value of the asset and measures the degree of variation oruncertainty in the investments growth. We describe the desired analogy by mapping this allocationof funds to financial assets to the allocation of traffic to routingpaths. We relate the expected investment return on the financialportfolio to the estimated end-to-end success rates risk of the portfolio to the estimated success rate covariancematrix and theinvestment .We note that
the correlation between relatedassets in the financial portfolio corresponds to the correlationbetween nondisjoint routing paths. The analogy between financialportfolio selection and the allocation of traffic to routingpaths is summarized in the table at the bottom of the page. As in Markowitzs theory, we define a constant risk-aversionfactor source for
to indicate the preferencefor source to allocate resources to less
risky paths withlower throughput variance. This risk-aversion constant weighsthe tradeoff between expected throughput and estimation variance.We note that each source can choose a different riskaversionfactor, and a source may vary the riskaversion factor with time or for different types of data. For a given traffic
16
rateallocation vector vector inner product
, the expected total throughput for sourceis equal to the . The correspondingvariance in the throughput for source is equal to the quadratic term .
due to the uncertainty inthe estimate
Basedon the above analogy making use of portfolio selection theory,we define the utility function at source as the weightedsum
(12) Setting the risk-aversion factor to zero indicates that thesource is willing to put up with any amount of uncertainty inthe estimate of the end-to-end success rates to
maximize theexpected throughput. The role of the risk-aversion factor is thusto impose a penalty on the objective function proportional to theuncertainty in the estimation process, potentially narrowing thegap between expected throughput and achieved throughput. Thecases of Section V. Combining the utility function in (12) with the set of constraintsdefined in Section IVA yields the following jammingawaretraffic allocation optimization problem that aims to findthe globally optimal traffic allocation over the set of sources: are compared in detail in
(13)
17
Since the use of centralized protocols for source routing maybe undesirable due to excessive communication overhead inlarge-scale wireless networks, we seek a distributed formulationfor the optimal traffic allocation problem in (13).
4.3. Optimal Distributed Traffic Allocation Using NUM

In the distributed formulation of the algorithm, each sourcedetermines its own traffic allocation , ideally with minimalmessage passing between sources. By inspection,
we see thatthe optimal jamming-aware flow allocation problem in (13) issimilar to the NUM formulation of the basic maximum networkflow problem . We thus develop a distributed traffic allocationalgorithm using techniques for NUM. The dual decomposition technique is derived by decouplingthe capacity constraint in (11) and introducing the link pricescorresponding to each link denoe the vector of linkprices , the Lagrangian . Letting of the Lagrangian dual decomposition
optimizationproblem in (13) is given by
(14) The distributed optimization problem is solved iterativelyusing the Lagrangian dual method as follows. For a given setof link prices solves the localoptimization problem at iteration , each source
(15) The link prices are then updated using a gradient descentiteration as
18
(16) Where is a constant step size and is theelement-
wise projection into the nonnegative orthant. In orderto perform the local update in (16), sources must exchange informationabout the result of the local optimization step. Sinceupdating the link prices only exchange the depends only on the expected linkusage, sources must
link usage vectors
to ensure that the link prices are
consistentlyupdated across all sources. The iterative optimization step
can be repeated until the allocation vectors i.e., when
converge8 for allsources witha given
, . This
for all
approach yields the following distributedalgorithm for optimal jamming-aware flow allocation.
Distributed Jamming-Aware Traffic Allocation

Initialize with initial link prices . 1.Each source independently computes
19
(17) 2.Sources exchange the link usage vectors
(18) 3.Each source locally updates link prices as
(19)
4. If
for any
, increment
andgo to Step 1.
Given the centralized optimization problem in (13) and theabove distributed formulation for jamming-aware traffic allocation,a set of sources with estimated parameters networktraffic flow. canproactively compensate for the presence of jamming on
4.4. Computational Complexity

We note that both the centralized optimization problem in(13) and the local optimization step in the distributed algorithmare quadratic programming optimization problems with linearconstraints [14]. The computational time required for solvingthese problems using numerical methods for quadratic programmingis a polynomial function of the number of optimizationvariables and the number of constraints. In the centralized problem, there are optimizationvariles
corresponding to the number of paths availableto each of the sources. The number of constraints in the centralizedproblem is equal to the total number of links
20
corresponding to the number of link capacity constraints. In thedistributed algorithm, each source iteratively solves a local optimizationproblem, leading to decoupled optimization problems.Each of these problems has constraints. Hence, as the number of sources in the
optimization variablesand
networkincreases, the distributed algorithm may be advantageousin terms of total computation time. In what follows, we providea detailed performance evaluation of the methods proposed inthis paper.
5. PERFORMANCE EVALUATION
In this section, we simulate various aspects of the proposedtechniques for estimation of jamming impact andjamming-aware traffic allocation. We first describe the simulationsetup, including descriptions of the assumed modelsfor routing path construction, jammer mobility, packet successrates, and estimate updates. We then simulate the process ofcomputing the estimation statistics for asingle link . Next, we illustrate the effects of the estimationprocess on the
throughput optimization, both in terms ofoptimization objective functions and the resulting simulatedthroughput. Finally, we simulate a small-scale network similarto that in Fig. 2 while varying network and protocol parametersin order to observe performance trends.
5.1. Simulation Setup

The simulation results presented herein are obtained using thefollowing simulation setup. A network of nodes is deployed randomlyover an area, and links are formed between pairs of nodeswithin a fixed communication range. The set nodesis chosen randomly, and the destination node of source
correspondingto each source
21
is randomly chosen from within the connectedcomponent containing Each routing path in the set
is chosen using a randomized geometric routing from theset of
algorithmwhich chooses the next hop toward the destination neighboring nodes that are closer to transmit using fixed power .
in terms of eitherdistance or hop-count. Nodes
We simulate the case of continuous jamming at a fixedpower omnidirectional antennas. The mobility of eachjammer choosing a random direction and a random speed amount of time
using
consists of repeatedly
and movingfor a random
at the chosen directionand speed. At each instant in time, , the fromeach
the packet error rate is afunction of the transmission powers distance from the transmitter to the receiver, and the distances
jammer to the receiver. The packet
error rate is set equalto ratio(SINR) received signal power power constant
, where is the signal-to-interference-plus-noise . The SINR is computed as a functionof the from the transmitter,the received interference from thejammers, and the noise N at the receiver. The
determines the relationship between the SINR and the packeterror characterize thepath loss of the
rate, and the constants
wireless medium. In our simulation study, wechoose parameters based on IEEE 802.15.4 and the CC2420transceiver, and these parameters are summarized in Table I.
22
We are interested in comparing the performance of severalmethods of traffic allocation using the given network and jammingmodels. We define the following cases of interest. Case IIgnoring jamming: Each source chooses the allocationvector standard maximum-flow for alllinks formulationcorresponding using the to
. This case is included in order to
observe the improvementthat can be obtained by incorporating the jammingstatistics.
23
Case IIMaximum throughput: The allocation vectors
are chosen using the .
jamming-aware optimizationproblem in (12) with risk-aversion constant Thiscase incorporates the estimates , updated every s, inthe allocation. Case IIIMinimum risk-return: Similar to Case II with incorporates the estimates and uncertaintyparameters
. This case to balance the mean
throughputwith the estimation variance. Case IVOracle model: Each source continuously optimizesthe allocation vector using the true values of thepacket success rates . This impractical case is
includedin order to illustrate the effect of the estimation process. Our simulations are performed using a packet simulator thatgenerates and allocates packets to paths in a fixed network accordingto the current value of the allocation vector . Eachtrial of the simulation compares several of the above cases using
the same jammer mobility patterns.
24
5.2. Simulation of Estimation Process

We first simulate the process of computing the estimate over a single link with the estimate and the variance
. Fig. 4 shows thetrue packet success rate and theestimation variance for various parameter and a
values. By inspectionof Fig. 4, we see that a shorter update relay period
25
longer update period around the true value of
yield a more consistent estimate
with less variation
. In addition,a smaller value of allows the estimate , while a larger value of smooths
to reflectrapid changes in theestimate relay period
over the sampled PDRs. We similarly see thata shorter update and a longer update period yield a
lower estimation variance coefficient
. In addition, a smallervalue of the EWMA to primarily reflect recent incorporates PDR history to
allows the estimation variance
variations in the sampledPDRs, while a larger value of agreater degree.
5.3. Network Simulation

We next simulate the jamming-aware traffic allocation usingthe estimated parameters as described inSection V-A. To observe the effects of the jamming-awareformulation and the estimation process, we first compare theoptimal expected throughput and the actual achieved throughputfor Cases I, II, and IV in Fig. 5. Fig. 5(a) illustrates the expectedthroughput and throughput variance over
over time, and Fig. 5(b) illustrates the resulting throughput
time. By inspection, we see that all of Cases II, III,and IV consistently outperform Case I, showing the benefit ofincorporating any type of jamming statistics into the allocationproblem. The effect of the estimation error in Case II is seenin the difference between the expected throughput in Fig. 5(a)and the achieved throughput in Fig. 5(b). To observe the effect of the risk-aversion constant ,we next compare the optimal expected throughput and theactual achieved throughput for Case II with thatof Case III to
with in Fig. 5. Fig. 5(c) illustrates the expected throughput overtime, and Fig. 5(d) illustrates the
and throughput variance resulting throughput
over time. By inspection, we see that Case III exhibits a
significantreduction in the throughput variance compared to thatof Case II, resulting in
26
achievable throughput much closer tothe expected throughput. This reduction in variance in Case IIIsometimes comes in trade for a reduction in both expected andachieved throughput compared to that of Case II. However, dueto the higher variance in Case II, Case III can sometimes achievehigher throughput than Case II, for example over the interval375390 s in Fig. 5(d). The most important feature of Case IIIis that the achieved throughput in Fig. 5(d) closely matches theexpected throughput in Fig. 5(c). The choice of in the multipath traffic allocation is similar tothe choice of the riskaversion parameter in financial portfolioselection. As shown, this parameter introduces a tradeoff
between the expected throughput and the associated uncertainty.Hence, the design of this parameter is a problem of interest inmany scenarios, including when timely packet delivery is required(e.g., delivery of control messages) or when packet losses can be tolerated (e.g., streaming video).
27
5.4. Simulation of Parameter Dependence

We next evaluate the effect of varying network and protocolparameters in order to observe the performance trends using thejamming-aware traffic allocation formulation. In particular, weare interested in the effect of the update relay period
28
and themaximum number of routing paths
on the performance ofthe flow
allocation algorithm. In order to compare trials withdifferent update times or numbers of paths, we average the simulatedresults over each simulation run, yielding a single valuefor each trial. In addition to comparing the expected throughputfor various parameter values, we compute the Sharpe ratio,given by the ratio of the expected throughput to the standarddeviation , measuring the
throughput-per-unitriskachievable by the different methods. To ensure that theobserved trends are due to the intended parameter variation, we simulate a simple network topology similar to that givenin Fig. 2. Fig. 6 illustrates the trends in expected throughput,throughput variance, and Sharpe ratio as the update relay period and the number of routing paths increase. Sinceincreased
update times lead to increased variance, as previouslyseen in Fig. 4(d), the Sharpe ratio decreases with increasing .Fig. 6(c) illustrates the improvement in
throughput due to increasedrouting diversity.
29
30
6. CONCLUSION
In this paper, we studied the problem of traffic allocation inmultiple-path routing algorithms in the presence of jammerswhose effect can only be characterized statistically. We havepresented methods for each network node to
probabilisticallycharacterize the local impact of a dynamic jamming attack andfor data sources to incorporate this information into the routingalgorithm. We formulated multiple-path traffic allocation inmultisource networks as a lossy network flow optimizationproblem using an objective function based on portfolio selectiontheory from finance. We showed that this centralizedoptimization problem can be solved using a distributed algorithmbased on decomposition in network utility maximization (NUM).We presented simulation results to illustrate the impactof jamming dynamics and mobility on network throughput andto demonstrate the efficacy of our traffic allocation algorithm.We have thus shown that multiple-path source routing algorithmscan optimize the throughput performance by effectivelyincorporating the empirical jamming impact into the allocationof traffic to the set of paths.
31
7.Future Enhancement
We propose a scheme based on multiple routing paths. The wireless network of interest can be represented by a directed graph. The solution is when a source node S, want to send data to a target node T. It finds all the paths to route the packets from S to T. The packets to be sent from S to T is split and sent across multiple paths. Say there is 100 packets to be sent, how many packets to send in each routing path is to be decided. The logic of how to split the traffic across multiple paths takes into consideration the expected jamming in each path. The algorithm to solve is called as Optimal Jamming aware traffic allocation.
32
33
8.REFERENCES
[1] I. F. Akyildiz, X. Wang, and W. Wang, Wireless mesh networks: Asurvey, Comput. Netw., vol. 47, no. 4, pp. 445487, Mar. 2005. [2] E. M. Sozer, M. Stojanovic, and J. G. Proakis, Underwater acousticnetworks, IEEE J. Ocean. Eng., vol. 25, no. 1, pp. 7283, Jan. 2000. [3] R. Anderson, Security Engineering: A Guide to Building DependableDistributed Systems. New York: Wiley, 2001. [4] J. Bellardo and S. Savage, 802.11 denial-of-service attacks: Real vulnerabilities and practical solutions, in Proc. USENIX Security Symp.,Washington, DC, Aug. 2003, pp. 1528. [5] A. D.Wood and J. A. Stankovic, Denial of service in sensor networks,Computer, vol. 35, no. 10, pp. 5462, Oct. 2002. [6] G. Lin and G. Noubir, On link layer denial of service in data wirelessLANs,WirelessCommun. Mobile Comput., vol. 5, no. 3, pp. 273284,May 2005.
34

Mini Project 2011-'12 Online Voting System

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Mini Project 2011-'12 Online Voting System

Caricato da

Copyright:

Formati disponibili

Mini Project 2011-12

Online Voting System

Department of Computer Science and Engineering.

College of Engineering, Cherthala