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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amin Farbod

dblp:16/2739 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 3 · 3 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
2 papers
Wireless networking · 40% Network optimization and economics · 23% Cellular and mobile networks · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics
admission control
0.112009
Structured Admission Control Policy in Heterogeneous Wireless Networks with Mesh Underlay · INFOCOM 2009
Wireless networking
heterogeneous wireless networks
0.112009
Structured Admission Control Policy in Heterogeneous Wireless Networks with Mesh Underlay · INFOCOM 2009
Wireless networking
WLAN
0.112007
Resource Allocation and Outage Control for Solar-Powered WLAN Mesh Networks · IEEE Trans. Mob. Comput. 2007
Network performance modeling › point process
markov modulated poisson process
0.012009
Structured Admission Control Policy in Heterogeneous Wireless Networks with Mesh Underlay · INFOCOM 2009
Network performance modeling
queueing analysis
0.012009
Structured Admission Control Policy in Heterogeneous Wireless Networks with Mesh Underlay · INFOCOM 2009

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

meteorological data analysis · 0.1threshold policy optimization · 0.1queueing theory · 0.1partially observable markov decision process · 0.1control algorithms · 0.1control algorithm · 0.1
YearPublicationVenuePosition
2009 Structured Admission Control Policy in Heterogeneous Wireless Networks with Mesh Underlay
abstract
In this paper, we investigate into optimal admission control policies for Heterogeneous Wireless Networks (HWN), considering an integration of wireless mesh networks with an overlaying cellular infrastructure. In order to characterize the overflow traffic from the underlaying mesh to the overlay, a Partially-Observable Markov-Modulated Poisson Process (PO-MMPP) traffic model is developed. This model captures the burstiness of the overflow traffic under the imperfect observability of the mesh network states. Then, by modeling the overlay network as a controlled PO-MMPP/M/C/C queueing system and obtaining structured decision theoretic results, it is shown that the optimal control policies for this class of HWNs can be characterized as monotonic threshold curves. Further, these results are used to design a computationally efficient algorithm to determine the optimal policy in terms of thresholds. Numerical observations suggest that the proposed algorithm is efficient in terms of time-complexity and can drastically reduce the cost of dropped and blocked calls.
Amin Farbod, Ben Liang 0001
INFOCOM1
2007 Optimal admission control policies for heterogeneous wireless networks
abstract
In the near future, demand for Heterogeneous Wireless Networking (HWN) is expected to to increase. QoS provisioning in these networks is a challenging issue considering the diversity in wireless networking technologies and the existence of mobile users with different communication requirements. In HWNs with their increased complexity, "the curse of dimensionality" problem makes it impractical to directly apply the decision theoretic optimal control methods that are previously used in homogeneous wireless networks to achieve desired QoS levels. In this paper, optimal call admission control policies for HWNs are considered. A decision theoretic framework for the problem is derived by a dynamic programming formulation. We prove that for a two-tier wireless network architecture, the optimal policy has a two-dimensional threshold-based structure. Further, a novel algorithm called Structured Value Iteration is proposed as a numerically efficient method to determine the optimal policy in terms of its thresholds. Extensive simulation experiments are conducted. The numerical results show that the proposed algorithm is efficient in terms of its time-complexity and in achieving the optimal performance.
Amin Farbod, Ben Liang 0001
QSHINE1
2007 Efficient Structured Policies for Admission Control in Heterogeneous Wireless Networks
Amin Farbod, Ben Liang 0001
Mob. Networks Appl.1
2007 Resource Allocation and Outage Control for Solar-Powered WLAN Mesh Networks
abstract
In this paper, resource allocation and outage control are considered for solar-powered WLAN mesh networks. Solar-powered nodes are a very cost effective option in WLAN mesh deployments where continuous power sources are not practical. In such nodes, the cost of the solar panel and battery can be a significant fraction of the total and, therefore, reducing AP power consumption is very important. A solar panel/battery configuration methodology is introduced based on a proposed AP power-aware version of IEEE 802.11. Public meteorological data is used to provision each node based on an averaged offered capacity profile. Since a node is configured statistically, it is possible that future loading may result in nonzero outage even when negligible outage is the design target. Control algorithms are introduced which can improve node outage performance by sometimes introducing an access point capacity deficit. Results are presented which show the value of the proposed configuration methodology and show that the control algorithms can prevent outage even at high levels of excess loading.
Amin Farbod, Terry Todd 0001
IEEE Trans. Mob. Comput.1