This paper proposes a clustering routing algorithm that conJgures cluster to reduce the number of messages when establishing routing paths. Sensor nodes deployed in a sensing area contain links information about adjacent nodes. While receiving an interest ji-om neighbor nodes, the sensor node broadcasts the interest and own bitmap. Each node keeps link information expressed by bitmap. After broadcasting, each node updates the bitmap when the adjacent nodes broadcast the same interest message. The size of bitmap is restricted, so sensor node must be classzJed into clusters. We try to divide clusters by naming a sub-sink node. Then, all nodes in a certain cluster must report to the sub-sink node. A sub-sink has afirnction to broadcast an interest and to receive data from cluster members. The sub-sink node broadcasts only an interest, because the size of bitmap is restricted and all nodes need not know information about total topologies. The proposed routing algorithm reduces the number of required messages for establishing routing paths in comparison to the previous clustering algorithms.