Scaling Properties of Delay Tolerant Networks with Correlated Motion Patterns Uichin Lee, Bell Labs/Alcatel-Lucent Soon Y. Oh, Mario Gerla (UCLA) Kang-Won.

Slides:



Advertisements
Similar presentations
Milan Vojnović Joint work with: Jean-Yves Le Boudec Workshop on Clean Slate Network Design, Cambridge, UK, Sept 18, 2006 On the Origins of Power Laws in.
Advertisements

Enabling Inter-domain DTN Communications by Networked Static Gateways Ting He*, Nikoletta Sofra, Kang-Won Lee*, and Kin K Leung * IBM Imperial College.
Scalable Routing In Delay Tolerant Networks
Supporting Cooperative Caching in Disruption Tolerant Networks
Mobile Ad-hoc Network Simulator: mobile AntNet R. Hekmat * (CACTUS TermiNet - TU Delft/EWI/NAS) and Radovan Milosevic (MSc student) Mobile Ad-hoc networks.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
CodeTorrent: Content Distribution using Network Coding in VANET Uichin Lee, JoonSang Park, Joseph Yeh, Giovanni Pau, Mario Gerla Computer Science Dept,
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Mobility assisted routing CS 218 F2008 Ad hoc mobility generally harmful Can mobility help in routing? –Mobility induced distributed route/directory tree.
Finding Self-similarity in People Opportunistic Networks Ling-Jyh Chen, Yung-Chih Chen, Paruvelli Sreedevi, Kuan-Ta Chen Chen-Hung Yu, Hao Chu.
RelayCast: Scalable Multicast Routing in Delay Tolerant Networks
Phero-Trail: A Bio-inspired Location Service for Mobile Underwater Sensor Networks Luiz F. Vieira, Uichin Lee, Mario Gerla UCLA.
SLAW: A Mobility Model for Human Walks Lee et al..
TSF: Trajectory-based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks Jaehoon Jeong, Shuo Guo, Yu Gu, Tian He,
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Wireless Capacity. A lot of hype Self-organizing sensor networks reporting on everything everywhere Bluetooth personal networks connecting devices City.
Mobility Modeling Capturing Key Correlations of Measured Data Christoph Lindemann University of Leipzig Department of Computer Science Johannisgasse 26.
Mobility of agents and its impact on data harvesting in VANET Kang-Won Lee IBM T. J. Watson Research 7/31/20071 NSF Workshop – Mobility in Wireless Networks.
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.
Multicast Applications: ProbeCast and RelayCast Mario Gerla, Uichin Lee, Soon Oh, SeungHoon Lee CSD, UCLA MURI-DAWN Project review.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Mobility (III) 12th Week
Motion Pattern Characterization NSF Wireless Mobility Workshop Rutgers, July 31-Aug 1, 2007 Mario Gerla Computer Science Dept, UCLA
Opportunistic Networking (aka Pocket Switched Networking)
Analysis of the Internet Topology Michalis Faloutsos, U.C. Riverside (PI) Christos Faloutsos, CMU (sub- contract, co-PI) DARPA NMS, no
MobEyes: Smart Mobs for Urban Monitoring with Vehicular Sensor Networks* Uichin Lee, Eugenio Magistretti, Mario Gerla, Paolo Bellavista, Antonio Corradi.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Wireless “ESP”: Using Sensors to Develop Better Network Protocols Hari Balakrishnan Lenin Ravindranath, Calvin Newport, Sam Madden M.I.T. CSAIL.
Wei Gao Joint work with Qinghua Li, Bo Zhao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University Multicasting.
Mobile Ad hoc Networks COE 549 Delay and Capacity Tradeoffs II Tarek Sheltami KFUPM CCSE COE 8/6/20151.
Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,
© University of Alabama1 Chapter 1: Identifying the Intertwined Links between Mobility and Routing in Opportunistic Networks Xiaoyan Hong Bo Gu University.
Performance Evaluation of Vehicular DTN Routing under Realistic Mobility Models Pei’en LUO.
Pocket Switched Networks: Real-world Mobility and its Consequences for Opportunistic Forwarding Jon Crowcroft,Pan Hui (Ben) Augustin Chaintreau, James.
UNIVERSITY of NOTRE DAME COLLEGE of ENGINEERING Preserving Location Privacy on the Release of Large-scale Mobility Data Xueheng Hu, Aaron D. Striegel Department.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Multicast Scheduling in Cellular Data Networks Katherine Guo, Arun Netravali, Krishan Sabnani Bell-Labs Research Hyungsuk Won, Han Cai, Do Young Eun, Injong.
Exploiting Temporal Dependency for Opportunistic Forwarding in Urban Vehicular Network [MANET-2] Presented by Cui Kai 2011/5/25 Hongzi Zhu, Sherman Shen,
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
Routing In Socially Selfish Delay Tolerant Networks Chan-Myung Kim
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Contact-Based Mobility Metrics for Delay-
Multicast ad hoc networks Multicast in ad hoc nets Multicast in ad hoc nets Review of Multicasting in wired networks Review of Multicasting in wired networks.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
Converge-Cast: On the Capacity and Delay Tradeoffs Xinbing Wang Luoyi Fu Xiaohua Tian Qiuyu Peng Xiaoying Gan Hui Yu Jing Liu Department of Electronic.
1 Performance Analysis of the Distributed Coordination Function under Sporadic Traffic joint work with C.-F. Chiasserini (Politecnico di Torino)
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.
1 On the Levy-walk Nature of Human Mobility Injong Rhee, Minsu Shin and Seongik Hong NC State University Kyunghan Lee and Song Chong KAIST.
UNIVERSITY OF SOUTHERN CALIFORNIA PATHS: Analysis of PATH Duration Statistics and their Impact on Reactive MANET Routing Protocols Narayanan Sadagopan.
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Multipath TCP in a Lossy ad hoc Wireless Network Medhocnet 2004 Bodrum, June 2004 Jiwei Chen, Kaixin Xu, Mario Gerla UCLA.
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
Copyright © 2002 OPNET Technologies, Inc. 1 Random Waypoint Mobility Model Empirical Analysis of the Mobility Factor for the Random Waypoint Model 1542.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
1 Stochastic Ordering for Internet Congestion Control Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, and Lisong Xu PFLDnet 2007 February 7, 2007.
Mobile Data Offloading: How Much Can WiFi Deliver? Kyunghan Lee, Injong Rhee, Joohyun Lee, Song Chong, Yung Yi CoNEXT Presentor: Seokshin.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Geographic Routing without Location Information. Assumption by Geographic Routing Each node knows its own location.  outdoor positioning device: GPS:
SLAW: A Mobility Model for Human Walks
Jérôme Härri, Fethi Filali, Christian Bonnet
Power law and exponential decay
Highway Vehicular Delay Tolerant Networks: Information Propagation Speed Properties Emmanuel Baccelli, Philippe Jacquet, Bernard Mans, and Georgios Rodolakis.
Distributed Channel Assignment in Multi-Radio Mesh Networks
Presentation transcript:

