QoS routing in multihop packet radio environment

We present a method to compute the path bandwidth for the DSDV (destination-sequenced distance-vector) based routing algorithm. The addressed network does not necessarily have a cellular structure and could have no fixed infrastructure. This network can be either stand-alone, or connected to the wired network. Each mobile station has to relay packets for others, thus achieving multihop routing. To calculate the available bandwidth of a path in this environment, it is incorrect to simply compute the minimum bandwidth of the links along the path. There are two crucial steps in the path bandwidth computation process of this multihop environment: (1) intersecting the sets of common free slots of two adjacent links, and (2) dividing the intersection for the adjacent links to share. We present two bandwidth computation rules including the half rule and the floating rule. Numerical results are given to evaluate the performance of applying these rules to the DSDV-based QoS routing algorithm.