give neighboring bsss a chance to transmit their top priority packets as long as any of the deferral rime intervals for low priority traffic is longer than the deferral time intervals for higher priority traffic of any tag in general all neighboring bsss would have a chance to transmit all pending top priority packets before any lower priority packets are transmitted fig4 illustrates how three interfering bsss each with two types of traffic of different priorities share the same channel in two consecutive frames as before the tags assigned in each of the two frames are 1 2 2 3 and 3 1 for the three bsss respectively the deferral times for the top priority traffic are 1 2 and 3 time slots for tags 1 2 and 3 respectively the deferral times for the higher priority traffic are 4 5 and 6 time slots for tags 1 2 and 3 respectively a requirement in assigning tags to bss is that distinct tags must be given to user entities with potential to interfere this is not a difficult requirement to meet in the absence of any information a different tag could be assigned to each user entity in that case non interfering cells will use the channel simultaneously even though they have different tags interference sensing will enable reuse of the channel by non interfering bsss that have been assigned different tags there are advantages however in reducing the number of different tags for instance if the interference relationships between user entities are known.