To solve the problems existing in the present probabilistic routing based on Bargaining Games

including redundant control packets exist in the exchange process of Summary Vector（SV）

redundancy exists in the messages interaction process

and unnecessary overhead from using special data structure to transmit matrix of delivery probability

an routing algorithm based on information piggybacked by SV and Low-overhead Routing based on Information Piggybacked by SV for opportunistic networks（LR-IPSV）is proposed.The LR-IPSV algorithm designs an improved exchange mechanism of SV and eliminate the redundant steps in current interaction mechanism.We also propose mechanism of piggybacking matrix of delivery probability with SV to reduce the control overhead and improve the network throughput.The simulation results show that the proposed LR-IPSV algorithm shows better performances than previous Probabilistic Routing Protocol using History of Encounters and Transitivity（PROPHET）algorithm and Game-theoretic approach to Stimulate Cooperation for Probabilistic routing（GSCP）algorithm in terms of overhead and throughput.