Principles of mobile communication (2nd ed.)
Principles of mobile communication (2nd ed.)
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Throughput of ideally routed wireless ad hoc networks
ACM SIGMOBILE Mobile Computing and Communications Review
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
INFORMS Journal on Computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Capacity of multi-channel wireless networks: impact of number of channels and interfaces
Proceedings of the 11th annual international conference on Mobile computing and networking
Measurement driven deployment of a two-tier urban mesh access network
Proceedings of the 4th international conference on Mobile systems, applications and services
Capacity of multi-channel wireless networks with random (c, f) assignment
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks
IEEE Transactions on Information Theory
Channel assignment strategies for optimal network capacity of IEEE 802.11s
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
| Hi-index | 0.00 |
In this paper, we theoretically analyze the performance in terms of end-to-end call acceptance in Multi-Channel Multi-Radio (MC-MR) Wireless Mesh Networks (WMNs) using queueing theory techniques. We study the impact of the routing protocol and the channel assignment algorithm on the end-to-end call acceptance and address the issue of providing deterministic QoS guarantees to a designated set of nodes. The significance of our work lies in providing an insight into the bounds of the probability of call acceptance under a given set of parameters for a WMN and provide a framework for comparison of existing routing protocols and channel assignment algorithms. This can be used for network dimensioning and comparative study of different protocols. We have adopted a TDMA-based WMN as our base framework. We consider the case of differentiated class of users and derive upper P"A"c"c^M^a^x and lower P"A"c"c^M^i^n bounds for the probability of call acceptance (P"A"c"c) and theoretically estimate the probability of system saturation (P"S"a"t) (which is the probability that no more new calls can be accepted in the network). Through simulations, we study the dependence of the (P"A"c"c) on the number of radios in each node (K), the number of channels available in the network (C), the network load (@r), the routing protocol used, and the channel assignment algorithm. We also study the effect of Weighted Cumulative Expected Transmission Time (WCETT) routing metric and compare its performance with the Shortest Path (SP) routing protocol. The increase in P"A"c"c with the WCETT metric emphasizes the need to consider better routing metrics in an MC-MR network.