Blocking probability and channel assignment in wireless networks

Authors:
M. Zafer;E. Modiano
Affiliations:
Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA;-
Venue:
IEEE Transactions on Wireless Communications
Year:
2006

Citing 0
Cited 7

Performance of channel allocation techniques for uni-directional & bi-directional call using 50 channels

CISST'08 Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications
OVSF Code Sharing and Reducing the Code Wastage Capacity in WCDMA

Wireless Personal Communications: An International Journal
Developing cognitive radio approach based on dynamic SNR to reduce handoff latency in cellular systems

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Optimal tradeoff between exposed and hidden nodes in large wireless networks

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Channel assignment in mobile wireless cellular networks: genetic algorithm

ACELAE'11 Proceedings of the 10th WSEAS international conference on communications, electrical & computer engineering, and 9th WSEAS international conference on Applied electromagnetics, wireless and optical communications
Throughput and delay analysis of multi-channel wireless infrastructure networks

Ad Hoc Networks
Spatial fairness in linear random-access networks

Performance Evaluation

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.