Self–Organized Networks are multi-hop networks that do not rely on any infrastructure. Moreover, their topology is supposed to be flat since all nodes are equally in charge of address allocation and routing functions. Their time–changing topology breaks the association between Identification and Location that is present in the IP address. Moreover, mobility can not be handled easily when the addressing space is based on a tree description. In this paper we propose the use of Virtual Regular Structures to provide desired properties for Self0–Organized Networks. Our approach opens new ways to build addressing spaces and enables an implementation based on trellis graphs. We propose a construction heuristic and evaluate its performance via simulations. We also analyze the robustness of the proposed approach with regards to mobility.