On the complexity of neighbourhood learning in radio networks

Theoretical Computer Science, Volume 608, Issue P2, 2015.

Cited by: 3|Bibtex|Views1|Links
EI

Abstract:

Consider a synchronous radio network of n stationary nodes represented by an undirected graph with maximum degree . Suppose that each node has a unique ID from {1,,U}, where Un. In the neighbourhood learning task, each node must produce a list of the IDs of its neighbours in the network. We prove new lower bounds on the number of slots ne...More

Code:

Data:

Your rating :
0

 

Tags
Comments