{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T11:30:38Z","timestamp":1772451038361,"version":"3.50.1"},"reference-count":43,"publisher":"Wiley","issue":"9","license":[{"start":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T00:00:00Z","timestamp":1583107200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int J Communication"],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>Opportunistic networking enables users to communicate in an environment where connectivity is intermittent or unstable. However, such networking scheme assumes that mobile nodes voluntary cooperate, which cannot be guaranteed. Some nodes can simply exhibit selfish behavior and thus diminish the effectiveness of the approach. In this paper, a game scenario is formulated in which the nodes try to convince each other to participate in packets forwarding. Each node is considered as a player in this game. When a node comes in the communication range of another, a bargaining game starts between them as part of the message forwarding process. Both players try to have a mutual agreement on a price for message forwarding. We present a new incentive mechanism called evolutionary bargaining\u2010based incentive scheme (EBIS) to motivate selfish nodes to cooperate in data forwarding. In EBIS, a node negotiates with other nodes to obtain an agreeable amount of credit for its forwarding service. Nodes apply a sequential bargaining game and then adapt their strategies using an evolutionary model to maximize the probability of reaching an agreement. Unlike classical bargaining games, nodes in our model are boundedly rational. In addition, we use the evolutionary stable strategy (ESS) concept to determine the adaptive strategies for the nodes. The comparison of EBIS with a benchmarked model demonstrates that EBIS performs better in terms of packet delivery ratio and average latency.<\/jats:p>","DOI":"10.1002\/dac.4377","type":"journal-article","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T04:40:35Z","timestamp":1583210435000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An evolutionary bargaining\u2010based approach for incentivized cooperation in opportunistic networks"],"prefix":"10.1002","volume":"33","author":[{"given":"Ossama","family":"Nazih","sequence":"first","affiliation":[{"name":"Department of Computer Sciences, National School of Applied Sciences University of Ibn Tofail  Kenitra Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1804-6977","authenticated-orcid":false,"given":"Nabil","family":"Benamar","sequence":"additional","affiliation":[{"name":"Department of Computer Sciences, School of Technology Moulay Ismail University of Meknes  Morocco"}]},{"given":"Mohamed","family":"Younis","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Electrical Engineering University of Maryland  Baltimore Maryland USA"}]}],"member":"311","published-online":{"date-parts":[[2020,3,2]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"crossref","unstructured":"YangS YangX ZhangC SpyrouE.Human mobility models for opportunistic networks.IEEE Commun. Mag. no. December 2011: pp.157\u2013165.","DOI":"10.1109\/MCOM.2011.6094021"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29031-7"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2019.04.005"},{"key":"e_1_2_7_5_1","doi-asserted-by":"crossref","unstructured":"JenkinsA KuzminskyS GiffordKK PittsRL NicholsK.Delay\/disruption\u2010tolerant networking: flight test results from the international space station.IEEE Aerosp. Conf. Proc. 2010.","DOI":"10.1109\/AERO.2010.5446948"},{"key":"e_1_2_7_6_1","doi-asserted-by":"crossref","unstructured":"LiuT SadlerCM ZhangP MartonosiM.Implementing software on resource\u2010constrained mobile sensors.2004: p.256.","DOI":"10.1145\/990064.990095"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2010.03.017"},{"key":"e_1_2_7_8_1","doi-asserted-by":"crossref","unstructured":"CoutinhoMM MoreiraT SilvaE EfratA JohnsonT.A new proposal of data mule network focused on Amazon riverine population.ACM Int. Conf. Proceeding Ser. 2011.","DOI":"10.1145\/2414393.2414403"},{"key":"e_1_2_7_9_1","doi-asserted-by":"crossref","unstructured":"NtaremeH ZennaroM PehrsonB.Delay tolerant network on smartphones: applications for communication challenged areas.third Extrem. Work. Commun. 2011: pp.1\u20136.","DOI":"10.1145\/2414393.2414407"},{"key":"e_1_2_7_10_1","unstructured":"HuangCM LanKC TsaiCZ.A survey of opportunistic networks \u201dProc. \u2010 Int. Conf. Adv. Inf. Netw. Appl. AINA 2008: pp.1672\u20131677."},{"key":"e_1_2_7_11_1","first-page":"1","article-title":"Hybrid delay tolerant network routing protocol for heterogeneous networks","volume":"148","author":"Arbi E","year":"2019","journal-title":"J Netw Comput Appl"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2009.2020105"},{"key":"e_1_2_7_13_1","doi-asserted-by":"crossref","unstructured":"LiN DasSK.RADON: reputation\u2010assisted data forwarding in opportunistic networks \u201dProc. Second Int. Work. Mob. Opportunistic Netw. \u2010 MobiOpp'10 2010: p.8.","DOI":"10.1145\/1755743.1755746"},{"key":"e_1_2_7_14_1","doi-asserted-by":"crossref","unstructured":"ChenBB ChanMC.MobiCent: a credit\u2010based incentive system for disruption tolerant network.Proc. \u2010 IEEE INFOCOM 2010.","DOI":"10.1109\/INFCOM.2010.5462136"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35612-9_9"},{"key":"e_1_2_7_16_1","doi-asserted-by":"crossref","unstructured":"ChenB MaoJL GuoN QiaoGH DaiN.An incentive detection mechanism for cooperation of nodes selfish behavior in wireless sensor networks.2013 25th Chinese Control Decis. Conf. CCDC 2013 2013: pp.4021\u20134024.","DOI":"10.1109\/CCDC.2013.6561653"},{"key":"e_1_2_7_17_1","first-page":"303","article-title":"Incentive\u2010compatible opportunistic routing for wireless networks","author":"Wu F","year":"2008","journal-title":"ACM MobiCom"},{"key":"e_1_2_7_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/07421222.1996.11518135"},{"key":"e_1_2_7_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.06.020"},{"key":"e_1_2_7_20_1","doi-asserted-by":"crossref","unstructured":"ShevadeU SongHH QiuL ZhangY. \u201cIncentive\u2010aware routing in DTNs \u201dProc. \u2010 Int. Conf. Netw. Protoc. ICNP 2008: pp.238\u2013247.","DOI":"10.1109\/ICNP.2008.4697042"},{"key":"e_1_2_7_21_1","doi-asserted-by":"crossref","unstructured":"SocievoleA De RangoF CaputoA MaranoS.Simulating node selfishness in opportunistic networks.Proc. 2016 Int. Symp. Perform. Eval. Comput. Telecommun. Syst. SPECTS 2016 \u2010 Part SummerSim 2016 Multiconference 2016.","DOI":"10.1109\/SPECTS.2016.7570516"},{"key":"e_1_2_7_22_1","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nenA Pitk\u00e4nenM VuoriM OttJ.Effect of non\u2010cooperative nodes in mobile DTNs.2011 IEEE Int. Symp. a World Wireless Mob. Multimed. Networks WoWMoM 2011 \u2010 Digit. Proc. 2011.","DOI":"10.1109\/WoWMoM.2011.5986144"},{"key":"e_1_2_7_23_1","doi-asserted-by":"crossref","unstructured":"ZhengT WangY MaX.Effects of selfishness in the opportunistic network under two different movement models.ICEIEC 2016 \u2010 Proc. 2016 IEEE 6th Int. Conf. Electron. Inf. Emerg. Commun. 2016: pp.240\u2013244.","DOI":"10.1109\/ICEIEC.2016.7589729"},{"key":"e_1_2_7_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijinfomgt.2012.11.001"},{"key":"e_1_2_7_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2149552"},{"key":"e_1_2_7_26_1","unstructured":"LiY YuJ WangC LiuQ CaoB DaneshmandM.A novel bargaining based incentive protocol for opportunistic networks.GLOBECOM \u2010 IEEE Glob. Telecommun. Conf. 2012: pp.5285\u20135289."},{"key":"e_1_2_7_27_1","doi-asserted-by":"crossref","unstructured":"WuF ChenT ZhongS LiLE YangYR.Incentive\u2010compatible opportunistic routing for wireless networks.Proc. 14th ACM Int. Conf. Mob. Comput. Netw. \u2013 MobiCom'08 2008: p.303.","DOI":"10.1145\/1409944.1409979"},{"key":"e_1_2_7_28_1","unstructured":"BansalS BakerM.Observation\u2010based cooperation enforcement in ad hoc networks.Proc. Comput. Res. Repos. 2003: pp.1\u201310."},{"key":"e_1_2_7_29_1","unstructured":"HeQHQ WuDWD KhoslaP.SORI: a secure and objective reputation\u2010based incentive scheme for ad\u2010hoc networks.2004 IEEE Wirel. Commun. Netw. Conf. (IEEE Cat. No.04TH8733) vol. 2 pp. 825\u2010830 Vol.2 2004."},{"key":"e_1_2_7_30_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-net.2017.0079"},{"key":"e_1_2_7_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2477164"},{"key":"e_1_2_7_32_1","doi-asserted-by":"crossref","unstructured":"WuF ChenT ZhongS QiaoC ChenG.A bargaining\u2010based approach for incentive\u2010compatible message forwarding in opportunistic networks.IEEE Int. Conf. Commun. 2012: pp.789\u2013793.","DOI":"10.1109\/ICC.2012.6363685"},{"key":"e_1_2_7_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2334655"},{"key":"e_1_2_7_34_1","doi-asserted-by":"crossref","unstructured":"OsborneMJ.A Course in Game Theory 1995; vol. 29 no. 3.","DOI":"10.1016\/0898-1221(95)90101-9"},{"key":"e_1_2_7_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2472289"},{"key":"e_1_2_7_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.120413.130670"},{"key":"e_1_2_7_37_1","doi-asserted-by":"crossref","unstructured":"NagrathP.Analysis of malicious activity in delay tolerant networks.2016 1st Int. Conf. Innov. Challenges Cyber Secur. (ICICCS 2016) no. Iciccs 2016: pp.17\u201320.","DOI":"10.1109\/ICICCS.2016.7542331"},{"key":"e_1_2_7_38_1","doi-asserted-by":"crossref","unstructured":"SouzaC MotaE GalvaoL ManzoniP CanoJC CalafateCT. \u201cFSF: friendship and selfishness forwarding for delay tolerant networks \u201dIEEE Symp. Comput. Commun. 2016.","DOI":"10.1109\/ISCC.2016.7543899"},{"key":"e_1_2_7_39_1","unstructured":"JinN TsangE.Co\u2010evolutionary strategies for an alternating\u2010offer bargaining problem.IEEE 2005 Symp. Comput. Intell. Games CIG'05 2005: pp.211\u2013217."},{"key":"e_1_2_7_40_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1997.2387"},{"key":"e_1_2_7_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-54962-8"},{"key":"e_1_2_7_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.07.013"},{"key":"e_1_2_7_43_1","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nenA.The ONE simulator for DTN protocol evaluation.Proc. Second Int. ICST Conf. Simul. Tools Tech. 2009: p.55.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"e_1_2_7_44_1","unstructured":"andF\u00f6rsterKKA DedeJ F\u00f6rsterA Hern\u00e1ndez\u2010oralloE Herrera\u2010tapiaJ.Simulating opportunistic networks: survey and future directions simulating opportunistic networks: survey and future directions.IEEE Commun. Surv. Tutorials 2018."}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fdac.4377","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.4377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T03:11:39Z","timestamp":1694056299000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.4377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,2]]},"references-count":43,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1002\/dac.4377"],"URL":"https:\/\/doi.org\/10.1002\/dac.4377","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"value":"1074-5351","type":"print"},{"value":"1099-1131","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,2]]},"assertion":[{"value":"2019-10-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-18","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e4377"}}