A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
[chapter]
Lecture Notes in Computer Science
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where the vertices represent the nodes and the edges, the possible communications. The interference constraint is modeled by a fixed integer dI ≥ 1, which
doi:10.1007/978-3-540-85209-4_16
fatcat:bjghza5zyrgtrinf7fqofxu7j4