Vahid Shah-Mansouri
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Vahid Shah-Mansouri has a total of 76 co-authors. Here are the top co-authors by number of shared publications:
- Behrouz Maham
School of Engineering and Digital Sciences, Nazarbayev University, Astana, Kazakhstan
6 shared publications - Keyvan Aghababaiyan
School of Electrical and Computer Engineering, College of Engineering, University of Tehran, Tehran, Iran
5 shared publications - Dusit Niyato
Nanyang technological university, Singapore, Singapore
4 shared publications - Seyed Hamed Rastegar
Shiraz University
4 shared publications Behrouz Maham
3 shared publications- Hamed Kebriaei
School of ECE, College of Engineering, University of Tehran, Tehran, Iran
3 shared publications
Latest Publications
- 13 January 2026
- Published by Springer Nature in Wireless Personal Communications
- Vol. 146 (2) , 429-464
Distributed and Dynamic Resource Management with Delay Guarantees in Millimeter-wave Networks
- 13 January 2026
- Published by Springer Nature in Wireless Personal Communications
- Vol. 146 (2) , 429-464
Distributed and Dynamic Resource Management with Delay Guarantees in Millimeter-wave Networks
- Open Access
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 701-717
DyQRA: A Mathematical Framework for Enhanced Dynamic QoS Provisioning in 5G/6G Networks
The increasing complexity of 5G and emerging 6G networks necessitates advanced resource allocation and adaptive scheduling mechanisms to ensure stringent Quality of Service (QoS) requirements. Existing heuristic solutions struggle to scale with the high dimensionality of next-generation networks, leading to sub-optimal packet scheduling and queue management. This paper proposes a mathematical optimization framework, termed DyQRA (Dynamic QoS-Aware Resource Allocation), that integrates active queue management with dynamic scheduling, ensuring queue stability, minimal delay, and compliance with Packet Delay Budget (PDB) and Packet Error Rate (PER) constraints. Our model leverages Lyapunov optimization, specifically the drift-plus-penalty technique. Through frame-based modeling, our method effectively captures time-varying traffic dynamics and service-rate fluctuations, ensuring robust QoS adherence. Additionally, the model accounts for effective arrival rates, considering packet drops caused by delay violations. Simulation results demonstrate that the proposed method outperforms existing schemes, making it a strong candidate for implementation in both 5G and 6G networks.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 701-717
Open AccessDyQRA: A Mathematical Framework for Enhanced Dynamic QoS Provisioning in 5G/6G Networks
The increasing complexity of 5G and emerging 6G networks necessitates advanced resource allocation and adaptive scheduling mechanisms to ensure stringent Quality of Service (QoS) requirements. Existing heuristic solutions struggle to scale with the high dimensionality of next-generation networks, leading to sub-optimal packet scheduling and queue management. This paper proposes a mathematical optimization framework, termed DyQRA (Dynamic QoS-Aware Resource Allocation), that integrates active queue management with dynamic scheduling, ensuring queue stability, minimal delay, and compliance with Packet Delay Budget (PDB) and Packet Error Rate (PER) constraints. Our model leverages Lyapunov optimization, specifically the drift-plus-penalty technique. Through frame-based modeling, our method effectively captures time-varying traffic dynamics and service-rate fluctuations, ensuring robust QoS adherence. Additionally, the model accounts for effective arrival rates, considering packet drops caused by delay violations. Simulation results demonstrate that the proposed method outperforms existing schemes, making it a strong candidate for implementation in both 5G and 6G networks.
- 12 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (6) , 6128-6142
Sensify: A Learning-Based Budget-Aware Task Assignment in Mobile Crowdsensing
Accurate and comprehensive data acquisition is critical for modern data-driven environmental applications. Mobile Crowdsensing (MCS) offers an effective approach by leveraging user participation to collect environmental data through task assignment. To minimize costs, MCS platforms often partition the environment into subareas and utilize inference algorithms to extrapolate data for entire subareas based on partial sensing in a limited subset. However, determining the optimal set of users for sensing tasks remains challenging due to constraints such as user availability and the complexity of data inference models. This paper introduces Sensify, a task assignment strategy that optimizes data acquisition by accounting for data correlations and budget constraints. Sensify efficiently selects subareas and recruits cost-effective users for sensing tasks, incorporating user-specific contexts such as location and device power availability during task assignment. To adaptively manage the platform budget, the strategy considers a dynamic set of users with varying costs over time. A deep recurrent reinforcement learning-based network is employed to select optimal subareas for sensing, while user recruitment is dynamically optimized using a reinforcement learning approach. Specifically, a modified Contextual Combinatorial Multi-Armed Bandit (CC-MAB) framework is utilized to handle the volatility and variability in user costs. Experiments conducted on two real-world datasets demonstrate that Sensify can improve data acquisition by up to 7% compared to existing approaches.
- 12 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (6) , 6128-6142
Sensify: A Learning-Based Budget-Aware Task Assignment in Mobile Crowdsensing
Accurate and comprehensive data acquisition is critical for modern data-driven environmental applications. Mobile Crowdsensing (MCS) offers an effective approach by leveraging user participation to collect environmental data through task assignment. To minimize costs, MCS platforms often partition the environment into subareas and utilize inference algorithms to extrapolate data for entire subareas based on partial sensing in a limited subset. However, determining the optimal set of users for sensing tasks remains challenging due to constraints such as user availability and the complexity of data inference models. This paper introduces Sensify, a task assignment strategy that optimizes data acquisition by accounting for data correlations and budget constraints. Sensify efficiently selects subareas and recruits cost-effective users for sensing tasks, incorporating user-specific contexts such as location and device power availability during task assignment. To adaptively manage the platform budget, the strategy considers a dynamic set of users with varying costs over time. A deep recurrent reinforcement learning-based network is employed to select optimal subareas for sensing, while user recruitment is dynamically optimized using a reinforcement learning approach. Specifically, a modified Contextual Combinatorial Multi-Armed Bandit (CC-MAB) framework is utilized to handle the volatility and variability in user costs. Experiments conducted on two real-world datasets demonstrate that Sensify can improve data acquisition by up to 7% compared to existing approaches.
- 25 May 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 125
Cell selection in mobile crowdsensing using multi-objective deep reinforcement learning
- 25 May 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 125
Cell selection in mobile crowdsensing using multi-objective deep reinforcement learning
- Open Access
- 8 August 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-15
Design and evaluation of crowdsourcing platforms based on users’ confidence judgments
Crowdsourcing deals with solving problems by assigning them to a large number of non-experts called crowd using their spare time. In these systems, the final answer to the question is determined by summing up the votes obtained from the community. The popularity of these systems has increased by facilitating access for community members through mobile phones and the Internet. One of the issues raised in crowdsourcing is how to choose people and how to collect answers. Usually, users are separated based on their performance in a pre-test. Designing the pre-test for performance calculation is challenging; The pre-test questions should be selected to assess characteristics in individuals that are relevant to the main questions. One of the ways to increase the accuracy of crowdsourcing systems is by considering individuals’ cognitive characteristics and decision-making models to form a crowd and improve the estimation of their answer accuracy to questions. People can estimate the correctness of their responses while making a decision. The accuracy of this estimate is determined by a quantity called metacognition ability. Metacoginition is referred to the case where the confidence level is considered along with the answer to increase the accuracy of the solution. In this paper, by both mathematical and experimental analysis, we would answer the following question: Is it possible to improve the performance of a crowdsourcing system by understanding individuals’ metacognition and recording and utilizing users’ confidence in their answers?
- 8 August 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-15
Open AccessDesign and evaluation of crowdsourcing platforms based on users’ confidence judgments
Crowdsourcing deals with solving problems by assigning them to a large number of non-experts called crowd using their spare time. In these systems, the final answer to the question is determined by summing up the votes obtained from the community. The popularity of these systems has increased by facilitating access for community members through mobile phones and the Internet. One of the issues raised in crowdsourcing is how to choose people and how to collect answers. Usually, users are separated based on their performance in a pre-test. Designing the pre-test for performance calculation is challenging; The pre-test questions should be selected to assess characteristics in individuals that are relevant to the main questions. One of the ways to increase the accuracy of crowdsourcing systems is by considering individuals’ cognitive characteristics and decision-making models to form a crowd and improve the estimation of their answer accuracy to questions. People can estimate the correctness of their responses while making a decision. The accuracy of this estimate is determined by a quantity called metacognition ability. Metacoginition is referred to the case where the confidence level is considered along with the answer to increase the accuracy of the solution. In this paper, by both mathematical and experimental analysis, we would answer the following question: Is it possible to improve the performance of a crowdsourcing system by understanding individuals’ metacognition and recording and utilizing users’ confidence in their answers?
- Open Access
GSC: Generalizable Service Coordination
Services with distributed and interdependent components are becoming a popular option for harnessing dispersed resources available on cloud and edge networks. However, effective deployment and management of these services, namely service coordination, is a challenging task. Service coordination comprises the placement and scalability of components and scheduling incoming traffic requesting for services between deployed instances. Due to the online nature of the problem and the success of Deep Reinforcement Learning (DRL) methods, previous works considered DRL agents for solving service coordination problems, yet these solutions have to be retrained for every unseen scenario. Other works have tried to tackle this shortcoming by incorporating Graph Neural Networks (GNN) into their solutions, but they often focus on specific aspects (and disregard others) or cannot operate in dynamic and practical situations where there is no labeled dataset and feedback from the network might be delayed. In response to these challenges, we present GSC, a generalizable service coordinator that jointly considers service placement, scaling, and traffic scheduling. GSC can operate in unseen situations without significant performance degradation and outperforms existing state-of-the-art solutions by 40%, as determined by simulating real-world network situations.
Open AccessGSC: Generalizable Service Coordination
Services with distributed and interdependent components are becoming a popular option for harnessing dispersed resources available on cloud and edge networks. However, effective deployment and management of these services, namely service coordination, is a challenging task. Service coordination comprises the placement and scalability of components and scheduling incoming traffic requesting for services between deployed instances. Due to the online nature of the problem and the success of Deep Reinforcement Learning (DRL) methods, previous works considered DRL agents for solving service coordination problems, yet these solutions have to be retrained for every unseen scenario. Other works have tried to tackle this shortcoming by incorporating Graph Neural Networks (GNN) into their solutions, but they often focus on specific aspects (and disregard others) or cannot operate in dynamic and practical situations where there is no labeled dataset and feedback from the network might be delayed. In response to these challenges, we present GSC, a generalizable service coordinator that jointly considers service placement, scaling, and traffic scheduling. GSC can operate in unseen situations without significant performance degradation and outperforms existing state-of-the-art solutions by 40%, as determined by simulating real-world network situations.
- Open Access
Traffic Offloading Probability for Integrated LEO Satellite-Terrestrial Networks
In this paper, we consider traffic offloading of integrated low earth orbit (LEO) satellite-terrestrial network. We first derive traffic offloading probability from the terrestrial network to the LEO satellite network based on the instantaneous radio signal strength. Then to overcome limited coverage and also traffic congestion of the terrestrial network, we design an optimal satellite network in which the minimum number of LEO satellites maximizes the traffic offloading probability, while probability of a generic LEO satellite being idle is close to zero. Since the satellite network is optimized regarding the intensities of the base stations (BSs) and the users, it can control the terrestrial traffic. Numerical results show that an appropriate number of LEO satellites overcomes the limited coverage in a region with low intensity of the BSs and also the traffic congestion by controlling the traffic in a region that the intensity of the users increases.
Open AccessTraffic Offloading Probability for Integrated LEO Satellite-Terrestrial Networks
In this paper, we consider traffic offloading of integrated low earth orbit (LEO) satellite-terrestrial network. We first derive traffic offloading probability from the terrestrial network to the LEO satellite network based on the instantaneous radio signal strength. Then to overcome limited coverage and also traffic congestion of the terrestrial network, we design an optimal satellite network in which the minimum number of LEO satellites maximizes the traffic offloading probability, while probability of a generic LEO satellite being idle is close to zero. Since the satellite network is optimized regarding the intensities of the base stations (BSs) and the users, it can control the terrestrial traffic. Numerical results show that an appropriate number of LEO satellites overcomes the limited coverage in a region with low intensity of the BSs and also the traffic congestion by controlling the traffic in a region that the intensity of the users increases.
- 25 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (9) , 2413-2416
Traffic Offloading Probability for Integrated LEO Satellite-Terrestrial Networks
In this paper, we consider traffic offloading of integrated low earth orbit (LEO) satellite-terrestrial network. We first derive traffic offloading probability from the terrestrial network to the LEO satellite network based on the instantaneous radio signal strength. Then to overcome limited coverage and also traffic congestion of the terrestrial network, we design an optimal satellite network in which the minimum number of LEO satellites maximizes the traffic offloading probability, while probability of a generic LEO satellite being idle is close to zero. Since the satellite network is optimized regarding the intensities of the base stations (BSs) and the users, it can control the terrestrial traffic. Numerical results show that an appropriate number of LEO satellites overcomes the limited coverage in a region with low intensity of the BSs and also the traffic congestion by controlling the traffic in a region that the intensity of the users increases.
- 25 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (9) , 2413-2416
Traffic Offloading Probability for Integrated LEO Satellite-Terrestrial Networks
In this paper, we consider traffic offloading of integrated low earth orbit (LEO) satellite-terrestrial network. We first derive traffic offloading probability from the terrestrial network to the LEO satellite network based on the instantaneous radio signal strength. Then to overcome limited coverage and also traffic congestion of the terrestrial network, we design an optimal satellite network in which the minimum number of LEO satellites maximizes the traffic offloading probability, while probability of a generic LEO satellite being idle is close to zero. Since the satellite network is optimized regarding the intensities of the base stations (BSs) and the users, it can control the terrestrial traffic. Numerical results show that an appropriate number of LEO satellites overcomes the limited coverage in a region with low intensity of the BSs and also the traffic congestion by controlling the traffic in a region that the intensity of the users increases.
- 26 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (1) , 24-38
Toward a Virtual Edge Service Provider: Actor-Critic Learning to Incentivize the Computation Nodes
The growing development of computation-intensive applications has considerably increased the demand for computing resources in the network. Many of these applications require computations with low delays. Edge computing, which offers computing resources at the edge of the network, is a prominent solution. However, an edge service provider might not have sufficient resources at the edge to satisfy the demands of its users. Computation offloading can fill the gap by letting the service provider transfer the users' computational tasks to other computation nodes (CNs). Nevertheless, due to the imposed costs, CNs are not always interested in sharing their computation capacity. This article considers the concept of a virtual edge service provider, and studies an incentive mechanism to motivate the CNs to share their resources. We formulate the problem as a Stackelberg game and present a complete information analysis. We prove the existence and uniqueness of the game equilibriums. However, the complete information scenario is not accessible in practice due to privacy reasons. Therefore, we propose a soft actor-critic algorithm as an incomplete information method using deep reinforcement learning. Finally, through extensive numerical evaluations, we show that the incomplete information method converges to the same equilibrium that the complete information analysis proved.
- 26 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (1) , 24-38
Toward a Virtual Edge Service Provider: Actor-Critic Learning to Incentivize the Computation Nodes
The growing development of computation-intensive applications has considerably increased the demand for computing resources in the network. Many of these applications require computations with low delays. Edge computing, which offers computing resources at the edge of the network, is a prominent solution. However, an edge service provider might not have sufficient resources at the edge to satisfy the demands of its users. Computation offloading can fill the gap by letting the service provider transfer the users' computational tasks to other computation nodes (CNs). Nevertheless, due to the imposed costs, CNs are not always interested in sharing their computation capacity. This article considers the concept of a virtual edge service provider, and studies an incentive mechanism to motivate the CNs to share their resources. We formulate the problem as a Stackelberg game and present a complete information analysis. We prove the existence and uniqueness of the game equilibriums. However, the complete information scenario is not accessible in practice due to privacy reasons. Therefore, we propose a soft actor-critic algorithm as an incomplete information method using deep reinforcement learning. Finally, through extensive numerical evaluations, we show that the incomplete information method converges to the same equilibrium that the complete information analysis proved.
- Open Access
- 16 March 2023
- Published by Springer Nature in Research Square
Design and Evaluation of Crowd-sourcing Platforms Based on Users’ Confidence Judgments
Crowd-sourcing deals with solving problems by assigning them to a large number of non-experts called crowd using their spare time. In these systems, the final answer to the question is determined by summing up the votes obtained from the community. The popularity of using these systems has increased by facilitation of access to community members through mobile phones and the Internet. One of the issues raised in crowd-sourcing is how to choose people and how to collect answers. Usually, the separation of users is done based on their performance in a pre-test. Designing the pre-test for performance calculation is challenging; The pre-test questions should be chosen in a way that they test the characteristics in people related to the main questions. One of the ways to increase the accuracy of crowd-sourcing systems is to pay attention to people's cognitive characteristics and decision-making model to form a crowd and improve the estimation of the accuracy of their answers to questions. People can estimate the correctness of their responses while making a decision. The accuracy of this estimate is determined by a quantity called metacognition ability. Metacoginition is referred to the case where the confidence level is considered along with the answer to increase the accuracy of the solution1. In this paper, by both mathematical and experimental analysis, we would answer the following question: Is it possible to improve the performance of the crowd-sourcing system by knowing the metacognition of individuals and recording and using the users' confidence in their answers?
- 16 March 2023
- Published by Springer Nature in Research Square
Open AccessDesign and Evaluation of Crowd-sourcing Platforms Based on Users’ Confidence Judgments
Crowd-sourcing deals with solving problems by assigning them to a large number of non-experts called crowd using their spare time. In these systems, the final answer to the question is determined by summing up the votes obtained from the community. The popularity of using these systems has increased by facilitation of access to community members through mobile phones and the Internet. One of the issues raised in crowd-sourcing is how to choose people and how to collect answers. Usually, the separation of users is done based on their performance in a pre-test. Designing the pre-test for performance calculation is challenging; The pre-test questions should be chosen in a way that they test the characteristics in people related to the main questions. One of the ways to increase the accuracy of crowd-sourcing systems is to pay attention to people's cognitive characteristics and decision-making model to form a crowd and improve the estimation of the accuracy of their answers to questions. People can estimate the correctness of their responses while making a decision. The accuracy of this estimate is determined by a quantity called metacognition ability. Metacoginition is referred to the case where the confidence level is considered along with the answer to increase the accuracy of the solution1. In this paper, by both mathematical and experimental analysis, we would answer the following question: Is it possible to improve the performance of the crowd-sourcing system by knowing the metacognition of individuals and recording and using the users' confidence in their answers?