SlideShare una empresa de Scribd logo
1 de 5
Geo-Community-Based Broadcasting for Data
Dissemination in Mobile Social Networks
ABSTRACT
In this paper, we consider the issue of data broadcasting in mobile social networks (MSNets). The objective is
to broadcast data from a superuser to other users in the network. There are two main challenges under this
paradigm, namely, (a) how to represent and characterize user mobility in realistic MSNets; (b) given the
knowledge of regular users’ movements, how to design an efficient superuser route to broadcast data actively.
We first explore several realistic datasets to reveal both geographic and social regularities of human mobility,
and further propose the concepts of geo-community and geo-centrality into MSNet analysis. Then, we employ a
semi-Markov process to model user mobility based on the geo-community structure of the network.
Correspondingly, the geo-centrality indicating the “dynamic user density” of each geo-community can be
derived from the semi-Markov model. Finally, considering the geo-centrality information, we provide different
route algorithms to cater to the superuser that wants to either minimize total duration or maximize dissemination
ratio. To the best of our knowledge, this work is the first to study data broadcasting in a realistic MSNet setting.
Extensive trace-driven simulations show that our approach consistently outperforms other existing superuser
route design algorithms in terms of dissemination ratio and energy efficiency.
GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
Existing System
MOBILE Social Networks (MSNets) are networks in which mobile social users physically interact with each
other and further reach network service, even in the absence of network infrastructure or end-to-end
connectivity. MSNets can be viewed as a kind of socially aware Delay/Disruption Tolerant Networks (DTNs).
However, intermittent and uncertain network connectivity make data dissemination in MSNets a challenging
problem.
Proposed System:
The main idea behinds this is exploring both geographic and social properties of users mobility to facilitate data
dissemination on purpose. We explore the geographic and social regularities of users mobility from both
theoretical and experimental perspectives. Based on the exploited characterization, we introduce a semi-Markov
process for modeling users mobility. The proposed superuser route comprises several geo-communities and the
according waiting times, which are both calculated carefully based on the semi-Markov model. Extensive trace-
driven simulation results show that our data broadcast schemes perform significantly better than other existing
schemes.
Architecture:
MODULES”
1. Mobileuser.
2. Superuser.
3. Geo-Community.
4. Static Route Algorithm.
Super User Mobile User
Moving Trace Share DataPrediction
Geo-Graph
Geo-Community
5. Realistic MSNet Traces.
Modules Description
1. Mobileuser
Regular users, or simply, the users that move based on their social lives. These users are
potential data receivers from the superuser. The movements of the users are not controllable.
2. Superuser
A single, special user called superuser (e.g. the salesman) that aims to broadcast data to regular
users in the network. In this paper, we only consider one-hop data broadcasting from the superuser to
regular users.
3. Geo-Community
A community is defined as a clustering of users that are “tightly” linked to each other, either by direct
linkage or by some “easily accessible” users that act as intermediates. Members of a community usually share
interesting properties, such as common hobbies, social functions, and occupations. On campus, graduate
students working in the same office interact more frequently with each other; members affiliating with the same
team, such as football or swimming, have such heavy interactions.
4. Static Route Algorithm
The total duration T of the superuser route has two components: (a) Waiting time Tw: The sum of
waiting times at the chosen geo-communities; (b) Traveling Time Tt: The total time that the superuser spends
traveling between geocommunities. The total route time T = Tw + Tt. Assuming that only Tw contributes to the
superuser’s data dissemination, the superuser route design algorithm can be broken into two subproblems:
finding a good set of geo-communities and their corresponding waiting times, and ordering these
geocommunities together to form a tour.
5. Realistic MSNet Traces
Mobile users in MSNets usually move around several well-visited locations instead of moving randomly. We
explore the realistic traces aiming to reveal the real situation behind such observation. The well-known “small
world” phenomenon shows that people usually belong to several communities, and contact others with similar
hobbies, occupations, or social functions.
System Configuration:-
H/W System Configuration:-
Processor - Pentium –III
Speed - 1.1 Ghz
RAM - 256 MB (min)
Hard Disk - 20 GB
Floppy Drive - 1.44 MB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA
S/W System Configuration:-
 Operating System :Windows95/98/2000/XP
 Application Server : Tomcat5.0/6.X
 Front End : HTML, Java, Jsp
 Scripts : JavaScript.
 Server side Script : Java Server Pages.
 Database : Mysql
 Database Connectivity : JDBC.
