{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:37:25Z","timestamp":1760240245974,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:00:00Z","timestamp":1555459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1804164. U1404602, U1604156"],"award-info":[{"award-number":["U1804164. U1404602, U1604156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>The performance of mobile opportunistic networks mainly relies on collaboration among nodes. Thus far, researchers have ignored the influence of node sociality on the incentive process, leading to poor network performance. Considering the fact that followers always imitate the behavior of superstars, this paper proposes FollowMe, which integrates the social importance of nodes with evolutionary game theory to improve the collaborative behavior of nodes. First, we use the prisoner\u2019s dilemma model to establish the matrix of game gains between nodes. Second, we introduce the signal reference as a game rule between nodes. The number of nodes choosing different strategies in a game round is used to calculate the cumulative income of the node in combination with the probability formula. Finally, the Fermi function is used to determine whether the node updates the strategy. The simulation results show that, compared with the random update rule, the proposed strategy is more capable of promoting cooperative behavior between nodes to improve the delivery rate of data packets.<\/jats:p>","DOI":"10.3390\/fi11040098","type":"journal-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T07:58:09Z","timestamp":1555487889000},"page":"98","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["FollowMe: One Social Importance-Based Collaborative Scheme in MONs"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0023-1194","authenticated-orcid":false,"given":"Peiyan","family":"Yuan","sequence":"first","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang 453000, Henan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3523-8070","authenticated-orcid":false,"given":"Xiaoxiao","family":"Pang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang 453000, Henan, China"}]},{"given":"Ping","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang 453000, Henan, China"}]},{"given":"En","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang 453000, Henan, China"}]}],"member":"1968","published-online":{"date-parts":[[2019,4,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/MCOM.2014.6871666","article-title":"Opportunities in mobile crowd sensing","volume":"52","author":"Ma","year":"2014","journal-title":"IEEE Commun. Mag."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/TDSC.2014.2316816","article-title":"Secure data aggregation technique for wireless sensor networks in the presence of collusion attacks","volume":"12","author":"Rezvani","year":"2015","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Sharma, A. (2015, January 11\u201313). A credit based routing mechanism to contrast selfish nodes in Delay tolerant networks. Proceedings of the International Conference on Parallel, Distributed and Grid Computing, Solan, India.","DOI":"10.1109\/PDGC.2014.7030759"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Shevade, U., Song, H.H., Qiu, V., and Zhang, Y. (2008, January 19\u201322). Incentive-aware routing in DTNs. Proceedings of the IEEE International Conference on Network Protocols, Orlando, FL, USA.","DOI":"10.1109\/ICNP.2008.4697042"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.obhdp.2016.08.006","article-title":"Blame the shepherd not the sheep: Imitating higher-ranking transgressors mitigates punishment for unethical behavior","volume":"137","author":"Bauman","year":"2016","journal-title":"Organ. Behav. Hum. Decis. Process."},{"key":"ref_6","unstructured":"Shen, X.L., Zhang, K.Z.K., and Zhao, S.J. (2016). Herd Behavior in Consumers\u2019 Adoption of Online Reviews, John Wiley and Sons, Inc."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.physa.2015.05.029","article-title":"Imitating winner or sympathizing loser? Quadratic effects on cooperative behavior in prisoners\u2019 dilemma games","volume":"436","author":"Lu","year":"2015","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_8","first-page":"1738","article-title":"A reputation-based incentive scheme for delay tolerant networks","volume":"42","author":"Zhang","year":"2014","journal-title":"Acta Electron. Sin."},{"key":"ref_9","unstructured":"Hubaux, J.P. (2003). Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks, Springer."},{"key":"ref_10","first-page":"126","article-title":"Game analysis of incentive-cooperative mechanism in opportunistic routing","volume":"36","author":"Long","year":"2010","journal-title":"Comput. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Vincent, T.L. (1994). An Evolutionary Game Theory for Differential Equation Models with Reference to Ecosystem Management, Springer.","DOI":"10.1007\/978-1-4612-0245-5_20"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3640","DOI":"10.1016\/j.physa.2013.04.031","article-title":"Cautious strategy update promotes cooperation in spatial prisoner\u2019s dilemma game","volume":"392","author":"Liu","year":"2013","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_13","first-page":"59","article-title":"A formal model based on Game Theory for the analysis of cooperation in distributed service discovery","volume":"326","author":"Val","year":"2016","journal-title":"Inf. Sci. Int. J."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.physa.2016.01.032","article-title":"Cooperation in memory-based prisoner\u2019s dilemma game on interdependent networks","volume":"450","author":"Luo","year":"2016","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.physleta.2014.12.051","article-title":"Spatial prisoner\u2019s dilemma games with increasing neighborhood size and individual diversity on two interdependent lattices","volume":"379","author":"Meng","year":"2015","journal-title":"Phys. Lett. A"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.jnca.2016.01.006","article-title":"Recent progress in routing protocols of mobile opportunistic networks","volume":"62","author":"Yuan","year":"2016","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","article-title":"Network robustness and fragility: Percolation on random graphs","volume":"85","author":"Callaway","year":"2000","journal-title":"Phys. Rev. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Yuan, P., Ma, H., and Fu, H. (2015). Hotspot-Entropy Based Data Forwarding in Opportunistic Social Networks, Elsevier Science Publishers B.V.","DOI":"10.1016\/j.pmcj.2014.06.003"},{"key":"ref_19","unstructured":"Jiang, A.X., and Leyton-Brown, K. (2008). A Tutorial on the Proof of the Existence of Nash Equilibria, University of British Columbia."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Lindgren, A., and Doria, A. (2003, January 1\u20133). Probabilistic routing in intermittently connected networks. Proceedings of the ACM International Symposium on Mobilde Ad Hoc Networking and Computing, Annapolis, MD, USA.","DOI":"10.1145\/961268.961272"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Daly, E.M., and Haahr, M. (2007, January 9\u201314). Social network analysis for routing in disconnected delay-tolerant MANETs. Proceedings of the ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, Montreal, QC, Canada.","DOI":"10.1145\/1288107.1288113"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1109\/TNET.2011.2120618","article-title":"On the levy-walk nature of human mobility","volume":"19","author":"Rhee","year":"2011","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/4\/98\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:46:04Z","timestamp":1760186764000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/4\/98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,17]]},"references-count":22,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,4]]}},"alternative-id":["fi11040098"],"URL":"https:\/\/doi.org\/10.3390\/fi11040098","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2019,4,17]]}}}