Grouping nodes gives better performance to the whole network by diminishing the average network delay and avoiding unnecessary message for warding and additional overhead. Many routing protocols for ad-hoc and sensor network shave been designed but none of them are based on groups. In this paper, we will start defining group-based topologies,and then we will show how some wireless ad hoc sensor networks (WAHSN) routing protocols perform when the nodes are arranged in groups. In our proposal connections between groups are established as a function of the proximity of the nodes and the neighbors available capacity (based on the nodes energy). We describe the architecture proposal, the messages that are needed for the proper operation and its mathematical description. We have also simulated how much time is needed to propagate information between groups. Finally, we will show a comparison with other architectures.