Vahid Shah-Mansouri

Vahid Shah-Mansouri

Auto-generated profile, based on publicly available information

Vahid Shah-Mansouri

School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2021 in Computer Networks
Verified
Journal Article
Closed access
HNHojjat Navidan
Hojjat Navidan
PMParisa Fard Moshiri
Parisa Fard Moshiri
MNMohammad Nabati
Mohammad Nabati
Reza ShahbazianReza Shahbazian
Reza Shahbazian
SGSeyed Ali Ghorashi
Seyed Ali Ghorashi
David WindridgeDavid Windridge
David Windridge

13 September 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
MMMojdeh Karbalaee Motalleb
Mojdeh Karbalaee Motalleb
VSVahid Shah-Mansouri
Vahid Shah-Mansouri
SPSaeedeh Parsaeefard
Saeedeh Parsaeefard
Onel Luis Alcaraz LópezOnel Luis Alcaraz López
Onel Luis Alcaraz López
The next radio access network (RAN) generation, open RAN (O-RAN), aims to enable more flexibility and openness, including efficient service slicing, and to lower the operational costs in 5G and beyond wireless networks. Nevertheless, strictly satisfying quality-of-service requirements while establishing priorities and promoting balance between the significantly heterogeneous services remains a key research problem. In this paper, we use network slicing to study the service-aware baseband resource allocation and virtual network function (VNF) activation in O-RAN systems. The limited fronthaul capacity and end-to-end delay constraints are simultaneously considered. Optimizing baseband resources includes O-RAN radio unit (O-RU), physical resource block (PRB) assignment, and power allocation. The main problem is a mixed-integer non-linear programming problem that is non-trivial to solve. Consequently, we break it down into two different steps and propose an iterative algorithm that finds a near-optimal solution. In the first step, we reformulate and simplify the problem to find the power allocation, PRB assignment, and the number of VNFs. In the second step, the O-RU association is resolved. The proposed method is validated via simulations, which achieve a higher data rate and lower end-to-end delay than existing methods.

13 December 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
MKMohammad Karimzadeh-Farshbafan
Mohammad Karimzadeh-Farshbafan
VSVahid Shah-Mansouri
Vahid Shah-Mansouri
DNDusit Niyato
Dusit Niyato
Network softwarization is one of the major paradigm shifts in the next generation of networks. It enables programmable and flexible management and deployment of the network. Network function virtualization (NFV) is referred to the deployment of software functions running on commodity servers instead of traditional hardware-based middle-boxes. It is an example of network softwarization. In NFV, a service is defined as a chain of software functions named service chain function (SFC). The process of allocating the resources of servers to the services, called service placement, is the most challenging mission in NFV. Dynamic nature of the service arrivals and departures as well as meeting the service level agreement make the service placement problem even more challenging. In this paper, we propose a model for dynamic reliability-aware service placement based on the simultaneous allocation of the main and backup servers. Then, we formulate the dynamic reliability-aware service placement as an infinite horizon Markov decision process (MDP), which aims to minimize the placement cost and maximize the number of admitted services. In the proposed MDP, the number of active services in the network is considered to be the state of the system, and the state of the idle resources is estimated based on it. Also, the number of possible admitted services is considered as the action of the presented MDP. To evaluate each possible action in the proposed MDP, we use a suboptimal method based on the Viterbi algorithm named Viterbibased Reliable Static Service Placement (VRSSP) algorithm. We determine the optimal policy based on value iteration method using an algorithm named VRSSP-based Value Iteration (VVI) algorithm. Eventually, through the extensive simulations, the superiority of the proposed model for dynamic reliability-aware service placement compared to the static solutions is inferred.

11 November 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
KAKeyvan Aghababaiyan
Keyvan Aghababaiyan
VSVahid Shah-Mansouri
Vahid Shah-Mansouri
BMBehrouz Maham
Behrouz Maham

30 January 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
LMLayla Majzoobi
Layla Majzoobi
FLFarshad Lahouti
Farshad Lahouti
VSVahid Shah-Mansouri
Vahid Shah-Mansouri
Alternating Direction Method of Multipliers (ADMM) is a popular convex optimization algorithm, which can be employed for solving distributed consensus optimization problems. In this setting agents locally estimate the optimal solution of an optimization problem and exchange messages with their neighbors over a connected network. The distributed algorithms are typically exposed to different types of errors in practice, e.g., due to quantization or communication noise or loss. We here focus on analyzing the convergence of distributed ADMM for consensus optimization in presence of additive random node error, in which case, the nodes communicate a noisy version of their latest estimate of the solution to their neighbors in each iteration. We present analytical upper and lower bounds on the mean squared steady state error of the algorithm in case that the local objective functions are strongly convex and have Lipschitz continuous gradients. In addition we show that, when the local objective functions are convex and the additive node error is bounded, the estimation error of the noisy ADMM for consensus optimization is also bounded. Numerical results are provided which demonstrate the effectiveness of the presented analyses and shed light on the role of the system and network parameters on performance.

19 April 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
KAKeyvan Aghababaiyan
Keyvan Aghababaiyan
HKHamed Kebriaei
Hamed Kebriaei
VSVahid Shah-Mansouri
Vahid Shah-Mansouri
BMBehrouz Maham
Behrouz Maham
DNDusit Niyato
Dusit Niyato
The novel concept of Internet of Nano Things (IoNT) brings even larger groups of nanomachines collaborating to achieve more complex tasks in the military, medical, and security fields. Moreover, Internet of Bio-Nano Things (IoBNT) is an emerging technology defining the seamless connection of nanomachines and biological entities with each other where they can access the traditional wireless communication networks to provide novel Internet of Things (IoT) applications, such as health monitoring, healthcare, and targeted therapy. The exchange of information between biological cells is based on the synthesis, transformation, emission, propagation, and reception of molecules. This information exchange is recently classified in telecommunications as molecular communication which is a biologically inspired technique to communicate in very small dimension networks. In nanonetworks, a high number of nanothings will operate in the same medium and they interfere with each other. Multiuser interference will create significant limits. Hence, we introduce to use the direction of releasing molecules as a new property to convey information. Releasing the molecules to the specific directions enhances the performance of molecular communication systems due to multiusers interference mitigation. Hence, adjacent transmitters can convey information in different directions, simultaneously. Then, we propose the binary direction shift keying (BDSK) modulation scheme where the transmitter pumps molecules in two different directions. Next, we obtain the error probability and achievable bit rate of BDSK modulation. Finally, we evaluate the performance of BDSK modulation by numerical results. The result of this article can be useful for molecular communication relay systems where relay nodes convey information to the different destinations.