Credit-Based Incentive Data Dissemination in Mobile Social Networks Guoliang Liu, Shouling Ji, Zhipeng Cai Georgia State University Georgia Institute of.

Slides:



Advertisements
Similar presentations
Low Overhead With Speed Aware Routing (LOWSAR) in VANETs By Kannikar Siriwong Na Ayutaya.
Advertisements

Catch-Up: A Data Aggregation Scheme for VANETs Bo Yu, Jiayu Gong, Cheng-Zhong Xu Dept. of ECE, Wayne State Univ. ACM VANET08.
Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Supporting Cooperative Caching in Disruption Tolerant Networks
Collaboration Mechanisms in SOA based MANETs. Introduction Collaboration implies the cooperation between the nodes to support the proper functioning of.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
CSLI 5350G - Pervasive and Mobile Computing Week 6 - Paper Presentation “Exploiting Beacons for Scalable Broadcast Data Dissemination in VANETs” Name:
URSA: Providing Ubiquitous and Robust Security Support for MANET
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Pricing What Can Pricing Do In Wireless Networks? Jianning Mai and Lihua Yuan
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Scheduling with Optimized Communication for Time-Triggered Embedded Systems Slide 1 Scheduling with Optimized Communication for Time-Triggered Embedded.
An Adaptive Multi-Objective Scheduling Selection Framework For Continuous Query Processing Timothy M. Sutherland Bradford Pielech Yali Zhu Luping Ding.
1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
A Study on Mobile P2P Systems Hongyu Li. Outline  Introduction  Characteristics of P2P  Architecture  Mobile P2P Applications  Conclusion.
Structure based Data De-anonymization of Social Networks and Mobility Traces Shouling Ji, Weiqing Li, and Raheem Beyah Georgia Institute of Technology.
Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.
HARP-Hybrid Ad Hoc Routing Protocol Navid NIKAEIN Christian BONNET Neda NIKAEIN © 2001 Navid Nikaein Eurecom Institute.
An adaptive framework of multiple schemes for event and query distribution in wireless sensor networks Vincent Tam, Keng-Teck Ma, and King-Shan Lui IEEE.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
Deadline-sensitive Opportunistic Utility-based Routing in Cyclic Mobile Social Networks Mingjun Xiao a, Jie Wu b, He Huang c, Liusheng Huang a, and Wei.
Incentive Based Data Sharing in Delay Tolerant Mobile Networks.
Primary Social Behavior aware Routing and Scheduling for Cognitive Radio Networks Shouling Ji and Raheem Beyah Georgia Institute of Technology Zhipeng.
Multicast Scheduling in Cellular Data Networks Katherine Guo, Arun Netravali, Krishan Sabnani Bell-Labs Research Hyungsuk Won, Han Cai, Do Young Eun, Injong.
A Novel Domain Re-organizing Algorithm for Network-Layer Mobility Management in 4G Networks Jianwen Huang, Ruijun Feng, Lei Liu, Mei Song, Junde Song Communications,
Alexander Afanasyev Tutors: Seung-Hoon Lee, Uichin Lee Content Distribution in VANETs using Network Coding: Evaluation of the Generation Selection Algorithms.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
A Game Approach for Multi-Channel Allocation in Multi-Hop Wireless Networks Lin Gao, Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.
RELAX : An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks Bashir Yahya, Jalel Ben-Othman University of Versailles, France ICC.
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 Monitoring and Aggregation in Wireless Sensor Networks INFOCOM 2010 Changlei Liu and Guohong Cao Speaker: Wun-Cheng Li.
1 Objective and Secure Reputation-Based Incentive Scheme for Ad-Hoc Networks Dapeng Oliver Wu Electrical and Computer Engineering University of Florida.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
DDR-based Multicast routing Protocol with Dynamic Core (DMPDC) Shiyi WU, Navid Nikaein, Christian BONNET Mobile Communications Department EURECOM Institute,
/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Whitespace Measurement and Virtual Backbone Construction for Cognitive Radio Networks: From the Social Perspective Shouling Ji and Raheem Beyah Georgia.
Complex Contagions Models in Opportunistic Mobile Social Networks Yunsheng Wang Dept. of Computer Science, Kettering University Jie Wu Dept. of Computer.
Jennifer Campbell November 30,  Problem Statement and Motivation  Analysis of previous work  Simple - competitive strategy  Near optimal deterministic.
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 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
Minimizing Recovery State In Geographic Ad-Hoc Routing Noa Arad School of Electrical Engineering Tel Aviv University Yuval Shavitt School of Electrical.
1 G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks Bin Wang and Sandeep K. S. Gupta Computer Science and.
Algorithms for Resource Allocation in HetNet Jianwei Liu Clemson University.
Ching-Ju Lin Institute of Networking and Multimedia NTU
Joint Replication-Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Temple University Zhen Jiang Feng Li West Chester Unveristy.
Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled WSNs under real-time constraints Fei Yang, Isabelle Augé-Blum National Institute of.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Self-Organized Resource Allocation in LTE Systems with Weighted Proportional Fairness I-Hong Hou and Chung Shue Chen.
Multi-Task Assignment for CrowdSensing in Mobile Social Network Mingjun Xiao ∗, Jie Wu†, Liusheng Huang ∗, Yunsheng Wang‡, and Cong Liu§
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Cognitive Information Service Basic Principles and Implementation of A Cognitive Inter-Node Protocol Optimization Scheme Dzmitry Kliazovich Fabrizio Granelli.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
SYNERGY: A Game-Theoretical Approach for Cooperative Key Generation in Wireless Networks Jingchao Sun, Xu Chen, Jinxue Zhang, Yanchao Zhang, and Junshan.
1 A Throughput Enhancement Handover Algorithm for WiMAX Network Architecture Hao-Ming Chang and Gwo-Jong Yu Graduate School of Mathematical Sciences, Aletheia.
Presented by Edith Ngai MPhil Term 3 Presentation
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Distributed voting application for handheld devices
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Introduction Secondary Users (SUs) Primary Users (PUs)
Improving Routing & Network Performances using Quality of Nodes
Presentation transcript:

