The problem of throughput optimization in decentralized wireless networks with spatial randomness under queue stability and packet loss constraints are investigated. Two key performance measures are analyzed, namely the effective link throughput and the network spatial throughput. Specifically, the double of medium access probability, coding rate, and maximum number of retransmissions that maximize each throughput metric is analytically derived for a class of Poisson networks, in which packets arrive at the transmitters following a geometrical distribution. Necessary conditions so that the effective link throughput and the network spatial throughput are stable and achievable under bounded packet loss are determined, as well as upper bounds for both cases by considering the unconstrained optimization problem. It results show in which system configuration stable achievable throughput capacity obtained as a function of the network density and the arrival rate. Finally the time delay has get reduced at high rate. The throughput for the two nodes has been found efficiently.