Declarative Policy-based Adaptive MANET Routing Changbin Liu*, Ricardo Correa*, Xiaozhou Li* Prithwish Basu†, Boon Thau Loo*, Yun Mao‡ 1 *University of.

Slides:



Advertisements
Similar presentations
1 S4: Small State and Small Stretch Routing for Large Wireless Sensor Networks Yun Mao 2, Feng Wang 1, Lili Qiu 1, Simon S. Lam 1, Jonathan M. Smith 2.
Advertisements

Implementing Declarative Overlays From two talks by: Boon Thau Loo 1 Tyson Condie 1, Joseph M. Hellerstein 1,2, Petros Maniatis 2, Timothy Roscoe 2, Ion.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Towards a Declarative Language and System for Secure Networking Martín Abadi 1,2, Boon Thau Loo 3 1 Microsoft Research Silicon Valley, 2 UC Santa Cruz,
SEEKER: An Adaptive and Scalable Location Service for Mobile Ad Hoc Networks Jehn-Ruey Jiang and Wei-Jiun Ling Presented by Jehn-Ruey Jiang National Central.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking David B. Johnson Department of Computer Science Rice University Monarch.
Multicasting in Mobile Ad-Hoc Networks (MANET)
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta.
Progress Report Wireless Routing By Edward Mulimba.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
GeoLANMAR Routing: Asymptotic Analysis in Large and Dense Networks Broadnets 2005 Boston, Oct 5, 2005 Mario Gerla, Biao Zhou (UCLA) F. de Rango, S. Marano.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Di Wu 03/03/2011 Geographic Routing in Clustered Multi-layer Vehicular Ad Hoc Networks for Load Balancing Purposes.
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.
1 Virtual Direction Routing for Overlay Networks Bow-Nan Cheng Murat Yuksel Shivkumar Kalyanaraman.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Mobile Adhoc Network: Routing Protocol:AODV
1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
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.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
An OLSR implementation, experience, and future design issues.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
H AZY S IGHTED L INK S TATE R OUTING P ROTOCOL Eleonora Borgia Pervasive Computing & Networking Lab. PerLab IIT – CNR MobileMAN.
The Performance of Query Control Schemes for the Zone Routing Protocol Zygmunt J. Haas Marc R. Pearlman.
Customizable Routing with Declarative Queries Boon Thau Loo 1 Collaborators: Joseph M. Hellerstein 1,2, Karthik Lakshminarayanan 1, Raghu Ramakrishnan.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
H AZY S IGHTED L INK S TATE Eleonora Borgia IIT – CNR Pisa - Dicember 4th, 2003.
Sharp Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Declarative Routing: Extensible Routing with Declarative Queries Boon Thau Loo 1 Joseph M. Hellerstein 1,2, Ion Stoica 1, Raghu Ramakrishnan 3, 1 University.
Self-stabilizing energy-efficient multicast for MANETs.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu
Mobile Ad Hoc Networks. What is a MANET (Mobile Ad Hoc Networks)? Formed by wireless hosts which may be mobile No pre-existing infrastructure Routes between.
Routing Metrics for Wireless Mesh Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
A Brief Talk on Mesh Routing
Virtual Direction Routing
Routing Metrics for Wireless Mesh Networks
AODV-OLSR Scalable Ad hoc Routing
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
What is Mobile Network? Why is it called Ad Hoc?
Outline Introduction Routing in Mobile Ad Hoc Networks
GPSR Greedy Perimeter Stateless Routing
A comparison of Ad-Hoc Routing Protocols
ODMRP Enhancement.
Ahmed Helmy Computer and Information Science and Engineering (CISE)
Sensor Network Routing
GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Declarative Routing: Extensible Routing with Declarative Queries
Ad hoc Routing Protocols
by Saltanat Mashirova & Afshin Mahini
Routing Metrics for Wireless Mesh Networks
Proactive vs. Reactive Routing
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Motion-Aware Routing in Vehicular Ad-hoc Networks
Routing in Mobile Ad-hoc Networks
Vinay Singh Graduate school of Software Dongseo University
Routing protocols in Mobile Ad Hoc Network
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

Declarative Policy-based Adaptive MANET Routing Changbin Liu*, Ricardo Correa*, Xiaozhou Li* Prithwish Basu†, Boon Thau Loo*, Yun Mao‡ 1 *University of Pennsylvania †BBN Technologies ‡ AT&T Labs - Research

Motivation Variety of MANET routing protocols Reactive (DSR, AODV) Proactive (LS, OLSR, HSLS) Epidemic Hybrid (ZRP, SHARP) However, a one-size-fits-all MANET protocol DOES NOT exist: Variability in network connectivity, wireless channels, mobility Wide range of traffic patterns 2

Approach Policy-based adaptive protocols Composed from any number of known protocols Generic set of policies for selecting and switching amongst different routing protocols due to network/traffic conditions Declarative networking A general platform and framework for specifying and implementing network protocols 3

Use a database query language to specify network protocols Specifying “what” to do instead of “how” Distributed query engine executes specifications to implement network protocols Similar to Click modular router Efficient performance compared to imperative implementations Declarative Networking [Loo et. al., SIGCOMM’05] 4

Why Declarative for MANETs? Compact and high level representation of protocols Orders of magnitude reduction in code size Chord DHT in 47 rules MANET routing protocols in a few rules Easy customization for policy-based adaptive MANETs 5