Credit-Based Incentive Data Dissemination in Mobile Social Networks Guoliang Liu, Shouling Ji, Zhipeng Cai Georgia State University Georgia Institute of Technology

Outline Introduction Motivation Credit-based Incentive Scheme Simulation Conclusion

Background Mobile Social Network(MSN) Architectures – Centralized Architecture All connected to APs – Distributed Architecture No AP – Hybrid Architecture Partially connected to APs

Background Data dissemination in hybrid MSN architecture – Data is classified to several kinds of interest Sport news Game news Weather broadcast Movie stars … – Every use has his own interests. User A like Sports and Game User B like Sports and Weather news User C like Movie stars news … – Goal of Data dissemination: People get their interested messages Two Factors

Motivation Pass the news to Lei Feng 4 and 5 OK News

Motivation Selfishness in MSN E:Sports, Movie C:Movie, Game A:Sports, Weather D:Movie, Weather B:Sports, Movie AP Selfish but rational

Motivation(cont.) Question: – Are all the nodes in the mobile social networks cooperative? Behaviors of nodes: – Fully cooperative – Selfish For selfish nodes: – How to encourage them to be more cooperative? For fully cooperative nodes: – Resources are always limited, cooperative nodes also need to be wise to choose valuable messages to carry.

Motivation Pass the news to 4 and 5 OK News

Motivation(cont.) Why not use incentive schemes to stimulate nodes to be more cooperative? Existing incentive schemes in MANET – Reputation-based incentive scheme – Barter (Tit-for-Tat) – Credit-based incentive scheme Our method: – Embedding an effective credit-based incentive scheme to the data dissemination in MSN Virtual credits (money) Renting nodes to help get interested messages

Challenge How to evaluate a node’s fetching ability to messages as to a specific kind of interest. How to define a reasonable and fair optimization function for all the nodes in order to effectively stimulate them How to keep the computation as low as possible since computation resources are still limited in mobile devices How to reward the credits and control the currency flow.

System Model N mobile nodes and m APs Each mobile node has one or multiple interests Neighbor – Neighbors with common interest i : – Neighbors without common interest i: A C D B F E

Credit-based Incentive Scheme Definitions: – Interest Fetching Ability (IFA) The ability that a node get messages of interest i from its neighbors – Interest Fetching Ability from AP (IFA-AP) – Interest Fetching Ability from Propagation (IFA-Prop) – Interest Absorbing Ability (IAA) IAA of node a for interest i from node j represents the ability that node a gets messages of interest i from node j directly

Credit-based Incentive Scheme – Interest Fetching Ability (IFA) – denotes the ability that node a gets messages of interest i from its neighbors, directly. – Calculate and update IFA through Exponentially Weighted Moving Average Chart (EWMA) – IFA-AP – IFA-Prop

Credit-based Incentive Scheme – Interest Fetching Ability (IFA)(cont.) IFA updating:

Credit-based Incentive Scheme – Interest Absorbing Ability (IAA) – IFA evaluates “how good is a neighbor as to a specific interest” – IAA evaluates “how good do I think my neighbor is as to a specific interest”

Credit-based Incentive Scheme Rental Decision – With the system running a while, all nodes should know how to rent others to maximize their own interests!

Credit-based Incentive Scheme How to decide the prepay function reasonably. – Two functions:

Algorithm An easily computed algorithm is given. – Not optimal – But Fast

Simulations Date sets: – UmassDisel 06 – INFOCOM 06 – SIGCOMM 09 Metrics: – Delivery Ratio – Delivery Delay – Overhead Compared with: – Direct, CommonInterest, Cooperative

Simulation results Delivery Ratio:

Simulation results Delivery Delay:

Simulation results Overhead:

Conclusion A practical credit-based incentive scheme in data dissemination in MSN A simple and effective way to pay the credits and make credit flow in the MSN. Simulation results show that selfishness is well motivated and selfish nodes become more cooperative.

Credit-Based Incentive Data Dissemination in Mobile Social Networks