Faster Information Gathering in Ad-Hoc Radio Tree Networks
| Autor: | Marek Chrobak, Kevin P. Costello |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Computer science
Property (programming) Node (networking) Distributed computing Topology (electrical circuits) 0102 computer and information sciences 02 engineering and technology Rumor 16. Peace & justice 01 natural sciences Radio networks Tree (data structure) 010201 computation theory & mathematics TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing |
| Zdroj: | LATIN 2016: Theoretical Informatics ISBN: 9783662495285 LATIN |
| Popis: | We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all these rumors in the designated target node. The ad-hoc property refers to the fact that the topology of the network is unknown when the computation starts. Aggregation of rumors is not allowed, which means that each node may transmit at most one rumor in one step. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|