Opportunistic Mobile Social Networks

Opportunistic Mobile Social Networks

Hardcover

$105.00
Eligible for FREE SHIPPING
  • Want it by Friday, September 28?   Order by 12:00 PM Eastern and choose Expedited Shipping at checkout.

Overview

Opportunistic Mobile Social Networks by Jie Wu

The widespread availability of mobile devices along with recent advancements in networking capabilities make opportunistic mobile social networks (MSNs) one of the most promising technologies for next-generation mobile applications. Opportunistic Mobile Social Networks supplies a new perspective of these networks that can help you enhance spontaneous interaction and communication among users that opportunistically encounter each other, without additional infrastructure support.

The book explores recent developments in the theoretical, algorithmic, and application-based aspects of opportunistic MSNs. It presents the motivation behind opportunistic MSNs, describes their underpinning and key concepts, and also explores ongoing research.


  • Supplies a systematic study of the constrained information flow problem
  • Reviews the recent literature on social influence in complex social networks
  • Presents a complete overview of the fundamental characteristics of link-level connectivity in opportunistic networks
  • Explains how mobility and dynamic network structure impact the processing capacity of opportunistic MSNs for cloud applications
  • Provides a comprehensive overview of the routing schemes proposed in opportunistic MSNs

Taking an in-depth look at multicast protocols, the book explains how to provide pervasive data access to mobile users without the support of cellular or Internet infrastructures. Considering privacy and security issues, it surveys a collection of cutting-edge approaches for minimizing privacy leakage during opportunistic user profile exchange.

The book concludes by introducing a framework for mobile peer rating using a multi-dimensional metric scheme based on encounter and location testing. It also explains how to develop a network emulation test bed for validating the efficient operation of opportunistic network applications and protocols in scenarios that involve both node mobility and wireless communication.

Product Details

ISBN-13: 9781466594944
Publisher: Taylor & Francis
Publication date: 08/11/2014
Pages: 541
Product dimensions: 6.00(w) x 9.20(h) x 1.30(d)

About the Author

Jie Wu, Department of Computer and Information Sciences, Temple University

Yunsheng Wang, Kettering University, Flint, Michigan

Table of Contents

Social-Communication Composite Networks; Prithwish Basu, Ben Baumer, Amotz Bar-Noy, and Chi-Kin Chau
Introduction
Related Work
Composite Graph Models
Metrics on Composite Graphs
Composite Stretch Analysis
Theoretical Results
Composite Stretch of Some Special Graphs
Average vs. Worst-Case Analysis
Composite Broadcast Time
Composite Betweenness Centrality
Constrained Composite Load on Path Graphs
Composite Centrality in Manhattan Grid Networks
Multicast in Composite Networks
Preliminaries
Hierarchy-Compliant Multicast
Algorithms for H-Compliant Multicast
Simulation-Based Evaluation
Chain of Command
Evaluation of Basic Composite Network Metrics
Evaluation of Composite Network Multicast
Friend-of-a-Friend (FOAF)
Conclusion and Discussion
References

Recent Advances in Information Diffusion and Influence Maximization of Complex Social Networks
; Huiyuan Zhang, Subhankar Mishra, and My T. Thai
Abstract
Introduction
Social Influence and Influence Maximization
Information Diffusion Models
Threshold Models
Linear Threshold Model
The Majority Threshold Model
The Small Threshold Model
The Unanimous Threshold Model
Other Extensions
Cascading Model
Independent Cascading Model
Decreasing Cascading Model
Independent Cascading Model with Negative Opinion
Generalized Threshold and Cascade Models
Epidemic Model
SIR Model
SIS Model
SIRS Model
Competitive Influence Diffusion Models
Distance-Based Model
Wave Propagation Model
Weight-Proportional Threshold Model
Separated Threshold Model
Influence Maximization and Approximation Algorithms
Influence Maximization
Approximation Algorithm
Greedy Algorithm
CELF Selection Algorithm
CELF++ Algorithm
SPM and SP1M
Maximum Influence Paths
SIMPATH
VirAds
Conclusion
References

Characterizing Link Connectivity in Opportunistic Networks; Chul-Ho Lee and Do Young Eun
Introduction
Mobility-Induced Link-Level Metrics and Network Performance
Mathematical Definitions
The Status Quo for Mobility-Induced Link-Level Dynamics
Impact of User Availability on Link-Level Dynamics: Model and Analysis
Motivation
User Availability Comes into Picture
Analysis of Link-Level Dynamics
Transfer-Time Distribution and Mean Inter-transfer Time
Inter-transfer Time Distribution
Impact of User Availability on Link-Level Dynamics: Simulation Results
Discussion and Conclusion
References

