부산대학교 도서관

We consider a multi-hop wireless network with a connection-oriented traffic model and multiple transmission channels that can be spatially re-used. In such a network the blocking probability of a call that makes a channel request depends on (a) the channel assignment scheme and (b) the transmission radius of the nodes which affects the network link structure. In this work, we study these two aspects for simple wireless networks. Specifically, we develop blocking probability analysis for a wireless line and grid network and explore the tradeoff between transmission radius and blocking probability for multi-hop calls. We show that for a line network a larger transmission radius can substantially reduce the blocking probability of calls, while for a grid network with a more dense node topology using a smaller transmission radius is better. We then, investigate various channel assignment schemes and present a novel non-rearranging channel assignment algorithm for multi-hop calls in a general network. Our algorithm efficiently incorporates spatial channel re-use and significantly reduces call blocking probability when compared to other algorithms.