The instantaneous effect of path loss and channel fading can be modelled as
$$ \text{PL}(d) \approx 10\gamma\times\log\left(\frac{d}{d_0}\right) + \text{PL}(d_0) + X_1 + X_2$$
where \$X_1\$ is zero-mean log-normal distributed and is due to slow fading (i.e shadowing) and \$X_2\$ is zero-mean Rayleigh distributed if in mobile, NLOS environment. If there is a LOS component then \$X_2\$ will be Ricean distributed. Note the formula above is not the same one used in communication budget link loss calculation, budget link loss is a similar but slightly different matter.
The log-normal path loss distribution simplifies this model by condensing \$X_1\$ and \$X_2\$ into one log-normally distributed variable \$X_g\$. It is particularly accurate if \$X_2\$ is negligible because of relatively low mobility (i.e in slow fading channels).
\$X_1\$ and \$X_2\$ are stochastic variables drawn from probability distribution functions, not deterministic quantities. If you have a random number source that produces uniformly distributed numbers, \$U\$, in the interval [0,1]. Then you can easily formulate a log-normal or Rayleigh number source from values of U by using inverse transform sampling. See source [1] and [2].
$$X_1 = \sigma \sqrt {-2\ln U_1} \cos (2\pi U_2)$$
$$X_2 = \sigma \sqrt {-2\log U}$$
or assume just log-normal and use just one variable
$$X_g = \sigma \sqrt {-2\ln U_1} \cos (2\pi U_2)$$
Where \$U_i\$ is a random variable drawn from the uniform distribution.The standard deviation (\$\sigma\$) is obtained empirically, you can see sample values of \$sigma\$ used to evaluate \$X_g\$ in different environments below [source]:

Note that because \$X_1\$ and \$X_2\$ are zero mean their effect can be largely reduced by taking many RSS values and then passing them through an optimal averaging filter. The biggest problem you have is that in a pure NLOS environment the path loss model we have being discussing here will be fairly inaccurate in a lot of settings as it assumes broadly similar environmental conditions existing between the average path distances [\$0\$,\$d_0\$] and [\$d_0\$, \$d\$], which is not the case in many NLOS cases. Again in NLOS there will be the issue of the average path distance being very different from the actual distance between communicating nodes. You might want to read up on that and maybe try searching for "Wireless Sensor Network RSSI Localisation algorithms" to see common ways the problem you have is commonly tackled in literature.