We propose a protocol where a node occasionally sends a signed packet including the accumulator reading. The non repudiation nature of digital signatures provides some recourse to third parties. In the above example A may choose to assure B by sending such a signed packet immediately upon a large change in the accumulator such as when large value packets are sent.
This overcomes one of the ways that DSR can break down under large transfers. There remains the problem of an operator taking the money and disappearing.
There are small technical problems with synchronization. If the signed packet includes the transmission and reception packet counts then the balances should be precise. Alternatively one might settle for approximate checks. If balances are kept for each direction separately then the logic becomes simpler.
If a node sometimes gets a signed packet with an amount that is less than he expects, the following protocol may help find the source of error between honest operators. Lost and duplicate packets are the likely source of discrepancies.
The either the sender or receiver of packets over an interface computes a hash of a summary for each packet. This summary includes the interface packet serial number, money field and packet error control value (checksum). The summary need not otherwise cover the payload. The exclusive-or of these hashes is included in the signed balance report. The commutative and associative xor is used since packet error control or other interface quirks may permute the order that the packets are seen.
Just now it is not clear to me what clues this scheme provides over the signed balance report. They can both be used to convince the sender that there is a bug in his code. A third party can now decide which node has a bug in its code if either side has kept the packet summaries.