Scaling Properties of Delay Tolerant Networks with Correlated Motion Patterns Uichin Lee, Bell Labs/Alcatel-Lucent Soon Y. Oh, Mario Gerla (UCLA) Kang-Won Lee (IBM T.J. Watson Research)

Alcatel-Lucent 2 | CHANTS’09 | Sept Key DTN Metric: Pair-wise Inter-contact Time Key metric for measuring end-to-end delay Pair-wise inter-contact time: interval between two contact points Inter-contact distribution:  Exponential : bounded delay, but not realistic?  Power-law  : may cause infinite delay, but more realistic? T1 T2 T3 Contact points between two nodes: i and j T ic (n): pair-wise inter-contact time time T ic (1) T1 T ic (2) T2 T ic (3) T3

Alcatel-Lucent 3 | CHANTS’09 | Sept Two-phase Inter-contact Time Two-phase distribution: power-law head and exponential tail Levy walk based mobility Lee et al. Infocom’08/09 Inter-contact time CCDF Time (min) Power Law Head Exponential Tail Power Law Head Inter-contact time CCDF Exponential Tail Karagiannis et al., MobiCom’07 Association times w/ AP (UCSD) or cell tower (MIT cell) Direct contact traces: Infocom, cambridge (imotes), MIT-bt Power Law Head Log-log plot Time (days) Log-log plot

Alcatel-Lucent 4 | CHANTS’09 | Sept Two-phase Inter-contact Time Why two-phase distribution? One possible cause:  Flight distance of each random trip (within a finite area) [Cai08]  The shorter the flight distance, the higher the motion correlation in local area, resulting heavier power-law head  Power-law head while in local area vs. exponential tail for future encounters Examples of motion correlation:  Manhattan sightseers: In Time Square, sightseers tend to bump into each other; and then depart for other sights  Levy flight of human walks [Rhee08]: short flights + occasional long flights  Vehicular mobility: constrained by road traffic (+traffic jam)  High correlation among vehicles in close proximity  After leaving locality, vehicles meet like “ ships in the night ” *Cai08: Han Cai and Do Young Eun, Toward Stochastic Anatomy of Inter-meeting Time Distribution under General Mobility Models, MobiHoc’08 *Rhee08: Injong Rhee, Minsu Shin, Seongik Hong, Kyunghan Lee and Song Chong, On the Levy-walk Nature of Human Mobility, INFOCOM’08 Goal: understanding impacts of correlated motion patterns on throughput/delay/buffer scaling properties Frequent encounters in local area Local area

Alcatel-Lucent 5 | CHANTS’09 | Sept DTN Model: Inter-contact rate + flight distance Inter-contact rate: λ ~ speed (v)*radio range (r) [Groenevelt, Perf’05]  Random waypoint/direction (exp inter-contact time) Flight distance (motion correlation):  Ranging from radio radius Ω(r) to network width O(1) Invariance property: avg inter-contact time does not depend on the degree of correlation in the mobility patterns [Cai and Eun, Mobihoc’08] 1 1 flight distance = Θ(1) Random direction Random walk 1 1 flight distance = Θ(r)radio range=Θ(r) Varying flight distance

