We investigate the impact of the node-selfishness on the network connectivity and the path delay of information dissemination in large scale Ad-hoc networks based on the percolation theory. A network framework with links obeying stationary process is conceived by combining the effects of both node-selfishness and link qualities. The existence of the node cooperation probability boundary is proved when the network density exceeds a value. The network presents two connection characteristics with respect to this boundary. The minimum path delay is asymptotically independent of the source-destination distance when the node cooperation probability exceeds this boundary. While the node cooperation probability is below the boundary, the minimum path delay scales linearly with the source-destination distance. Simulation results verify the theoretical analysis.