{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:28:15Z","timestamp":1775122095102,"version":"3.50.1"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T00:00:00Z","timestamp":1508976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2018,2,28]]},"abstract":"<jats:p>Mobile opportunistic networking is a promising technology that can supplement existing cellular and WiFi networks to provide desirable services for smart and connected communities. Message routing is the most compelling challenge in mobile opportunistic networks due to the lack of contemporaneous end-to-end paths and the resource constraints at mobile devices. To improve the probability of successful message delivery, most existing routing schemes use the past contact history to predict future contacts for message forwarding, and exploit message replication and redundancy for multicopy routing. However, most existing prediction-based routing schemes simply use the average pairwise contact probability as the routing metric and neglect the benefits of exploring fine-grained contact information such as pairwise repeated contact patterns to improve the accuracy of predicting future contacts. Moreover, there is no efficient mechanism that can adaptively control message replication in a decentralized manner to achieve both high probability of successful message delivery and low message overhead. To address these problems, we present FGAR, a routing protocol designed for mobile opportunistic networks by leveraging fine-grained contact characterization and adaptive message replication. In FGAR, contact history is characterized in a fine-grained manner with timing information using a sliding window mechanism, and future contacts are predicted based on the fine-grained contact information, thereby improving the accuracy of contact prediction. We further design an efficient message replication scheme in which message replication is controlled in a fully decentralized manner by taking into account the expected message delivery probability, the replication history, and the quality of the encountered device. A replica is generated only when it is necessary to fulfill the expected message delivery probability. We evaluate our scheme through trace-driven simulations, and the simulation results show that FGAR outperforms existing schemes. In comparison with PRoPHET, FGAR can achieve more than 20% improvement on average on successful message delivery, whereas the message overhead has been reduced by a factor up to 15.<\/jats:p>","DOI":"10.1145\/3122984","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T14:19:33Z","timestamp":1509027573000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Adaptive Message Routing and Replication in Mobile Opportunistic Networks for Connected Communities"],"prefix":"10.1145","volume":"18","author":[{"given":"Haibo","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Otago, Dunedin, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luming","family":"Wan","sequence":"additional","affiliation":[{"name":"University of Otago, Dunedin, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yawen","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Otago, Dunedin, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence T.","family":"Yang","sequence":"additional","affiliation":[{"name":"St. Francis Xavier University, NS, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lizhi","family":"Peng","sequence":"additional","affiliation":[{"name":"University of Jinan, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282427.1282422"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/WOWMOM.2007.4351716"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"e_1_2_1_4_1","volume-title":"Retrieved","author":"Burgess John","year":"2008","unstructured":"John Burgess , John Zahorjan , Ratul Mahajan , Brian Neil Levine , Aruna Balasubramanian , Arun Venkataramani , Yun Zhou , Bruce Croft , Nilanjan Banerjee , Mark Corner , and Don Towsley . 2008 . The Umass\/Diesel Dataset (v. 2008-09-14) . Retrieved September 19, 2017, from http:\/\/crawdad.org\/umass\/diesel\/20080914 John Burgess, John Zahorjan, Ratul Mahajan, Brian Neil Levine, Aruna Balasubramanian, Arun Venkataramani, Yun Zhou, Bruce Croft, Nilanjan Banerjee, Mark Corner, and Don Towsley. 2008. The Umass\/Diesel Dataset (v. 2008-09-14). Retrieved September 19, 2017, from http:\/\/crawdad.org\/umass\/diesel\/20080914"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2281583"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2009.5235229"},{"key":"e_1_2_1_7_1","volume-title":"Retrieved","year":"2010","unstructured":"Cisco. 2010 . Smart+Connected Communities: Changing a City, a Country, the World . Retrieved September 19, 2017, from http:\/\/www.cisco.com\/c\/dam\/en_us\/solutions\/industries\/docs\/scc\/09CS2326_SCC_BrochureForWest_r3_112409.pdf. Cisco. 2010. Smart+Connected Communities: Changing a City, a Country, the World. Retrieved September 19, 2017, from http:\/\/www.cisco.com\/c\/dam\/en_us\/solutions\/industries\/docs\/scc\/09CS2326_SCC_BrochureForWest_r3_112409.pdf."},{"key":"e_1_2_1_8_1","volume-title":"Retrieved","year":"2017","unstructured":"Cisco. 2017 . Smart+Connected Communities . Retrieved September 19, 2017, from http:\/\/www.cisco.com\/c\/en\/us\/solutions\/industries\/smart-connected-communities.html. Cisco. 2017. Smart+Connected Communities. Retrieved September 19, 2017, from http:\/\/www.cisco.com\/c\/en\/us\/solutions\/industries\/smart-connected-communities.html."},{"key":"e_1_2_1_9_1","volume-title":"Retrieved","author":"Eagle Nathan","year":"2005","unstructured":"Nathan Eagle and Alex (Sandy) Pentland . 2005 . The MIT\/Reality Dataset (v. 2005-07-01) . Retrieved September 19, 2017, from http:\/\/crawdad.org\/mit\/reality\/. Nathan Eagle and Alex (Sandy) Pentland. 2005. The MIT\/Reality Dataset (v. 2005-07-01). Retrieved September 19, 2017, from http:\/\/crawdad.org\/mit\/reality\/."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.249"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature06958"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.101"},{"key":"e_1_2_1_13_1","volume-title":"Retrieved","author":"ITU.","year":"2016","unstructured":"ITU. 2016 . Measuring the Information Society Report . Retrieved September 19, 2017, from http:\/\/www.itu.int\/en\/ITU-D\/Statistics\/Documents\/publications\/misr2016\/MISR2016-w4.pdf. ITU. 2016. Measuring the Information Society Report. Retrieved September 19, 2017, from http:\/\/www.itu.int\/en\/ITU-D\/Statistics\/Documents\/publications\/misr2016\/MISR2016-w4.pdf."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015484"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/635506.605408"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/WOWMOM.2008.4594889"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSN.2014.29"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 6th International Conference on Emerging Networking Experiments and Technologies (CoNEXT\u201910)","author":"Lee Kyunghan","year":"2010","unstructured":"Kyunghan Lee , Joohyun Lee , Yung Yi , Injong Rhee , and Song Chong . 2010 . Mobile data offloading: How much can WiFi deliver? In Proceedings of the 6th International Conference on Emerging Networking Experiments and Technologies (CoNEXT\u201910) . 26:1--26:12. Kyunghan Lee, Joohyun Lee, Yung Yi, Injong Rhee, and Song Chong. 2010. Mobile data offloading: How much can WiFi deliver? In Proceedings of the 6th International Conference on Emerging Networking Experiments and Technologies (CoNEXT\u201910). 26:1--26:12."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848134"},{"key":"e_1_2_1_20_1","volume-title":"Probabilistic Routing Protocol for Intermittently Connected Networks. Retrieved","author":"Lindgren A.","year":"2017","unstructured":"A. Lindgren , A. Doria , E. Davies , and S. Grasic . 2012 . Probabilistic Routing Protocol for Intermittently Connected Networks. Retrieved September 19, 2017 , from https:\/\/tools.ietf.org\/html\/draft-irtf-dtnrg-prophet-10. A. Lindgren, A. Doria, E. Davies, and S. Grasic. 2012. Probabilistic Routing Protocol for Intermittently Connected Networks. Retrieved September 19, 2017, from https:\/\/tools.ietf.org\/html\/draft-irtf-dtnrg-prophet-10."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.280"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5684252"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2008.107"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2011.05.007"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1260729"},{"key":"e_1_2_1_27_1","volume-title":"Retrieved","author":"Scott James","year":"2006","unstructured":"James Scott , Richard Gass , Jon Crowcroft , Pan Hui , Christophe Diot , and Augustin Chaintreau . 2006 . The Cambridge\/Haggle Dataset (v. 2006-01-31) . Retrieved September 19, 2017, from http:\/\/crawdad.org\/cambridge\/haggle\/20060131\/. James Scott, Richard Gass, Jon Crowcroft, Pan Hui, Christophe Diot, and Augustin Chaintreau. 2006. The Cambridge\/Haggle Dataset (v. 2006-01-31). Retrieved September 19, 2017, from http:\/\/crawdad.org\/cambridge\/haggle\/20060131\/."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the ACM SIGCOMM Workshop on Delay Tolerant Networks (WDTN\u201905)","author":"Spyropoulos Thrasyvoulos","unstructured":"Thrasyvoulos Spyropoulos , Konstantinos Psounis , and Cauligi S. Raghavendra . 2005. Spray and Wait: An efficient routing scheme for intermittently connected mobile networks . In Proceedings of the ACM SIGCOMM Workshop on Delay Tolerant Networks (WDTN\u201905) . 252--259. Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra. 2005. Spray and Wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the ACM SIGCOMM Workshop on Delay Tolerant Networks (WDTN\u201905). 252--259."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the IEEE International Symposium on a World of Wireless, Mobile, and Multimedia Networks (WoWMoM\u201911)","author":"Vu L.","unstructured":"L. Vu , Q. Do , and K. Nahrstedt . 2011. 3R: Fine grained encounter-based routing in delay tolerant networks . In Proceedings of the IEEE International Symposium on a World of Wireless, Mobile, and Multimedia Networks (WoWMoM\u201911) . 1--6. L. Vu, Q. Do, and K. Nahrstedt. 2011. 3R: Fine grained encounter-based routing in delay tolerant networks. In Proceedings of the IEEE International Symposium on a World of Wireless, Mobile, and Multimedia Networks (WoWMoM\u201911). 1--6."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287791.1287810"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.140"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287853.1287876"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530806"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the IEEE International Conference on Computer Communications and Networks (ICCCN\u201913)","author":"Zhou Huan","year":"2013","unstructured":"Huan Zhou , Huanyang Zheng , Jie Wu , and Jiming Chen . 2013 . Energy-efficient contact probing in opportunistic mobile networks . In Proceedings of the IEEE International Conference on Computer Communications and Networks (ICCCN\u201913) . 4629--4642. Huan Zhou, Huanyang Zheng, Jie Wu, and Jiming Chen. 2013. Energy-efficient contact probing in opportunistic mobile networks. In Proceedings of the IEEE International Conference on Computer Communications and Networks (ICCCN\u201913). 4629--4642."}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3122984","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3122984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:04Z","timestamp":1750212664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3122984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,26]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2,28]]}},"alternative-id":["10.1145\/3122984"],"URL":"https:\/\/doi.org\/10.1145\/3122984","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,26]]},"assertion":[{"value":"2016-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}