Title :
An algorithm to find global optimal routing assignments for a class of PRNs
Author :
Yee, James R. ; Shiao, Feng-Min
Author_Institution :
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
Abstract :
The problem of determining routing assignments and transmission probabilities to maximize the end-to-end throughput in a slotted ALOHA packet radio network is investigated. Due to interference from the neighbors of a receiver, this optimization problem is inherently nonconvex. By restricting the transmission probability of each node to be the same, it is shown that a global optimal solution can be found by solving a series of linear programs. Dantzig-Wolfe decomposition is applied to solve the LPs. The numerical examples show that the proposed method is effective in determining the network capacity
Keywords :
channel capacity; linear programming; packet switching; radio networks; Dantzig-Wolfe decomposition; algorithm; end-to-end throughput; global optimal routing assignments; linear programs; network capacity; slotted ALOHA packet radio network; transmission probabilities; Access protocols; Interference; Packet radio networks; Radio network; Receivers; Routing; Satellite broadcasting; Throughput; Topology; Wire;
Conference_Titel :
Communications, 1991. ICC '91, Conference Record. IEEE International Conference on
Conference_Location :
Denver, CO
Print_ISBN :
0-7803-0006-8
DOI :
10.1109/ICC.1991.162270
