{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T07:16:38Z","timestamp":1718176598306},"reference-count":36,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61379157"],"award-info":[{"award-number":["No. 61379157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p> With the advance in mobile network-based systems, dynamic system has become one of the hotspots in fundamental study of distributed systems. In this article, we consider the dynamic system with frequent topology changes arising from node mobility or other reasons, which is also referred to as \u201cdynamic network.\u201d With the model of dynamic network, fundamental distributed computing problems, such as information dissemination and election, can be formally studied with rigorous correctness. Our work focuses on the node counting problem in dynamic environments. We first define two new dynamicity models, named ( Q, S)- distance and ( Q, S)*- distance, which describe dynamic changes of information propagation time against topology changes. Based on these two models, we design three different counting algorithms which basically adopt the approach of diffusing computation. These algorithms mainly differ in communication cost due to different information collection procedures. The correctness of all the algorithms is formally proved and their performance is evaluated via both theoretical analysis and experimental simulations. <\/jats:p>","DOI":"10.1177\/1550147718756872","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T09:02:12Z","timestamp":1517389332000},"page":"155014771875687","update-policy":"http:\/\/dx.doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["(<i>Q, S<\/i>)-<i>distance<\/i> model and counting algorithms in dynamic distributed systems"],"prefix":"10.1177","volume":"14","author":[{"given":"Zhiwei","family":"Yang","sequence":"first","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China"}]},{"given":"Weigang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China"}]},{"given":"Yishun","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China"}]},{"given":"Xiaola","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China"}]},{"given":"Jiannong","family":"Cao","sequence":"additional","affiliation":[{"name":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong"}]}],"member":"179","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"bibr1-1550147718756872","volume-title":"Proceedings of the 15th international symposium on stabilization, safety, and security of distributed systems","author":"Michail O"},{"key":"bibr2-1550147718756872","first-page":"41","volume-title":"Proceeding of the fourth IEEE international symposium on network computing and applications (NCA)","author":"Psaltoulis D"},{"key":"bibr3-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2012.01.011"},{"key":"bibr4-1550147718756872","first-page":"301","volume-title":"Proceedings of the IEEE 33rd international symposium on reliable distributed systems (SRDS)","author":"Yang Z"},{"key":"bibr5-1550147718756872","first-page":"213","volume-title":"Proceedings of the 27th ACM symposium on principles of distributed computing (PODC)","author":"Clementi A"},{"key":"bibr6-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335364"},{"key":"bibr7-1550147718756872","first-page":"404","volume-title":"Proceedings of the 11th international IFIP TC 6 networking conference","author":"De Bovenkamp R"},{"key":"bibr8-1550147718756872","first-page":"104","volume-title":"Proceedings of the 9th joint workshop on foundations of mobile computing (DIALM-POMC)","author":"O\u2019Dell R"},{"key":"bibr9-1550147718756872","first-page":"381","volume-title":"Proceedings of the 30th ACM symposium on principles of distributed computing (PODC)","author":"Haeupler B"},{"key":"bibr10-1550147718756872","first-page":"355","volume-title":"Proceedings of the 30th ACM symposium on principles of distributed computing (PODC)","author":"Pettarin A"},{"key":"bibr11-1550147718756872","first-page":"7","volume-title":"Proceedings of the 15th international symposium on high performance distributed computing (HPDC)","author":"Le Merrer E"},{"key":"bibr12-1550147718756872","first-page":"513","volume-title":"Proceedings of the 42nd ACM symposium on theory of computing (STOC)","author":"Kuhn F"},{"key":"bibr13-1550147718756872","first-page":"41","volume-title":"Proceedings of the 4th international symposium on network computing and applications (NCA)","author":"Kostoulas D"},{"key":"bibr14-1550147718756872","first-page":"102","volume-title":"Proceedings of the 24th international conference on distributed computing systems (ICDCS)","author":"Jelasity M"},{"key":"bibr15-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1145\/1082469.1082470"},{"key":"bibr16-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90021-6"},{"key":"bibr17-1550147718756872","first-page":"82","volume-title":"Proceedings of the 12th annual ACM Symposium on the theory of computing","author":"Angluin D"},{"key":"bibr18-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.12.016"},{"issue":"13","key":"bibr19-1550147718756872","first-page":"105","volume":"36","author":"Wang N","year":"2010","journal-title":"Comput Eng"},{"key":"bibr20-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.05.003"},{"key":"bibr21-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1053"},{"key":"bibr22-1550147718756872","volume-title":"Proceedings of the 42nd International Conference on parallel processing (ICPP)","author":"Yang Z"},{"key":"bibr23-1550147718756872","first-page":"346","volume-title":"Proceedings of the 10th international conference on Ad-Hoc, mobile, and wireless networks (ADHOC-NOW)","author":"Casteigts A"},{"key":"bibr24-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P"},{"key":"bibr25-1550147718756872","first-page":"444","volume-title":"International colloquium on automata, languages and programming","author":"Erlebach T"},{"key":"bibr26-1550147718756872","first-page":"267","volume-title":"Proceedings of the 26th ACM symposium on parallelism in algorithms and architectures (SPAA)","author":"Akrida EC"},{"issue":"2115","key":"bibr27-1550147718756872","first-page":"753","volume":"466","author":"Grindrod P","year":"2010","journal-title":"Philos Tr R Soc S: A"},{"key":"bibr28-1550147718756872","first-page":"1","volume-title":"Proceedings of IEEE international conference on data science and advanced analytics (DSAA)","author":"Wehmuth K"},{"key":"bibr29-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2016.05.004"},{"key":"bibr30-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1145\/1959045.1959064"},{"key":"bibr31-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12200"},{"key":"bibr32-1550147718756872","first-page":"123","volume-title":"Proceedings of the 25th ACM symposium on Principles of distributed computing (PODC)","author":"Massoulie L"},{"key":"bibr33-1550147718756872","volume-title":"Efficient distributed snapshots and global virtual time algorithms for non-FIFO systems","author":"Mattern F","year":"1990"},{"key":"bibr34-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1145\/357360.357365"},{"key":"bibr35-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1986.6312900"},{"key":"bibr36-1550147718756872","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1550147718756872","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1550147718756872","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1550147718756872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,6]],"date-time":"2020-12-06T20:48:09Z","timestamp":1607287689000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1177\/1550147718756872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1177\/1550147718756872"],"URL":"https:\/\/doi.org\/10.1177\/1550147718756872","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"value":"1550-1477","type":"print"},{"value":"1550-1477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}