No abstract

No abstract

Abstruct-We investigate algorithms based on simulated annealing to solve the channel assignment problem for cellular radio networks. The blocking probability of a network is chosen as the optimization criterion. In order to check the quality of the solutions obtained by simulated annealing, we examine some special types of networks which allow an effective calculation of optimal solutions by tailored algorithms. Our investigations show that simulated annealing is a very powerful tool for solving channel assignment problems.

No abstract

We present a one-dimensional model to analyze routing strategy N F P (Nearest with Forward Progress) for a multihop packet radio network. It is assumed that each station has adjustable transmission range to address target nodes, distributed on a line according to a nonhomogeneous Poisson process. N F P transmits to the nearest neighbor in the desired direction with transmission range as small as possible, to minimize the probability of collisions. This model is appropriate e.g. for road traffic information systems. Our analysis is based on a complete mathematical description, the solution of certain differential equations is one of the key points t o arrive at a closed form solution. Results are presented graphically. It turns out that N F P has uniformly largest throughput, while progress behaves comparable t o other routing strategies proposed in the literature.