On the Power of Broadcasting in Mobile Computing
A computational model reflecting fundamental computational aspects of wirelessly communicating mobile processors is presented. In essence, our model is a deterministic Turing machine that can launch new processes among which a wireless communication via explicitly assigned channels must be programmed. We show that computations of such machines are polynomially time- and space-equivalent to the synchronized alternating Turing machines studied previously in the literature. This shows that nondeterminism can be completely eliminated from synchronized alternation at the price of introducing a program-driven communication among the respective processors.
KeywordsTuring Machine Communication State Computational Graph Channel Space Channel Tape
Unable to display preview. Download preview PDF.
- 6.Wiedermann, J., Pardubská, D.: On the power of broadcasting in mobile computing. Technical report V-944, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague 2005, 17 p.Google Scholar