{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:46Z","timestamp":1740123826060,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-12-C-0278"],"award-info":[{"award-number":["FA8750-12-C-0278"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s11276-017-1452-y","type":"journal-article","created":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T07:19:51Z","timestamp":1485933591000},"page":"2017-2034","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Census: fast, scalable and robust data aggregation in MANETs"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8005-0603","authenticated-orcid":false,"given":"Vinod","family":"Kulathumani","sequence":"first","affiliation":[]},{"given":"Anish","family":"Arora","sequence":"additional","affiliation":[]},{"given":"Mukundan","family":"Sridharan","sequence":"additional","affiliation":[]},{"given":"Kenneth","family":"Parker","sequence":"additional","affiliation":[]},{"given":"Masahiro","family":"Nakagawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,1]]},"reference":[{"key":"1452_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Avin, C., Koucky, M., Kozma, G., Lotker, Z., & Tuttle, M. R. (2008). Many random walks are faster than one. In Proceedings of the twentieth annual symposium on parallelism in algorithms and architectures (pp. 119\u2013128). SPAA \u201908.","DOI":"10.1145\/1378533.1378557"},{"key":"1452_CR2","doi-asserted-by":"crossref","unstructured":"Avin, C., & Brito, C. (2004). Efficient and robust query processing in dynamic environments using random walk techniques. In International symposium on information processing in sensor networks (IPSN) (pp. 277\u2013286).","DOI":"10.1145\/984622.984663"},{"key":"1452_CR3","unstructured":"Avin, C., Kouck\u00fd, M., & Lotker, Z. (2008). How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In L. Aceto, I. Damg\u00e5rd, L. A. Goldberg, M. M. Halld\u00f3rsson, A. Ing\u00f3lfsd\u00f3ttir, & I. Walukiewicz (Eds.), Automata, languages and programming: 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7\u201311, 2008, proceedings, part I (pp. 121\u2013132). Berlin: Springer."},{"key":"1452_CR4","doi-asserted-by":"crossref","unstructured":"Avin, C., & Krishnamachari, B. (2006). The power of choice in random walks: An empirical study. In Proceedings of the 9th ACM international symposium on modeling analysis and simulation of wireless and mobile systems (pp. 219\u2013228). MSWiM \u201906.","DOI":"10.1145\/1164717.1164757"},{"key":"1452_CR5","doi-asserted-by":"crossref","unstructured":"Boudec, J. Y. L., & Vojnovic, M. (2005). Perfect simulation and stationarity of a class of mobility models. In IEEE 24th annual joint conference of the IEEE computer and communications societies (INFOCOM) (Vol. 4, pp. 2743\u20132754).","DOI":"10.1109\/INFCOM.2005.1498557"},{"issue":"6","key":"1452_CR6","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006). Randomized gossip algorithms. IEEE Transactions on Information Theory, 52(6), 2508\u20132530.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"17","key":"1452_CR7","doi-asserted-by":"publisher","first-page":"3335","DOI":"10.1088\/0305-4470\/17\/17\/011","volume":"17","author":"C Byrnes","year":"1984","unstructured":"Byrnes, C., & Guttman, A. J. (1984). On self-repelling random walks. Journal of Physics A: Mathematical and General, 17(17), 3335\u20133342.","journal-title":"Journal of Physics A: Mathematical and General"},{"key":"1452_CR8","unstructured":"Camp, T., Boleng, J., & Davies, V. (2002). A survey of mobility models for ad hoc network research. In Wireless communication and mobile computing (WCMC): Special issue on mobile ad-hoc networking (Vol. 2, pp. 483\u2013502)."},{"issue":"12","key":"1452_CR9","doi-asserted-by":"publisher","first-page":"3953","DOI":"10.1109\/TIT.2013.2247462","volume":"56","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Shakkottai, S., & Andrews, J. (2013). On the role of mobility on multi-message gossip. IEEE Transactions on Information Theory, 56(12), 3953\u20133970.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"1452_CR10","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TPDS.2011.33","volume":"22","author":"AEF Clementi","year":"2011","unstructured":"Clementi, A. E. F., Monti, A., Pasquale, F., & Silvestri, R. (2011). Information spreading in stationary Markovian evolving graphs. IEEE Transactions on Parallel and Distributed Systems, 22(9), 1425\u20131432.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"1452_CR11","unstructured":"Clementi, A. E. F., Pasquale, F., & Silvestri, R. (2009). MANETs: High mobility can make up for low transmission power. In S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. Nikoletseas, & W. Thomas (Eds.), Automata, languages and programming: 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5\u201312, 2009, proceedings, part II (pp. 387\u2013398). Berlin: Springer."},{"issue":"4","key":"1452_CR12","doi-asserted-by":"publisher","first-page":"1738","DOI":"10.1137\/080729542","volume":"23","author":"C Cooper","year":"2009","unstructured":"Cooper, C., Frieze, A., & Radik, T. (2009). Multiple random walks in random regular graphs. SIAM Journal of Discrete Mathematics, 23(4), 1738\u20131761.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"1452_CR13","unstructured":"DARPA. Clean slate ideas for MANETs. Accessed September 2, 2015."},{"key":"1452_CR14","unstructured":"DARPA. Fixed wireless at a distance. Accessed September 2, 2015. (Online)."},{"key":"1452_CR15","unstructured":"DARPA. (2013). Novel methods for information sharing in large scale mobile ad-hoc networks. Request for information: DARPA-SN-13-35."},{"key":"1452_CR16","unstructured":"Doumas, A. V., & Papanicolaou, V. G. (2014). The coupon collector\u2019s problem revisited: Generalizing the double Dixie Cup problem of Newman and Shepp. (ArXiv e-prints)."},{"issue":"1","key":"1452_CR17","first-page":"677","volume":"3580","author":"G Ercal","year":"2005","unstructured":"Ercal, G., & Avin, C. (2005). On the cover time of random geometric graphs. Automata, Languages, and Programming, 3580(1), 677\u2013689.","journal-title":"Automata, Languages, and Programming"},{"issue":"4","key":"1452_CR18","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/rsa.3240060406","volume":"6","author":"U Feige","year":"1995","unstructured":"Feige, U. (1995). A tight lower bound for the cover time of random walks on graphs. Random Structures and Algorithms, 6(4), 433\u2013438.","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"1452_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U Feige","year":"1995","unstructured":"Feige, U. (1995). A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms, 6(1), 51\u201354.","journal-title":"Random Structures and Algorithms"},{"key":"1452_CR20","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0378-4371(93)90048-9","volume":"192","author":"H Feund","year":"1993","unstructured":"Feund, H., & Grassberger, P. (1993). How a random walk covers a finite lattice. Physica A, 192, 465\u2013470.","journal-title":"Physica A"},{"issue":"5","key":"1452_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1317379.1317390","volume":"41","author":"R Friedman","year":"2007","unstructured":"Friedman, R., Gavidia, D., Rodrigues, L., Viana, A., & Voulgaris, S. (2007). Gossiping on MANETs: The beauty and the beast. ACM SIGOPS Operating Systems Review, 41(5), 67\u201374.","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"4","key":"1452_CR22","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1137\/S0895480103428478","volume":"18","author":"A Frieze","year":"2005","unstructured":"Frieze, A., & Cooper, C. (2005). The cover time of random regular graphs. SIAM Journal of Discrete Mathematics, 18(4), 728\u2013740.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"1452_CR23","doi-asserted-by":"crossref","unstructured":"Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., & Levis, P. (2009). Collection tree protocol. In Proceedings of the 7th ACM conference on embedded networked sensor systems (pp. 1\u201314). SenSys \u201909.","DOI":"10.1145\/1644038.1644040"},{"issue":"1","key":"1452_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TNET.2002.808417","volume":"11","author":"C Intanogonwiwat","year":"2003","unstructured":"Intanogonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., & Silva, F. (2003). Directed diffusion for wireless sensor networking. IEEE Transactions on Networking, 11(1), 2\u201316.","journal-title":"IEEE Transactions on Networking"},{"key":"1452_CR25","doi-asserted-by":"crossref","unstructured":"Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., & Viennot, L. (2001). Optimized link state routing protocol for ad hoc networks. In IEEE international multi-topic conference (INMIC) (pp 62\u201368).","DOI":"10.1109\/INMIC.2001.995315"},{"key":"1452_CR26","unstructured":"Joint Tactical Radio System. (2015). Jtrs\u2014Wikipedia, the free encyclopedia. Accessed September 2, 2015. (Online)."},{"issue":"8","key":"1452_CR27","doi-asserted-by":"publisher","first-page":"1623","DOI":"10.1109\/LCOMM.2016.2572083","volume":"20","author":"V Kulathumani","year":"2016","unstructured":"Kulathumani, V., Arora, A., Sridharan, M., Parker, K., & Lemon, B. (2016). On the repair time scaling wall for MANETs. IEEE Communications Letters, 20(8), 1623\u20131626.","journal-title":"IEEE Communications Letters"},{"key":"1452_CR28","unstructured":"Kulathumani, V., Parker, K., Sridharan, M., & Arora, A. (2014). Census: Fast, scalable and robust data aggregation in MANETs. CoRR, abs\/1409.7368."},{"key":"1452_CR29","unstructured":"Kulathumani, V., Sridharan, M., Arora, A., Lemon, B., & Parker, K. (2014). On the repair time scaling wall for MANETs. CoRR, abs\/1409.7370."},{"key":"1452_CR30","unstructured":"Levis, P., Patel, N., Shenker, S., & Culler, D. (2004). Trickle: A self-regulating algorithm for code propagation and maintenance in wireless sensor networks. In USENIX\/ACM symposium on networked systems design and implementation (NSDI) (pp. 15\u201328)."},{"key":"1452_CR31","unstructured":"Lovascz, L. (1993). Random walks on graphs: A survey. Combinatorics, Paul Erdos, 80."},{"issue":"SI","key":"1452_CR32","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/844128.844142","volume":"36","author":"S Madden","year":"2002","unstructured":"Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W. (2002). Tag: A tiny aggregation service for ad-hoc sensor networks. ACM SIGOPS Operating Systems Review, 36(SI), 131\u2013146.","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"7","key":"1452_CR33","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/TMC.2007.1013","volume":"6","author":"V Naik","year":"2007","unstructured":"Naik, V., Arora, A., Sinha, P., & Zhang, H. (2007). Sprinkler: A reliable and energy efficient data dissemination service for extreme scale wireless networks of embedded devices. IEEE Transactions on Mobile Computing, 6(7), 777\u2013789.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"1452_CR34","doi-asserted-by":"crossref","unstructured":"Nain, P., Towsley, D., Liu, B., & Liu, Z. (2005). Properties of random direction models. In IEEE 24th annual joint conference of the IEEE computer and communications societies (INFOCOM) (Vol. 3, pp. 1897\u20131907).","DOI":"10.1109\/INFCOM.2005.1498468"},{"issue":"1","key":"1452_CR35","doi-asserted-by":"publisher","first-page":"58","DOI":"10.2307\/2308930","volume":"67","author":"D Newman","year":"1960","unstructured":"Newman, D., & Shepp, L. (1960). The double dixie cup problem. The American Mathematical Monthly, 67(1), 58\u201361.","journal-title":"The American Mathematical Monthly"},{"issue":"1","key":"1452_CR36","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/JPROC.2006.887293","volume":"95","author":"R Olfati-Saber","year":"2007","unstructured":"Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007). Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE, 95(1), 215\u2013233.","journal-title":"Proceedings of the IEEE"},{"key":"1452_CR37","unstructured":"Parker, K., Sridharan, M., Arora, A., Kulathumani, V., Kumar, P. R., Brown, J., et al.(2013). Scaling mobile ad-hoc networks using application specific networking patterns. \n                    https:\/\/samraksh.com\/files\/learning\/Far%20Out%20Networking%20-%20Ad%20Hoc%20Mobility%20Patterns.pdf\n                    \n                  . Public release: Technical book."},{"key":"1452_CR38","doi-asserted-by":"crossref","unstructured":"Pettarin, A., Pietracaprina, A., Pucci, G., & Upfal, E. (2011). Tight bounds on information dissemination in sparse mobile networks. In 30th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing (pp. 355\u2013362). PODC \u201911.","DOI":"10.1145\/1993806.1993882"},{"key":"1452_CR39","doi-asserted-by":"crossref","unstructured":"Rabbat, M. G. (2007). On spatial gossip algorithms for average consensus. In 2007 IEEE\/SP 14th workshop on statistical signal processing (pp. 705\u2013709).","DOI":"10.1109\/SSP.2007.4301350"},{"key":"1452_CR40","doi-asserted-by":"crossref","unstructured":"Sarwate, A. D., & Javidi, T. (2011). Opinion dynamics and distributed learning of distributions. In 2011 49th annual Allerton conference on communication, control, and computing (Allerton) (pp. 1151\u20131158).","DOI":"10.1109\/Allerton.2011.6120297"},{"key":"1452_CR41","unstructured":"The ns-3 network simulator. Accessed June 2, 2016. (Online)."},{"key":"1452_CR42","doi-asserted-by":"crossref","unstructured":"Zeng, W., Arora, A., & Srinivasan, K. (2013). Low power counting via collaborative wireless communications. In Proceedings of the 12th international conference on information processing in sensor networks (pp. 43\u201354). IPSN \u201913.","DOI":"10.1145\/2461381.2461391"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-017-1452-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-017-1452-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-017-1452-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T14:09:08Z","timestamp":1589724548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-017-1452-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,1]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["1452"],"URL":"https:\/\/doi.org\/10.1007\/s11276-017-1452-y","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2017,2,1]]},"assertion":[{"value":"1 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}