Security and QoS Self-Optimization in Mobile Ad Hoc Networks ZhengMing Shen and Johnson P. Thomas Presented by: Sharanpal singh.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Mobile Ad-hoc Network Simulator: mobile AntNet R. Hekmat * (CACTUS TermiNet - TU Delft/EWI/NAS) and Radovan Milosevic (MSc student) Mobile Ad-hoc networks.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
BY PAYEL BANDYOPADYAY WHAT AM I GOING TO DEAL ABOUT? WHAT IS AN AD-HOC NETWORK? That doesn't depend on any infrastructure (eg. Access points, routers)
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Page 1 / 14 The Mesh Comparison PLANET’s Layer 3 MAP products v.s. 3 rd ’s Layer 2 Mesh.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Routing Strategies Fixed Routing
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
The Capacity of Wireless Ad Hoc Networks
Secure Data Communication in Mobile Ad Hoc Networks Authors: Panagiotis Papadimitratos and Zygmunt J Haas Presented by Sarah Casey Authors: Panagiotis.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.
Improving Robustness in Distributed Systems Jeremy Russell Software Engineering Honours Project.
QoS Constraint Routing Protocols for Mobile Ad Hoc
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
CEFRIEL Deliverable R4.1.5 MAIS adaptive and reconfigurable modem Giovanni Paltenghi Roma – 24 Novembre 2005.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Ad Hoc Wireless Routing COS 461: Computer Networks
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
IETF-76, Hiroshima, Nov 2009 ROLL Working Group Meeting IETF-76, Nov 2009, Hiroshima Routing Metrics used for Path Calculation in Low Power and Lossy Networks.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
1 Dynamic Adaption of DCF and PCF mode of IEEE WLAN Abhishek Goliya Guided By: Prof. Sridhar Iyer Dr. Leena-Chandran Wadia MTech Dissertation.
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
Adaptive QoS Management for IEEE Future Wireless ISPs 通訊所 鄭筱親 Wireless Networks 10, 413–421, 2004.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Routing Protocol Evaluation David Holmer
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
CCNA 1 Module 10 Routing Fundamentals and Subnets.
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
1 Optical Packet Switching Techniques Walter Picco MS Thesis Defense December 2001 Fabio Neri, Marco Ajmone Marsan Telecommunication Networks Group
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
STUMP: Exploiting Position Diversity in the Staggered TDMA Underwater MAC Protocol Kurtis Kredo II, Petar Djukic, Prasant Mohapatra IEEE INFOCOM 2009.
Introducing a New Concept in Networking Fluid Networking S. Wood Nov Copyright 2006 Modern Systems Research.
Self-stabilizing energy-efficient multicast for MANETs.
A Receiver-Initiated Approach for Channel-Adaptive On-Demand Routing in Ad Hoc Mobile Computing Networks Xiao-Hui Lin, Yu-Kwong Kwok, and Vincent K. N.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Wireless Control of a Multihop Mobile Robot Squad UoC Lab. 임 희 성.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
A comparison of Ad-Hoc Routing Protocols
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Yiannis Andreopoulos et al. IEEE JSAC’06 November 2006
Presentation transcript:

Security and QoS Self-Optimization in Mobile Ad Hoc Networks ZhengMing Shen and Johnson P. Thomas Presented by: Sharanpal singh

Introduction Tradition: Network quality of service (QoS) and network security have been considered as separate entities. Truth: Security impacts the overall network QoS. – Overheads for authentication – Overheads caused by encryption In all the previous work, the security feature is fixed and permanent. – What when the resources availability changes??

Proposal Three basic frameworks: 1. Plug-in security framework provides a dynamic security policy management system. 2. Multilayer QoS-guided routing mechanism is an adaptable QoS routing mechanism for ad hoc networks to ensure QoS even as network resources change. 3. Proportional, integral, derivative (PID) feedback controller constantly monitors and adjusts the network security policy to ensure that the network satisfies all existing QoS requirements while making the network the most secure possible  Algorithm will remove some security policy to reduce overhead until the QoS requirements can be satisfied.  Similarly, if more resources are available due to reduced traffic, the security level can be increased

FEEDBACK CONTROL THEORY Transfer Function of PID e- tracking error R- the difference between the desired input value, and (Y) the actual output The controller computes both the derivative and the integral of this error signal resulting in:

Effects of Controllers Effects of each of the controllers on a closed-loop system If a modeling equation of a system is: Taking the Laplace transform: The transfer function between the displacement X(s) and the input F(s) then becomes:

Contd… Proportional Control: The closed-loop transfer function of the system with a proportional controller is: Proportional-Integral (PI) Control: The closed-loop transfer function: Proportional, Integral, Derivative Control: The closed-loop transfer function:

Security and QoS Feedback control Loop A distributed optimization architecture present at each node in the network. The QoS plant is responsible for creating new paths as well as managing the state information of any existing path and the state information of each node. It outputs the QoS path state information to the PID controller The security plant is responsible for managing, adding, and removing security policies. It outputs the security policy state information to the PID controller. The PID controller module takes the network resource usage metrics (path latency, path throughput, and path stability), the state information of the node (buffer space available, for example), and the security policy state information as system output feedback to calculate the adjustments, which will be fed into the QoS plant and security plant to achieve optimization. The PID controller at each node collects two levels of state information, the node’s local state and the global path state

