Society Dissemination Based Propagation For Data Spreading In Mobiles Social Networks

Shaik Mohammad Ayesha, SK. Mubeena Sultana


In mobile ad hoc networks, nodes are dynamically changing their locations. MOBILE ad hoc networks (MANETs) consist of a collection of mobile nodes which can move freely. These nodes can be dynamically self-organized into arbitrary topology networks without a fixed infrastructure. A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. MSNets can be viewed as a kind of socially aware Delay/ Disruption Tolerant Networks (DTNs). Thanks to the popularization of smart phones (e.g., iPhone, Nokia N95,and Blackberry), MSNets have begun to attract more attention. However, intermittent and uncertain network connectivity make data dissemination in MSNets a challenging problem. Broadcasting is the operation of sending data from a source user to all other users in the network. Most of the envisioned services (ranging from safety applications to traffic management) rely on broadcasting data to the users inside a certain area of interest. For example, location-based services (product prices, tourist points of interest, etc.) can be advertised from salesmen to near-by users. In this paper The objective is to broadcast data from a superuser to other users in the network. There are two main challenges under this paradigm, namely 1) how to represent and characterize user mobility in realistic MSNets; 2) given the knowledge of regular users' movements, how to design an efficient superuser route to broadcast data actively. We first explore several realistic data sets to reveal both geographic and social regularities of human mobility, and further propose the concepts of geocommunity and geocentrality into MSNet analysis.


Mobile social networks, data dissemination, broadcasting, geography, community, acknowledgement.


.Geo-Community-Based Broadcasting for Data Dissemination in Mobile Social Networks, IEEE transactions on parallel and distributed systems, 2013 [2] S. Ioannidis, A. Chaintreau, and L. Massoulie. Optimal and scalable distribution of content updates over a mobile social network. In Proc. IEEE INFOCOM, 2009.

B. Han, P. Hui, V. S. A. Kumar, M. V. Marathe, and G. Pei. Cellular traffic offloading through opportunistic communications: A case study. In Proc. ACM CHANTS, 2010.

J. Wu and F. Dai. Efficient broadcasting with guaranteed coverage in mobile ad hoc networks. IEEE Trans. Mobile Computing, 4(3):1–12, May/June 2005.

S. Yang and J. Wu. Efficient broadcasting using network coding and directional antennas in MANETs. IEEE Trans. Parallel and Distributed Systems, 21(2):148–161, Feb. 2010.

P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: Social-based forwarding in delay tolerant networks. In Proc. ACM MobiHoc, 2008.

W. Gao, Q. Li, B. Zhao, and G. Cao. Multicasting in delay tolerant networks: A social network perspective. In Proc. ACM MobiHoc, 2009.

F. J. Ros, P. M. Ruiz, and I. Stojmenovic Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad-hoc networks. IEEE Trans. Mobile Computing. To appear.

W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proc. ACM MobiHoc, 2004. [10] W. Zhao, M. Ammar, and E. Zegura.

Controlling the mobility of multiple data transport ferries in a delay-tolerant network. In Proc IEEE INFOCOM, 2005.

R. Shah, S. Roy, S. Jain, and W. Brunette. Data MULEs: Modeling a three-tier architecture for sparse sensor networks. Elsevier Ad Hoc Networks Journal, 1:215–233, Sep. 2003.

J. Wu, S. Yang, and F. Dai. Logarithmic storecarry-forward routing in mobile ad hoc networks.

IEEE Trans. Parallel and Distributed Systems, 18(6):735–748, Jun. 2007.

M. Tariq, M. Ammar, and E. Zegura. Message ferry route design for sparse ad hoc networks with mobile nodes. In Proc. ACM MobiHoc, 2006.

Q. Yuan, I. Cardei, and J. Wu. Predict and relay: An efficient routing in disruption-tolerant networks. In Proc. ACM MobiHoc, 2009.

J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau.CRAWDAD data set cambridge/haggle (v. 2009-05-29). Downloaded from, May 2009.

N. Eagle, A. Pentland, and D. Lazer. Inferring social network structure using mobile phone data. In Proc. PNAS, volume 106(36), pages 15274– 15278, 2009.

A. Peddemors, H. Eertink, and I. Niemegeers.

CoSphere data set. Downloaded from, May 2008.

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at