In multi-hop routing, cluster heads close to the base station functionaries as intermediate nodes for father cluster heads to relay the data packet from regular nodes to base station. The cluster heads that act as relays will experience energy depletion quicker that causes hot spot problem. This paper proposes a dynamic multihop routing algorithm named Data Similarity Aware for Dynamic Multi-hop Routing Protocol (DSA-DMRP) to improve the network lifetime, and satisfy the requirement of multi-hop routing protocol for the dynamic node clustering that consider the data similarity of adjacent nodes. The DSA-DMRP uses fuzzy aggregation technique to measure their data similarity degree in order to partition the network into unequal size clusters. In this mechanism, each node can recognize and note its similar neighbor nodes. Next, K-hop Clustering Algorithm (KHOPCA) that is modified by adding a priority factor that considers residual energy and distance to the base station is used to select cluster heads and create the best routes for intra-cluster and inter-cluster transmission. The DSA-DMRP was compared against the KHOPCA to justify the performance. Simulation results show that, the DSA DMRP can improve the network lifetime longer than the KHOPCA and can satisfy the requirement of the dynamic multi-hop routing protocol.