![]() ![]() The replication rate l is selected for each source packet at random according to a transmission probability Λ ( x ) = ∑ l m a x l = 0 Λ l x l, where Λ l is the probability that a source transmits l replicas of a given source packet within the MAC frame, and l m a x is the maximum replication rate. Each replica is transmitted within one time slot and replicas sent from the same source are allocated to different slots, which are uniformly selected at random among the M available slots in a MAC frame. ![]() Visual sensor networks, in which each source sends periodic data to a central BS, represent one possible scenario 1 1 1 Random MAC strategies offer scalability, and adaptability to possibly varying L, like in the scenario considered in this paper.Įach source sends K source packets per MAC frame and each source packet is sent in multiple replicas within the MAC frame. The time axis is discretized in MAC frames, each of those composed of M time slots. In particular, let us consider a system where L sources send information to a central base station ( BS), through an irregular repetition slotted ALOHA ( IRSA) algorithm, which is a SA protocol with SIC. Random random slotted ALOHA ( SA) with successive interference cancellation ( SIC) has been widely considered as an effective MAC strategy, for its good performance despite the distributed protocol.
0 Comments
Leave a Reply. |