CONCLUSION
In this paper, we have studied one-hop data broadcasting from a single superuser to other users in
MSNets. The main idea behinds this is exploring both geographic and social properties of users mobility to
facilitate data dissemination on purpose. We explore the geographic and social regularities of users mobility
from both theoretical and experimental perspectives. Based on the exploited characterization, we introduce a
semi-Markov process for modeling users mobility. The proposed superuser route comprises several geo-
communities and the according waiting times, which are both calculated carefully based on the semi-Markov
model. Extensive trace-driven simulation results show that our data broadcast schemes perform significantly
better than other existing schemes. We also discuss multiple superuser scheduling and incentive schemes in
selfish MSNets in the Appendix.

Más contenido relacionado

Más de IEEEGLOBALSOFTTECHNOLOGIES

Más de IEEEGLOBALSOFTTECHNOLOGIES (20)

DOTNET 2013 IEEE MOBILECOMPUTING PROJECT SSD a robust rf location fingerprint...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT SSD a robust rf location fingerprint...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT SSD a robust rf location fingerprint...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT SSD a robust rf location fingerprint...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Privacy preserving distributed profi...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Privacy preserving distributed profi...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Privacy preserving distributed profi...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Privacy preserving distributed profi...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Optimal multicast capacity and delay...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT On the real time hardware implementa...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT On the real time hardware implementa...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT On the real time hardware implementa...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT On the real time hardware implementa...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Model based analysis of wireless sys...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Model based analysis of wireless sys...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Model based analysis of wireless sys...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Model based analysis of wireless sys...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Mobile relay configuration in data i...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Mobile relay configuration in data i...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Mobile relay configuration in data i...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Mobile relay configuration in data i...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Distributed cooperative caching in s...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Distributed cooperative caching in s...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Distributed cooperative caching in s...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Distributed cooperative caching in s...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Delay optimal broadcast for multihop...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Delay optimal broadcast for multihop...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Delay optimal broadcast for multihop...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Delay optimal broadcast for multihop...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Dcim distributed cache invalidation ...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Dcim distributed cache invalidation ...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Dcim distributed cache invalidation ...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Dcim distributed cache invalidation ...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Cooperative packet delivery in hybri...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Cooperative packet delivery in hybri...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Cooperative packet delivery in hybri...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Cooperative packet delivery in hybri...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Content sharing over smartphone base...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Content sharing over smartphone base...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Content sharing over smartphone base...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Content sharing over smartphone base...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routin...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routin...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routin...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Community aware opportunistic routin...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Capacity of hybrid wireless mesh net...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Capacity of hybrid wireless mesh net...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Capacity of hybrid wireless mesh net...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Capacity of hybrid wireless mesh net...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Adaptive position update for geograp...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Adaptive position update for geograp...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Adaptive position update for geograp...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Adaptive position update for geograp...
 
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT A scalable server architecture for m...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT A scalable server architecture for m...DOTNET 2013 IEEE MOBILECOMPUTING PROJECT A scalable server architecture for m...
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT A scalable server architecture for m...
 
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Attribute based access to scalable me...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Attribute based access to scalable me...DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Attribute based access to scalable me...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Attribute based access to scalable me...
 
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Attribute based access to scalable me...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Attribute based access to scalable me...DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Attribute based access to scalable me...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Attribute based access to scalable me...
 
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Scalable and secure sharing of person...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Scalable and secure sharing of person...DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Scalable and secure sharing of person...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Scalable and secure sharing of person...
 
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Qos ranking prediction for cloud serv...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Qos ranking prediction for cloud serv...DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Qos ranking prediction for cloud serv...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Qos ranking prediction for cloud serv...
 
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Privacy preserving public auditing fo...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Privacy preserving public auditing fo...DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Privacy preserving public auditing fo...
DOTNET 2013 IEEE CLOUDCOMPUTING PROJECT Privacy preserving public auditing fo...
 

Último

Último (20)

BT & Neo4j _ How Knowledge Graphs help BT deliver Digital Transformation.pptx
BT & Neo4j _ How Knowledge Graphs help BT deliver Digital Transformation.pptxBT & Neo4j _ How Knowledge Graphs help BT deliver Digital Transformation.pptx
BT & Neo4j _ How Knowledge Graphs help BT deliver Digital Transformation.pptx
 
Long journey of Ruby Standard library at RubyKaigi 2024
Long journey of Ruby Standard library at RubyKaigi 2024Long journey of Ruby Standard library at RubyKaigi 2024
Long journey of Ruby Standard library at RubyKaigi 2024
 
Overview of Hyperledger Foundation
Overview of Hyperledger FoundationOverview of Hyperledger Foundation
Overview of Hyperledger Foundation
 
Syngulon - Selection technology May 2024.pdf
Syngulon - Selection technology May 2024.pdfSyngulon - Selection technology May 2024.pdf
Syngulon - Selection technology May 2024.pdf
 
