{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:47Z","timestamp":1750306607395,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T00:00:00Z","timestamp":1434931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["0835735","CAREER award 0746841","1117427","1407205"],"award-info":[{"award-number":["0835735","CAREER award 0746841","1117427","1407205"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,22]]},"DOI":"10.1145\/2746285.2746297","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"47-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Asynchronous Neighbor Discovery on Duty-cycled Mobile Devices"],"prefix":"10.1145","author":[{"given":"Sxia","family":"Chen","sequence":"first","affiliation":[{"name":"Central Connecticut State University, New Britain, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruofan","family":"Jin","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanyuan","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudarshan","family":"Vasudevan","sequence":"additional","affiliation":[{"name":"Palo Alto Networks, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/990064.990073"},{"key":"e_1_3_2_1_2_1","volume-title":"Algorithmic Number Theory, Volume 1: Efficient Algorithms. Foundations of Computing","author":"Bach E.","year":"1996","unstructured":"E. Bach and J. Shallit . Algorithmic Number Theory, Volume 1: Efficient Algorithms. Foundations of Computing . MIT Press , 1996 . E. Bach and J. Shallit. Algorithmic Number Theory, Volume 1: Efficient Algorithms. Foundations of Computing. MIT Press, 1996."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348568"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2006.04.006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460412.1460420"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.101"},{"key":"e_1_3_2_1_7_1","volume-title":"Quorum-based asynchronous power-saving protocols for ieee 802.11 and hoc networks. ACM Journal on Mobile Networks and Applications (MONET), 10(1-2):169--181","author":"Hsu C. S.","year":"2005","unstructured":"C. S. Hsu , J. R. Jiang , Y. C. Tseng , and T. H. Lai . Quorum-based asynchronous power-saving protocols for ieee 802.11 and hoc networks. ACM Journal on Mobile Networks and Applications (MONET), 10(1-2):169--181 , 2005 . C. S. Hsu, J. R. Jiang, Y. C. Tseng, and T. H. Lai. Quorum-based asynchronous power-saving protocols for ieee 802.11 and hoc networks. ACM Journal on Mobile Networks and Applications (MONET), 10(1-2):169--181, 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1098918.1098938"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791253"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354586"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92221-6_20"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2012.240"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/990064.990095"},{"key":"e_1_3_2_1_14_1","unstructured":"Locast. http:\/\/www.lokast.com.  Locast. http:\/\/www.lokast.com."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/501416.501435"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409944.1409953"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848106"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080829.1080855"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592678"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. of IPSN","author":"Purohit A.","year":"2011","unstructured":"A. Purohit , N. Priyantha , and J. Liu . WiFlock: collaborative group discovery and maintenance in mobile sensor networks . In Proc. of IPSN , 2011 . A. Purohit, N. Priyantha, and J. Liu. WiFlock: collaborative group discovery and maintenance in mobile sensor networks. In Proc. of IPSN, 2011."},{"key":"e_1_3_2_1_21_1","volume-title":"Combinatorial designs: Constructions and analysis","author":"Stinson D. R.","year":"2003","unstructured":"D. R. Stinson . Combinatorial designs: Constructions and analysis . Springer Verlag , 2003 . D. R. Stinson. Combinatorial designs: Constructions and analysis. Springer Verlag, 2003."},{"key":"e_1_3_2_1_22_1","unstructured":"Nintendo 3ds's streetpass. http:\/\/www.nintendo.com\/3ds\/features.  Nintendo 3ds's streetpass. http:\/\/www.nintendo.com\/3ds\/features."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511755149","volume-title":"Additive Combinatorics. Number 105 in Cambridge Studies in Advanced Mathematics","author":"Tao T.","year":"2006","unstructured":"T. Tao and V. Vu . Additive Combinatorics. Number 105 in Cambridge Studies in Advanced Mathematics . Cambridge University Press , 2006 . T. Tao and V. Vu. Additive Combinatorics. Number 105 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2006."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of IEEE INFOCOM","author":"Tseng Y.-C.","year":"2002","unstructured":"Y.-C. Tseng , C.-S. Hsu , and T.-Y. Hsieh . Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks . In Proc. of IEEE INFOCOM , 2002 . Y.-C. Tseng, C.-S. Hsu, and T.-Y. Hsieh. Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks. In Proc. of IEEE INFOCOM, 2002."},{"volume-title":"Efficient algorithms for neighbor discovery in wireless networks","author":"Vasudevan S.","key":"e_1_3_2_1_25_1","unstructured":"S. Vasudevan , M. Adler , D. Goeckel , and D. Towsley . Efficient algorithms for neighbor discovery in wireless networks . IEEE\/ACM Transactions on Networking. TouppercaseAppear . S. Vasudevan, M. Adler, D. Goeckel, and D. Towsley. Efficient algorithms for neighbor discovery in wireless networks. IEEE\/ACM Transactions on Networking. TouppercaseAppear."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.56"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2426656.2426674"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. of IEEE ICDCS","author":"Zhang D.","year":"2011","unstructured":"D. Zhang , T. He , F. Ye , R. K. Ganti , and H. Lei . EQS: neighbor discovery and rendezvous maintenance with extended quorum system for mobile sensing applications . In Proc. of IEEE ICDCS , 2011 . D. Zhang, T. He, F. Ye, R. K. Ganti, and H. Lei. EQS: neighbor discovery and rendezvous maintenance with extended quorum system for mobile sensing applications. In Proc. of IEEE ICDCS, 2011."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2011.5930008"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/778415.778420"}],"event":{"name":"MobiHoc'15: The Sixteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Hangzhou China","acronym":"MobiHoc'15"},"container-title":["Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746285.2746297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746285.2746297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:57Z","timestamp":1750227417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746285.2746297"}},"subtitle":["Integer and Non-Integer Schedules"],"short-title":[],"issued":{"date-parts":[[2015,6,22]]},"references-count":30,"alternative-id":["10.1145\/2746285.2746297","10.1145\/2746285"],"URL":"https:\/\/doi.org\/10.1145\/2746285.2746297","relation":{},"subject":[],"published":{"date-parts":[[2015,6,22]]},"assertion":[{"value":"2015-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}