Radio　frequency　identification　is　a　wireless　communication　technology,　which　enables　data　gathering　and　identifies　recognition　from　any　tagged　object.　The　number　of　collisions　produced　during　wireless　communication　would　lead　to　a　variety　of　problems　including　unwanted　number　of　iterations　and　reader-induced　idle　slots,　computational　complexity　in　terms　of　estimation　as　well　as　recognition　of　the　number　of　tags.　In　this　work,　dynamic　frame　adjustment　and　optimal　splitting　are　employed　together　in　the　proposed　algorithm.　In　the　dynamic　frame　adjustment　method,　the　length　of　frames　is　based　on　the　quantity　of　tags　to　yield　optimal　efficiency.　The　optimal　splitting　method　is　conceived　with　smaller　duration　of　idle　slots　using　an　optimal　value　for　splitting　level　M-opt,　where　(M　＞　2),　to　vary　slot　sizes　to　get　the　minimal　identification　time　for　the　idle　slots.　The　application　of　the　proposed　algorithm　offers　the　advantages　of　not　going　for　the　cumbersome　estimation　of　the　quantity　of　tags　incurred　and　the　size　(number)　of　tags　has　no　effect　on　its　performance　efficiency.　Our　experiment　results　show　that　using　the　proposed　algorithm,　the　efficiency　curve　remains　constant　as　the　number　of　tags　varies　from　50　to　450,　resulting　in　an　overall　theoretical　gain　in　the　efficiency　of　0.032　compared　to　system　efficiency　of　0.441　and　thus　outperforming　both　dynamic　binary　tree　slotted　ALOHA　(DBTSA)　and　binary　splitting　protocols.