: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as possible to avoid redundant sensor and transceiver tasks. In addition to energy awareness, the network has to guarantee complete sensor coverage and connectivity as long as possible. This paper presents a novel clustering algorithm, which allows building up clusters without knowledge about their position. Next to the advantage that only one node per cluster has to be active at each time, also no node has to localize itself. We compared our developed algorithm with former clustering and redundancy detection approaches in terms of nodes per cluster and coverage abilities.