Smart Networks Project UC Berkeley / Cisco May 27, 2003.

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 9 Fundamentals.
Advertisements

The Selective Intermediate Nodes Scheme for Ad Hoc On-Demand Routing Protocols Yunjung Yi, Mario gerla and Taek Jin Kwon ICC 2002.
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
TTDD: A Two-tier Data Dissemination Model for Large- scale Wireless Sensor Networks Haiyun Luo Fan Ye, Jerry Cheng Songwu Lu, Lixia Zhang UCLA CS Dept.
QoS Routing using Clustering with Interference Considerations Admission Control Motivation Simulation  We study QoS Routing using clustering with interference.
A Practical Approach to QoS Routing for Wireless Networks Teresa Tung, Zhanfeng Jia, Jean Walrand WiOpt 2005—Riva Del Garda.
Interference Considerations for QoS in MANETs Rajarshi Gupta, John Musacchio, Jean Walrand {guptar, musacchj, University of California,
UCB Tools for Smart Networks Jean Walrand BITS (Berkeley Information Technology & Systems) U.C. Berkeley
Breaking the Single-Path Barrier Brad Smith Jack Baskin SoE Research Review Day 10/20/2011.
WiFlex: Flexible MAC protocols for Configurable Radios Jean Walrand and Wilson So EECS, UC Berkeley NSF Wireless Networking PI Meeting 10/14/2004.
Comparing flow-oblivious and flow-aware adaptive routing Sara Oueslati and Jim Roberts France Telecom R&D CISS 2006 Princeton March 2006.
ASWP – Ad-hoc Routing with Interference Consideration Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya Department of EECS University of California,
How Much? For What? Thoughts on Economic Issues in Networks Jean Walrand U.C. Berkeley Thoughts on Economic Issues in Networks Jean Walrand U.C. Berkeley.
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
4/17/2017 UCSC: MIT: Stanford University: UC Berkeley: UCLA: UIUC:
UCB Tools for Smart Networks Jean Walrand BITS (Berkeley Information Technology & Systems) U.C. Berkeley
Quality of Service for Flows in Ad-Hoc Networks SmartNets Research Group Dept of EECS, UC Berkeley NMS PI Meeting, Nov 2004.
1 Smart Networks Project Overview Cisco: – David Jaffe, Karl Auerbach, Anna Charny Berkeley: – Venkat Anantharam, David Tse, Pravin Varaiya, Jean Walrand.
UCB Communication Networks: Big Picture Jean Walrand U.C. Berkeley
Smart Networks Project University of California, Berkeley DARPA NMS PI Meeting Miami, Jan 21-23, 2004.
Interference-aware QoS Routing (IQRouting) for Ad-Hoc Networks Rajarshi Gupta, Zhanfeng Jia, Teresa Tung, and Jean Walrand Dept of EECS, UC Berkeley Globecom.
Focus on Distributed Hash Tables Distributed hash tables (DHT) provide resource locating and routing in peer-to-peer networks –But, more than object locating.
Analysis of RIP, OSPF, and EIGRP Routing Protocols using OPNET Group 5: Kiavash Mirzahossein Michael Nguyen Sarah Elmasry
HARP-Hybrid Ad Hoc Routing Protocol Navid NIKAEIN Christian BONNET Neda NIKAEIN © 2001 Navid Nikaein Eurecom Institute.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Hamida SEBA - ICPS06 June 26 th -29 th Lyon France 1 ARMP: an Adaptive Routing Protocol for MANETs Hamida SEBA PRISMa Lab. – G2Ap team
Architecture and Algorithms for an IEEE based Multi-channel Wireless Mesh Network Ashish Raniwala, Tzi-cker Chiueh Stony Brook University Infocom2005.
A Distributed Framework for Correlated Data Gathering in Sensor Networks Kevin Yuen, Ben Liang, Baochun Li IEEE Transactions on Vehicular Technology 2008.
IDRM: Inter-Domain Routing Protocol for Mobile Ad Hoc Networks C.-K. Chau, J. Crowcroft, K.-W. Lee, S. H.Y. Wong.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
ROUTING ALGORITHMS IN AD HOC NETWORKS
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
Maulana Azad National Institute of Technology Bhopal (MP) AD-HOC NETWORKS Submitted By: Pradeep Ahirwar M Tech (CSE)
The University of Bolton School of Games Computing & Creative Technologies LCT2516 Network Architecture CCNA Exploration LAN Switching and Wireless Chapter.
Tufts University. EE194-WIR Wireless Sensor Networks. April 21, 2005 Increased QoS through a Degraded Channel using a Diverse, Cross-Layered Protocol Elliot.
RELAX : An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks Bashir Yahya, Jalel Ben-Othman University of Versailles, France ICC.
1 A Distributed Architecture for Multimedia in Dynamic Wireless Networks By UCLA C.R. Lin and M. Gerla IEEE GLOBECOM'95.
Multipath Routing in Wireless Mesh Networks Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on Author: Nagesh S. Nandiraju,
Architectures and Algorithms for Future Wireless Local Area Networks  1 Chapter Architectures and Algorithms for Future Wireless Local Area.
A Method for Distributed Computation of Semi-Optimal Multicast Tree in MANET Eiichi Takashima, Yoshihiro Murata, Naoki Shibata*, Keiichi Yasumoto, and.
Virtual Wire for Managing Virtual Dynamic Backbone in Wireless Ad Hoc Networks Bo Ryu, Jason Erickson, Jim Smallcomb ACM MOBICOM 1999.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 LAN Design LAN Switching and Wireless – Chapter 1.
LAN Switching and Wireless – Chapter 1
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 LAN Design LAN Switching and Wireless – Chapter 1.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
INSIGNIA : A QOS ARCHITECTURAL FRAMEWORK FOR MANETS Course:-Software Architecture & Design Team Members 1.Sameer Agrawal 2.Vivek Shankar Ram.R.
Francine Lalooses David Lancia Arkadiusz Slanda Donald Traboini
Ching-Ju Lin Institute of Networking and Multimedia NTU
Evaluation of ad hoc routing over a channel switching MAC protocol Ethan Phelps-Goodman Lillie Kittredge.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
/ Fast Web Content Delivery An Introduction to Related Techniques by Paper Survey B Li, Chien-chang R Sung, Chih-kuei.
A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks Bahador Bakhshi and Siavash Khorsandi WCNC 2008.
Uplink scheduling in LTE Presented by Eng. Hany El-Ghaish Under supervision of Prof. Amany Sarhan Dr. Nada Elshnawy Presented by Eng. Hany El-Ghaish Under.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
ProbeCast: MANET Admission Control via Probing Soon Y. Oh, Gustavo Marfia, and Mario Gerla Dept. of Computer Science, UCLA Los Angeles, CA 90095, USA {soonoh,
Architecture and Algorithms for an IEEE 802
Outline Introduction Routing in Mobile Ad Hoc Networks
Multi-channel, multi-radio wireless networks
LAN Switching and Wireless – Chapter 1
Parallel Programming in C with MPI and OpenMP
Distributed Channel Assignment in Multi-Radio Mesh Networks
LAN Switching and Wireless – Chapter 1
Hemant Kr Rath1, Anirudha Sahoo2, Abhay Karandikar1
Multi-channel, multi-radio
EEL 6935 Wireless Ad Hoc Networks
LAN Switching and Wireless – Chapter 1
Presentation transcript:

Smart Networks Project UC Berkeley / Cisco May 27, 2003

UCB - Smart Networks Project2 May 27, 2003 Team CISCO  David Jaffe UCB  Venkat Anantharam  David Tse  Pravin Varaiya  Jean Walrand COLLABORATION WITH  UIUC (J. Hou)  Georgia Tech (R. Fujimoto)  UCLA (R. Bagrodia)  Eric Chi  Antonios Dimakis  Linhai He  Bill Hodge  Zhanfeng Jia  John Musacchio  Jun Shu  Wilson So  Teresa Tung  Undergraduate Students

UCB - Smart Networks Project3 May 27, 2003 Outline Goals Approach Illustrations  Routing  Clustering  Channel Allocation Contributions Future Work

UCB - Smart Networks Project4 May 27, 2003 Goals Scalable & Robust QoS Routing in MANET Scalable: Hundreds of Nodes Robust: Fast rerouting as network changes QoS: Urgent Messages (CFF), Urgent Flows (Voice), Expedited Flows (Video Streams), BE Video Voice Video

UCB - Smart Networks Project5 May 27, 2003 Approach Hierarchical: for scalability Routing: two levels Clustering: randomized algorithm Channel allocation: simulated annealing

UCB - Smart Networks Project6 May 27, 2003 Approach Hierarchical

UCB - Smart Networks Project7 May 27, 2003 Approach Dynamic Clustering Gateways

UCB - Smart Networks Project8 May 27, 2003 Benefits of Clustering Decomposes problem Simplifies tables Limit change announcements Reduces control messages Acceptable sub-optimality

UCB - Smart Networks Project9 May 27, 2003 Approach: Routing Decomposition Decomposed into intra-cluster and inter-cluster Source Dest

UCB - Smart Networks Project10 May 27, 2003 Approach: Dynamic Clustering Distributed randomized algorithm Limits cut-sets Targets a cluster size

UCB - Smart Networks Project11 May 27, 2003 Approach: Channel Allocation Objective: Maximize capacity while maintaining connectivity Approach: Simulated annealing

UCB - Smart Networks Project12 May 27, 2003 Illustration: Routing Routing  Hierarchical link-state routing protocol  Dynamic load balancing  Considers wireless channel sharing effects  More in the demo …

UCB - Smart Networks Project13 May 27, 2003

UCB - Smart Networks Project14 May 27, 2003

UCB - Smart Networks Project15 May 27, 2003

UCB - Smart Networks Project16 May 27, 2003 Illustration: Clustering Clustering  An example with 100 nodes

UCB - Smart Networks Project17 May 27, : node w/ longer range radio. : node w/ shorter range radio : gateway nodes of a cluster 50km Clusters Shorter range radio: 3.5km

UCB - Smart Networks Project18 May 27, 2003

UCB - Smart Networks Project19 May 27, 2003

UCB - Smart Networks Project20 May 27, 2003

UCB - Smart Networks Project21 May 27, 2003

UCB - Smart Networks Project22 May 27, 2003

UCB - Smart Networks Project23 May 27, 2003

UCB - Smart Networks Project24 May 27, 2003

UCB - Smart Networks Project25 May 27, 2003

UCB - Smart Networks Project26 May 27, 2003

UCB - Smart Networks Project27 May 27, 2003

UCB - Smart Networks Project28 May 27, 2003 Illustration: Channel Allocation Channel Allocation  Example 1: Single cluster; each node has 1 radio.  Example 2: 4 clusters; gateways have 2 radios, others have 1.  More in the demo …

UCB - Smart Networks Project29 May 27, 2003

UCB - Smart Networks Project30 May 27, 2003

UCB - Smart Networks Project31 May 27, 2003

UCB - Smart Networks Project32 May 27, 2003

UCB - Smart Networks Project33 May 27, 2003

UCB - Smart Networks Project34 May 27, 2003

UCB - Smart Networks Project35 May 27, 2003

UCB - Smart Networks Project36 May 27, 2003

UCB - Smart Networks Project37 May 27, 2003

UCB - Smart Networks Project38 May 27, 2003

UCB - Smart Networks Project39 May 27, 2003

UCB - Smart Networks Project40 May 27, 2003

UCB - Smart Networks Project41 May 27, 2003

UCB - Smart Networks Project42 May 27, 2003 Channel Allocation (4 clusters example)

UCB - Smart Networks Project43 May 27, 2003

UCB - Smart Networks Project44 May 27, 2003

UCB - Smart Networks Project45 May 27, 2003

UCB - Smart Networks Project46 May 27, 2003

UCB - Smart Networks Project47 May 27, 2003

UCB - Smart Networks Project48 May 27, 2003

UCB - Smart Networks Project49 May 27, 2003

UCB - Smart Networks Project50 May 27, 2003

UCB - Smart Networks Project51 May 27, 2003

UCB - Smart Networks Project52 May 27, 2003

UCB - Smart Networks Project53 May 27, 2003

UCB - Smart Networks Project54 May 27, 2003

UCB - Smart Networks Project55 May 27, 2003

UCB - Smart Networks Project56 May 27, 2003

UCB - Smart Networks Project57 May 27, 2003

UCB - Smart Networks Project58 May 27, 2003

UCB - Smart Networks Project59 May 27, 2003

UCB - Smart Networks Project60 May 27, 2003

UCB - Smart Networks Project61 May 27, 2003

UCB - Smart Networks Project62 May 27, 2003

UCB - Smart Networks Project63 May 27, 2003

UCB - Smart Networks Project64 May 27, 2003

UCB - Smart Networks Project65 May 27, 2003

UCB - Smart Networks Project66 May 27, 2003

UCB - Smart Networks Project67 May 27, 2003

UCB - Smart Networks Project68 May 27, 2003 Contributions New Algorithms  Clustering: Randomized Algorithm  Channel Allocation: Simulated Annealing with a suitable potential function  Routing: New structure of constraints Evaluation and Testing Environment  Simulates Mobility  Models Flows  Implements Algorithms  Evaluates Performance

UCB - Smart Networks Project69 May 27, 2003 Future Work Fundamental Problems:  Packet-based Channel Allocation  QoS through bandwidth limits  Fast rerouting of multiple flows  Proof of correctness and convergence  Model of TDM radios  Traffic sensitive channel allocation