Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/77576
Title: (Q, s)-distance model and counting algorithms in dynamic distributed systems
Authors: Yang, Z
Wu, W
Chen, Y
Lin, X
Cao, J 
Keywords: Distributed algorithms
Dynamic networks
Dynamic systems
Node counting
System model
Issue Date: 2018
Publisher: Hindawi Publishing Corporation
Source: International journal of distributed sensor networks, 2018, v. 14, no. 1 How to cite?
Journal: International journal of distributed sensor networks 
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)
URI: http://hdl.handle.net/10397/77576
ISSN: 1550-1329
EISSN: 1550-1477
DOI: 10.1177/1550147718756872
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

1
Citations as of Sep 18, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.