An investigation is conducted of the problem of determiningrouting assignments in slotted Aloha packet radio networks to maximizethe end-to-end throughput. It is assumed that the networks have anarbitrary topology and that the relative traffic requirements matrix isarbitrary. The problem is formulated as a nonlinear programming problem.Unfortunately, the problem is not a convex program, which explains whythe development of an algorithm to find global optimal solutions hasbeen so elusive. A heuristic algorithm is developed based upon ideasfrom resource directive decomposition. The heuristic is applied toseveral standard problems. The numerical results show that the methodcompares favorably to other methods in the literature
展开▼