Easier, Faster, and More Powerful – Notes Document Properties Reimagined
Easier, Faster, and More Powerful – Notes Document Properties ReimaginedEasier, Faster, and More Powerful – Notes Document Properties Reimagined
Easier, Faster, and More Powerful – Notes Document Properties Reimagined
 
Using IESVE for Room Loads Analysis - UK & Ireland
Using IESVE for Room Loads Analysis - UK & IrelandUsing IESVE for Room Loads Analysis - UK & Ireland
Using IESVE for Room Loads Analysis - UK & Ireland
 
ECS 2024 Teams Premium - Pretty Secure
ECS 2024   Teams Premium - Pretty SecureECS 2024   Teams Premium - Pretty Secure
ECS 2024 Teams Premium - Pretty Secure
 
The Value of Certifying Products for FDO _ Paul at FIDO Alliance.pdf
The Value of Certifying Products for FDO _ Paul at FIDO Alliance.pdfThe Value of Certifying Products for FDO _ Paul at FIDO Alliance.pdf
The Value of Certifying Products for FDO _ Paul at FIDO Alliance.pdf
 
Linux Foundation Edge _ Overview of FDO Software Components _ Randy at Intel.pdf
Linux Foundation Edge _ Overview of FDO Software Components _ Randy at Intel.pdfLinux Foundation Edge _ Overview of FDO Software Components _ Randy at Intel.pdf
Linux Foundation Edge _ Overview of FDO Software Components _ Randy at Intel.pdf
 
Introduction to FDO and How It works Applications _ Richard at FIDO Alliance.pdf
Introduction to FDO and How It works Applications _ Richard at FIDO Alliance.pdfIntroduction to FDO and How It works Applications _ Richard at FIDO Alliance.pdf
Introduction to FDO and How It works Applications _ Richard at FIDO Alliance.pdf
 
A Business-Centric Approach to Design System Strategy
A Business-Centric Approach to Design System StrategyA Business-Centric Approach to Design System Strategy
A Business-Centric Approach to Design System Strategy
 
WebRTC and SIP not just audio and video @ OpenSIPS 2024
WebRTC and SIP not just audio and video @ OpenSIPS 2024WebRTC and SIP not just audio and video @ OpenSIPS 2024
WebRTC and SIP not just audio and video @ OpenSIPS 2024
 
AI presentation and introduction - Retrieval Augmented Generation RAG 101
AI presentation and introduction - Retrieval Augmented Generation RAG 101AI presentation and introduction - Retrieval Augmented Generation RAG 101
AI presentation and introduction - Retrieval Augmented Generation RAG 101
 
The Metaverse: Are We There Yet?
The  Metaverse:    Are   We  There  Yet?The  Metaverse:    Are   We  There  Yet?
The Metaverse: Are We There Yet?
 
How we scaled to 80K users by doing nothing!.pdf
How we scaled to 80K users by doing nothing!.pdfHow we scaled to 80K users by doing nothing!.pdf
How we scaled to 80K users by doing nothing!.pdf
 
Choosing the Right FDO Deployment Model for Your Application _ Geoffrey at In...
Choosing the Right FDO Deployment Model for Your Application _ Geoffrey at In...Choosing the Right FDO Deployment Model for Your Application _ Geoffrey at In...
Choosing the Right FDO Deployment Model for Your Application _ Geoffrey at In...
 
ASRock Industrial FDO Solutions in Action for Industrial Edge AI _ Kenny at A...
ASRock Industrial FDO Solutions in Action for Industrial Edge AI _ Kenny at A...ASRock Industrial FDO Solutions in Action for Industrial Edge AI _ Kenny at A...
ASRock Industrial FDO Solutions in Action for Industrial Edge AI _ Kenny at A...
 
Working together SRE & Platform Engineering
Working together SRE & Platform EngineeringWorking together SRE & Platform Engineering
Working together SRE & Platform Engineering
 
Extensible Python: Robustness through Addition - PyCon 2024
Extensible Python: Robustness through Addition - PyCon 2024Extensible Python: Robustness through Addition - PyCon 2024
Extensible Python: Robustness through Addition - PyCon 2024
 
Where to Learn More About FDO _ Richard at FIDO Alliance.pdf
Where to Learn More About FDO _ Richard at FIDO Alliance.pdfWhere to Learn More About FDO _ Richard at FIDO Alliance.pdf
Where to Learn More About FDO _ Richard at FIDO Alliance.pdf
 

