Efficient Information Dissemination in Dynamic Networks

Abstract

Dynamic network is the abstraction of networks with frequent topology changes arising from node mobility or other reasons. With the model of dynamic network, distributed computation problems can be formally studied with rigorous correctness. Information dissemination is one of such problems and it has received much attention recently. However, existing works focus on the time cost of dissemination, i.e. how fast the information can be disseminated to all nodes, and communication cost has been largely ignored. Our work focuses on high communication efficiency in information dissemination with correctness property guaranteed. We achieve this by making use of cluster-based hierarchy. Clustering has been widely studied and used in wireless networks to reduce communication cost. However, to the best of our knowledge, it has never been considered in the study of dynamic networks. In this paper, we firstly propose a dynamic network model, named (T, L)-HiNet, to extend existing dynamic network model with clusters. (T, L)-HiNet includes several properties defining the dynamics of cluster hierarchy in a dynamic network. Base on (T, L)-HiNet, we design hierarchical information dissemination algorithms for different scenarios of dynamics. The correctness of our algorithms is proved and the performance is analyzed. Compared with the algorithm recently proposed by Kuhn, Lynch and Oshman [7], our design can significantly reduce communication and our objective is fully achieved.

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

“…Cluster-based hierarchy is very popular in ad hoc networks to reduce communication cost and improve topology control efficiency. In our previous work, 22 we have considered cluster-based hierarchy in dynamic networks and designed hierarchical algorithms for information dissemination.…”

“…In the design of Algorithm 3, we propose the (Q, S)-distance clusterhead model, which is defined based on our recent work on information dissemination. 22 In the following, we first present necessary models and assumptions used and then describe the operations of Algorithm 3. Finally, we prove its correctness and analyze its performance.…”

“…The cluster-based hierarchy with both T-interval clusterhead connectivity and L-hop clusterhead connectivity in the subgraph Y. 22 To design hierarchical counting algorithm, we define the (Q, S)-distance clusterhead model, which defines the change of dynamic distance among the clusterhead nodes by simply extending (Q, S)-distance.…”

Analyzing Eventual Leader Election Protocols for Dynamic Systems by Probabilistic Model Checking

“…Recent years have witnessed an increasingly booming interest in dynamic systems [1][2][3][4] since they have been widely applied in many fields such as distributed systems [5,6], neural networks [4] etc. Accordingly, problems which have been studied in the traditional distribution computing are revisited in this new setting.…”

Cluster-based efficient information dissemination in dynamic networks

“…This article is an extension of our conference paper published in the proceedings of ICPP'13 37 (the 42th International Conference on Parallel Processing). In the extend version, we have added quite a lot of new and significant content to make our work more solid and significant.…”