{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:32Z","timestamp":1750306772610,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T00:00:00Z","timestamp":1380499200000},"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":[],"published-print":{"date-parts":[[2013,9,30]]},"DOI":"10.1145\/2505494.2505501","type":"proceedings-article","created":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T18:09:20Z","timestamp":1380650960000},"page":"7-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Plausible mobility inference from wireless contacts using optimization"],"prefix":"10.1145","author":[{"given":"Alireza K.","family":"Monfared","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa H.","family":"Ammar","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ellen W.","family":"Zegura","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"CRAWDAD data set upmc\/rollernet (v. 2009-02-02).  CRAWDAD data set upmc\/rollernet (v. 2009-02-02)."},{"key":"e_1_3_2_1_2_1","unstructured":"CRAWDAD data set st andrews\/sassy (v. 2011-06-03). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/st_andrews\/sassy June 2011.  CRAWDAD data set st andrews\/sassy (v. 2011-06-03). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/st_andrews\/sassy June 2011."},{"key":"e_1_3_2_1_3_1","unstructured":"E. W. Z. Alireza K. Monfared Mostafa Ammar. Optimization Algorithm for Plausible Mobility Inference. Accessible at https:\/\/github.com\/alirezamonfared\/MobilityReport Apr. 2013.  E. W. Z. Alireza K. Monfared Mostafa Ammar. Optimization Algorithm for Plausible Mobility Inference. Accessible at https:\/\/github.com\/alirezamonfared\/MobilityReport Apr. 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2009.07.009"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.11.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.96"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"T. Camp J. Boleng and V. Davies. A survey of mobility models for ad hoc network research. Wireless communications and mobile computing 2(5):483--502 2002.  T. Camp J. Boleng and V. Davies. A survey of mobility models for ad hoc network research. Wireless communications and mobile computing 2(5):483--502 2002.","DOI":"10.1002\/wcm.72"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/234889.234901"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061995"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"A.\n       \n      Lindgren A.\n       \n      Doria and \n      \n      \n      O.\n       \n      Schelen\n      \n  \n  . \n  Probabilistic Routing in Intermittently Connected Networks. In P. Dini P. Lorenz and J. N. de Souza editors SAPIR volume \n  3126\n   of \n  Lecture Notes in Computer Science pages \n  239\n  --\n  254\n  . \n  Springer 2004\n  .  A. Lindgren A. Doria and O. Schelen. Probabilistic Routing in Intermittently Connected Networks. In P. Dini P. Lorenz and J. N. de Souza editors SAPIR volume 3126 of Lecture Notes in Computer Science pages 239--254. Springer 2004.","DOI":"10.1007\/978-3-540-27767-5_24"},{"key":"e_1_3_2_1_12_1","unstructured":"P. Meroni S. Gaito E. Pagani and G. P. Rossi. CRAWDAD data set unimi\/pmtr (v. 2008-12-01). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/unimi\/pmtr Dec. 2008.  P. Meroni S. Gaito E. Pagani and G. P. Rossi. CRAWDAD data set unimi\/pmtr (v. 2008-12-01). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/unimi\/pmtr Dec. 2008."},{"volume-title":"Georgia Institute of Technology","year":"2013","author":"Monfared A. K.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762888.1762904"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2120618"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921206.1921211"},{"key":"e_1_3_2_1_17_1","unstructured":"J. Scott R. Gass J. Crowcroft P. Hui C. Diot and A. Chaintreau. CRAWDAD data set cambridge\/haggle (v. 2009-05-29). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/cambridge\/haggle May 2009.  J. Scott R. Gass J. Crowcroft P. Hui C. Diot and A. Chaintreau. CRAWDAD data set cambridge\/haggle (v. 2009-05-29). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/cambridge\/haggle May 2009."},{"key":"e_1_3_2_1_18_1","unstructured":"J. Scott R. Gass J. Crowcroft P. Hui C. Diot and A. Chaintreau. CRAWDAD trace cambridge\/haggle\/imote\/infocom2006 (v. 2009-05-29). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/cambridge\/haggle\/imote\/infocom2006 May 2009.  J. Scott R. Gass J. Crowcroft P. Hui C. Diot and A. Chaintreau. CRAWDAD trace cambridge\/haggle\/imote\/infocom2006 (v. 2009-05-29). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/cambridge\/haggle\/imote\/infocom2006 May 2009."},{"key":"e_1_3_2_1_19_1","unstructured":"V. Srinivasan M. Motani and W. T. Ooi. CRAWDAD data set nus\/contact (v. 2006-08-01). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/nus\/contact Aug. 2006.  V. Srinivasan M. Motani and W. T. Ooi. CRAWDAD data set nus\/contact (v. 2006-08-01). Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/nus\/contact Aug. 2006."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018481"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2010.11.001"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208967"}],"event":{"name":"MobiCom'13: The 19th Annual International Conference on Mobile Computing and Networking","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Miami Florida USA","acronym":"MobiCom'13"},"container-title":["Proceedings of the 8th ACM MobiCom workshop on Challenged networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505494.2505501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2505494.2505501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:58Z","timestamp":1750231738000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505494.2505501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,30]]},"references-count":22,"alternative-id":["10.1145\/2505494.2505501","10.1145\/2505494"],"URL":"https:\/\/doi.org\/10.1145\/2505494.2505501","relation":{},"subject":[],"published":{"date-parts":[[2013,9,30]]},"assertion":[{"value":"2013-09-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}