Modem communicatians services have strict quality of service (QoS) quiremenis, with separate eonstrsinb on bandwidth, delay and error tolerance. The task of finding a mute through a network satisfying multiple QoS constmiits is intractable, but increasingly important for modern atmmuniestions apptications. This paper investigates an appmximate algorithm, which has p-ously been analysed for the w e of two constraints, and presents a generalisation of this analysis to the m e of an srbihary number of constraints. The bloeliing rate of this algorithm is then empirically compared to several other techniques

Absfmct-In multihop cellular neiwarks, mobiles with no gwd path l o any base ist ti on may inliead relay their calli thmugh oiher mabiln wiih hdlcr propagation renditions. This can impmvr coverap and capactly, sod d u c e the required total transmission power, bui its elfectivenrrr drpenl p a l l y on the routing ~l n t r g y used. This paper tweiligater the minimum possible asgregste transmit power in the presenceof interference in a ringlHell multihop cellular network. The new concept of iderference-sensitiICe link coils is i n t m duced, and is shown to perform suhrtantidly beller than routing bawd soldy on palh loss, Which is optimal In the mise-limiied C~I L 0-7803-7632-3/02/~17.00 02002 IEEE

In ad-hoc networks, the optimal hop size is a trade-off between the transmission errors and the number of hops required. This paper investigates the optimal hop size and transmission strategy in networks with overlaid base stations. The objective is to maximize the minimum throughput any user achieves, excluding traffic that it relays. The optimum depends on the routing algorithm used, and a specific receiver-based algorithm is proposed. Optimal parameters are derived using a simplified model, and are shown by simulation to out-perform systems with the optimal positioninvariant hop size. For this choice of objective, improvement is obtained by using one hop size for the base station and another for relays.

No abstract