Bubble Rap: Social-based Forwarding in DTNs Pan Hui, Jon Crowcroft, Eiko Yoneki University of Cambridge, Computer Laboratory Slides by Alex Papadimitriou.

Slides:



Advertisements
Similar presentations
Exploring User Social Behavior in Mobile Social Applications Konglin Zhu *, Pan Hui $, Yang Chen *, Xiaoming Fu *, Wenzhong Li + * University of Goettingen,
Advertisements

Robin Kravets Tarek Abdelzaher Department of Computer Science University of Illinois The Phoenix Project.
Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future.
COMPUTER NETWORK TOPOLOGIES
Computer Network Topologies
Supporting Cooperative Caching in Disruption Tolerant Networks
DTN Multicast/Anycast Semantic Models Wenrui Zhao Kevin Fall IETF 63 / DTNRG Aug 2, 2005.
Delay bounded Routing in Vehicular Ad-hoc Networks Antonios Skordylis Niki Trigoni MobiHoc 2008 Slides by Alex Papadimitriou.
Peer-to-Peer and Social Networks Centrality measures.
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Are You moved by Your Social Network Application? Abderrahmen Mtibaa, Augustin Chaintreau, Jason LeBrun, Earl Oliver, Anna-Kaisa Pietilainen, Christophe.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Original Tree:
SOCIAL-BASED FORWARDING SCHEMES Rance Fredericksen CMPE 257 Wireless Networks.
© nCode 2000 Title of Presentation goes here - go to Master Slide to edit - Slide 1 Reliable Communication for Highly Mobile Agents ECE 7995: Term Paper.
1 Computer Networks Internetworking Devices. 2 Repeaters Hubs Bridges –Learning algorithms –Problem of closed loops Switches Routers.
Imperial College LondonFebruary 2007 Bubble Rap: Forwarding in Small World DTNs in Ever Decreasing Circles Part 2 - People Are the Network Jon Crowcroft.
Multi-path Routing -Sridevi Bellary. Introduction Multipath routing is an alternative to single shortest path routing to distribute and alleviate congestion.
How small labels create big improvements Pan Hui Jon Crowcroft Computer Laboratory University of Cambridge.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
CHINACOM 2006, Beijing, China26 Oct 2006 Osmosis in Pocket Switched Network Pan (Ben) Hui University of Cambridge Computer Laboratory
Wei Gao Joint work with Qinghua Li, Bo Zhao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University Multicasting.
Damian Gordon.  When we hook up computers together using data communication facilities, we call this a computer network.
9. Demo Scenario #1 Behavioral profile upon discovering friends/enemies 1)No friends and enemies: search for friends.  Turn by 90 degree and go forward.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
© Y. Zhu and Y. University of North Carolina at Charlotte, USA 1 Chapter 1: Social-based Routing Protocols in Opportunistic Networks Ying Zhu and.
LECTURE 9 CT1303 LAN. LAN DEVICES Network: Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and.
Pocket Switched Networks: Real-world Mobility and its Consequences for Opportunistic Forwarding Jon Crowcroft,Pan Hui (Ben) Augustin Chaintreau, James.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
Communications and Networks Chapter 8. 2 Introduction We live in a truly connected society. Increased connectivity potentially means increased productivity,
1 Contact Prediction, Routing and Fast Information Spreading in Social Networks Kazem Jahanbakhsh Computer Science Department University of Victoria August.
Challenged Networking An Experimental Study of New Protocols and Architectures Erik Nordström.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
EITnotes.com For more notes and topics visit:
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Evgueni (Eugene) Khokhlov1 A Mobility-Centric Data Dissemination Algorithm for Vehicular Networks (MDDV) Evgueni (Eugene) Khokhlov.
CS 447 Networks and Data Communication Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki
Overview of computer communication and Networking Communication VS transmission Computer Network Types of networks Network Needs Standards.
On Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering.
How Small Labels create Big Improvements April Chan-Myung Kim
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
Multiplexing FDM & TDM. Multiplexing When two communicating nodes are connected through a media, it generally happens that bandwidth of media is several.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
User-Centric Data Dissemination in Disruption Tolerant Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania State University.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
Social-Aware Stateless Forwarding in Pocket Switched Networks Soo-Jin SHIN
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Alex Leifheit NETWORKS. NETWORK A number of interconnected computers, machines, or operations. Key Components Network components, Network Architecture,
1 Part 3. Research Themes Social-based Communication Epidemiology Complex Networks Human Mobility Social Phenomena DTN Capacity.
Multicasting in delay tolerant networks a social network perspective networks October2012 In-Seok Kang
© SITILabs, University Lusófona, Portugal1 Chapter 2: Social-aware Opportunistic Routing: the New Trend 1 Waldir Moreira, 1 Paulo Mendes 1 SITILabs, University.
UNIT 2 LESSON 8 CS PRINCIPLES. UNIT 2 LESSON 8 OBJECTIVES Students will be able to: Describe how routers develop routing tables to determine how to send.
Fundamentals of Computer Networks ECE 478/578
BUBBLE Rap: Social-based Forwarding in Delay Tolerant Networks April 2013 Yong-Jin Jeong
Assignment 3 Jacob Seiz. Hub A hub provides a central access point for a network. Through multiple I/O ports a hub can connect multiple Ethernet devices.
Delay-Tolerant Networks (DTNs)
Jon Crowcroft Pan Hui Computer Laboratory University of Cambridge
Comp. Lab. Univ. Cambridge
Internet Networking recitation #4
Wireless Ad Hoc Multicast and ODMRP CS 218 Fall 2017
Wireless Epidemic The wireless epidemic (Nature 449, ; 2007) by Jon Kleinberg ‘Digital traffic flows not only over the wired backbone of the Internet,
Kevin Lee & Adam Piechowicz 10/10/2009
PRESENTATION COMPUTER NETWORKS
Presentation transcript:

