The Effective Way of Data Dissemination in Mobile Social Networks

  • Unique Paper ID: 145610
  • PageNo: 468-471
  • Abstract:
  • This work focus on their incorporation of into their data dissemination in mobile social networks with selfish nodes of the networks. They key challenge of their enabling incentives mechanism is to the effectively track base to their value of a message under such as an unique network setting with in intermittent connectivity and multiple interest data type in networks. We propose two data dissemination models they are: data pulling model when mobile users pull data the data providers, then data pushing model where data providers generate personalized data and push them their intended personalized users. For data pulling model, we can present effective mechanisms to estimate the expected credit reward of a given message that helps nodes to evaluate the potential reward. This can be message a communication is they formulated as their two-person cooperative game they are, whose solution is given found by a given approach which is achieves pareto optimality. They check buying process rules formulated by an online acction model to further accelerate the circulation is credits. Extensive simulations carried out based on their real-world traces are show the proposed schemes achieve to be better performance than their fully cooperative scheme ,but they significantly reduce cost. Under the data pushing model it can eliminating the needs of accurate knowledge about and they how many credits data providers should pay.

Copyright & License

Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

BibTeX

@article{145610,
        author = {I.SUBBA REDDY and M.PADMAVATHAMMA},
        title = {The Effective Way of Data Dissemination in Mobile Social Networks},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {10},
        pages = {468-471},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145610},
        abstract = {This work focus on their incorporation of  into their data dissemination in  mobile social networks with selfish nodes of the networks. They key challenge of their enabling incentives mechanism is to the effectively track base to their value of a message under such as an unique network setting with in intermittent connectivity and multiple interest data type in networks. We propose two data dissemination models they are: data pulling model when mobile users pull data the data providers, then data pushing model where data providers generate personalized data and push them their intended personalized users. For data pulling model, we can present effective mechanisms to estimate the expected credit reward of a  given message that helps  nodes to evaluate the potential reward. This can be message a communication is they formulated as their two-person cooperative game they are, whose solution is given found by a given approach which is achieves pareto optimality. They check buying process rules formulated by an online acction model to further accelerate the circulation is credits. Extensive simulations carried out based on their real-world traces are show the proposed schemes achieve to be better performance than their fully cooperative scheme ,but they significantly reduce cost. Under the data pushing model it can  eliminating the needs of accurate knowledge about and they how many credits data providers should pay.},
        keywords = {Incentive, Data Dissemination, autonomous mobile social networks, data pulling and pushing methods, secretary problem.},
        month = {},
        }

Cite This Article

REDDY, I., & M.PADMAVATHAMMA, (). The Effective Way of Data Dissemination in Mobile Social Networks. International Journal of Innovative Research in Technology (IJIRT), 4(10), 468–471.

Related Articles