Study on isolated algorithm of conflictresolution with alterable values of p for binary trees
Cheng Jun-lin · Yunnan Daxue xuebao. Shehui kexue ban · 2007
It is presented an improved isolated algorithm of conflict resolution for binary tree,and analyzed the packet conflict resolution in random multiple access system.Furthermore,the average times of packet conflict resolution and the analytic formulae of the throughput of improved isolated algorithm are explicitly obtained.The simulation results shows that the theory results of packet conflict resolution are accorded with its simulation results.