An algorithm to find global optimal routing assignments for a class of PRNs

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.<<ETX>>

[1]  I. Gitman.  On the Capacity of Slotted ALOHA Networks and Some Design Problems , 1975, IEEE Trans. Commun..

[2]  F.A. Tobagi,et al.  Modeling and performance analysis of multihop packet radio networks , 1987, Proceedings of the IEEE.

[3]  J. R. Yee,et al.  On determining the transmission range for multi-hop slotted Aloha packet radio networks , 1990, IEEE Conference on Military Communications.

[4]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[5]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[6]  James R. Yee,et al.  On calculating high throughputs in multi-hop slotted ALOHA packet radio networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[7]  John A. Silvester,et al.  On the Capacity of Multihop Slotted ALOHA Networks with Regular Structure , 1983, IEEE Trans. Commun..