A robust novel 4G contention-resolution protocol guaranteeing high QoS and capacity in CBR communications networks by maximal sequential partitioning to significantly resolve contention mini-slot collisions

A novel CBR CR protocol (with fundamental theories and postulates for this protocol) based on the previously proposed user-group-division method is presented here. The CR protocol is used with a divided CBR network MAC protocol that initially divides the network into groups of users, and then continuously re-distributes and regroups the data slot (ds) and contention mini-slot (cms) resources depending on the feedback received on the collision and resource (bandwidth) conditions of the network during the previous round-trip time (rtt). Subsequently, the CR protocol sequentially partitions each active group/subgroup of contending users by assigning two or more cms to each of them. The acceptable size and candidates for each partition is determined by the feedback received on the status(es) of the cms used for the corresponding region in the previous rtt. The protocol can be executed on the mobile stations (ms) or cable modems (cm) from the Base Station (BS) or Head-End (HE) without additional hardware. The advanced network simulator (ANS-1) written in MATLAB using my novel abstractions and novel Nasrin traffic generation and distribution model are used to evaluate the protocol in a flexible and reliable network simulation environment. The results show high (fair) utilization of the required cms and ds bandwidth with a record reduction in both cumulative and repetitive collisions (max. 4 rtt and avg. 2 rtt access delay, 90% cumulative and 80% repetitive cms collision reduction, 90% cms and 100% data bandwidth utilization, and 25% increase in high-data-rate and time-sensitive applications). Thus, the CR protocol guarantees high QoS and capacity by sequentially detecting and managing the contenders so that the ds and cms resource requirements and contentions can be quickly and efficiently predicted and administered by the network.