Multilayer QoS Interface Guided Routing Application Layer: classifies the QoS requirements into a set of three QoS priority levels – Guaranteed service corresponds to applications that have strong delay constraints such as voice. – Controlled load service applications requiring high throughput such as video. – Best effort service has no specific constraints. Network Layer: having following metrics: – Hop count represents the number of hops required for a packet to reach its destination. – Buffer state stands for the available unallocated buffer. – Stability means the connectivity variance of a node with respect to its neighboring nodes over time. MAC Layer: MAC layer metric is the quality of a link as specified by the line signal to interference plus noise ratio (SINR) – SINR determines the data rate and associated probability of packet error rate or bit error rate (BER) that can be supported by the link

QoS Routing Process QoS interface metrics guide the routing process in following steps: Path generation:- This generates paths according to the assembled and distributed state information of the network and application. Path selection:- This selects appropriate paths based on the network and application state information. Data forwarding:- This forwards user traffic along the selected path.

Path Generation Measure the quality of network and use it in the path generation process. A node broadcasts its network layer metrics to its neighbors, indicating its presence and its QoS state. Hop count (Resource conservation) Buffer level (Load balancing) – Node maintains average buffer level instead of instantaneous. Stability level metric is used to avoid unstable nodes to relay packets. We calculate the stability S of a node n as: Where, Nti and Nti+1 are neighbor nodes on n at time ti and ti+1 Highly Stable if, Nti = Nti+1 Unstable if, Nti  Nti+1 = 

Path Generation Network layer metrics are propagated through the nodes of the generated path. Suppose P is a path between source node s and destination node d, in which P is a sequence of nodes, P = {s, n1, n2,... ni,d}. The value of the metrics of P are: Where, P.hop is the path hop count P.buffer is the path unallocated (free) buffer size P.stability is the path stability level n.buffer is the node unallocated (free) buffer size n.stability is the node stability level At the MAC layer, the quality of network is identified by the SINR Greedy algorithm will always try to choose the highest SINR nodes available to generate the path unless the node buffer is full regardless of QoS requirements

Path Selection The network layer metrics are mapped into each QoS metric and the MAC layer metrics are mapped into each network metric. If guaranteed service is required, the network layer QoS interface will translate this requirement into the network QoS metric, which should select a path that has minimum delay based on the average buffer level and hop count. Packet latency is calculated as: Where, P.hop is the path hop count, P.bufferSize is the path total buffer size, P.buffer is the path unallocated (free) buffer size, P.throughput is the path throughput. If the controlled load service is required, the network QoS interface needs to pick the highest buffer size path in this case to meet the application layer QoS requirements. So, Controlled load service defines the minimum throughput required by the application: Best effort service has no specific constraints. The network QoS interface will select the most stable path when the network mobility is high and the shortest path when the network mobility is low.

QoS Interface A QoS interface translates high-layer QoS metrics to lower layer metrics For guaranteed service, the AN interface translates the QoS requirements to the maximum path latency and passes to the network layer as application layer QoS requirements. During the path selection process, network layer will choose the qualified path by using the calculations defined in the last slide and using the network layer metrics as an input parameter Similarly, for controlled load service, the AN interface translates the QoS requirements to the minimum path throughput and pass to the network layer. Network layer will choose the qualified path by calculating the path buffer level and hop count. For best effort service, the AN interface compromises between the most stable path in the high-mobility case and the shortest path in the low-mobility path case

Performance Analysis Our multilayer QoS interface guided routing protocol is implemented based on existing QoS-AODV and AODV For simulations, all protocols maintain a send buffer of 64 packets. Interface queue has size of 50 packets with priority Routing packet > Security pkt < Data pkt. 10 communications in the network with each one randomly assigned a class (guaranteed, control load or best effort) The number of source-destination pairs and the packet sending rate in each pair is varied to change the offered load in the network. 1,500 m 300 m field with 50 nodes with a randomly chosen speed (mobility between 0-20 m/s) Simulation period is 900 seconds.

Simulation Results Throughput drops roughly by 15 percent and avg packet delay increases by 50% at v=10 m/s compared with v=5 m/s.

Security Plug-in Architecture Policy-based plug-in architecture to provide dynamic security policy management at runtime.

Optimization Algorithm Each communication path determines if there are extra resources available to support more security policies until the resource target utilization is reached. As long as the network does not reach its target resource utilization, the policy manager will continue deploying new security policies into the network. In reality target utilization is impossible to reach due to mobility, so acceptable resource utilization is introduced which is defined as: The target resource utilization is calculated by the PID controller and the acceptable resource utilization is driven by the greedy algorithm.

Policy Deployment Post Validation If there is any path that is not able to satisfy the original QoS requirements, this is due to the previous deployed security policy causing the network to use up more resources. The domain policy manager will remove the previous deployed security policy and log all the suffering paths. The greedy algorithm will not be called until at least one of the suffering paths changes state (for example, finish communication, change QoS requirement, etc.)

Performance Analysis We compare proposed PID-AODV model with AODV, Policy based Secure AODV (PS- AODV) and QoS-AODV.

Conclusion  Due to overheads caused by implementing security in ad hoc networks, security and QoS must be considered together.  Proposed a distributed flexible mechanism to optimize security and QoS in mobile ad hoc networks  The best case scenario is under light traffic, where it can provide the same security as any other secure protocol but the same performance as nonsecure QoS protocols.  The worst case scenario is under extreme heavy traffic, where it provides similar performance as QoS protocols but with no security