{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:32:30Z","timestamp":1761611550273,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Technology, Taiwan","award":["MOST-108-2221-E-008-021","MOST-109-2221-E-008-051"],"award-info":[{"award-number":["MOST-108-2221-E-008-021","MOST-109-2221-E-008-051"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Opportunistic ad hoc networks are characterized by intermittent and infrastructure-less connectivity among mobile nodes. Because of the lack of up-to-date network topology information and frequent link failures, geographic routing utilizes location information and adopts the store\u2013carry\u2013forward data delivery model to relay messages in a delay-tolerant manner. This paper proposes a message-forwarding policy based on movement patterns (MPMF). First, one- and two-hop location information in a geographic neighborhood is exploited to select relay nodes moving closer to a destination node. Message-forwarding decisions are made by referring to selected relay nodes\u2019 weight values obtained by calculating the contact frequency of each node with the destination node. Second, when relays in the vicinity of a message-carrying node are not qualified due to the sparse node density and nodal motion status, the destination\u2019s movement and the location information of a one-hop relay are jointly utilized to improve the message-forwarding decision. If the one-hop relay is not closer to the destination node or moving away from it, its centrality value in the network is used instead. Based on both synthetic and real mobility scenarios, the simulation results show that the proposed policy performs incomparable efforts to some typical routing policies, such as Epidemic, PRoPHETv2, temporal closeness and centrality-based (TCCB), transient community-based (TC), and geographic-based spray-and-relay (GSaR) routing policies.<\/jats:p>","DOI":"10.3390\/fi14070214","type":"journal-article","created":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T11:22:24Z","timestamp":1658316144000},"page":"214","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc Networks"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0044-1143","authenticated-orcid":false,"given":"Mohd-Yaseen","family":"Mir","sequence":"first","affiliation":[{"name":"Department of Communication Engineering, National Central University, Taoyuan City 32001, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengbing","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Communication Engineering, National Central University, Taoyuan City 32001, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Lin","family":"Hu","sequence":"additional","affiliation":[{"name":"Department of Communication Engineering, National Central University, Taoyuan City 32001, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,20]]},"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","first-page":"391","DOI":"10.1109\/TMC.2019.2944829","article-title":"Cooperative Caching in Vehicular Content Centric Network Based on Social Attributes and Mobility","volume":"20","author":"Yao","year":"2021","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"3533","DOI":"10.1109\/TITS.2020.2983835","article-title":"V2VR: Reliable Hybrid-Network-Oriented V2V Data Transmission and Routing Considering RSUs and Connectivity Probability","volume":"22","author":"Gao","year":"2021","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TVT.2014.2331395","article-title":"Geographic-Based Spray-and-Relay (GSaR): An Efficient Routing Scheme for DTNs","volume":"64","author":"Cao","year":"2015","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1109\/JSYST.2016.2563519","article-title":"A Geographic Multicopy Routing Scheme for DTNs With Heterogeneous Mobility","volume":"12","author":"Cao","year":"2018","journal-title":"IEEE Syst. J."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s11277-019-06283-4","article-title":"Enhanced Geographic Routing with Two-Hop Neighborhood Information in Sparse MANETs","volume":"107","author":"Hu","year":"2019","journal-title":"Wirel. Pers. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Zhu, H., Mir, M.Y., and Hu, C.L. (2021, January 7\u20138). Geographic Routing with Two-Hop Movement Information in Mobile Opportunistic Networks. Proceedings of the 2021 30th Wireless and Optical Communications Conference (WOCC), Taipei, Taiwan.","DOI":"10.1109\/WOCC53213.2021.9602992"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2339","DOI":"10.1109\/TVT.2013.2238958","article-title":"Converge-and-Diverge: A Geographic Routing for Delay\/Disruption-Tolerant Networks Using a Delegation Replication Approach","volume":"62","author":"Cao","year":"2013","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"10372","DOI":"10.1109\/TVT.2017.2740218","article-title":"Predicting Temporal Social Contact Patterns for Data Forwarding in Opportunistic Mobile Networks","volume":"66","author":"Zhou","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Samo Grasic, S., Davies, E., Lindgren, A., and Doria, A. (2011, January 19\u201323). The Evolution of a DTN Routing Protocol\u2014PRoPHETv2. Proceedings of the 2011 6th ACM workshop on Challenged Networks (CHANTS), Las Vegas, NV, USA.","DOI":"10.1145\/2030652.2030661"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Iranmanesh, S., Raad, R., and Chin, K.W. (2012, January 2\u20135). A novel destination-based routing protocol (DBRP) in DTNs. Proceedings of the 2012 International Symposium on Communications and Information Technologies (ISCIT), Gold Coast, Australia.","DOI":"10.1109\/ISCIT.2012.6380915"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"7195","DOI":"10.1109\/TVT.2017.2653843","article-title":"SEBAR: Social-Energy-Based Routing for Mobile Social Delay-Tolerant Networks","volume":"66","author":"Li","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1109\/JIOT.2020.3001309","article-title":"Dynamically Transient Social Community Detection for Mobile Social Networks","volume":"8","author":"Bi","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1109\/TVT.2013.2272547","article-title":"Approach-and-Roam (AaR): A Geographic Routing Scheme for Delay\/Disruption Tolerant Networks","volume":"63","author":"Cao","year":"2014","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Singh, I.B., Ho, Q.D., and Le-Ngoc, T. (2012, January 3\u20136). TIEGeR: An Energy-Efficient Multi-Parameter Geographic Routing Algorithm. Proceedings of the 2012 IEEE Vehicular Technology Conference (VTC-Fall), Quebec City, QC, Canada.","DOI":"10.1109\/VTCFall.2012.6399163"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Bayhan, S., Hyyti\u00e4, E., Kangasharju, J., and Ott, J. (2015, January 2\u20136). Two Hops or More: On Hop-Limited Search in Opportunistic Networks. Proceedings of the ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), Cancun, Mexico.","DOI":"10.1145\/2811587.2811592"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1109\/TNET.2008.2011128","article-title":"Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks, Rome, Italy","volume":"17","author":"Hsu","year":"2009","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/MCOM.2015.7295476","article-title":"NCCU Trace: Social-Network-Aware Mobility Trace","volume":"53","author":"Tsai","year":"2015","journal-title":"IEEE Commun. Mag."},{"key":"ref_19","unstructured":"Vahdat, A., and Becker, D. (2000). Epidemic Routing for Partially-Connected Ad Hoc Networks, Duke University."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2829","DOI":"10.1109\/TNET.2017.2708090","article-title":"Transient Community Detection and Its Application to Data Forwarding in Delay Tolerant Networks","volume":"25","author":"Zhang","year":"2017","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Nelson, S.C., Bakht, M., and Kravets, R. (2009, January 19\u201325). Encounter-Based Routing in DTNs. Proceedings of the IEEE INFOCOM\u201909, Rio de Janeiro, Brazil.","DOI":"10.1109\/INFCOM.2009.5061994"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/TMC.2008.172","article-title":"Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations","volume":"8","author":"Spyropoulos","year":"2009","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.inffus.2011.11.003","article-title":"GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks","volume":"15","author":"Soares","year":"2014","journal-title":"Inf. Fusion"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1002\/wcm.2195","article-title":"Exploiting resource heterogeneity in delay-tolerant networks","volume":"13","author":"Sandulescu","year":"2013","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_25","unstructured":"Xie, G., and Chen, N. (May, January 28). A Social-Aware Opportunistic Network Routing Protocol Based on the Node Embeddings. Proceedings of the IEEE 89th Vehicular Technology Conference (VTC-Spring), Kuala Lumpur, Malaysia."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Tao, J., Wu, H., Shi, S., Hu, J., and Gao, Y. (2018, January 15\u201318). Contacts-aware opportunistic forwarding in mobile social networks: A community perspective. Proceedings of the 2018 IEEE Wireless Communications and Networking Conference (WCNC), Barcelona, Spain.","DOI":"10.1109\/WCNC.2018.8377216"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"8735","DOI":"10.1109\/TVT.2015.2503431","article-title":"Enhanced Buffer Management for Data Delivery to Multiple Destinations in DTNs","volume":"65","author":"Hsu","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen, A., Ott, J., and K\u00e4rkk\u00e4inen, T. (2009, January 2\u20136). The ONE Simulator for DTN protocol evaluation. Proceedings of the 2nd International Conference on Simulation Tools and Techniques (SIMUTools), Rome, Italy.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"ref_29","unstructured":"Tsai, T.C., and Chan, H.H. (2022, March 01). NCCU Trace: Social-Network-Aware Mobility Trace. Available online: https:\/\/github.com\/NCCU-MCLAB\/NCCU-Trace-Data."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/14\/7\/214\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:55:00Z","timestamp":1760140500000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/14\/7\/214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":29,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["fi14070214"],"URL":"https:\/\/doi.org\/10.3390\/fi14070214","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2022,7,20]]}}}