Social-Aware Stateless Forwarding in Pocket Switched Networks. 2013. 4. 23 Soo-Jin SHIN

Slides:



Advertisements
Similar presentations
Mobility Entropy and Message Routing in Community-Structured Delay Tolerant Networks Hideya Ochiai Hiroshi Esaki The University of Tokyo / NICT Asia Future.
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
An Optimal Probabilistic Forwarding Protocol in Delay Tolerant Networks Chan-Myung Kim
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
Multi-Variate Analysis of Mobility Models for Network Protocol Performance Evaluation Carey Williamson Nayden Markatchev
Are You Moved by Your Social Network Application? Gregory Peaker.
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Bubble Rap: Social-based Forwarding in DTNs Pan Hui, Jon Crowcroft, Eiko Yoneki University of Cambridge, Computer Laboratory Slides by Alex Papadimitriou.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Wei Gao Joint work with Qinghua Li, Bo Zhao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University Multicasting.
A Measurement-driven Analysis of Information Propagation in the Flickr Social Network WWW09 报告人: 徐波.
© Y. Zhu and Y. University of North Carolina at Charlotte, USA 1 Chapter 1: Social-based Routing Protocols in Opportunistic Networks Ying Zhu and.
Pocket Switched Networks: Real-world Mobility and its Consequences for Opportunistic Forwarding Jon Crowcroft,Pan Hui (Ben) Augustin Chaintreau, James.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
Does Packet Replication Along Multipath Really Help ? Swades DE Chunming QIAO EE Department CSE Department State University of New York at Buffalo Buffalo,
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Authors: Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu Published:
Lecturer: Ghadah Aldehim
Authors: Xu Cheng, Haitao Li, Jiangchuan Liu School of Computing Science, Simon Fraser University, British Columbia, Canada. Speaker : 童耀民 MA1G0222.
Load Balancing in Distributed Computing Systems Using Fuzzy Expert Systems Author Dept. Comput. Eng., Alexandria Inst. of Technol. Content Type Conferences.
CS380y Junior Thesis1 The Performance of TCP/IP over Bluetooth Chris Snow Supervisors: Serguei Primak, Electrical Engineering Hanan Lutfiyya, Computer.
LWIP TCP/IP Stack 김백규.
Challenged Networking An Experimental Study of New Protocols and Architectures Erik Nordström.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
1 Meeyoung Cha and DK Lee Advisor - Sue Moon (Korea Advanced Institute of Science and Technology) IEEE INFOCOM 2005 Student Workshop Split-n-Save : Path.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Socially-aware pub-sub system for human networks Yaxiong Zhao Jie Wu Department of Computer and Information Sciences Temple University Philadelphia
1 Delay Tolerant Network Routing Sathya Narayanan, Ph.D. Computer Science and Information Technology Program California State University, Monterey Bay.
Energy Efficient Phone-to-Phone Communication Based on WiFi Hotspots in PSN En Wang 1,2, Yongjian Yang 1, and Jie Wu 2 1 Dept. of Computer Science and.
Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks Wei Gao and Guohong Cao Dept. of Computer Science and Engineering Pennsylvania.
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
Routing In Socially Selfish Delay Tolerant Networks Chan-Myung Kim
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Selfishness, Altruism and Message Spreading in Mobile Social Networks September 2012 In-Seok Kang
ﺑﺴﻢﺍﷲﺍﻠﺭﺣﻣﻥﺍﻠﺭﺣﻳﻡ. Group Members Nadia Malik01 Malik Fawad03.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
Wireless communications and mobile computing conference, p.p , July 2011.
A Sociability-Based Routing Scheme for Delay-Tolerant Networks May Chan-Myung Kim
1 UNIT 13 The World Wide Web Lecturer: Kholood Baselm.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
An Evaluation of Routing Reliability in Non-Collaborative Opportunistic Networks Ling-Jyh Chen, Che-Liang Chiou, and Yi-Chao Chen Institute of Information.
Pastry Antony Rowstron and Peter Druschel Presented By David Deschenes.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
An Adaptive Routing Protocol with Congestion Avoidance for Opportunistic Networks 王冉茵.
Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power.
Winter 2014Parallel Processing, Fundamental ConceptsSlide 1 2 A Taste of Parallel Algorithms Learn about the nature of parallel algorithms and complexity:
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
© SITILabs, University Lusófona, Portugal1 Chapter 2: Social-aware Opportunistic Routing: the New Trend 1 Waldir Moreira, 1 Paulo Mendes 1 SITILabs, University.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Location-Centric Storage for Wireless Sensor Networks Kai Xingn 1, Xiuzhen Cheng 1, and Jiang Li 2 1 Department of Computer Science, The George Washington.
Data Communication Networks Lec 13 and 14. Network Core- Packet Switching.
1 UNIT 13 The World Wide Web. Introduction 2 Agenda The World Wide Web Search Engines Video Streaming 3.
1 UNIT 13 The World Wide Web. Introduction 2 The World Wide Web: ▫ Commonly referred to as WWW or the Web. ▫ Is a service on the Internet. It consists.
Net 323: NETWORK Protocols
Software Defined Networking (SDN)
Chapter 20 Network Layer: Internet Protocol
Kevin Lee & Adam Piechowicz 10/10/2009
Data Communication Networks
Presentation transcript:

Social-Aware Stateless Forwarding in Pocket Switched Networks Soo-Jin SHIN

Abstract In this paper we describe SANE, the first forwarding mechanism that combines the advantages of both social-aware and stateless approaches in pocket switched network routing. SANE is based on the observation –that we validate on real world traces –that individuals with similar interests tend to meet more often. Individuals (network members) are characterized by their interest profile. Through extensive experiments, we show the superiority of social-aware, stateless forwarding over existing stateful, social-aware and stateless, social- oblivious forwarding. An interest-casting protocol is also described, and extensively evaluated through experiments based on both real-world and synthetic mobility traces.

