Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Mohammad Mansoori

dblp:121/8575 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2016
0009-0003-9554-4675ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 67% Network performance modeling · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network performance modeling › scaling laws
asymptotic capacity bounds
0.212016
Performance Analysis of Large Multi-Interface Wireless Mesh Networks with Multi-Different Bandwidth Channel · IEEE Trans. Mob. Comput. 2016
Wireless networking › network capacity
throughput capacity
0.212016
Performance Analysis of Large Multi-Interface Wireless Mesh Networks with Multi-Different Bandwidth Channel · IEEE Trans. Mob. Comput. 2016
Wireless networking
wireless mesh network
0.212016
Performance Analysis of Large Multi-Interface Wireless Mesh Networks with Multi-Different Bandwidth Channel · IEEE Trans. Mob. Comput. 2016

Methods — techniques the papers use, named apart from their topics

construction of lower bound · 0.2asymptotic analysis · 0.2
YearPublicationVenuePosition
2016 Performance Analysis of Large Multi-Interface Wireless Mesh Networks with Multi-Different Bandwidth Channel
abstract
In this paper, we study the asymptotic throughput capacity of a static multi-channel multi-interface infrastructure wireless mesh network (InfWMN) wherein each infrastructure node has m interfaces and c channels of unequal bandwidth are available. First, an upper bound on the InfWMN per-user capacity is established. Then, the feasible lower bound is derived by construction. We prove that both lower and upper bounds are tight. We limit our analysis for more practical case of$\mathrm{m} \le \mathrm{c}$. However, for the asymptotic upper bound, our analysis can be used for the general case in which there is no constraint on m and c. Our study shows that in such a network with Ncrandomly distributed mesh clients, Nrregularly placed mesh routers, and Nggateways, the asymptotic per-client throughput capacity has different bounds, which depend on the ratio between the total available bandwidth for the network and the sum of m first greatest data rates of c available channels, i.e.,$\sum \limits_{\mathrm{j} = 1}^\mathrm{C} \mathrm{w}_\mathrm{j} / \sum \limits_{\mathrm{j} = 1}^\mathrm{m} \mathrm{w}_\mathrm{j}$. The results of this paper are more general compared to the existing published researches. In addition, in the case that$\mathrm{w}_\mathrm{i} = \mathrm{W}/\mathrm{c} \forall \mathrm{i},\mathrm{}1 \le \mathrm{i} \le \mathrm{c}$, our results reduce to the previously reported studies. This implies that our study is comprehensive compared to the formerly published researches.
Mohammad Mansoori, Mehdi Mahdavi, Hamidreza Amini Khorasgani
IEEE Trans. Mob. Comput.1
2013 Throughput capacity analysis of large multi-channel, multi-interface random wireless mesh networks
Mohammad Mansoori, Mehdi Mahdavi
Perform. Evaluation1