Understanding and Accelerating Information Spreading in Dynamic Networks
Abstract
In many existing and emerging large-scale networks, an important application is to spread the information quickly and efficiently over the network. This topic has received great research interest, and is relatively well studied for static networks. In contrast, our knowledge is far from complete when the network structures change over time, which is typical for many applications and particularly true for military operations. Furthermore, with the continuing advancement of modern networks, in both military fields and everyday life, there are usually multiple interconnected networks available for information spreading. As the study of multilayer networks is still in infancy, our current understanding for information spreading in multilayer networks is very limited. Through this project we intend to advance our understanding and improve algorithm designs for efficient information spreading in various large-scale dynamic single-layer and multi-layer networks. In the theoretical aspect, we will work towards a unifying analytical framework for mobile networks that can address various types of mobility patterns and handle both connected and disconnected scenarios. We also plan to extend our study to social networks and multilayer networks, which possess unique features and extra resources for information spreading that deserve separate and in-depth considerations. In the design aspect, we plan to explore efficient distributed algorithm design in complex networks, and extend the study to dynamic settings. We will deepen our study on the proposed design framework, to provide a solid underpinning for efficient random-walk based algorithms. The proposed research will be assessed through a comprehensive evaluation plan. If successful, it will contribute a general analytical framework that can further our understanding of information spreading in dynamic complex networks, and provide insights for design and optimization of practical algorithms and protocols that directly address the ArmyÕs needs for multi-dimensional network-centric operations. As random-walk based algorithms serve as a fundamental building block for effective exploration, communication, and computation in large-scale complex networks, the expected substantial improvement on them will benefit all relevant areas.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Oct 23, 2018
- Source ID
- W911NF1710087
Entities
People
- Huaiyu Dai
Organizations
- Army Contracting Command
- North Carolina State University
- United States Army