JAVA 2013 IEEE PARALLELDISTRIBUTION PROJECT Geo community-based broadcasting for data dissemination in mobile social networks

  • 1. Geo-Community-Based Broadcasting for Data Dissemination in Mobile Social Networks ABSTRACT In this paper, we consider the issue of data broadcasting in mobile social networks (MSNets). The objective is to broadcast data from a superuser to other users in the network. There are two main challenges under this paradigm, namely, (a) how to represent and characterize user mobility in realistic MSNets; (b) given the knowledge of regular users’ movements, how to design an efficient superuser route to broadcast data actively. We first explore several realistic datasets to reveal both geographic and social regularities of human mobility, and further propose the concepts of geo-community and geo-centrality into MSNet analysis. Then, we employ a semi-Markov process to model user mobility based on the geo-community structure of the network. Correspondingly, the geo-centrality indicating the “dynamic user density” of each geo-community can be derived from the semi-Markov model. Finally, considering the geo-centrality information, we provide different route algorithms to cater to the superuser that wants to either minimize total duration or maximize dissemination ratio. To the best of our knowledge, this work is the first to study data broadcasting in a realistic MSNet setting. Extensive trace-driven simulations show that our approach consistently outperforms other existing superuser route design algorithms in terms of dissemination ratio and energy efficiency. GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
  • 2. Existing System MOBILE Social Networks (MSNets) are networks in which mobile social users physically interact with each other and further reach network service, even in the absence of network infrastructure or end-to-end connectivity. MSNets can be viewed as a kind of socially aware Delay/Disruption Tolerant Networks (DTNs). However, intermittent and uncertain network connectivity make data dissemination in MSNets a challenging problem. Proposed System: The main idea behinds this is exploring both geographic and social properties of users mobility to facilitate data dissemination on purpose. We explore the geographic and social regularities of users mobility from both theoretical and experimental perspectives. Based on the exploited characterization, we introduce a semi-Markov process for modeling users mobility. The proposed superuser route comprises several geo-communities and the according waiting times, which are both calculated carefully based on the semi-Markov model. Extensive trace- driven simulation results show that our data broadcast schemes perform significantly better than other existing schemes. Architecture: MODULES” 1. Mobileuser. 2. Superuser. 3. Geo-Community. 4. Static Route Algorithm. Super User Mobile User Moving Trace Share DataPrediction Geo-Graph Geo-Community
  • 3. 5. Realistic MSNet Traces. Modules Description 1. Mobileuser Regular users, or simply, the users that move based on their social lives. These users are potential data receivers from the superuser. The movements of the users are not controllable. 2. Superuser A single, special user called superuser (e.g. the salesman) that aims to broadcast data to regular users in the network. In this paper, we only consider one-hop data broadcasting from the superuser to regular users. 3. Geo-Community A community is defined as a clustering of users that are “tightly” linked to each other, either by direct linkage or by some “easily accessible” users that act as intermediates. Members of a community usually share interesting properties, such as common hobbies, social functions, and occupations. On campus, graduate students working in the same office interact more frequently with each other; members affiliating with the same team, such as football or swimming, have such heavy interactions. 4. Static Route Algorithm The total duration T of the superuser route has two components: (a) Waiting time Tw: The sum of waiting times at the chosen geo-communities; (b) Traveling Time Tt: The total time that the superuser spends traveling between geocommunities. The total route time T = Tw + Tt. Assuming that only Tw contributes to the superuser’s data dissemination, the superuser route design algorithm can be broken into two subproblems: finding a good set of geo-communities and their corresponding waiting times, and ordering these geocommunities together to form a tour.
  • 4. 5. Realistic MSNet Traces Mobile users in MSNets usually move around several well-visited locations instead of moving randomly. We explore the realistic traces aiming to reveal the real situation behind such observation. The well-known “small world” phenomenon shows that people usually belong to several communities, and contact others with similar hobbies, occupations, or social functions. System Configuration:- H/W System Configuration:- Processor - Pentium –III Speed - 1.1 Ghz RAM - 256 MB (min) Hard Disk - 20 GB Floppy Drive - 1.44 MB Key Board - Standard Windows Keyboard Mouse - Two or Three Button Mouse Monitor - SVGA
  • 5. S/W System Configuration:-  Operating System :Windows95/98/2000/XP  Application Server : Tomcat5.0/6.X  Front End : HTML, Java, Jsp  Scripts : JavaScript.  Server side Script : Java Server Pages.  Database : Mysql  Database Connectivity : JDBC. CONCLUSION In this paper, we have studied one-hop data broadcasting from a single superuser to other users in MSNets. The main idea behinds this is exploring both geographic and social properties of users mobility to facilitate data dissemination on purpose. We explore the geographic and social regularities of users mobility from both theoretical and experimental perspectives. Based on the exploited characterization, we introduce a semi-Markov process for modeling users mobility. The proposed superuser route comprises several geo- communities and the according waiting times, which are both calculated carefully based on the semi-Markov model. Extensive trace-driven simulation results show that our data broadcast schemes perform significantly better than other existing schemes. We also discuss multiple superuser scheduling and incentive schemes in selfish MSNets in the Appendix.