Summary
Motivated by applications to information networks such as wireless and ad-hoc, this research will explore
fundamental informational properties of networks under communication constraints. In the standard
approach, the network is assumed to be fully connected and/or the information it carries is treated as a
commodity. Here, we will investigate a markedly different paradigm where limitations on the nodes’
connectivity in the network are imposed and pieces of information can be combined. Examples include
storage systems in which the links are established by physical proximity or system architecture, as well as
low-power wide-area networks for Internet-of-Things applications. We will consider a broad spectrum of
models and topics ranging from efficient information encoding and network resiliency to information loss
under corrupt nodes to cooperative models and network information accessibility. We will study these topics
under specific network families and random networks.
While prominently theoretic, the proposed investigation is expected to yield insights and design rules for the
construction of information networks, e.g., via new data placement techniques and communication protocols.
Moreover, we plan to devote part of our study to practical aspects by implementing and testing the theory
developed in real-world networks. Such developments may well lead to a paradigm shift in the design of
resource-limited wireless communication systems, and potentially reduce energy consumption, delays, and
increase the overall information reliability. Lastly, our motivation stems from the perception that naturally
occurring phenomena in general networks are dependent on the information carried by them; this perception
is what drives both the research questions we pose and the mathematical model we define. Consequently, the
theoretical results are expected to be practical and influential across different disciplines and research areas.
fundamental informational properties of networks under communication constraints. In the standard
approach, the network is assumed to be fully connected and/or the information it carries is treated as a
commodity. Here, we will investigate a markedly different paradigm where limitations on the nodes’
connectivity in the network are imposed and pieces of information can be combined. Examples include
storage systems in which the links are established by physical proximity or system architecture, as well as
low-power wide-area networks for Internet-of-Things applications. We will consider a broad spectrum of
models and topics ranging from efficient information encoding and network resiliency to information loss
under corrupt nodes to cooperative models and network information accessibility. We will study these topics
under specific network families and random networks.
While prominently theoretic, the proposed investigation is expected to yield insights and design rules for the
construction of information networks, e.g., via new data placement techniques and communication protocols.
Moreover, we plan to devote part of our study to practical aspects by implementing and testing the theory
developed in real-world networks. Such developments may well lead to a paradigm shift in the design of
resource-limited wireless communication systems, and potentially reduce energy consumption, delays, and
increase the overall information reliability. Lastly, our motivation stems from the perception that naturally
occurring phenomena in general networks are dependent on the information carried by them; this perception
is what drives both the research questions we pose and the mathematical model we define. Consequently, the
theoretical results are expected to be practical and influential across different disciplines and research areas.
Unfold all
/
Fold all
More information & hyperlinks
| Web resources: | https://cordis.europa.eu/project/id/852953 |
| Start date: | 01-10-2020 |
| End date: | 30-09-2025 |
| Total budget - Public funding: | 1 474 375,00 Euro - 1 474 375,00 Euro |
Cordis data
Original description
Motivated by applications to information networks such as wireless and ad-hoc, this research will explorefundamental informational properties of networks under communication constraints. In the standard
approach, the network is assumed to be fully connected and/or the information it carries is treated as a
commodity. Here, we will investigate a markedly different paradigm where limitations on the nodes’
connectivity in the network are imposed and pieces of information can be combined. Examples include
storage systems in which the links are established by physical proximity or system architecture, as well as
low-power wide-area networks for Internet-of-Things applications. We will consider a broad spectrum of
models and topics ranging from efficient information encoding and network resiliency to information loss
under corrupt nodes to cooperative models and network information accessibility. We will study these topics
under specific network families and random networks.
While prominently theoretic, the proposed investigation is expected to yield insights and design rules for the
construction of information networks, e.g., via new data placement techniques and communication protocols.
Moreover, we plan to devote part of our study to practical aspects by implementing and testing the theory
developed in real-world networks. Such developments may well lead to a paradigm shift in the design of
resource-limited wireless communication systems, and potentially reduce energy consumption, delays, and
increase the overall information reliability. Lastly, our motivation stems from the perception that naturally
occurring phenomena in general networks are dependent on the information carried by them; this perception
is what drives both the research questions we pose and the mathematical model we define. Consequently, the
theoretical results are expected to be practical and influential across different disciplines and research areas.
Status
SIGNEDCall topic
ERC-2019-STGUpdate Date
27-04-2024
Images
No images available.
Geographical location(s)
