{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T09:47:14Z","timestamp":1753868834677,"version":"3.41.2"},"reference-count":34,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T00:00:00Z","timestamp":1708905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/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":[[2024,5,25]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>Opportunistic network (OppNet) belongs to the category of Mobile Ad\u2010hoc Networks (MANETs), a kind of Delay Tolerant Network (DTN), where the wireless nodes are completely mobile and the data transmission routes are dynamic. The major challenge in developing a routing model for such a network is the unpredictable nature of the movement of the nodes. In this paper, a spatiotemporal prediction model based on human mobility pattern is proposed using Bayesian posterior probability (BPPR) where several clusters are identified within the network and the day and time duration of nodes visiting those clusters are recorded. The Bayesian posterior probability is then used to determine the probability of the neighbor node visiting the destination's cluster. If the calculated probability for that node is higher than a specified threshold, the packet will be forwarded. A comparison of the results obtained on simulation is made with benchmark models\u2014Epidemic, Prophet, HBPR, EDR, NexT, and EBC, to name a few, where it is found that on average the proposed model outperforms the other models in terms of delivery probability, hop count and number of messages dropped by around 23.89%, 24.8%, 24.4%, 37%, 11%, and 42% respectively, with varying number of nodes, TTL, message generation interval, and buffer size. Similar improvements have been observed in terms of the other two metrics. In terms of overhead ratio, the proposed model outperforms Epidemic, Prophet, HBPR, NexT, and EBC. However, as the number of nodes and TTL are varied, BPPR performs better than NexT by around 9% and 12%, respectively, in terms of average latency.<\/jats:p>","DOI":"10.1002\/dac.5741","type":"journal-article","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T23:30:35Z","timestamp":1708990235000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Bayesian approach using spatiotemporal features for suitable next hop selection in opportunistic networks"],"prefix":"10.1002","volume":"37","author":[{"given":"Amit","family":"Dutta","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering NERIST Nirjuli Itanagar India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satya Jyoti","family":"Borah","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering NERIST Nirjuli Itanagar India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-8044-0791","authenticated-orcid":false,"given":"Jagdeep","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering Sant Longowal Institute of Engineering and Technology Longowal India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2024,2,26]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.248176"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2008.4644117"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/35.968817"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470740125"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1201\/b10904"},{"key":"e_1_2_7_7_1","doi-asserted-by":"crossref","unstructured":"SunJ\u2010Z.Mobile ad hoc networking: an essential technology for pervasive computing. 2001 International Conferences on Info\u2010Tech and Info\u2010Net. Proceedings (Cat. No.01EX479) Beijing China.2001;3:316\u2010321. doi:10.1109\/ICII.2001.983076","DOI":"10.1109\/ICII.2001.983076"},{"key":"e_1_2_7_8_1","doi-asserted-by":"crossref","unstructured":"FallK(2003).A delay\u2010tolerant network architecture for challenged internets. In Proceedings of the 2003 conference on Applications technologies architectures and protocols for computer communications (pp.27\u201034).","DOI":"10.1145\/863955.863960"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.icte.2017.11.009"},{"key":"e_1_2_7_10_1","doi-asserted-by":"crossref","unstructured":"LuS LiuY LiuY KumarM.LOOP: a location based routing scheme for opportunistic networks. 2012 IEEE 9th International Conference on Mobile Ad\u2010Hoc and Sensor Systems (MASS 2012) Las Vegas NV USA.2012;118\u2010126. doi:10.1109\/MASS.2012.6502509","DOI":"10.1109\/MASS.2012.6502509"},{"key":"e_1_2_7_11_1","doi-asserted-by":"crossref","unstructured":"ZengJ TangH WuY LiuL HirokawaS.Predict the next location from trajectory based on spatiotemporal sequence. 2019 8th International Congress on Advanced Applied Informatics (IIAI\u2010AAI) Toyama Japan.2019:109\u2010114. doi:10.1109\/IIAI\u2010AAI.2019.00032","DOI":"10.1109\/IIAI-AAI.2019.00032"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12652\u2010018\u20100697\u20103"},{"key":"e_1_2_7_13_1","doi-asserted-by":"crossref","unstructured":"ThakkarJ VyasS PanchalV LokareR.Future location estimation of a mobile user (April 8 2019). 2nd International Conference on Advances in Science & Technology (ICAST) 2019 on 8th 9th April 2019 by K J Somaiya Institute of Engineering & Information Technology Mumbai India. Available at SSRN:https:\/\/2.zoppoz.workers.dev:443\/https\/ssrn.com\/abstract=3367689or doi:10.2139\/ssrn.3367689","DOI":"10.2139\/ssrn.3367689"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/02564602.2017.1304834"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.17762\/ijcnis.v10i1.3283"},{"key":"e_1_2_7_16_1","unstructured":"BapierreH.Context specific next location prediction(Doctoral dissertation M\u00fcnchen Technische Universit\u00e4t M\u00fcnchen Diss. 2014).2014."},{"key":"e_1_2_7_17_1","unstructured":"VahdatA BeckerD.Epidemic routing for partially connected ad hoc networks. Technical Report CS\u20102000\u201006 Dept. of Computer Science Duke University Durham NC USA;2000."},{"key":"e_1_2_7_18_1","doi-asserted-by":"crossref","unstructured":"SpyropoulosT PsounisK RaghavendraCS.Spray and wait: an efficient routing scheme for intermittently connected mobile networks. Proc. of SIGCOMM Workshop on Delay\u2010Tolerant Networking PA USA Aug. 22\u201026;2005:252\u2010259.","DOI":"10.1145\/1080139.1080143"},{"key":"e_1_2_7_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"e_1_2_7_20_1","doi-asserted-by":"crossref","unstructured":"DhurandherSK SharmaDK WoungangI BhatiS.HBPR: history based prediction for routing in infrastructure\u2010less opportunistic networks. Proc. of 27th IEEE AINA 2013 Barcelona Spain.931\u2010936.","DOI":"10.1109\/AINA.2013.105"},{"key":"e_1_2_7_21_1","doi-asserted-by":"crossref","unstructured":"DhurandherSK BorahSJ ObaidatMS SharmaDK GuptaS BaruahB.Probability\u2010based controlled flooding in opportunistic networks. 2015 12th International Joint Conference on e\u2010Business and Telecommunications (ICETE) Colmar France;2015:3\u20108.","DOI":"10.5220\/0005580300030008"},{"key":"e_1_2_7_22_1","doi-asserted-by":"crossref","unstructured":"DhurandherSK BorahS WoungangI SharmaDK AroraK AgarwalD.EDR: an encounter and distance based routing protocol for opportunistic networks. 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA);2016:297\u2010302. doi:10.1109\/AINA.2016.15","DOI":"10.1109\/AINA.2016.15"},{"key":"e_1_2_7_23_1","unstructured":"BorahSJ SinghJ SinghTD.EBC: encounter buffer and contact duration\u2010based routing protocol in opportunistic networks. Accepted for publication in the proceedings of Widecom 2022 University of Windsor Windsor Canada; October2022:1\u20106. Springer."},{"key":"e_1_2_7_24_1","doi-asserted-by":"publisher","DOI":"10.3390\/fi10080074"},{"key":"e_1_2_7_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-75626-4_17"},{"key":"e_1_2_7_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.08.008"},{"key":"e_1_2_7_27_1","doi-asserted-by":"crossref","unstructured":"TianS ZhangX ZhangY CaoZ CaoW.Spatio\u2010temporal position prediction model for mobile users based on LSTM. In 2019 IEEE 25th International Conference on Parallel and Distributed Systems (ICPADS);2019:967\u2010970. IEEE.","DOI":"10.1109\/ICPADS47876.2019.00146"},{"key":"e_1_2_7_28_1","doi-asserted-by":"crossref","unstructured":"ChenY LongC CongG LiC.Context\u2010aware deep model for joint mobility and time prediction. In Proceedings of the 13th International Conference on Web Search and Data Mining;2020:106\u2010114.","DOI":"10.1145\/3336191.3371837"},{"key":"e_1_2_7_29_1","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS\u2010210807"},{"key":"e_1_2_7_30_1","doi-asserted-by":"publisher","DOI":"10.1049\/cmu2.12254"},{"key":"e_1_2_7_31_1","unstructured":"Barun Saha's blog on delay tolerant networks.https:\/\/2.zoppoz.workers.dev:443\/http\/delay-tolerant-networks.blogspot.com\/p\/one-tutorial.html"},{"key":"e_1_2_7_32_1","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nenA OttJ K\u00e4rkk\u00e4inenT.The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques;2009:1\u201010.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"e_1_2_7_33_1","doi-asserted-by":"publisher","DOI":"10.4304\/jcm.5.2.92\u2010105"},{"key":"e_1_2_7_34_1","doi-asserted-by":"publisher","DOI":"10.9790\/2834\u201015010110118"},{"key":"e_1_2_7_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106205"}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.5741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T22:57:46Z","timestamp":1731452266000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.5741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,26]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,5,25]]}},"alternative-id":["10.1002\/dac.5741"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/dac.5741","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"type":"print","value":"1074-5351"},{"type":"electronic","value":"1099-1131"}],"subject":[],"published":{"date-parts":[[2024,2,26]]},"assertion":[{"value":"2023-09-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-28","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e5741"}}