© Manasa Resilience of Flooding Protocol – A Case Study EECS 801 Graduate Reading © 2008–Manasa K Aug 14 2008 Manasa K Department of Electrical Engineering.

Slides:



Advertisements
Similar presentations
Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
Advertisements

EPIDEMIC DENSITY ADAPTIVE DATA DISSEMINATION EXPLOITING OPPOSITE LANE IN VANETS Irem Nizamoglu Computer Science & Engineering.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Real Time Flow Handoff in Ad Hoc Wireless Networks using Mobility Prediction William Su Mario Gerla Comp Science Dept, UCLA.
An Adaptive Coordinated Medium Access Control for Wireless Sensor Networks Jing Ai, Jingfei Kong, Damla Turgut Networking and Mobile Computing (NetMoC)
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
© Manasa Quantifying Metrics for Resilient and Survivable Networks EECS 801 Graduate Reading © 2008–Manasa K 6 June 2008 Manasa K Department of Electrical.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
QoS Constraint Routing Protocols for Mobile Ad Hoc
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Does Packet Replication Along Multipath Really Help ? Swades DE Chunming QIAO EE Department CSE Department State University of New York at Buffalo Buffalo,
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
Department of Computer Science
Analysis of the Impact and Interactions of Protocol and Environmental Parameters on Overall MANET Performance Michael W. Totaro and Dmitri D. Perkins Center.
Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.
Multicast Algorithms for Multi- Channel Wireless Mesh Networks Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt Mutka Department of Computer Science and.
A Dedicated Multi-channel MAC Protocol Design for VANET with Adaptive Broadcasting Ning Lu 1, Yusheng Ji 2, Fuqiang Liu 1, and Xinhong Wang 1 1 Dept. of.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
A Power Saving MAC Protocol for Wireless Networks Technical Report July 2002 Eun-Sun Jung Texas A&M University, College Station Nitin H. Vaidya University.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
Track-based Hybrid Service Discovery in Mobile Ad-hoc Networks Zhuoqun Li, Lingfen Sun and Emmanuel C. Ifeachor School of Computing, Communications and.
An Energy Efficient MAC Protocol for Wireless LANs Eun-Sun Jung Nitin H. Vaidya IEEE INFCOM 2002 Speaker :王智敏 研二.
/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.
Hop State Prediction Method using Distance Differential of RSSI on VANET 指導教授:許子衡 教授 學 生:董藝興 學生 1.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
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.
Wireless communications and mobile computing conference, p.p , July 2011.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Mohamed Elhawary Computer Science Department Cornell University PERCOM 2008 Zygmunt J. Haas Electrical and Computer Engineering Department Cornell University.
Designing Reliable Delivery for Mobile Ad-hoc Networks in Robots BJ Tiemessen Advisor: Dr. Dan Massey Department of Computer Science Colorado State University.
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling Olaf Landsiedel 1, Euhanna Ghadimi 2, Simon Duquennoy 3, Mikael Johansson 2 1 Chalmers University.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
Sanjay K. Dhurandher, Mohammad S. Obaidat, Fellow of IEEE and Fellow of SCS, Siddharth Goel and Abhishek Gupta CAITFS, Division of Information Technology,
Kun-chan Lan and Chien-Ming Chou National Cheng Kung University
A Multi-Channel CSMA MAC Protocol with Receiver Based Channel Selection for Multihop Wireless Networks Nitin Jain, Samir R. Das Department of Electrical.
Sharp Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
A Deafness Free MAC Protocol for Ad Hoc Networks Using Directional Antennas Jia Feng, Pinyi Ren, and Shuangcheng Yan Department of Electronic Engineering.
A Cluster Based On-demand Multi- Channel MAC Protocol for Wireless Multimedia Sensor Network Cheng Li1, Pu Wang1, Hsiao-Hwa Chen2, and Mohsen Guizani3.
On Mitigating the Broadcast Storm Problem with Directional Antennas Sheng-Shih Wang July 14, 2003 Chunyu Hu, Yifei Hong, and Jennifer Hou Dept. of Electrical.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
Performance Improvement in Ad hoc Wireless Networks with Consideration to Packet Duplication Takayuki Yamamoto Department of Informatics and Mathematical.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
2005/12/14 1 Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science.
Denial of Service Resilience in Ad Hoc Networks (MobiCom 2004) Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly November 21 th, 2006 Jinkyu Lee.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
Cognitive Link Layer for Wireless Local Area Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Header Store & Haul Improving Mobile Ad-Hoc Network Connectivity through Repeated Controlled Flooding Thesis Presentation Robert Tyson Thedinger Department.
Presentation transcript:

© Manasa Resilience of Flooding Protocol – A Case Study EECS 801 Graduate Reading © 2008–Manasa K Aug Manasa K Department of Electrical Engineering & Computer Science EECS 801

© Manasa 2 Resilience of Flooding Protocol – A Case Study Abstract Network state can be characterized by operational metrics and service parameters. Metrics include degree of connectivity(density), bandwidth, load factor etc. Service parameters include delay, jitter, goodput etc. In this paper, a case study on Resilinets controlled flooding was done to understand its transition as it degrades from optimal performance. Under the affect of different operational metrics namely load factor, density, mobility.

© Manasa 14 August 2008Resilience of Controlled Flooding 3 Resilience of Flooding Protocol – A Case Study Outline Introduction and Motivation Case Study of Controlled Flooding Proposed Evaluation Framework Simulation Setup Conclusion and Future Work Reference