Discovering and Predicting Temporal Patterns of WiFi-Interactive Social Populations; Xiang Li, Yi-Qing Zhang, and Athanasios V. Vasilakos
Introduction
Background
Pairwise Interactive Patterns of Temporal Contacts and Reachability
Concurrent Interactive Patterns of Event Interactions and Temporal Transmission Graphs
Temporal Degrees and Hubs: Ranking and Prediction
Conclusion
References

Behavioral and Structural Analysis of Mobile Cloud Opportunistic Networks; Anh-Dung Nguyen, Patrick Senac, and Michel Diaz
Introduction
Understanding and Modeling Opportunistic Networks
Introduction
Related Works
Characterizing and Modeling Human Mobility
STEPS
The Underlying Markov Chain
Fundamental Properties of Opportunistic Networks in STEPS
Inter-Contact Time Distribution
Contact Time Distribution
Small-World Structure of Opportunistic Networks
Introduction
Related Works
Small-World Phenomenon in Opportunistic Networks
Dynamic Small-World Metrics
Opportunistic Network Traces Analysis
Modeling Dynamic Small-World Structure with STEPS
Information Diffusion in Dynamic Small-World Networks
Mobile Cloud Opportunistic Networks
Related Works
Impact of Mobility on Mobile Cloud Computing
Mobility Model
Particle Swarm Optimization
Simulation Results and Discussion
Impact of Network Structure on Mobile Cloud Computing
Resilience of Mobile Cloud Computing Service
Conclusion
References

An Overview of Routing Protocols in Mobile Social Contact Networks; Cong Liu, Chengyin Liu, and Wei Wang
Preliminaries and Network Models
Ad Hoc Wireless Networks
Opportunistic Networks
Oblivious Routing Algorithms
Epidemic Routing
Basic Idea
Design Issues
Implementation Details
Spray and Wait
Basic Idea
Design Goals
Implementation Details
Encounter-Based Uni-cast Algorithms
Encounter-Based Routing
Basic Idea
Encounter-Based Routing
Securing EBR
Optimal Opportunistic Forwarding
Preliminary and Motivation
Basic Idea
Energy-Efficient Opportunistic Forwarding
Basic Idea
Optimization Formulation
Policy Design and Optimal Policy
NUS Student Contact Trace Model
Basic Idea
Delay-Tolerant Networking
Location-Based Routing (PER)
Basic Idea
TH-SMP Model
Contact Probabilities
Delivery Probability Metrics
Delegation Forwarding
Encounter-Based Routing (RAPID)
Selection Algorithm
Inference Algorithm
Control Channel
Social-Based Uni-cast Algorithms
Bubble Rap
Community Detection
Bubble Forwarding
Social Feature-Based Routing
Basic Idea
Preliminaries
Feature Extraction
Routing Schemes
SimBet Routing
Basic Idea
Betweenness Centrality and Similarity
SimBet Routing
Homing Spread
Basic Idea
Homing Spread
Performance Analysis
SOSIM
Basic Idea
Forwarding Algorithm
Social Similarity Metrics
Multicast
Multicasting in Delay-Tolerant Networks
Basic Idea
Single-Data Multicast
Multiple-Data Multicast
SCOOP
Benefits of Two-Hop Relaying
Positively Correlated Paths
Relaying Strategy
References

Multicast in Opportunistic Networks; Yunsheng Wang and Jie Wu
Introduction
Multicast
Single-Node Model
Multiple-Copy Model
Single-Copy Model
Discussion and Future Work
Conclusion
References

Interest-Based Data Dissemination in Opportunistic Mobile Networks: Design, Implementation, and Evaluation; Wei Gao, Wenjie Hu, and Guohong Cao
Introduction
Motivation
System Design
Collecting Data from the Web
User Interest Profile
Data Transmission
Basic Approach
Considering Data Freshness
Multi-Party Data Transmission
Power Constraint of Smartphones
Balancing the Workload of Super Users
Trade-off between Power Consumption and Data Availability
System Implementation
Development Platform
System Implementation
Discoverable Mode of Bluetooth
Removing the System Dialog Requesting Bluetooth Permission
Boot and Daemon Services
Experimental Results
Data Access Patterns of Mobile Users
Characterization of Social Communities
Related Work
Conclusion and Future Directions
References

