Grouping nodes gives better performance to the whole network by diminishing the average network delay and avoiding unnecessary message forwarding and additional overhead.Many routing protocols for ad-hoc and sensor networks have 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 neighbor’s available capacity(based on the node’s 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. Grouping nodes gives better performance to the whole network by diminishing the average network delay and avoiding unnecessary message forwarding and additional overhead. Mobile routing protocols for ad-hoc and sensor networks have 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. Our proposal connections between groups are established as a function of the proximity of the nodes and the neighbor’s available capacity (based on the node’s 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.