Slide 1 of 16 Internet Service in Developing Regions Through Network Coding Mike P. Wittie, Kevin C. Almeroth, Elizabeth M. Belding, Department of Computer.

Slides:



Advertisements
Similar presentations
Supporting Cooperative Caching in Disruption Tolerant Networks
Advertisements

ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science R3: Robust Replication Routing in Wireless Networks with Diverse Connectivity Characteristics.
Multicasting in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Advisor:
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Weak State Routing for Large Scale Dynamic Networks Utku Günay Acer, Shivkumar Kalyanaraman, Alhussein A. Abouzeid Rensselaer Polytechnic Institute Department.
Enhancing Vehicular Internet Connectivity using Whitespaces, Heterogeneity and A Scouting Radio Tan Zhang ★, Sayandeep Sen†, Suman Banerjee ★ ★ University.
CSE 6590 Department of Computer Science & Engineering York University 1 Introduction to Wireless Ad-hoc Networking 5/4/2015 2:17 PM.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
An Interest-Driven Approach to Integrated Unicast and Multicast Routing in MANETs Rolando Menchaca-Mendez J.J. Garcia-Luna-Aceves 280N Seminar: 4/28/2008.
On Using Probabilistic Forwarding to Improve HEC-based Data Forwarding in Opportunistic Networks Ling-Jyh Chen 1, Cheng-Long Tseng 2 and Cheng-Fu Chou.
University of Waterloo & UOIT & INRIA Lille Presenter: Rongxing Lu
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
Multicasting in Mobile Ad-Hoc Networks (MANET)
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Using Redundancy to Cope with Failures in a Delay Tolerant Network Sushant Jain, Michael Demmer, Rabin Patra, Kevin Fall Source:
Exploiting Opportunism in Wireless Networks Aruna Balasubramanian Guest Lecture, CS 653 (Some slides borrowed from the ExOr and MORE presentations at SigComm.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL
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.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
ISCC 2011 An Adaptive Epidemic Information Dissemination Scheme with Cross-layer Enhancements T. Kontos, E. Zaimidis, C. Anagnostopoulos, S. Hadjiefthymiades,
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.
Enabling Large Scale Wireless Broadband: The Case for TAPs Roger Karrer, Ashu Sabharwal and Ed Knightly ECE Department Rice University Joint project with.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,
Anya Apavatjrut, Katia Jaffres-Runser, Claire Goursaud and Jean-Marie Gorce Combining LT codes and XOR network coding for reliable and energy efficient.
The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation Baruch Awerbuch, David Holmer, Herbert Rubens {baruch dholmer WONS Jan.
8/28/2015  A. Orda, R. Rom, A. Segall, Design of Computer Networks Prof. Ariel Orda Room 914, ext 4646.
QoS-Aware In-Network Processing for Mission-Critical Wireless Cyber-Physical Systems Qiao Xiang Advisor: Hongwei Zhang Department of Computer Science Wayne.
MobiQuitous 2004Kimaya Sanzgiri Leveraging Mobility to Improve Quality of Service in Mobile Networks Kimaya Sanzgiri and Elizabeth Belding-Royer Department.
بسم الله الرحمن الرحيم. Wireless Mesh Network (WMN) Izzeldin Shibeika – April, UNCC -
Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.
Stochastic sleep scheduling (SSS) for large scale wireless sensor networks Yaxiong Zhao Jie Wu Computer and Information Sciences Temple University.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Disruption Tolerant Networks Aruna Balasubramanian University of Massachusetts Amherst 1.
Wireless Mesh Network 指導教授:吳和庭教授、柯開維教授 報告:江昀庭 Source reference: Akyildiz, I.F. and Xudong Wang “A survey on wireless mesh networks” IEEE Communications.
Disruption Tolerant Networks Aruna Balasubramanian University of Massachusetts Amherst 1.
1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.
Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
1 TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks IEEE ICDCS’09, Montreal, Quebec, Canada Jaehoon Jeong, Shuo Gu, Yu Gu, Tian.
Performance Evaluation of Mobile Hotspots in Densely Deployed WLAN Environments Presented by Li Wen Fang Personal Indoor and Mobile Radio Communications.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
Nour KADI, Khaldoun Al AGHA 21 st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications 1.
1 Packet Radio Networks Fixed or mobile nodes that communicate via radios –Advantages: »Fast (re) deployment and set-up of network »Ability to support.
1 Upcoming Topics and Projects Romit Roy Choudhury Dept. of ECE.
1 Presented by Jing Sun Computer Science and Engineering Department University of Conneticut.
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
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.
Chien-Shiu Lin, Wei-Shyh Chang, Ling-Jyh Chen, Cheng-Fu Chou, and Ting-Kai Huang.
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, 鄭宇辰
Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.
Advisor: Prof. Han-Chieh Chao Student: Joe Chen Date: 2011/06/07.
Tarun Banka Department of Computer Science Colorado State University
Presentation transcript:

Slide 1 of 16 Internet Service in Developing Regions Through Network Coding Mike P. Wittie, Kevin C. Almeroth, Elizabeth M. Belding, Department of Computer Science UC Santa Barbara Ivica Rimac, Volker Hilt Bell Labs Alcatel-Lucent

Slide 2 of 16 Networking and the Digital Divide The Digital Divide –Low penetration of Internet services –Higher price –Lack of adequate infrastructure Success of cellular deployments –No data services –High subscription price Rural mesh networks –Local communication patterns Goals: –Low cost data communications –Leverage cellular deployments –Cater to local communications

Slide 3 of 16 Multihop Cellular Networks (MCNs) Cellular network augmented by client-to-client Wi-Fi communications [Lin00] (A) Rural (sparse) MCNs –Large cell area –Large per-client spectrum usage Local traffic patterns (B): –Cannot use cell tower –Cannot form end-to-end paths Need: efficient opportunistic client-to-client forwarding in sparse MCNs

Slide 4 of 16 Delay Tolerant Networks (DTNs) Epidemic Routing [Vahdat00] –Bundled data forwarded during every contact for eventual delivery –Flood scoping by hop-count or TTL PRoPHET [Lindgren04] –Transitive destination contact probability as routing metric –Data forwarded up a routing metric gradient But, high cost of flooding creates network congestion Cloud Routing (CR) [Wittie09] –Network and traffic state disseminated over a control channel –Forwards a small set of data copies –Lower forwarding cost and higher network throughput But, replication wastes network resources S D

Slide 5 of 16 Intra-flow Network Coding (NC) Forwards randomly encoded data on each path With high probability, data arriving on multiple paths is innovative Codes are embedded in packets themselves [Chou03] S D

Slide 6 of 16 NC in DTNs Network Coding Probabilistic Routing (NCPR) [Widmer05] –Each node forwards floor(d) coded pieces and additional coded piece with probability d-floor(d) –Stops forwarding after ceil(d) coded pieces –New innovative coded pieces reset forwarding cap But, tradeoff between high delivery rates and high load Need a more efficient mechanism for reliability S D

Slide 7 of 16 Semi-Innovative Set Routing (SISR) S D Linearly independent? b r b – ff

Slide 8 of 16 Semi-Innovative Sets (SISs) S D SIS1 SIS2 SIS3 s1s1 s2s2 s3s3 b r b – ff f

Slide 9 of 16 Semi-Innovative Sets (SISs) S D SIS1 SIS2 SIS3 SIS4 SIS5 SIS6 b r b r fff b – f r-2f

Slide 10 of 16 SISR in an MCN S D n2n2 n3n3 D SIS1 SIS2 SIS3 SIS4 SIS5 SIS6 b r b r SIS1 SIS2 SIS3 SIS4 SIS5 SIS6 d n1n1

Slide 11 of 16 SISR Cloud Progress Example

Slide 12 of 16 Evaluation Setup Want to compare SISR with CR and NCPR –NCPR – flooding and network coding –CR – small set of bundle copies –SISR – network coded bundle + redundancy Configuration details: –Area, node density and mobility models a rural community –Single flow between a node pair at different distances –Interested in evaluating: Bundle forwarding cost End-to-end delay Control channel load

Slide 13 of 16 Forwarding Cost Forwarding cost –the amount of data forwarded in the network before delivery NCPR – high cost of flooding CR – high cost of replication SISR – lowest cost –Fraction of data on each path –Improvements for multiple simultaneous flows

Slide 14 of 16 Overhead of Control Traffic Control channel load –Position updates –Bundle progress notifications –Data encoding vectors (SISR only) Cellular channel gain –Bundle size minus control traffic Prevalence of position updates Higher gain for multiple flows Gain higher for CR, but SISR easier on client resources

Slide 15 of 16 Conclusions and Future Work Introduced Semi-Innovative Set Routing (SISR) End-to-end management of NC and forwarding mechanisms –Only innovative data forwarded –Tolerates any number of losses 2X reduction in forwarding cost –Lower cost of infrastructure and data services –Make data services affordable for more clients Future work: –Adaptation to different network settings –Directional mesh networks with smart antennas –Different ratios of data and control traffic propagation speeds S D br SIS1 SIS2 SIS3 SIS4 SIS5 SIS6

Slide 16 of 16 Thank You Mike Wittie

Slide 17 of 16 Q & A

Slide 18 of 16

Slide 19 of 16 Backup Slides

Slide 20 of 16 Evaluation Setup Want to compare SISR with CR and NCPR Configuration details: –Area, node density and mobility models a rural community –Single flow between random node pair –NCPR – d configured for 100% delivery at 6km –CR – lower forwarding cost at delay comparable to larger clouds –SISR – lowest delay at 6km

Slide 21 of 16 Bundle Delay Delay –end-to-end forwarding delay of entire bundle (all coded pieces) SISR - last copy delay NCPR – nodes use up forwarding allowance before delivery CR – first copy delay

Slide 22 of 16 Multihop Cellular Networks (MCNs) Cellular network augmented by client-to-client Wi-Fi communications [Lin00] MCNs can: –Reduce cellular channel load (A) –Extend cell coverage (B, C) MCNs make cellular infrastructure go further

Slide 23 of 16 MCNs in Developing Regions Sparse MCNs –Fewer clients and larger cell area –Larger per-client spectrum usage Local data communications –Regional caches (B) –Opportunistic client-to-client communications (C) Our focus: opportunistic client- to-client forwarding in sparse MCNs