What is the best algorithm for wireless node detection. Suppose you have a large wireless network or a bluetooth network, whether each node had its own detection range.
What is the best algorithm that allows any node to learn about the full graph topology, i.e. will any node know about all other nodes in the graph?
Little work has been done on these (and similar) problems. You can start by looking for several places, such as:
MIT Grid Ad Hoc NetworkingWireless Grids Corporation Berkeley Project
Googling , " ", , .
, node node , node .
, a node , , , ( " - , , , , " ). node, , node .
, a node node, , node . . node , . , node .
, node, " ", . , node, . , " ", , , .
, , Python, . , .