It is shown that community structure has great influence on traffic transportation. Networks with pronounced community structure are less efficient in terms of packet delivery. While the shortest path is chosen at random in the shortest path routing strategy, a routing strategy based on community structure is proposed in this paper which can reduce the betweenness centrality of the nodes on the edge of the community by minimizing the number of the communities that the shortest path passes through. Simulations show that the new strategy can enhance the packet delivery capability with the small-world character and that the more accurately the community is identified, the more efficient the new strategy is.