Analysis of a deterministic Manhattan network
S. A. Paschos, Μιλτιάδης Αναγνώστου, E.N. Protonotarios · 2003
The authors explore the properties of a Manhattan packet radio network. They model the network as a grid of GI/G/1 queues. The two-step analysis involves a computation of the flows (first step) and a queuing analysis (second step), at each link of the network. A deterministic protocol is used which determines which node transmits in each time slot (slots are fixed-length time intervals).>