© Manasa 14 August 2008Resilience of Controlled Flooding 4 Resilience of Flooding Protocol – A Case Study Introduction and Motivation Introduction and Motivation Case Study of Controlled Flooding Proposed Evaluation Framework Simulation Setup Conclusion and Future Work Reference

© Manasa 14 August 2008Resilience of Controlled Flooding 5 Resilience of Flooding Protocol – A Case Study Introduction and Motivation Flooding is most commonly used to compare other protocol. This is the simplest broadcast routing algorithm. But how well does flooding algorithm perform –the approach taken in this paper is to understand “controlled flooding” where each node floods the n/w with a duplicate packet only once, thus overriding “broadcast storm” As of today, we do not see many documented study of extensive performance on flooding algorithm

© Manasa 14 August 2008Resilience of Controlled Flooding 6 Resilience of Flooding Protocol – A Case Study Case Study of Controlled Flooding Introduction and Motivation Case Study of Controlled Flooding Proposed Evaluation Framework Simulation Setup Conclusion and Future Work Reference

© Manasa 14 August 2008Resilience of Controlled Flooding 7 Resilience of Flooding Protocol – A Case Study Case Study of Controlled Flooding The controlled flooding protocol was designed using existing ns-2 source code. Here each node sends duplicate packets the network only once. This is done by storing in memory, the status of each packet at each node. If the node had earlier received the packet it then just drops it else forwards the packet i.e. duplicates/floods the network once. Thus if there are n nodes in the network, we will have network rate to be n times the traffic source rate

© Manasa 14 August 2008Resilience of Controlled Flooding 8 Resilience of Flooding Protocol – A Case Study Proposed Evaluation Framework Introduction and Motivation Case Study of Controlled Flooding Proposed Evaluation Framework Simulation Setup Conclusion and Future Work Reference

© Manasa 14 August 2008Resilience of Controlled Flooding 9 Resilience of Flooding Protocol – A Case Study Proposed Evaluation Framework The Operational Metrics are defined as below – Load Factor = (rate*num_sources)/Bandwidth – Density = (∏*range*range*Num_Nodes)/(X*Y) – Mobility = [0,0], [10,20] (pause time = 0 sec) rate = source rate (Mbps) range = Transmission range (m) Bandwidth = 12 Mbps X, Y = Simulation region

© Manasa 14 August 2008Resilience of Controlled Flooding 10 Resilience of Flooding Protocol – A Case Study Simulation Set-up Introduction and Motivation Case Study of Controlled Flooding Proposed Evaluation Framework Simulation Set-up Conclusion and Future Work Reference

© Manasa 14 August 2008Resilience of Controlled Flooding 11 Resilience of Flooding Protocol – A Case Study Simulation Set-up Network Topology – Simulation Region by 1000 – Routing Protocol – Resilinets_Flooding – Mac Type – – Mobility – RandomWayPoint – Number of Nodes – 30 – Number of Traffic Sources – 10 Traffic Setup –CBR/UDP –Rate (Mbps) - (Packet Rate)*(Packet Size)*Bytes –Packet Interval - 1/(Packet Rate) –Packet Size Bytes –Rate per Node -.04,.08,.12,.2,.4, 1, 2 and 12 Mbps –Net Source Rate with 10 sources -.4,.8, 1.2, 2, 4, 10, 20 and 120 Mbps

© Manasa 14 August 2008Resilience of Controlled Flooding 12 Throughput Efficiency [Fig 1] No Mobility throughput efficiency wrt aggrgate src rate [Fig 1.1] With Mobility throughput efficiency wrt aggrgate src rate

© Manasa 14 August 2008Resilience of Controlled Flooding 13 Throughput Efficiency wrt Node Partition [Fig 2] No Mobility Throughput Efficiency wrt Node Partition [Fig 2.2] With Mobility Throughput Efficiency wrt Node Partition

© Manasa 14 August 2008Resilience of Controlled Flooding 14 End – End Delay wrt node partition [Fig 3] No mobility end-end delay wrt node partition [Fig 3.1] With Mobility End-End delay wrt Node Partition

© Manasa 14 August 2008Resilience of Controlled Flooding 15 Resilience of Flooding Protocol – A Case Study Conclusion Introduction and Motivation Case Study of Controlled Flooding Proposed Evaluation Framework Simulation Set-up Conclusion and Future Work Reference

© Manasa 14 August 2008Resilience of Controlled Flooding 16 Resilience of Flooding Protocol – A Case Study Conclusion We have understood the behavior of the controlled flooding protocol, against operation metrics being the density, load factor and mobility. And we see how the protocol transitions from optimal performance and degrades when over flooded and sparsely networked

© Manasa 14 August 2008Resilience of Controlled Flooding 17 Resilience of Flooding Protocol – A Case Study Reference Introduction and Motivation Case Study of Controlled Flooding Proposed Evaluation Framework Simulation Set-up Conclusion and Future Work Reference

© Manasa 14 August 2008Resilience of Controlled Flooding 18 Resilience of Flooding Protocol – A Case Study Reference [1] Poster: Towards Quantifying Metrics For Resilient and Survivable Networks ihttps://wiki.ittc.ku.edu/resilinets_wiki/index.php/Metrics_and_Modelling

© Manasa 14 August 2008Resilience of Controlled Flooding 19 Resilience of Flooding Protocol – A Case Study Acknowledgements James Sterbenz K.U. Professor –Comments and suggestions Abdul Jabber

© Manasa 14 August 2008Resilience of Controlled Flooding 20 Questions ?