The algorithm we present in this paper aims to optimally distribute and connect the community of loosely coupled middle agents ensuring communication accessibility in a dynamic, inaccessible environment. Complete decentralization, autonomous adaptation to local and global changes in the environment and domain independence are main features of the presented algorithm. The main motivation of this approach is to significantly decrease the number of messages required for communication relaying in inaccessible system operation. We use social dominance models and virtual payments to obtain such behavior.