Alcatel-Lucent 6 | CHANTS’09 | Sept Hop Relay: DTN Routing Each source has a random destination (n source-destination pairs) 2-hop relay protocol: 1. Source sends a packet to a relay node 2. Relay node delivers a packet to the corresponding receiver 2-hop Relay by Grossglauser and Tse Source Relay Destination Source to Relay Relay to Dest

Alcatel-Lucent 7 | CHANTS’09 | Sept Hop Relay: Throughput Analysis Intuition: avg throughput is determined by aggregate meeting rate (src  relay and relay  dest) Two-hop relay per node throughput : Θ(nλ)  Aggregate meeting rate at a destination: nλ  Grossglauser and Tse’s results: Θ(nλ)=Θ(1) when λ = 1/n (i.e., speed 1/√n, radio range 1/√n) Motion correlation (w/ flight len [O(r),O(1)]) still preserves meeting rate Source to RelayRelay to Destination Source Destination Food (=source) Ants (=relays)

Alcatel-Lucent 8 | CHANTS’09 | Sept Hop Relay: Delay Analysis Source to relay node (D sr ), and then relay to dest (D rd )  D sr = avg. inter-any-contact time to a random relay  D rd = avg. residual inter-contact time (relay  dest)  Mean residual inter-contact time (D rd ) = E[T 2 ] / 2E[T] >> T is a random variable for inter-contact time  Random Direction (RD): E[T 2 ] = O(1/λ 2 )  D rd =O(1/λ)  Random Walk (RW): E[T 2 ] = O(logn*1/λ 2 )  D rd =O(logn/λ) Average 2-Hop Delay: D(n) = [O(1/λ), O(logn/λ)]  As flight distance increases, average delay decreases monotonically Inspection paradox (length bias): source tends to sample a longer inter-contact interval between relay and dest nodes Time Src  Relay Inter-contact history: Relay  Dest Source Relay Destination Source to Relay Relay to Dest

Alcatel-Lucent 9 | CHANTS’09 | Sept Hop Relay: Buffer Requirement Little’s law: buffer = (rate) x (delay) Required buffer space per node: B = [Θ(n), Θ(nlogn)]  Rate*delay = Θ(nλ)* [1/λ, logn/λ] = [Θ(n), Θ(nlogn)]  Recall: random direction (1/λ) and random walk (logn/λ)  Motion correlation requires more buffer space  Correlation increases burstiness of relay traffic Impact of limited buffer space on throughput  Limited buffer of Θ(K) at each relay node is fairly shared by all sources  Relay node carries a packet to a certain dest with prob. K/B  Throughput per source = Θ(nλ*K/B) Delay: [Θ(1/λ), Θ(logn/λ)] S1 S2 R Θ(n) srcs Relay S3 D1 D2 D3 Θ(n) dests Rate: Θ(nλ)

Alcatel-Lucent 10 | CHANTS’09 | Sept Simulation: Throughput Degree of correlation via average flight distance L  L=250m  high correlation  power law head + exponential tail  L=1000m  low correlation  almost exponential Throughput is independent of the degree of correlations Average throughput per node as a function of # nodes Throughput per node (kbps) 5000m*5000m area # of nodes <=100 Radio range = 250m w/ 2Mbps CCDF of inter-contact time (20m/s) L=250m log-linear L=1000m L=250m Exp Inter-contact time CCDF Log-log

Alcatel-Lucent 11 | CHANTS’09 | Sept Simulation: Inter-any-contact Time Inter-any(k)-contact time: inter-contact time to any of k nodes Invariance property: avg inter-contact time is independent of correlation Residual inter-contact time: source probes a random point of the inter- meeting times between relay and destination Average Inter-contact time Average residual inter-contact time 20m/s 30m/s 20m/s L=250m 20m/s L=1000m 30m/s L=250m 30m/s L=1000m Number of relay nodes (k)

Alcatel-Lucent 12 | CHANTS’09 | Sept Simulation: Buffer Utilization Burstiness of relay traffic increases with the degree of correlation SSDDDSSD N=3 N=2 Relay node’s contact history Time # consecutive encounters (N) S Source D Destination N=2 Cumulative dist of # consecutive encounters L=250 L=1000 Number of consecutive encounters (N) P(N<=X)

Alcatel-Lucent 13 | CHANTS’09 | Sept Conclusion Impact of correlated motion patterns on DTN scaling properties DTN model: inter-contact rate + motion correlation via flight distance  Flight distance of Ω(r); i.e., min travel distance ~ one ’ s radio range  Considered mobility ranges from Random Walk to Random Direction Main results:  Throughput is independent of motion correlation  Delay monotonically increases with the degree of correlation  Buffer requirement also increases with the degree of correlation  Correlation increases burstiness of relay traffic Future work:  Applying results to DTN multicast scenarios  Scaling properties of inter-domain DTN scenarios