Bubble Rap: Social-based Forwarding in DTNs Pan Hui, Jon Crowcroft, Eiko Yoneki University of Cambridge, Computer Laboratory Slides by Alex Papadimitriou

Bubble Rap: Social-based Forwarding in DTNs Pocket Switched Networks (PSNs)  Human mobility in terms of social structures  Multitude of devices carried by people are dynamically networked.  A PSN uses contact opportunities to allow humans to communicate without network infrastructure. Within a community some people are more popular and interact with more people than others (have high centrality), we call them hubs. Betweenness Centrality measures the number of times a node falls on the shortest path between two other nodes.  Represents the importance of a node as a potential traffic relay for other nodes in the system.

Bubble Rap: Social-based Forwarding in DTNs Experimental Datasets:  Infocom05, Hong Kong, Cambridge, infocom06, reality. Two intuitions:  People have varying roles and popularities in society. The first part of the forwarding strategy is to forward messages to nodes which are more popular than the current node.  People form communities in their social lives. The second part of the strategy is to identify the members of destination communities and to use them as relays. Assumptions:  Each node belongs to at least one community.  Each node has a global ranking across the system and a local ranking for its local community. It may belong to multiple communities and have multiple local rankings.

Bubble Rap: Social-based Forwarding in DTNs Algorithm:  The sender node first bubbles the message up the ranking tree using the global ranking, until it reaches a node which is in the same community as the destination node.  Then the local ranking is used. The message bubbles up the through the local ranking until the destination is reached or the message expires. The node needs to be able to compare rankings with nodes encountered and to push the message using a greedy approach. Whenever a message is delivered to the community, the original carrier can delete this message from the buffer.

Bubble Rap: Social-based Forwarding in DTNs Real Life:  First you try to forward the message via surrounding people more popular than you (politician), and then you bubble it up to well-known popular people in the wider-community (postman).

Bubble Rap: Social-based Forwarding in DTNs