{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:10:53Z","timestamp":1760209853248,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T00:00:00Z","timestamp":1510617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Nodes in Mobile Opportunistic Network (MON) have to cache packets to deal with the intermittent connection. The buffer management strategy obviously impacts the performance of MON, and it attracts more attention recently. Due to the limited storage capacity of nodes, traditional buffer management strategies just drop messages based on the property of message, and they neglect the collaboration between neighbors, resulting in an ineffective performance improvement. Therefore, effective buffer management strategies are necessary to ensure that each node has enough buffer space to store the message when the node buffer is close to congestion. In this paper, we propose a buffer management strategy by integrating the characteristics of messages and nodes, and migrate the redundant messages to the neighbor to optimize the total utility, instead of deleting them. The simulation experiment results show that it can obviously improve the delivery ratio, the overhead ratio and the average delays, and reduce the amount of hops compared with the traditional ones.<\/jats:p>","DOI":"10.3390\/fi9040082","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T10:58:32Z","timestamp":1510657112000},"page":"82","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Combinational Buffer Management Scheme in Mobile Opportunistic Network"],"prefix":"10.3390","volume":"9","author":[{"given":"Peiyan","family":"Yuan","sequence":"first","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang 453000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang 453000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,11,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/MCOM.2017.1500527CM","article-title":"A Decade of Research in Opportunistic Networks: Challenges, Relevance, and Future Directions","volume":"55","author":"Trifunovic","year":"2017","journal-title":"IEEE Commun. Mag."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ngo, T., Nishiyama, H., Kato, N., Kotabe, S., and Tohjo, H. (2016, January 15\u201318). A Novel Graph-Based Topology Control Cooperative Algorithm for Maximizing Throughput of Disaster Recovery Networks. Proceedings of the 2016 IEEE 83rd Vehicular Technology Conference (VTC Spring), Nanjing, China.","DOI":"10.1109\/VTCSpring.2016.7504088"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/MCOM.2016.7378438","article-title":"From radio telemetry to ultra-low-power sensor networks: Tracking bats in the wild","volume":"54","author":"Dressler","year":"2016","journal-title":"IEEE Commun. Mag."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1007\/s11277-012-0507-8","article-title":"Noncooperative Dynamic Routing with Bandwidth Constraint in Intermittently Connected Deep Space Information Networks Under Scheduled Contacts","volume":"68","author":"Zhang","year":"2012","journal-title":"Wirel. Pers. Commun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1770","DOI":"10.1109\/TPDS.2015.2467392","article-title":"POST: Exploiting Dynamic Sociality for Mobile Advertising in Vehicular Networks","volume":"27","author":"Qin","year":"2016","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/2038617.2038626","article-title":"A real-time analysis approach in opportunistic networks","volume":"8","author":"Santos","year":"2011","journal-title":"ACM SIGBED Rev."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Boldrini, C. (2010, January 22\u201323). Design and analysis of context-aware forwarding protocols for opportunistic networks. Proceedings of the Second International Workshop on Mobile Opportunistic Networking, Pisa, Italy.","DOI":"10.1145\/1755743.1755788"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1186\/1687-1499-2013-103","article-title":"A comprehensive-integrated buffer management strategy for opportunistic networks","volume":"2013","author":"Pan","year":"2013","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Erramilli, V., and Crovella, M. (2008, January 15). Forwarding in opportunistic networks with resource constraints. Proceedings of the Third ACM Workshop on Challenged Networks, San Francisco, CA, USA.","DOI":"10.1145\/1409985.1409994"},{"key":"ref_10","first-page":"35","article-title":"Impact of Mobility Models on DLA (Drop Largest) Optimized DTN Epidemic Routing Protocol","volume":"18","author":"Rashid","year":"2011","journal-title":"Int. J. Comput. Appl."},{"key":"ref_11","unstructured":"Kim, D., Park, H., and Yeom, I. (2008, January 18\u201320). Minimizing the impact of buffer overflow in DTN. Proceedings of the 3rd International Conference on Future Internet Technologies (CFI), Seoul, Korea."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Sati, S., Probst, C., and Graffi, K. (2016, January 1\u20134). Analysis of Buffer Management Policies for Opportunistic Networks. Proceedings of the IEEE 25th International Conference on Computer Communication and Networks, Waikoloa, HI, USA.","DOI":"10.1109\/ICCCN.2016.7568494"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Krifa, A., Baraka, C., and Spyropoulos, T. (2008, January 16\u201320). Optimal Buffer Management Policies for Delay Tolerant Networks. Proceedings of the 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, San Francisco, CA, USA.","DOI":"10.1109\/SAHCN.2008.40"},{"key":"ref_14","unstructured":"Scott, K., and Burleigh, S. (2017, November 10). Available online: https:\/\/rfc-editor.org\/rfc\/rfc5050.txt."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1109\/TPDS.2012.197","article-title":"A Novel Message Scheduling Framework for Delay Tolerant Networks Routing","volume":"24","author":"Elwhishi","year":"2013","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., and Krishnan, R. (2007, January 11). Prioritized epidemic routing for opportunistic networks. Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking, San Juan, Puerto Rico.","DOI":"10.1145\/1247694.1247707"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/1282427.1282422","article-title":"DTN routing as a resource allocation problem","volume":"37","author":"Balasubramanian","year":"2007","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_18","first-page":"1","article-title":"Buffer Scheduling Policy for Opportunitic Networks","volume":"2","author":"Ayub","year":"2013","journal-title":"Int. J. Sci. Eng. Res."},{"key":"ref_19","first-page":"8","article-title":"E-DROP: An Effective Drop Buffer Management Policy for DTN Routing Protocols","volume":"13","author":"Rashid","year":"2011","journal-title":"Int. J. Comput. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Wang, E., Yang, Y., and Wu, J. (2015, January 9\u201311). A Knapsack-Based Message Scheduling and Drop Strategy for Delay-Tolerant Networks. Proceedings of the European Conference on Wireless Sensor Networks, Porto, Portugal.","DOI":"10.1007\/978-3-319-15582-1_8"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2015.07.008","article-title":"A Knapsack-based buffer management strategy for delay-tolerant networks","volume":"86","author":"Wang","year":"2015","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_22","unstructured":"Li, Y., Qian, M., Jin, D., Su, L., and Zeng, L. (December, January 30). Adaptive Optimal Buffer Management Policies for Realistic DTN. Proceedings of the IEEE Global Telecommunications Conference, Honolulu, HI, USA."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/CC.2017.8010963","article-title":"A Utility-Based Buffer Management Policy for Improving Data Dissemination in Opportunistic Networks","volume":"14","author":"Yao","year":"2017","journal-title":"China Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1186\/s13638-016-0576-6","article-title":"A novel queue management policy for delay-tolerant networks","volume":"2016","author":"Iranmanesh","year":"2016","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Seligman, M., Mundur, P., and Mundur, P. (2006, January 11\u201315). Alternative custodians for congestion control in delay tolerant networks. Proceedings of the 2006 SIGCOMM Workshop on Challenged Networks, Pisa, Italy.","DOI":"10.1145\/1162654.1162660"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2189","DOI":"10.1007\/s11276-015-1085-y","article-title":"An adaptive and efficient buffer management scheme for resource-constrained delay tolerant networks","volume":"22","author":"Moetesum","year":"2016","journal-title":"Wirel. Netw."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Zhang, G., Wang, J., and Liu, Y. (2008, January 17\u201319). Congestion management in delay tolerant networks. Proceedings of the 4th Annual International Conference on Wireless Internet, Maui, HI, USA.","DOI":"10.4108\/ICST.WICON2008.4807"},{"key":"ref_28","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."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TNET.2011.2172984","article-title":"SLAW: Self-Similar Least-Action Human Walk","volume":"20","author":"Lee","year":"2012","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Niu, J., Wang, D., and Atiquzzaman, M. (2015, January 7\u201310). Copy limited flooding over opportunistic networks. Proceedings of the 2013 IEEE Wireless Communications and Networking Conference (WCNC), Shanghai, China.","DOI":"10.1109\/WCNC.2013.6554834"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/9\/4\/82\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:49:22Z","timestamp":1760208562000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/9\/4\/82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,14]]},"references-count":30,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,12]]}},"alternative-id":["fi9040082"],"URL":"https:\/\/doi.org\/10.3390\/fi9040082","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2017,11,14]]}}}