To evaluate the benefit of network coding, we implement a content distribution system based on sparse linear coding for P2P networks. To increase the practicability of our system, we resort to some strategies in encoding process and transmission control,such as coding interval and dependency test, to help diffuse data at senders with increasing blocks and reduce linear dependence resulting from cyclic topology. Experimental results
show that network coding slightly outperforms non-coding in terms of average downloading time at peers, total distribution time and the whole throughput,via contrast experiments with a BitTorrent-like system based on Local Rarest First scheme.

Resilient codes, such as Random Linear Code(RLC) and Reed-Solomon Code(RS),have been applied into many distributed storage systems, due to their improvements for data reliability. We resort to a new code "Sparse Linear Coding"(SLC) for p2p distributed storage, and compare its performance with RLC and RS codes in terms of computational overhead, besides data reliability. Through simulations, we prove that SLC achieves the least encoding time expense, almost the same space complexity and data reliability, with the other two codes, for a p2p storage system with a configuration of practical parameters. However, it has no superiority in decoding rate, as compared to RS code.. . .

Forwarding Problem in Ad Hoc Wireless Network .
Study on NP complete theory, concentrate on forwarding algorithm research for multihop nodes in Ad Hoc Network. Related paper: "Selective Forwarding Algorithms for two-hop broadcasting" presents a greedy algorithm for two-hop nodes in Ad Hoc network, aiming at minimum collisions