Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University.

Slides:

Advertisements

Similar presentations

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.

Advertisements

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.

Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.

Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute,

Good afternoon everyone.

Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,

MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT

Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.

Distributed Algorithms for Secure Multipath Routing

Yashar Ganjali Computer Systems Laboratory Stanford University February 13, 2003 Optimal Routing in the Internet.

Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,

2001 Winter CS215 Course Project Simulation Comparison of Routing Algorithms for Multicast with Bandwidth Reservation Zhihong Duan

Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.

PROXY FOR CONNECTIVITY We consider the k shortest edge disjoint paths between a pair of nodes and define a hyperlink, whose ‘connectivity’ is defined as:

ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Computer Science Department Stony Brook University.

Before start… Earlier work single-path routing in sensor networks

ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.

Yashar Ganjali Joint work with: Abtin Keshavarzian June 4, 2003 Single-Path vs. Multi-Path Routing in Ad Hoc Networks.

Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.

Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.

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.

Path selection Packet scheduling and multipath Sebastian Siikavirta and Antti aalto.

Evaluating the Vulnerability of Network Traffic Using Joint Security and Routing Analysis Patrick Tague, David Slater, and Radha Poovendran Network Security.

Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.

Does Packet Replication Along Multipath Really Help ? Swades DE Chunming QIAO EE Department CSE Department State University of New York at Buffalo Buffalo,

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

Tuning the Carrier Sensing Range of IEEE MAC Jing Deng,Ben Liang and Pramod K. Varshney Univ. of New Orleans Globecom 2004.

1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.

1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore.

High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Baruch Awerbuch, David Holmer, Herbert Rubens Szikszay Fábri Anna, ELTE IK Prog.terv.mat.

College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.

Routing Protocol Evaluation David Holmer

Mar 1, 2004 Multi-path Routing CSE 525 Course Presentation Dhanashri Kelkar Department of Computer Science and Engineering OGI School of Science and Engineering.

Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,

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.

Xiaobing Wu, Guihai Chen

Abtin Keshavarzian Yashar Ganjali Department of Electrical Engineering Stanford University June 5, 2002 Cell Switching vs. Packet Switching EE384Y: Packet.

1 A Multi-Rate Routing Protocol with Connection Entropy for MANETs Cao Trong Hieu, Young Cheol Bang, Jin Ho Kim, Young An Kim, and Choong Seon Hong Presenter:

GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks Qing Fang, Jie Gao, Leonidas J. Guibas, Vin de Silva, Li Zhang Department of Electrical.

SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.

November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.

Centralized Transmission Power Scheduling in Wireless Sensor Networks Qin Wang Computer Depart., U. of Science & Technology Beijing Edward Y. Hua Wireless.

Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.

1 Data Overhead Impact of Multipath Routing for Multicast in Wireless Mesh Networks Yi Zheng, Uyen Trang Nguyen and Hoang Lan Nguyen Department of Computer.

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.

Copyright © 2002 OPNET Technologies, Inc. 1 Random Waypoint Mobility Model Empirical Analysis of the Mobility Factor for the Random Waypoint Model 1542.

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.

Load Balancing of Multipath Source Routing in Ad Hoc Networks Lianfang Zhang, Zenghua Zhao, Yantai Shu, and Lei Wang Department of Computer Science Tianjin.

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

The (k, l) Coredian Tree for Ad-Hoc Networks Department of Communication Systems Engineering, Ben-Gurion University of the Negev, 2008 Vladimir Katz Alex.

Simulation and Exploration of

ECE 544: Traffic engineering (supplement)

Ahmed Helmy Computer and Information Science and Engineering (CISE)

A Scalable Multipath Algorithm in Hierarchical MPLS Networks

Routing in Wireless Ad Hoc Networks by Analogy to Electrostatic Theory

A Probabilistic Routing Protocol for Mobile Ad Hoc Networks

Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.

Department of Computer Science University of York

Routing in Ad Hoc Networks: A Case for Long Hops

Abhinandan Ramaprasath, Anand Srinivasan,

Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks Swades DE Chunming QIAO Hongyi WU EE Dept.

EE384Y: Packet Switch Architectures II

Presentation transcript:

Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University INFOCOM 2004 Load Balancing in Ad Hoc Networks: Single-path Routing vs. Multi-path Routing

INFOCOM 2004Load Balancing in Ad Hoc Networks2 Outline 1. Single-path vs. multi-path routing 2. Comparison Criteria 3. Network model 4. Traffic distribution analysis 4-1. Single-path routing 4-2. Multi-path routing 5. Simulations 6. Optimal number of paths? 7. Conclusion

