SEMINAR REPORT

On
Jamming-Aware Traffic Allocation for MultiplePath Routing Using Portfolio Selection
Submitted by

Suhara Jabeen (Reg. No: 12113663)

Under the guidance of Mr. Lomin Joy

In partial fulfillment of the requirements for the award of the degree of Bachelor of Technology in Computer Science & Engineering of Cochin University Of Science And Technology

September 2013 Department of Computer Science and Engineering College of Engineering, Pallippuram P O, Cherthala, Alappuzha Pin: 688541, Phone: 0478 2553416, Fax: 0478 2552714 www.cectl.ac.in

COLLEGE OF ENGINEERING, CHERTHALA

COLLEGE OF ENGINEERING, CHERTHALA

(Under IHRD)

ALAPPUZHA DISTRICT, KERALA

(Affiliated to Cochin University of Science and Technology)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CERTIFICATE
This is to certify that the Seminar report entitled JAMMING AN AWARE OF MULTIPATH ROUTING USING PORTFOLIO SELECTION is a bona fide record of the work done by SUHARA JABEEN (Reg. No:12113663 ) at College of Engineering, Cherthala submitted in partial fulfilment for the requirements of the award of the Degree of Bachelor of Technology (B.Tech) in COMPUTER SCIENCE AND ENGINEERING by Cochin University of Science and Technology during the academic year 2013-14.

Mr. Lomin Joy

Seminar Guide Asst. Professor Dept. of CSE

Mr. Muhammed Ilyas H

Seminar Coordinator Asst. Professor Dept. of CSE

Dr. Manilal D L
Head of the Dept. Associate Professor Dept. of CSE.

ACKNOWLEDGEMENT

I take this opportunity to express our sincere gratitude to the people who have been instrumental in the successful completion of my seminar. For every endeavor in our life, the help of the Lord has always followed. I have yet again experienced his loving kindness while preparing for this seminar. I would like to thank Dr. P. Sureshkumar, The Principal, who has provided with the best facilities and atmosphere for the seminar completion and presentation. I would also like to thank HOD Mr. Manilal D.L. and project guide Mr. Lomin Joy for the help extended and also for the encouragement and support given to me while doing the seminar. I would like to thank my dear friends for extending their co-operation and encouragement throughout the seminar work, without which I would never have completed the seminar this well. Thank you all for your love and also for being very understanding.

ii

ABSTRACT
Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. The paper considers the problem of jammingaware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes and formulates this traffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics. In multisource networks, this centralized optimization problem can be solved using a distributed algorithm based on composition in network utility maximization (NUM) and demonstrate the networks ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, simulate the achievable throughput using our proposed traffic allocation method in several scenarios.

iii

1.

TABLE OF CONTENTS
List of Figures.................... IV List of Tables....... V 1. 2. Introduction.. 6 System Model And Assumptions.8

3. Characterizing The Impact Of Jamming ........10

3.1. 3.2. 3.3.

4.

Illustrating The Effect Of Jamming On Ntw Throughput10 Estimating Local Packet Success Rates..12 Estimating End-To-End Packet Success Rate....15

Optimal Jamming-Aware Traffic allocation... 17

4.1. 4.2. 4.3. 4.4.

5.

Traffic Allocation Constraints....17 Optimal Traffic Allocation Using P S Theory....18 Optimal Distributed Traffic Allocation Using Num...20 Computational Complexity.................................23

Performance Evaluation.....24

5.1. 5.2. 5.3. 5.4.

6. 7. 8.

Simulation Setup.....24 Simulation Of Estimation Process..25 Network Simulation....26 Simulation Of Parameter Dependence...28

Future Enhancement..30 Conclusion ..31 References....32

iv

LIST OF FIGURES
1. Figure 2.1 : Example network with sources S={r, s}. ...08

2. Figure 3.1.1 : Example network that illustrates a single-source network with three routing paths. .....11 3. Figure 3.2.1 : Estimation update process for a single link....12 4. Figure 5.3.1 : In (a) and (b), Cases I, II, and IV are compared. In (c) and (d), Case II is similarly compared to Case III27 5. Figure 5.4.1 :Expected throughput is computed for Cases I, II, and II with varying update relay period.29

LIST OF TABLES
Table 4.3.1 Relation between portfolio and traffic allocation..22