{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T20:53:16Z","timestamp":1769633596440,"version":"3.49.0"},"reference-count":37,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":159,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002862","name":"China University of Petroleum, Beijing","doi-asserted-by":"publisher","award":["2462020YJRC001"],"award-info":[{"award-number":["2462020YJRC001"]}],"id":[{"id":"10.13039\/501100002862","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>A challenged network is one where traditional hypotheses such as reduced data transfer error rates, end\u2010to\u2010end connectivity, or short transmissions have not gained much significance. A wide range of application scenarios are associated with such networks. Delay tolerant networking (DTN) is an approach that pursues to report the problems which reduce communication in disrupted networks. DTN works on store\u2010carry and forward mechanism in such a way that a message may be stored by a node for a comparatively large amount of time and carry it until a proper forwarding opportunity appears. To store a message for long delays, a proper buffer management scheme is required to select a message for dropping upon buffer overflow. Every time dropping messages lead towards the wastage of valuable resources which the message has already consumed. The proposed solution is a size\u2010based policy which determines an inception size for the selection of message for deletion as buffer becomes overflow. The basic theme behind this scheme is that by determining the exact buffer space requirement, one can easily select a message of an appropriate size to be discarded. By doing so, it can overcome unnecessary message drop and ignores biasness just before selection of specific sized message. The proposed scheme Spontaneous Size Drop (SS\u2010Drop) implies a simple but intelligent mechanism to determine the inception size to drop a message upon overflow of the buffer. After simulation in ONE (Opportunistic Network Environment) simulator, the SS\u2010Drop outperforms the opponent drop policies in terms of high delivery ratio by giving 66.3% delivery probability value and minimizes the overhead ratio up to 41.25%. SS\u2010Drop also showed a prominent reduction in dropping of messages and buffer time average.<\/jats:p>","DOI":"10.1155\/2021\/9773402","type":"journal-article","created":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T17:20:52Z","timestamp":1623259252000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["SS\u2010Drop: A Novel Message Drop Policy to Enhance Buffer Management in Delay Tolerant Networks"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6313-6368","authenticated-orcid":false,"given":"Obaid ur","family":"Rehman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1813-1415","authenticated-orcid":false,"given":"Irshad Ahmed","family":"Abbasi","sequence":"additional","affiliation":[]},{"given":"Hythem","family":"Hashem","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7580-6007","authenticated-orcid":false,"given":"Khalid","family":"Saeed","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9734-1191","authenticated-orcid":false,"given":"Muhammad Faran","family":"Majeed","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2753-8615","authenticated-orcid":false,"given":"Sikandar","family":"Ali","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"e_1_2_11_1_2","unstructured":"FulvioR. Application-gateway in a DTN environment 2021."},{"key":"e_1_2_11_2_2","article-title":"An efficient routing protocol with overload control for group mobility in delay tolerant networking","volume":"10","author":"Wook K. M.","year":"2021","journal-title":"Electronics"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.nhres.2020.12.002"},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJSN.2021.112838"},{"key":"e_1_2_11_5_2","unstructured":"DavidR. ArshadJ. andLucaM. Protocol transformation for transiently powered wireless sensor networks Proceedings of the 36th Annual ACM Symposium on Applied Computing 2021 Virtual Event Republic of Korea 1112\u20131121."},{"key":"e_1_2_11_6_2","unstructured":"KevinF. A delay-tolerant network architecture for challenged internets Proceedings of the 2003 conference on Applications technologies architectures and protocols for computer communications 2003 Karlsruhe Germany 27\u201334."},{"key":"e_1_2_11_7_2","first-page":"297","volume-title":"Intelligent and Cloud Computing","author":"Satya R. D.","year":"2021"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-019-06543-3"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-020-02416-x"},{"key":"e_1_2_11_10_2","article-title":"Buffer scheduling policy for opportunistic networks","volume":"2","author":"Ayub Q.","year":"2011","journal-title":"International Journal of Scientific & Engineering Research"},{"key":"e_1_2_11_11_2","first-page":"781","volume-title":"Evolutionary Computing and Mobile Sustainable Networks","author":"Nidhi S.","year":"2021"},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-017-0394-0"},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-018-5861-8"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1802-4"},{"key":"e_1_2_11_15_2","unstructured":"YongL. MengjiongQ. DepengJ. LiS. andLieguangZ. Adaptive optimal buffer management policies for realistic DTN GLOBECOM 2009-2009 IEEE Global Telecommunications Conference 2009 Honolulu HI USA 1\u20135."},{"key":"e_1_2_11_16_2","first-page":"118","article-title":"E-drop: An effective drop buffer management policy for DTN routing protocols","volume":"13","author":"Sulma R.","year":"2011","journal-title":"International Journal of Computer Applications"},{"key":"e_1_2_11_17_2","first-page":"117","article-title":"Survey of buffer management policies for delay tolerant networks","volume":"2014","author":"Sweta J.","year":"2014","journal-title":"The Journal of Engineering"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-014-2066-7"},{"key":"e_1_2_11_19_2","first-page":"118","article-title":"Efficient buffer management policy DLA for DTN routing protocols under congestion","volume":"2","author":"Sulma R.","year":"2010","journal-title":"International Journal of computer and Network Security"},{"key":"e_1_2_11_20_2","doi-asserted-by":"publisher","DOI":"10.5120\/2278-2950"},{"key":"e_1_2_11_21_2","first-page":"456","article-title":"Comparision of MOFO drop policy with new efficient buffer management policy","volume":"8","author":"Kumar S. V.","year":"2018","journal-title":"International Journal of Innovative Research & Studies"},{"key":"e_1_2_11_22_2","unstructured":"ArunaB. BrianL. andArunV. DTN routing as a resource allocation problem Proceedings of the 2007 conference on Applications technologies architectures and protocols for computer communications 2007 New York United States 373\u2013384."},{"key":"e_1_2_11_23_2","unstructured":"AmirK. ChadiB. andThrasyvoulosS. Optimal buffer management policies for delay tolerant networks 2008 5th annual IEEE communications society conference on sensor mesh and ad hoc communications and networks 2008 San Francisco CA USA 260\u2013268."},{"key":"e_1_2_11_24_2","unstructured":"AndersL.andPhanse KaustubhS. Evaluation of queueing policies and forwarding strategies for routing in intermittently connected networks 2006 1st International Conference on Communication Systems Software & Middleware 2006 New Delhi India 1\u201310."},{"key":"e_1_2_11_25_2","unstructured":"PereiraS. A. ScottB. MassakiH. C. andKatiaO. DTN congestion control unplugged: A comprehensive performance study Proceedings of the 10th ACM MobiCom Workshop on Challenged Networks 2015 New York United States 43\u201348."},{"key":"e_1_2_11_26_2","unstructured":"DavisJ. A. FaggA. H. andNeilL. B. Wearable computers as packet transport mechanisms in highlypartitioned ad-hoc networks Proceedings Fifth International Symposium on Wearable Computers 2001 Zurich Switzerland 141\u2013148."},{"key":"e_1_2_11_27_2","unstructured":"SathitaK.andHiroshiE. Independent DTNs message deletion mechanism for multi-copy routing scheme Proceedings of the Sixth Asian Internet Engineering Conference 2010 New York United States 48\u201355."},{"key":"e_1_2_11_28_2","article-title":"A novel queue management policy for delay-tolerant networks","volume":"2016","author":"Saeid I.","year":"2016","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"e_1_2_11_29_2","article-title":"An analysis optimal buffer management policy to improve QOS in DTN routing protocol","volume":"975","author":"Animesha G.","year":"2012","journal-title":"International Journal of Computer Applications"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.9781\/ijimai.2016.417"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-015-1085-y"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.07.215"},{"key":"e_1_2_11_33_2","doi-asserted-by":"crossref","unstructured":"SilvaM. D. NunesI. O. MiniR. A. andLoureiroA. A. ST-Drop: a novel buffer management strategy for D2D opportunistic networks 2017 IEEE Symposium on Computers and Communications (ISCC) 2017 Heraklion Greece 1300\u20131305.","DOI":"10.1109\/ISCC.2017.8024704"},{"key":"e_1_2_11_34_2","article-title":"Correction: priority queue based reactive buffer management policy for delay tolerant network under city based environments","volume":"14","author":"Qaisar A.","year":"2019","journal-title":"PloS one"},{"key":"e_1_2_11_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.020811.090163"},{"key":"e_1_2_11_36_2","unstructured":"VahdatA.andBeckerD. Epidemic routing for partially connected ad hoc networks 2000."},{"key":"e_1_2_11_37_2","unstructured":"FransE. AriK. JouniK. andJ\u00f6rgO. Working day movement model Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models 2008 New York United States 33\u201340."}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/9773402.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/9773402.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/9773402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:20:48Z","timestamp":1723029648000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/9773402"}},"subtitle":[],"editor":[{"given":"Suleman","family":"Khan","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/9773402"],"URL":"https:\/\/doi.org\/10.1155\/2021\/9773402","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-04-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9773402"}}