An algorithm of resource allocation for multihop packet radio networks with radial data flow

This paper deals with a multihop packet radio network with a gateway located in the symmetrical center of the service area. The network is supposed to provide only user-to-gateway packet transmission service via radio links and it is supposed to be constructed by means of modular components, particularly of standard transceiver units. Thus, the network design consists basically in allocating transceiver units to each cell properly. In this paper, an algorithm for the resource allocation is presented, which enables a cost effective feasible design. A system is considered feasible when it can reach steady state, and cost effective when no more resources are employed than necessary. Based on a homogeneous cellular network model with gateway in the hub, the lower bound for the service rate necessary for the steady state is found for each cell, using combinatorial techniques. This lower bound can be related to the amount of transceiver units necessary for a given arrival rate and service profile, which results in an algorithm of resource allocation. An application example of the presented algorithm is given to demonstrate feasibility and cost effectiveness