Skip to main content
select distinct n.content as name, r.content as role, t.nameID as nameID, n.unitID as unitID, n.departmentID as departmentID, n.facultyID as facultyID, n.provinceID as provinceID, n.countryID as countryID from transaction as t, Name as n, Role as r where t.itemID='102101' and and

Performance comparison of Collision resolution algorithms with amount of feedback information



เครือข่ายนักวิจัย+ผลงานวิจัย (full screen)


This paper presents the Performance comparison of eight Collision resolution algorithms. It can be systematically applied for Random access protocols under different feedback information which includes binary, ternary and feedback of the number of accessing packets. Each algorithm is derived from the combination of uniform Selection algorithm and three effective strategies, including splitting, adaptive frame size, and skipped slot. This paper aims to investigate which one strategy in these three strategies is the best effective to improve the system performance. Based on simulation results, when the information about number of accessing packets is available, significant improvement in mean access delay can be achieved. We found that the splitting strategy is the most effective strategy, following by adaptive frame size and skipped slot. © 2013 IEEE.

Collision resolution algorithm (1 items found) | Performance comparison (65 items found) | Random access protocol (2 items found) | feedback information (1 items found) | Selection algorithm (14 items found) | tree algorithmCollision resolution algorithm | Feed back information | Medium access control | Splitting strategies | Ubiquitous computing | Tree algorithms | MAC protocol | Algorithms |

ต้นฉบับข้อมูล : scopus