INFOCOM 2004Load Balancing in Ad Hoc Networks3 Single-path vs. Multi-path s t s t Single-path routing Multi-path routing

INFOCOM 2004Load Balancing in Ad Hoc Networks4 Comparison Criteria Overhead: Route discovery overhead Route maintenance overhead Data transmission overhead Load distribution (throughput)

INFOCOM 2004Load Balancing in Ad Hoc Networks5 Network Model Nodes: Distributed uniformly in a circle of radius one with density  (high) Links: Any two nodes with distance <= T are connected Traffic: Each node sends to any other node in the network with fixed rate

INFOCOM 2004Load Balancing in Ad Hoc Networks6 Problem Statement Find the amount of flow going through a node (load) at distance r from the center.

INFOCOM 2004Load Balancing in Ad Hoc Networks7 Any path starting at a node in S 1 going to a node in S 2 goes through node F. Therefore, the traffic going through node F is proportional to S 1 x S 2. S1S1 S2S2 Load Distribution Analysis: Single-path Routing [P. Pham and S. Perreau, INFOCOM’03] F  dd 

INFOCOM 2004Load Balancing in Ad Hoc Networks8 [Pham and Perreau, INFOCOM’03]: Load is distributed uniformly using multi-path routing. Load Distribution Analysis: Multi-path Routing

INFOCOM 2004Load Balancing in Ad Hoc Networks9 Load Distribution Analysis: New Approach

INFOCOM 2004Load Balancing in Ad Hoc Networks10 Load Distribution Analysis: New Approach

INFOCOM 2004Load Balancing in Ad Hoc Networks11 Load Distribution Analysis Problem: For a given node F in the network find the set of all node pairs (A,B) such that the rectangle defined by A and B contains F. A F B

INFOCOM 2004Load Balancing in Ad Hoc Networks12 Load Distribution Analysis AF w B w

INFOCOM 2004Load Balancing in Ad Hoc Networks13 Load Distribution Analysis A F B=(x,y) d L y=L cos  y=L sin  L =d cos  x=d cos 2  y=d sin  cos  y 2 +(x-d/2) 2 =d 2 /4

INFOCOM 2004Load Balancing in Ad Hoc Networks14 Load Distribution Analysis AF B

INFOCOM 2004Load Balancing in Ad Hoc Networks15 Load Distribution Analysis For a fixed node F, and and a given node A we can find all points B such that the traffic from A to B goes through F. If we sum up for all nodes A we can find the total traffic going through F. F  A r

INFOCOM 2004Load Balancing in Ad Hoc Networks16 How to choose w? It is inversely proportional to . It depends on how nodes are connected. It depends on how paths are chosen: Length metric: hop-count, Euclidian distance. Edge-disjoint vs. node disjoint. It is increased by the number of paths in multi-path routing.

INFOCOM 2004Load Balancing in Ad Hoc Networks17 How to choose w? (cont’d) 1. Keep all parameters fixed. 2. Find w based on simulations for single-path. 3. For k paths use kw.

INFOCOM 2004Load Balancing in Ad Hoc Networks18 Evaluation of the Model

INFOCOM 2004Load Balancing in Ad Hoc Networks19 Evaluation of the Model

INFOCOM 2004Load Balancing in Ad Hoc Networks20 Evaluation of the Model

INFOCOM 2004Load Balancing in Ad Hoc Networks21 Effect of Increasing the Number of Paths in Multi-path routing

INFOCOM 2004Load Balancing in Ad Hoc Networks22 Effect of Increasing the Number of Paths in Multi-path routing

INFOCOM 2004Load Balancing in Ad Hoc Networks23 Summary We introduced a new method for analyzing the traffic in Ad Hoc Networks. Advantages of the new model: Works for both single-path and multi-path Sensitive to the number of paths We showed that increasing the number of paths in multi-path routing does not dramatically affect the load balance in the network. Open problem: What if we route on curves instead of shortest paths?

INFOCOM 2004Load Balancing in Ad Hoc Networks24 Thank you!

INFOCOM 2004Load Balancing in Ad Hoc Networks25 Load Distribution Analysis AF

INFOCOM 2004Load Balancing in Ad Hoc Networks26 Load Distribution Analysis AF

INFOCOM 2004Load Balancing in Ad Hoc Networks27 Load Distribution Analysis AF

INFOCOM 2004Load Balancing in Ad Hoc Networks28 Load Distribution Analysis FA

INFOCOM 2004Load Balancing in Ad Hoc Networks29 Load Distribution Analysis