Exploiting Social Information in Opportunistic Mobile Communication;
Abderrahmen Mtibaa and Khaled A. Harras
Introduction
Methodology: A Data-Driven Approach
Experimental Data Traces
CoNext07 [22]
Infocom06 [5]
CoNext08 [29]
Dartmouth01 [16]
Hope08 [1]
SanFrancisco11
Evaluation Methodology
PeopleRank: A Social Opportunistic Forwarding Algorithm
The PeopleRank Algorithm
PeopleRank Evaluation
Ensuring Fairness in Mobile Opportunistic Networking
The Efficiency Fairness Trade-off
Absolute Efficiency
Absolute Fairness
Real-Time Distributed Approach for Fairness-Based Forwarding
Desired Fairness and Satisfaction Index
The FOG Framework
FOG Evaluation
Forwarding in Large-Scale Mobile Opportunistic Networks
Forwarding Drawbacks in Large-Scale Opportunistic Networks
Forwarding within Sub-Communities
Classification and Forwarding in Sub-Communities
Impact of Different Community Classifications on Forwarding Performance
Forwarding across Sub-Communities: The Community-Aware Framework (CAF)
The Impact of Community Classification on CAF Enabled Rank-Based Forwarding Algorithms
CAF vs. BubbleRap
The Impact of MultiHomed Nodes
The Cost of CAF
Social-Based Trust in Mobile Opportunistic Networks
Social-Based Trust Filters
Relay-to-Relay Trust
Source-to-Relay Trust
Conclusion
References

Exploiting Private Profile Matching for Efficient Packet Forwarding in Mobile Social Networks; Kuan Zhang, Xiaohui Liang, Rongxing Lu, and Xuemin (Sherman) Shen
Introduction
Related Work
Packet Forwarding
Private Profile Matching
Problem Definition
Network Model
Threat Model
Design Goals
Preliminaries
Proposed POMP Protocols
Overview of POMP
POMP Protocol
Profile Matching
Enhanced POMP (ePOMP) Protocol
Privacy Analysis
Performance Evaluation
Simulation Setup
Simulation Results
Computational Cost
Conclusions
Acknowledgment
References

Privacy-Preserving Opportunistic Networking
; Gianpiero Costantino, Fabio Martinelli, and Paolo Santi
Introduction
Taxonomy of Privacy-Preserving Opportunistic Protocols
Attacker Models
Cryptography-Based Protocols
Private Contact Discovery
The MightBeEvil Framework
The MobileFairPlay Framework
Application to Interest-Cast
Interest-Cast Execution Time
Other Cryptography-Based Protocols
Cryptography-Free Protocols
Probabilistic Profile-Based Routing
Forwarding Packet Condition
Performance Evaluation
Hide-and-Lie
Simulations and Results
Conclusions .
References

Incentivizing Participatory Sensing via Auction Mechanisms; Buster O. Holzbauer, Boleslaw K. Szymanski, and Eyuphan Bulut
Introduction
Problem Definition
Issues in Participatory Sensing
Data
Coordination
Privacy and Security
Human Concerns
Participants
Applying Market Mechanisms
Privacy-Oriented Approaches
Participatory Sensing Systems
Conclusion
References

A P2P Search Framework for Intelligent Mobile Crowdsourcing;
Andreas Konstantinidis and Demetrios Zeinalipour-Yazti
Introduction
Background and Related Work
Mobile Crowdsourcing
Mobile P2P Search
Multi-Objective Optimization
System Model and Problem Formulation
System Model
Optimization Problem Formulation
The SmartOpt Framework
The Optimizer Module
The Decision-Maker Module
The P2P Search Module
The Smartphone Prototype System
The SmartLab Programming Cloud
SmartP2P Prototype Evaluation on SmartLab
Experimental Setup
Experimental Results
Conclusions and Potential Applications
References

Encounter-Based Opportunistic Social Discovery in Mobile Networks; Udayan Kumar and Ahmed Helmy
Introduction
Overview
Neighbor Discovery
Neighbor Selection
Connection Establishment
Applications
Rationale and Architecture
Rationale and Approach
Design Goals
Overall Design
Encounter Filters
Simple Encounter Ranking
Spatial Correspondence
Hybrid Filter (HF)
Decay of Filter Scores
Trace-Based Analysis
Filter Correlation
Filter Stability
Graph Analysis
Implementation and Simulation
Survey
ConnectEnc Application
Simulation Evaluation
Other Modules
Anomaly Detection
External Inputs
Unified Score Generation
Conclusion and Future Work
References

VANETs as an Opportunistic Mobile Social Network; Anna Maria Vegni and Thomas D.C. Little
Introduction
Opportunistic Social Networks
Social-Based Routing Protocols
Vehicular Ad Hoc Networks
Crowdsourcing-Based Applications
Eco-friendly Applications
Social-Based Routing Protocols in VSNs
Conclusions
References

Network Emulation Testbed for Mobile Opportunistic Networks; Razvan Beuran, Toshiyuki Miyachi, Shinsuke Miwa, and Yoichi Shinoda
Introduction
Approach Overview
Experiment Techniques
Network Emulation
Network Emulation Testbed
Design Challenges
Mobility
Disruptions
Wireless Communication
Scalability
QOMB Testbed
StarBED
QOMET
Overall Architecture
Opportunistic Network Emulation
Linux Support
Multi-Interface Support
Node Mobility
Fault Injection
Experimental Results
DTN Implementations
Experiment Summary
DTN2 Performance
26-Node Experiments
10 node experiments
Related Work
Conclusion
References

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews