Accurate and Efficient Counting in Dynamic Networks

Yang, Zhaohui; Wu, Weigang; Chen, Yi-Shun; Lin, Xingqin

doi:10.1109/srds.2014.31

Cited by 2 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kuhn et al 9 propose the T -interval connected model, which stipulates that for every T consecutive rounds, there exists a stable connected spanning subgraph. In our previous work, 23 we proposed ( Q, S )-distance model, which is used to describe dynamic changes of information propagation time between any two nodes. Ducourthial and Wade 24 introduce a dynamic p -graphs model.…”

Section: Related Workmentioning

confidence: 99%

Cluster-based efficient information dissemination in dynamic networks

Yang

Yong

et al. 2018

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

Dynamic network is an abstraction of networks with frequent topology changes arising from node mobility or other reasons. In this article, we first propose a dynamic network model, named (T, L)-HiNet, to extend existing dynamic network models with clusters. (T, L)-HiNet includes several properties defining the stability of cluster hierarchy in a dynamic network, including cluster head set, cluster member set and the connections among them. Based on (T, L)-HiNet, we design several hierarchical information dissemination algorithms for different scenarios of dynamics. Furthermore, we extend the (T, L)-HiNet model and corresponding algorithms in two directions, that is, stability of cluster head set and cluster size. The correctness of our algorithms is proved rigorously, and their performance is evaluated via both numerical analysis and simulations. The results show that compared with the algorithm recently proposed by Kuhn et al., our design can significantly reduce communication cost and also time cost.

show abstract

Section: Related Workmentioning

confidence: 99%

Cluster-based efficient information dissemination in dynamic networks

Yang

Yong

et al. 2018

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…3 A dynamic system focusing on topology changes is also referred to as ''dynamic network.'' 4,5 Quite a lot of work has been done for dynamic networks. Researchers have proposed formal system models 6,7 to describe the change of network topology and distributed algorithms [8][9][10] with formal correctness proof to solve fundamental computing problems in dynamic environments.…”

Section: Introductionmentioning

confidence: 99%

“…The dynamicity of dynamic systems lies in frequent topology changes due to node mobility 1,2 and/or changes of node set due to node joining/leaving. 3 A dynamic system focusing on topology changes is also referred to as “dynamic network.” 4,5…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

(Q, S)-distance model and counting algorithms in dynamic distributed systems

Yang

Chen

et al. 2018

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

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)*-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.

show abstract

Accurate and Efficient Counting in Dynamic Networks

Cited by 2 publications

References 26 publications

Cluster-based efficient information dissemination in dynamic networks

Cluster-based efficient information dissemination in dynamic networks

(Q, S)-distance model and counting algorithms in dynamic distributed systems

Contact Info

Product

Resources

About