Let G1=(V1,E1), G2=(V2,E2), ⋯, Gk=(Vk,Ek) be k graphs, and let f1:V1→V2, f2:V2→V3, ⋯, fk−1:Vk−1→Vk, fk:Vk→V1 be k bijections. The k-composition networks G induced by G1, G2, ⋯, Gk is the graph with V(G)=⋃t=1kV(Gt) and E(G)=⋃t=1kE(Gt)∪{(at,ft(at)):at∈V(Gt) and 1≤t≤k}. Many interconnection networks such as n-dimensional torus networks, recursive circulant graphs and Cayley graphs on abelian groups generated by minimal generating sets are special k-composition networks.The strong matching preclusion number of a graph is the minimum number of edges and/or vertices whose deletion results in the remaining graph has neither perfect matchings nor almost perfect matchings. In this paper, we study the strong matching preclusion number and strong matching preclusion sets for k-composition networks with odd order. Our results generalize the main conclusion in [12].