Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/77576
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Computing | - |
dc.creator | Yang, Z | - |
dc.creator | Wu, W | - |
dc.creator | Chen, Y | - |
dc.creator | Lin, X | - |
dc.creator | Cao, J | - |
dc.date.accessioned | 2018-08-28T01:33:19Z | - |
dc.date.available | 2018-08-28T01:33:19Z | - |
dc.identifier.issn | 1550-1329 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/77576 | - |
dc.language.iso | en | en_US |
dc.publisher | Sage Publications, Inc. | en_US |
dc.rights | © The Author(s) 2018 | en_US |
dc.rights | Creative Commons CC BY: This article is distributed under the terms of the Creative Commons Attribution 4.0 License(http://www.creativecommons.org/licenses/by/4.0/) which permits any use, reproduction and distribution of the work withoutfurther permission provided the original work is attributed as specified on the SAGE and Open Access pages (http://www.uk.sagepub.com/aboutus/openaccess.htm). | en_US |
dc.rights | The following publication Yang, Z., Wu, W., Chen, Y., Lin, X., & Cao, J. (2018). (Q, S)-distance model and counting algorithms in dynamic distributed systems. International Journal of Distributed Sensor Networks, 14(1), 1-18 is available at https://doi.org/10.1177/1550147718756872 | en_US |
dc.subject | Distributed algorithms | en_US |
dc.subject | Dynamic networks | en_US |
dc.subject | Dynamic systems | en_US |
dc.subject | Node counting | en_US |
dc.subject | System model | en_US |
dc.title | (Q, s)-distance model and counting algorithms in dynamic distributed systems | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 1 | en_US |
dc.identifier.epage | 18 | en_US |
dc.identifier.volume | 14 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.doi | 10.1177/1550147718756872 | en_US |
dcterms.abstract | 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 “dynamic network.” 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) | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | International journal of distributed sensor networks, 2018, v. 14, no. 1, 1-18 | - |
dcterms.isPartOf | International journal of distributed sensor networks | - |
dcterms.issued | 2018 | - |
dc.identifier.isi | WOS:000423804600001 | - |
dc.identifier.scopus | 2-s2.0-85041484822 | - |
dc.identifier.eissn | 1550-1477 | en_US |
dc.description.validate | 201808 bcrc | en_US |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Yang_Q_S_Distance.pdf | 1.41 MB | Adobe PDF | View/Open |
Page views
136
Last Week
2
2
Last month
Citations as of Apr 14, 2024
Downloads
76
Citations as of Apr 14, 2024
SCOPUSTM
Citations
2
Last Week
0
0
Last month
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
1
Last Week
0
0
Last month
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.