Introduction Hand-held devices are becoming increasingly popular and that these devices are typically endowed with wireless technologies allowing direct communication between them (e.g., Bluetooth) The above vision has motivated researchers to focus on a specific type of delay tolerant network, called opportunistic or pocket switched network [8], in which nodes are individuals carrying hand-held devices and links appear and disappear as these individuals move and get in physical proximity. Social-aware routing protocols have been shown to have superior performance to social-oblivious routing protocols such as, e.g., BinarySW [14]. This performance improvement comes at the expense of storing a significant amount of state information at the local memory of the nodes Our goal in this paper is to design a suite of social-aware, stateless routing protocols that combine the advantages of social-aware forwarding with stateless protocols.

Interest space and profiles

Our stateless protocols are based on a simple and natural observation from everyday life We use traces collected during an experiment done with real Bluetooth communicating devices distributed to participants of the Infocom 2006 conference. This data trace contains not only contact logs, also does it report information on participants’ nationality, residence, languages spoken, affiliation, scientific interests, etc.. From this information we generate interests profile as defined above. In the process, we discard participants that have not declared any interest, in order to remove erroneous profiles. This way, the number of participants reduces to 61 nodes.

Interest space and profiles we first calculate the cosine similarity between the interest profiles for every pair of participants. Then, we compute the Pearson correlation index among this value and the total meeting duration/meeting frequency among every couple. We then compute the correlation coefficients among profile similarities and meeting duration/meeting frequency. When we focus on longer meetings, the correlation of meeting duration/meeting frequency and similarity of interest profiles is considerably high, reaching These results can be used as the basic mechanism of social-aware, stateless forwarding protocols.

Social Aware Networking (SANE) We describe Social Aware Networking (SANE), a protocol suite that enables the efficient delivery of information to relevant destinations in PSNs. SANE supports a novel communication service, that we call interest- cast, besides the traditional unicast.

Social Aware Networking (SANE)

A. Unicast

Social Aware Networking (SANE) A. Unicast

Social Aware Networking (SANE) A. Unicast

Social Aware Networking (SANE) PSNs can create innovative services. Interest-cast is an example of such services in which a user wants to communicate a certain information (for instance, a movie at a local theater about opera composer Puccini) to the maximum possible number of interested users, within a certain time (e.g., the time of the last movie show). Interested users might have an interest in opera, or cinema, or both, and may be located in the “neighborhood” of the theater, so to be able to reach the theater if interested. This type of communication paradigm matches very well with the localized nature of PSN communications: the information is spread relatively fast in the neighborhood of the sender, while it takes longer to propagate to remote areas. B. Interest-cast

Social Aware Networking (SANE) B. Interest-cast

Experimental Setup and Result Here we present experimental results on the performance of SANE (the interest-cast version) and UN-SANE (the unicast version) compared to that of well known opportunistic forwarding protocols. For the evaluation we use both real world traces (Infocom 06) and synthetic ones obtained with the SWIM mobility model [12].

Experimental Setup and Result To validate the protocols on the Infocom 06 trace we average the results of the following experiment, repeated 100 times We generate a message with a uniform traffic pattern (source-destination chosen uniformly at random), and set message’s relevance profile to the destination’s interest profile. Then, we let the message to be forwarded in the network according to the different forwarding schemes. We present only the results where the limit is 40 packets per node As already discussed, the correlation between node interest profiles and their meeting frequencies may be low (see first row of Table I) without filtering out short meetings. A. SANE with limited buffer in Infocom 06

Experimental Setup and Result A. SANE with limited buffer in Infocom 06

Experimental Setup and Result A. SANE with limited buffer in Infocom 06

Experimental Setup and Result –As you can see in Figure 1, both versions of UN-SANE provide significantly higher success percentage than that of all the competing protocols, at a lower cost and at a similar or smaller delay. –Quite interestingly, the surprising result that UN-SANE EP has higher success rate than Epidemic. A. SANE with limited buffer in Infocom 06

Experimental Setup and Result 2. Interest-cast –we show results related to the two interest-cast versions of our protocol: SANE SW, and SANE EP. –we compare SANE protocols to Epidemic and BinarySW. –The way we generate messages and the input tuning parameters of BinarySW and SANE SW are the same as in unicast. –coverage refers to the percentage of relevant destinations holding a copy of the message when the TTL expires –The benefits of social-aware forwarding are evident comparing the relative performance of BinarySW and SANE SW: with a comparable cost, SANE SW provides higher coverage and lower delay than BinarySW A. SANE with limited buffer in Infocom 06

Experimental Setup and Result –SANE protocols perform very well with a much reduced cost (as much as 10-fold cost reduction with respect to Epidemic, in case of SANE SW). –The benefits of social-aware forwarding are evident comparing the relative performance of BinarySW and SANE SW: with a comparable cost, SANE SW provides higher coverage and lower delay than BinarySW A. SANE with limited buffer in Infocom 06

Experimental Setup and Result B. SANE with Synthetic Traces

Conclusions In this paper, we have first validated the intuition that individuals with similar interests tend to meet more often than individuals with diverse interests, and then used this intuition to design the first social-aware, stateless forwarding mechanism for opportunistic networks, called SANE. A nice feature of the SANE forwarding approach is that it can be used not only for traditional unicast communication, but also for realizing innovative networking services for PSNs, such as interest-casting. When collectively considered, the experimental results clearly show the superiority of SANE protocols over both social oblivious, stateless and social-aware, stateful approaches Quite astonishingly, SANE provides better performance than competitors. If this correlation is higher, as it might be expected in practical situations, we expect that the advantages of SANE protocols over competitors become substantial.