Auto Transition Function in RADG

Abstract

Abstract The main problem of RADG (Reaction Automata Directed Graph) is the fixed design of the graph. The purpose of this paper is to develop the transition function from fixed design to dynamic design, the dynamic design based on a key between sender and receiver in addition to some rules, the new design is more efficient and fairly distributed between standard states and reaction states, that design keeps the main aspect of RADG which gives more than one ciphertext to the same plaintext and adds high level of security to the wireless network.