Javad Hajipour
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Javad Hajipour has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Amr Mohamed
Qatar University
3 shared publications - Victor. C. M. Leung
Shenzhen University
3 shared publications - Amin Mohajer
Department of Electrical and Computer Engineering, The University of British Columbia (UBC), Vancouver, Canada
2 shared publications - Javad Musevi Niya
Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran
2 shared publications Victor C. M. Leung
ECE Department, The University of British Columbia, Vancouver, Canada
2 shared publicationsCyril Leung
Department of Electrical and Computer Engineering, The University of British Columbia, BC V6T 1Z4, Vancouver, Canada
1 shared publication
Latest Publications
- 2 January 2025
- Published by Springer Nature in Multimedia Tools and Applications
- p. 1-30
A multi-objective social-based algorithm for community detection
- 2 January 2025
- Published by Springer Nature in Multimedia Tools and Applications
- p. 1-30
A multi-objective social-based algorithm for community detection
- Top Cited Papers
- 18 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (1) , 95-99
Dynamic Offloading in Mobile Edge Computing With Traffic-Aware Network Slicing and Adaptive TD3 Strategy
Network slicing and computation offloading play a pivotal role in enabling edge service providers to handle dynamic service demands effectively. However, traffic fluctuations and resource diversity pose significant challenges, often constrained by static configurations lacking flexibility. To overcome these limitations, this paper presents FlexSlice, a dynamic offloading framework designed to optimize resource allocation in mobile edge networks. Our approach leverages a sparse multi-head graph attention mechanism for precise traffic prediction, capturing complex spatio-temporal dependencies to enhance network slicing decisions. Additionally, we present an adaptive offloading strategy based on the twin delayed deep deterministic policy gradient algorithm, which incorporates twin critics and prioritized experience replay to improve decision-making under dynamic conditions. Simulation results confirm FlexSlice’s outstanding performance and adaptability in diverse operational scenarios, achieving higher profits and reliable quality of service.
- 18 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (1) , 95-99
Top Cited PapersDynamic Offloading in Mobile Edge Computing With Traffic-Aware Network Slicing and Adaptive TD3 Strategy
Network slicing and computation offloading play a pivotal role in enabling edge service providers to handle dynamic service demands effectively. However, traffic fluctuations and resource diversity pose significant challenges, often constrained by static configurations lacking flexibility. To overcome these limitations, this paper presents FlexSlice, a dynamic offloading framework designed to optimize resource allocation in mobile edge networks. Our approach leverages a sparse multi-head graph attention mechanism for precise traffic prediction, capturing complex spatio-temporal dependencies to enhance network slicing decisions. Additionally, we present an adaptive offloading strategy based on the twin delayed deep deterministic policy gradient algorithm, which incorporates twin critics and prioritized experience replay to improve decision-making under dynamic conditions. Simulation results confirm FlexSlice’s outstanding performance and adaptability in diverse operational scenarios, achieving higher profits and reliable quality of service.
- 23 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (12) , 3385-3389
Bandwidth and Task Flow Control in Stochastic Relay-Assisted MEC
This paper studies stochastic Multi-hop Mobile Edge Computing (MMEC), where a Relay Node (RN) receives tasks from the users and randomly decides to assign them to its own computing server or to offload them to one of the multiple Higher-level computing Nodes (HNs). We take into account the waiting times in the computation and transmission queues and present the system Average Response Time (ART) in terms of offloading probabilities and links’ bandwidths. Based on that, we aim at minimizing the system ART by joint optimization of the task flow distribution among the RN/HNs and the bandwidth allocation among the links. We analyze the formulated problem and prove it is multi-convex. Moreover, we derive the closed-form expressions for the links’ bandwidths when the offloading probabilities are fixed, and based on the presented analysis and insights, we propose effective solution methods. Numerical results reveal the promising performance of the proposed methods in efficient use of the resources and reduction of the ART.
- 23 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (12) , 3385-3389
Bandwidth and Task Flow Control in Stochastic Relay-Assisted MEC
This paper studies stochastic Multi-hop Mobile Edge Computing (MMEC), where a Relay Node (RN) receives tasks from the users and randomly decides to assign them to its own computing server or to offload them to one of the multiple Higher-level computing Nodes (HNs). We take into account the waiting times in the computation and transmission queues and present the system Average Response Time (ART) in terms of offloading probabilities and links’ bandwidths. Based on that, we aim at minimizing the system ART by joint optimization of the task flow distribution among the RN/HNs and the bandwidth allocation among the links. We analyze the formulated problem and prove it is multi-convex. Moreover, we derive the closed-form expressions for the links’ bandwidths when the offloading probabilities are fixed, and based on the presented analysis and insights, we propose effective solution methods. Numerical results reveal the promising performance of the proposed methods in efficient use of the resources and reduction of the ART.
- 21 June 2022
- Published by Elsevier in Computer Communications
- Vol. 192, 417-429
Stochastic buffer-and-server-aided relay-assisted mobile edge computing in time-slotted systems
- 21 June 2022
- Published by Elsevier in Computer Communications
- Vol. 192, 417-429
Stochastic buffer-and-server-aided relay-assisted mobile edge computing in time-slotted systems
- 3 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 11 (7) , 1419-1422
Fairness and Efficiency in Stochastic Buffer-Aided Relay-Assisted MEC
This letter studies hierarchical Mobile Edge Computing (MEC) with multiple sources, multiple buffer-aided relays, and one Higher-level computing Node (HN). The relays may or may not have computation resources and therefore, they randomly decide to process the received tasks or to offload them to the HN. We consider the delay in the transmission and computation buffers, and propose a novel Fairness and Efficiency Cost Function (FECF) as the weighted sum of the maximum Average Response Time (ART) and the overall system ART. We formulate a novel problem to minimize the FECF while keeping the system queues stable, by jointly optimizing the offloading probabilities at the relays and the capacities of the virtual machines at the HN. We prove that the problem is a multi-convex optimization problem and propose an effective solution method by alternating optimization. Simulation results demonstrate the effectiveness of the different variants of the proposed scheme in the scenarios with server-less and server-empowered relays and provide important insights regarding the fairness and efficiency in terms of the ART.
- 3 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 11 (7) , 1419-1422
Fairness and Efficiency in Stochastic Buffer-Aided Relay-Assisted MEC
This letter studies hierarchical Mobile Edge Computing (MEC) with multiple sources, multiple buffer-aided relays, and one Higher-level computing Node (HN). The relays may or may not have computation resources and therefore, they randomly decide to process the received tasks or to offload them to the HN. We consider the delay in the transmission and computation buffers, and propose a novel Fairness and Efficiency Cost Function (FECF) as the weighted sum of the maximum Average Response Time (ART) and the overall system ART. We formulate a novel problem to minimize the FECF while keeping the system queues stable, by jointly optimizing the offloading probabilities at the relays and the capacities of the virtual machines at the HN. We prove that the problem is a multi-convex optimization problem and propose an effective solution method by alternating optimization. Simulation results demonstrate the effectiveness of the different variants of the proposed scheme in the scenarios with server-less and server-empowered relays and provide important insights regarding the fairness and efficiency in terms of the ART.
- Open Access
Stochastic Buffer-Aided Relay-Assisted MEC in Time-Slotted Systems
Mobile Edge Computing (MEC) has attracted significant research efforts in the recent years. However, these works consider mostly the computation resources located at the cloud centers and wireless access nodes, ignoring the possibility of utilizing server-empowered relays to improve the performance. In this paper, we study stochastic relay-assisted MEC in systems with discrete transmission time-line and block fading wireless channels. In order to clearly identify and inspect the fundamental affecting factors, we investigate the building block of this architecture, namely a hierarchical network consisting of a source, a buffer-and-server-aided relay and another higher-level computing node. We provide a framework to take into account the effects of the fading channels, the task arrival dynamics as well as the queuing delays in both the transmission and computation buffers, which facilitates the derivation of the expression for the Average Response Time (ART). Based on that and the system average power consumption in each slot, we introduce the concept of Average Response Energy (ARE) as a novel metric to capture the energy efficiency in MEC while considering the stochastic nature of the system parameters. Accordingly, we propose two offloading schemes with their respective problem formulations, namely the Minimum ART (MART) and the Minimum ARE (MARE) schemes, to optimize the transmission power and task assignment probability while keeping the system queues stable. We demonstrate the difference of the formulated problems with the relevant problem in a recent work, analyze the properties of the problems and noting them, we propose effective solution methods. Using extensive simulations, we validate the presented analysis and show the effectiveness of the proposed schemes in comparison with various baseline methods adapting existing approaches.
Open AccessStochastic Buffer-Aided Relay-Assisted MEC in Time-Slotted Systems
Mobile Edge Computing (MEC) has attracted significant research efforts in the recent years. However, these works consider mostly the computation resources located at the cloud centers and wireless access nodes, ignoring the possibility of utilizing server-empowered relays to improve the performance. In this paper, we study stochastic relay-assisted MEC in systems with discrete transmission time-line and block fading wireless channels. In order to clearly identify and inspect the fundamental affecting factors, we investigate the building block of this architecture, namely a hierarchical network consisting of a source, a buffer-and-server-aided relay and another higher-level computing node. We provide a framework to take into account the effects of the fading channels, the task arrival dynamics as well as the queuing delays in both the transmission and computation buffers, which facilitates the derivation of the expression for the Average Response Time (ART). Based on that and the system average power consumption in each slot, we introduce the concept of Average Response Energy (ARE) as a novel metric to capture the energy efficiency in MEC while considering the stochastic nature of the system parameters. Accordingly, we propose two offloading schemes with their respective problem formulations, namely the Minimum ART (MART) and the Minimum ARE (MARE) schemes, to optimize the transmission power and task assignment probability while keeping the system queues stable. We demonstrate the difference of the formulated problems with the relevant problem in a recent work, analyze the properties of the problems and noting them, we propose effective solution methods. Using extensive simulations, we validate the presented analysis and show the effectiveness of the proposed schemes in comparison with various baseline methods adapting existing approaches.
- 27 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (4) , 931-934
Stochastic Buffer-Aided Relay-Assisted MEC
- 27 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (4) , 931-934
Stochastic Buffer-Aided Relay-Assisted MEC
- 21 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (10) , 6648-6659
Energy-Efficient Resource Allocation in Buffer-Aided Wireless Relay Networks
In this paper, we study energy-efficient resource allocation in the downlink of buffer-aided wireless relay networks. We aim at maximizing the system average energy efficiency while maintaining the queue stability at both the base station (BS) and relays. We formulate the resource allocation design as a novel stochastic network optimization problem and based on the well-known Lyapunov drift-plus-penalty policy and the system constraints, we transform it to an instantaneous non-convex optimization problem to be solved in each time slot. We analyze the instantaneous utility function and propose a novel algorithm to find its optimum point. Based on that, we present an effective distributed strategy to get the globally optimal solution for channel and power allocation. Furthermore, we show that the proposed algorithm can be used as a building block for energy-efficient resource allocation in conventional relay networks, where the relays do not have buffering capability, but the BS queues need to be stabilized. Using extensive simulations, we show that the proposed algorithm is able to provide higher energy efficiency compared with the existing algorithms, while keeping the system queues stable.
- 21 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 16 (10) , 6648-6659
Energy-Efficient Resource Allocation in Buffer-Aided Wireless Relay Networks
In this paper, we study energy-efficient resource allocation in the downlink of buffer-aided wireless relay networks. We aim at maximizing the system average energy efficiency while maintaining the queue stability at both the base station (BS) and relays. We formulate the resource allocation design as a novel stochastic network optimization problem and based on the well-known Lyapunov drift-plus-penalty policy and the system constraints, we transform it to an instantaneous non-convex optimization problem to be solved in each time slot. We analyze the instantaneous utility function and propose a novel algorithm to find its optimum point. Based on that, we present an effective distributed strategy to get the globally optimal solution for channel and power allocation. Furthermore, we show that the proposed algorithm can be used as a building block for energy-efficient resource allocation in conventional relay networks, where the relays do not have buffering capability, but the BS queues need to be stabilized. Using extensive simulations, we show that the proposed algorithm is able to provide higher energy efficiency compared with the existing algorithms, while keeping the system queues stable.
- 7 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 20 (12) , 2502-2505
Context-Aware Relay Selection in Buffer-Aided Wireless Relay Networks
In this letter, we study relay selection strategies for file transfer in a two-hop buffer-aided relay network when the source and relay nodes have limited energy. We consider the fact that the constrained energies of the relays limit their transmission capabilities. Using the concept of a token as an approximate sign of the possibility for packet reception and forwarding by a relay, we propose a context (specifically, channel, energy, and queue state)-aware relay selection strategy, which dynamically defines a scheduling rule at each time slot, based on the channel states, residual energies, and queue sizes. At each time slot, the scheduling rule specifies which of the source or relay nodes should use the channel for packet transmission. Numerical results confirm that the proposed strategy generally provides a higher number of packet transfers and a lower file transfer time compared with existing algorithms.
- 7 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 20 (12) , 2502-2505
Context-Aware Relay Selection in Buffer-Aided Wireless Relay Networks
In this letter, we study relay selection strategies for file transfer in a two-hop buffer-aided relay network when the source and relay nodes have limited energy. We consider the fact that the constrained energies of the relays limit their transmission capabilities. Using the concept of a token as an approximate sign of the possibility for packet reception and forwarding by a relay, we propose a context (specifically, channel, energy, and queue state)-aware relay selection strategy, which dynamically defines a scheduling rule at each time slot, based on the channel states, residual energies, and queue sizes. At each time slot, the scheduling rule specifies which of the source or relay nodes should use the channel for packet transmission. Numerical results confirm that the proposed strategy generally provides a higher number of packet transfers and a lower file transfer time compared with existing algorithms.
- Open Access
- 22 December 2015
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2015 (1) , 263
Utility-based efficient dynamic distributed resource allocation in buffer-aided relay-assisted OFDMA networks
- 22 December 2015
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2015 (1) , 263
Open AccessUtility-based efficient dynamic distributed resource allocation in buffer-aided relay-assisted OFDMA networks