Example(1): Link State ls1 :- ls2 :- 6 Input: link next, cost) Output: lsu src, next, cost, from) Broadcast specifierBuilt-in periodic trigger

hs1 :- TTL=f_pow(2,K), T=TTL*Tp, K=range[1,5]. hs2 :- TTL > 0. 7 Input: link next, cost) Output: lsu src, next, cost, from) Scoped flooding Link updates to farther nodes sent less frequently TTL field to limit the forwarding range of LSU Example(2): Hazy Sighted Link State

Declarative MANET protocols Reactive DSR (Dynamic Source Routing) (10 rules) Proactive LS (Link State) (8 rules) HSLS (Hazy Sighted Link State routing) (14 rules) OLSR (Optimized Link State Routing) (27 rules) Epidemic Summary Vector based (16 rules) 8

Validation of Declarative MANETs 9 Declarative MANET protocols executed by the P2 declarative networking system Local cluster consisting of 15 nodes interconnected by high-speed Ethernet emulating up to 40 MANET nodes Emulate network dynamics by adding/deleting links during rule execution Fig 1. Per-node communication overhead (KB/s) for LS, HSLS, OLSR Declarative MANETs show expected scalability trends

23 nodes 10 ORBIT wireless testbed at Rutgers University 1 GhZ VIA Nehemiah, 64 KB cache, 512 MB RAM Atheros AR5212 chipset a/b/g ad hoc mode 33 nodes in a 7m x 5m grid Measurements on ORBIT Wireless Testbed

In declarative networking framework Hybrid protocol composed from any number of known protocols Generic set of policies for selecting and switching among different routing protocols due to network/traffic conditions Policies also specified in declarative language Examples Hybrid link state Hybrid proactive-epidemic 11 Policy-based Adaptive MANETs

Example(1): Hybrid Link State LS: quick convergence, may perform better in stable network HSLS: incurs low bandwidth overhead, scales better Switch between LS and HSLS Low mobility: LS High mobility: HSLS Mobility measurement: link average availability (AA), i.e. percentage of time when link is up #define THRES 0.5 s1 ) :- s2 :- AA<THRES. // unstable s3 :- AA>=THRES. // stable 12

33 wireless nodes on 7m x 5m grid on ORBIT testbed that communicate over a Linux iptables to filter packets from non-neighbors Emulate 2-dimensional random waypoint model Random jitter and desynchronized broadcasting to alleviate packet collision Alternate at 60 seconds interval of: Moderate stage: nodes move at 0.06 m/s Fast stage: nodes move at 0.15m/s 13 Evaluation of Hybrid Link State

14 Evaluation of Hybrid Link State Link dynamics Average link AA Protocol switching Bandwidth overhead Route stretch Hybrid Link State protocol achieves the best of both LS and HSLS

15 Example(2): Hybrid Proactive-Epidemic LS: good performance for well connected network Epidemic: for DTN, reliable message delivery in the sacrifice of high bandwidth Switch between LS and Epidemic Well connected network: LS Disrupted network: Epidemic Network connectivity measurement: path length Refer to our paper for more details about evaluation Declarative framework makes it easier to express policies for runtime adaptation of routing protocols

MANET protocols in declarative framework Reactive, Proactive, Epidemic Compact specification Exhibit expected behaviors Policy-based adaptive MANETs Easy to build using existing declarative MANET protocols Protocol switching due to policies and network/traffic conditions Experiment results demonstrate that hybrid protocol can achieve the best of different protocols 16 Summary

Enhance declarative policy-based framework for adaptive protocols Adapt in a unified manner amongst proactive, reactive and epidemic Integrate with a channel selection policy engine Formally verifiable networking Verification of network protocols [HotNets ’09] RapidNet A development toolkit that unifies rapid prototyping, simulation and experimentation [SIGCOMM ’09 Demo] Integrates a declarative networking engine with the ns-3 network simulator and emulator Successful evaluation on the ORBIT testbed [WinTECH ’09] 17 Ongoing work

Thank you! 18 RapidNet open source code release:

Backup 19

Network Datalog (NDlog) Example R2:  R1:  Input: destination) Output: destination) “For all nodes S,D, If there is a link from S to D, then S can reach D”. – “there is a link from node a to node b” – “node a can reach node b” 20

R2:  R1:  Input: destination) Output: destination) “For all nodes S,D and Z, If there is a link from S to Z, AND Z can reach D, then S can reach D”. 21 Network Datalog (NDlog) Example

Epidemic (Summary vector based) e1 e2 V=f_vec_AND(V1,f_vec_NOT(V2)). e3 f_vec_in(V,I)==true. e4 22

Emulate 35 wireless nodes on 7m x 5m grid on local cluster Application level filtering to accept packets only from neighbors Emulate 2-dimensional random waypoint model Vary neighbor distance to construct connected/disconnected network Alternate at 60 seconds interval: Low connectivity with high mobility: nodes move at 0.03 m/s High connectivity with low mobility: nodes move at 0.001m/s 23 Evaluation of Hybrid Proactive Epidemic

Performance Metrics: Per-node communication bandwidth overhead Packet delivery ratio: messages are forwarded from random sources to random destination 24 Evaluation of Hybrid Proactive Epidemic Hybrid Proactive Epidemic achieves the best of both LS and Epidemic