20 results on '"Assi, Chadi"'
Search Results
2. Reconfigurable Intelligent Surface Enabled Vehicular Communication: Joint User Scheduling and Passive Beamforming.
- Author
-
Al-Hilo, Ahmed, Samir, Moataz, Elhattab, Mohamed, Assi, Chadi, and Sharafeddine, Sanaa
- Subjects
BEAMFORMING ,REINFORCEMENT learning ,DEEP learning ,SCHEDULING ,MARKOV processes ,MULTICASTING (Computer networks) - Abstract
Given its ability to control and manipulate wireless environments, reconfigurable intelligent surface (RIS), also known as intelligent reflecting surface (IRS), has emerged as a key enabler technology for the six-generation (6G) cellular networks. In the meantime, vehicular environment radio propagation is negatively influenced by a large set of objects that cause transmission distortion such as high buildings. Therefore, this work is devoted to explore the area of RIS technology integration with vehicular communications while considering the dynamic nature of such communication environment. Specifically, we provide a system model where RoadSide Unit (RSU) leverages RIS to provide indirect wireless transmissions to disconnected areas, known as dark zones. Dark zones are spots within RSU coverage where the communication links are blocked due to the existence of blockages. In details, a discrete RIS is utilized to provide communication links between the RSU and the vehicles passing through out-of-service zones. Therefore, the joint problem of RSU resource scheduling and RIS passive beamforming or phase-shift matrix is formulated as an optimization problem with the objective of maximizing the minimum average bit rate. The formulated problem is mixed integer non-convex program which is difficult to be solved and does not account for the uncertain dynamic environment in vehicular networks. Thereby, we resort to alternative methods based on Deep Reinforcement Learning to determine RSU wireless scheduling and Block Coordinate Descent (BCD) to solve for the phase-shift matrix, i.e., passive beamforming, of the RIS. The Markov Decision Process (MDP) is defined and the complexity of the solution approach is discussed. Our numerical results demonstrate the superiority of our proposed approach over baseline techniques. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. Optimizing Age of Information Through Aerial Reconfigurable Intelligent Surfaces: A Deep Reinforcement Learning Approach.
- Author
-
Samir, Moataz, Elhattab, Mohamed, Assi, Chadi, Sharafeddine, Sanaa, and Ghrayeb, Ali
- Subjects
INFORMATION society ,DRONE aircraft ,INTERNET of things ,DEEP learning ,MATHEMATICAL optimization ,REINFORCEMENT learning - Abstract
We investigate the benefits of integrating unmanned aerial vehicles (UAVs) with reconfigurable intelligent surface (RIS) elements to passively relay information sampled by Internet of Things devices (IoTDs) to the base station (BS). In order to maintain the freshness of relayed information, an optimization problem with the objective of minimizing the expected sum Age-of-Information (AoI) is formulated to optimize the altitude of the UAV, the communication schedule, and phases-shift of RIS elements. In the absence of prior knowledge of the activation pattern of the IoTDs, proximal policy optimization algorithm is developed to solve this mixed-integer non-convex optimization problem. Numerical results show that our proposed algorithm outperforms all others in terms of AoI. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
4. Age of Information Aware Trajectory Planning of UAVs in Intelligent Transportation Systems: A Deep Learning Approach.
- Author
-
Samir, Moataz, Assi, Chadi, Sharafeddine, Sanaa, Ebrahimi, Dariush, and Ghrayeb, Ali
- Subjects
- *
INTELLIGENT transportation systems , *DEEP learning , *INFORMATION society , *MARKOV processes , *REINFORCEMENT learning , *DRONE aircraft , *TELECOMMUNICATION systems - Abstract
Unmanned aerial vehicles (UAVs) are envisioned to play a key role in intelligent transportation systems to complement the communication infrastructure in future smart cities. UAV-assisted vehicular networking research typically adopts throughput and latency as the main performance metrics. These conventional metrics, however, are not adequate to reflect the freshness of the information, an attribute that has been recently identified as a critical requirement to enable services such as autonomous driving and accident prevention. In this paper, we consider a UAV-assisted single-hop vehicular network, wherein sensors (e.g., LiDARs and cameras) on vehicles generate time sensitive data streams, and UAVs are used to collect and process this data while maintaining a minimum age of information (AoI). We aim to jointly optimize the trajectories of UAVs and find scheduling policies to keep the information fresh under minimum throughput constraints. The formulated optimization problem is shown to be mixed integer non-linear program (MINLP) and generally hard to be solved. Motivated by the success of machine learning (ML) techniques particularly deep learning in solving complex problems with low complexity, we reformulate the trajectories and scheduling policies problem as a Markov decision process (MDP) where the system state space considers the vehicular network dynamics. Then, we develop deep reinforcement learning (DRL) to learn the vehicular environment and its dynamics in order to handle UAVs’ trajectory and scheduling policy. In particular, we leverage Deep Deterministic Policy Gradient (DDPG) for learning the trajectories of the deployed UAVs to efficiently minimize the Expected Weighted Sum AoI (EWSA). Simulations results demonstrate the effectiveness of the proposed design and show the deployed UAVs adapt their velocities during the data collection mission in order to minimize the AoI. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
5. Optimal Scheduling of EV Charging at a Solar Power-Based Charging Station.
- Author
-
Kabir, Mohammad Ekramul, Assi, Chadi, Tushar, Mosaddek Hossain Kamal, and Yan, Jun
- Abstract
The transition to electric vehicles (EVs) has prodigious plausibility in reducing green house gas (GHG). But EVs acceptance is, however, hindered by several challenges; among them is their avidity for quicker charging at lower price. This article considers a photovoltaic (PV)-powered station equipped with an energy storage system (ESS), which is assumed to be capable of assigning variable charging rates to different EVs to fulfill their demands inside their declared deadlines at minimum price. To ensure fairness, a charging rate-dependent pricing mechanism is proposed to assure a higher price for enjoying a higher charging rate. The PV generation profile and future load request are forecasted at each time slot, to handle the respective uncertainty. An integer linear programming (ILP)-based centralized system is first proposed to minimize the charging price per EV. Due to the larger computational time, we subsequently present two game theoretic algorithms, i.e., game 1 and game 2. In game 1, players are oblivious of upcoming charging requests, whereas in game 2, players consider the future anticipated load to select their charging strategies. The games are shown to converge to a Nash equilibrium. The average unit price of game 2 is shown to be the same as the one of the optimal solution and takes considerably less computation time than the centralized method. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
6. Workload Scheduling in Vehicular Networks With Edge Cloud Capabilities.
- Author
-
Sorkhoh, Ibrahim, Ebrahimi, Dariush, Atallah, Ribal, and Assi, Chadi
- Subjects
IN-vehicle computing ,DATA warehousing ,EDGES (Geometry) ,COMMUNICATIVE disorders - Abstract
In order to support the development of 5G technologies, researchers are actively engaged in addressing the challenges accompanying the emerging 5G applications. Unquestionably, an eminent technology gaining significant research attention is edge computing. Vehicular edge computing brings data storage and computing capabilities as well as hosting support applications that comprise emerging vehicular services and applications which demand low-delay processing, to the edge closer to the vehicles, reducing response time and increasing reliability, therefore achieving the holistic vision of the tactile Internet. In this context, this paper considers a vehicular network with edge computing capabilities deployed at road side units, and addresses the problem of workload offloading as well as scheduling of computation tasks on the computing resources available at the edge. The challenge here is the high mobility of the vehicles and hence their short residence time within the coverage range of the road side units hosting the edge computing resources. A joint problem considering the communication and computation resources, as well as the latency requirements of the workload is formulated and the scheduling is shown to be NP-Hard. Subsequently, efficient solutions based on Lagrangian relaxation are derived and presented. We evaluate numerically the proposed methods and show their closeness to the optimal solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
7. Scheduling the Operation of a Connected Vehicular Network Using Deep Reinforcement Learning.
- Author
-
Atallah, Ribal F., Assi, Chadi M., and Khabbaz, Maurice J.
- Abstract
Driven by the expeditious evolution of the Internet of Things, the conventional vehicular ad hoc networks will progress toward the Internet of Vehicles (IoV). With the rapid development of computation and communication technologies, IoV promises huge commercial interest and research value, thereby attracting a large number of companies and researchers. In an effort to satisfy the driver’s well-being and demand for continuous connectivity in the IoV era, this paper addresses both safety and quality-of-service (QoS) concerns in a green, balanced, connected, and efficient vehicular network. Using the recent advances in training deep neural networks, we exploit the deep reinforcement learning model, namely deep Q-network, which learns a scheduling policy from high-dimensional inputs corresponding to the current characteristics of the underlying model. The realized policy serves to extend the lifetime of the battery-powered vehicular network while promoting a safe environment that meets acceptable QoS levels. Our presented deep reinforcement learning model is found to outperform several scheduling benchmarks in terms of completed request percentage (10–25%), mean request delay (10–15%), and total network lifetime (5–65%). [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
8. Dynamic Task Offloading and Scheduling for Low-Latency IoT Services in Multi-Access Edge Computing.
- Author
-
Alameddine, Hyame Assem, Sharafeddine, Sanaa, Sebbah, Samir, Ayoubi, Sara, and Assi, Chadi
- Subjects
INTERNET of things ,MULTIPLE access protocols (Computer network protocols) ,COMPUTER scheduling - Abstract
Multi-access edge computing (MEC) has recently emerged as a novel paradigm to facilitate access to advanced computing capabilities at the edge of the network, in close proximity to end devices, thereby enabling a rich variety of latency sensitive services demanded by various emerging industry verticals. Internet-of-Things (IoT) devices, being highly ubiquitous and connected, can offload their computational tasks to be processed by applications hosted on the MEC servers due to their limited battery, computing, and storage capacities. Such IoT applications providing services to offloaded tasks of IoT devices are hosted on edge servers with limited computing capabilities. Given the heterogeneity in the requirements of the offloaded tasks (different computing requirements, latency, and so on) and limited MEC capabilities, we jointly decide on the task offloading (tasks to application assignment) and scheduling (order of executing them), which yields a challenging problem of combinatorial nature. Furthermore, we jointly decide on the computing resource allocation for the hosted applications, and we refer this problem as the Dynamic Task Offloading and Scheduling problem, encompassing the three subproblems mentioned earlier. We mathematically formulate this problem, and owing to its complexity, we design a novel thoughtful decomposition based on the technique of the Logic-Based Benders Decomposition. This technique solves a relaxed master, with fewer constraints, and a subproblem, whose resolution allows the generation of cuts which will, iteratively, guide the master to tighten its search space. Ultimately, both the master and the sub-problem will converge to yield the optimal solution. We show that this technique offers several order of magnitude (more than 140 times) improvements in the run time for the studied instances. One other advantage of this method is its capability of providing solutions with performance guarantees. Finally, we use this method to highlight the insightful performance trends for different vertical industries as a function of multiple system parameters with a focus on the delay-sensitive use cases. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. Optimal Supercharge Scheduling of Electric Vehicles: Centralized Versus Decentralized Methods.
- Author
-
Atallah, Ribal F., Assi, Chadi M., Fawaz, Wissam, Tushar, Mosaddek Hossain Kamal, and Khabbaz, Maurice Jose
- Subjects
- *
ELECTRIC vehicles , *SCALABILITY , *SIMULATION methods & models , *MOTOR vehicles , *OPERATIONS research - Abstract
The contemporary problem of scheduling the recharge operations of electric vehicles (EVs) has gained a lot of research attention. This is particularly true given the governmental and industrial confidence in a bright future for EVs accompanied with the widespread installation of an enormous number of charging stations across the world. As such, this paper addresses the delay-optimal scheduling of charging EVs at several charging stations (CSs) each with multiple charging outlets. At first, a centralized optimization framework is formulated using an integer linear problem (ILP) that accounts for the delayed arrival of EVs to CSs and the randomness in the requested recharge time interval. Simulation results showed the efficacy of the ILP model when compared to naive as well as sophisticated scheduling heuristics. Next, motivated by the scalability issues of the ILP model, this paper then proposes a distributed game-theoretical approach where each EV communicates with its selected CS and iterates on modifying its strategy until all EVs converge to selecting an appropriate CS that minimizes their waiting times for receiving services. The distributed game-theoretical approach recorded promising results especially when compared to the well-known shortest job first scheduling algorithm. Further, unlike the other approaches, which normally are centralized and suited for offline scheduling, the game-based method is suited for online scheduling since it played at anytime a batch of EVs requests charging services. The running time of the game is remarkably small and outperforms all other heuristics and its convergence to Nash equilibrium is guaranteed after only small number of iterations. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
10. On the Interplay Between Network Function Mapping and Scheduling in VNF-Based Networks: A Column Generation Approach.
- Author
-
Alameddine, Hyame Assem, Sebbah, Samir, and Assi, Chadi
- Abstract
Middleboxes (i.e., firewall, cache, proxy, etc.) are hardware appliances designed to enforce security and performance policies. Being an integral part of today’s cloud and enterprise networks, these middleboxes are expensive, hard to manage and to maintain. Network function virtualization has emerged as a promising technology that replaces these hardware appliances by software ones known as virtual network functions (VNFs). Unlike hardware middleboxes, VNFs can be instantiated and deployed on virtual machines running on commodity servers which ensures their flexibility, manageability, cost-efficiency, and reduce their time-to-market. However, efficiently processing services through an ordered chain of VNFs, called service function chaining (SFC), is not trivial. It requires solving three inter-related sub-problems; the network functions (NFs) mapping sub-problem, the traffic routing sub-problem and the service scheduling sub-problem. This paper first highlights the existing interplay between the three sub-problems and then presents a formulation of the SFC scheduling (SFCS) which exploits interactions between NFs mapping onto VNFs, service scheduling and traffic routing. Given the complexity of the SFCS problem, we present a novel primal–dual decomposition using column generation that solves exactly a relaxed version of the problem and can serve as a benchmark approach. We enhance our solution methodology with a diversification technique to help improve the quality of the obtained solutions. We evaluate numerically our method and show that it can attain optimal solutions substantially faster. Finally, we present several engineering insights for improving the network performance. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
11. Delay-Aware Flow Scheduling In Low Latency Enterprise Datacenter Networks: Modeling and Performance Analysis.
- Author
-
Khabbaz, Maurice, Shaban, Khaled, and Assi, Chadi
- Subjects
STORAGE area networks (Computer networks) ,DEADLINES ,FLOW control (Data transmission systems) ,QUALITY of service ,DATA flow computing ,TCP/IP - Abstract
Real-time interactive application workloads (e.g., Web search, social networking, and so on) appear in the form of a large number of mini requests and responses flowing over the datacenters’ networks. They end up being sewed all together to constitute a user-requested task or computation (e.g., display a complete Facebook timeline). Applications as such strictly impose low latency flow completion, since the service’s quality is decreed by quick aggregation of responses to the largest possible fraction of requests and their delivery back to the user. This paper presents a deadline-aware flow scheduling (DAFS). In addition to reducing the average flow completion time (FCT), DAFS aims at decreasing the deadline mismatch and blocking probabilities, hence improving the average application throughput. An analytical queuing model is formulated herein to capture the datacenter’s network dynamics and evaluate its performance when operating under DAFS. The model is validated through extensive simulations whose results also show that DAFS outperforms existing multi-queue-based priority mechanisms by 52% in terms of the average FCT and a range of 7%–29% in terms of the average throughput. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
12. Delay-Aware Scheduling and Resource Optimization With Network Function Virtualization.
- Author
-
Qu, Long, Assi, Chadi, and Shaban, Khaled
- Subjects
- *
VIRTUAL networks , *COMPUTER networks , *GENETIC algorithms , *DATA transmission systems , *BANDWIDTH allocation - Abstract
To accelerate the implementation of network functions/middle boxes and reduce the deployment cost, recently, the concept of network function virtualization (NFV) has emerged and become a topic of much interest attracting the attention of researchers from both industry and academia. Unlike the traditional implementation of network functions, a software-oriented approach for virtual network functions (VNFs) creates more flexible and dynamic network services to meet a more diversified demand. Software-oriented network functions bring along a series of research challenges, such as VNF management and orchestration, service chaining, VNF scheduling for low latency and efficient virtual network resource allocation with NFV infrastructure, among others. In this paper, we study the VNF scheduling problem and the corresponding resource optimization solutions. Here, the VNF scheduling problem is defined as a series of scheduling decisions for network services on network functions and activating the various VNFs to process the arriving traffic. We consider VNF transmission and processing delays and formulate the joint problem of VNF scheduling and traffic steering as a mixed integer linear program. Our objective is to minimize the makespan/latency of the overall VNFs’ schedule. Reducing the scheduling latency enables cloud operators to service (and admit) more customers, and cater to services with stringent delay requirements, thereby increasing operators’ revenues. Owing to the complexity of the problem, we develop a genetic algorithm-based method for solving the problem efficiently. Finally, the effectiveness of our heuristic algorithm is verified through numerical evaluation. We show that dynamically adjusting the bandwidths on virtual links connecting virtual machines, hosting the network functions, reduces the schedule makespan by 15%–20% in the simulated scenarios. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
13. A Column Generation Method for Constructing and Scheduling Multiple Forwarding Trees in Wireless Sensor Networks.
- Author
-
Ebrahimi, Dariush, Sebbah, Samir, and Assi, Chadi
- Abstract
This paper considers the problem of jointly constructing and scheduling forwarding trees in a wireless sensor network, each to collect measurements from a group of sensor nodes at a single sink node. The goal is to construct such trees that gather measurements in the most energy efficient manner and with minimal gathering latency. We assume transmissions (carrying measurements) on wireless links interfere with one another, and thus, appropriate link scheduling is required to manage interference. We refer to this problem as forwarding tree construction and scheduling (FTCS). Each tree may be constructed independently, and then, its links are scheduled. However, when all trees are combined together, the shortest and energy efficient schedule may not be guaranteed. Furthermore, a large number of possible forwarding trees for each group of sensors may be considered. Both problems of enumerating forwarding trees and scheduling links for those trees are hard combinatorial problems. This is compounded by the fact that the two problems must be solved jointly, to guarantee the selection of the best forwarding trees that, when their links are scheduled, guarantee a shortest energy efficient schedule. After highlighting the complexity of the FTCS problem, we present a novel primal-dual decomposition method using column generation. We also highlight several challenges we faced when solving the decomposed problem and present efficient techniques for mitigating those challenges. One major advantage of this paper is that it can serve as a benchmark for evaluating the performance of any low complexity method for solving the FTCS problem for larger network instances, where no known exact solutions can be found. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
14. Does Network Coding Combined With Interference Cancellation Bring Any Gain to a Wireless Network?
- Author
-
Yazdanpanah, Mina, Assi, Chadi, Sebbah, Samir, and Shayan, Yousef
- Subjects
LINEAR network coding ,INTERFERENCE (Telecommunication) ,WIRELESS sensor networks ,TRANSMITTERS (Communication) ,SIGNAL-to-noise ratio ,ROUTING (Computer network management) - Abstract
We investigate the achievable performance gain that network coding (NC) when combined with successive interference cancellation (SIC) brings to a multihop wireless network. While SIC enables concurrent receptions from multiple transmitters, NC reduces the transmission time-slot overhead, and each of these techniques has shown independently great benefits in improving the network performance. We present a cross-layer formulation for the joint routing and scheduling problem in a wireless network with NC (with opportunistic listening) and SIC capabilities. We use the realistic signal-to-interference-plus-noise ratio (SINR) interference model. To solve this combinatorially complex nonlinear problem, we decompose it (using column generation) to two linear subproblems—namely opportunistic NC aware routing and scheduling subproblems. Our scheduling subproblem consists of activating noninterfering NC components, rather than links, which do not interfere with each other and will be used to route the traffic. We further extend our design to consider a multirate multihop wireless network with interference cancellation capabilities. We use numerical evaluation to present the achieved performance gain and compare our work to three other models: a base model with no NC and SIC, a model with only NC, and a model with only SIC capabilities. The numerical results show that our proposed method (both with and without variable transmission rate selection) achieves performance gains that range between moderate and significant for the various considered scenarios. Such improvements are attributed to the joint capabilities of SIC and NC in effectively controlling the interference and improving the spatial reuse. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
15. Congestion Control, Routing, and Scheduling in Wireless Networks With Interference Cancelation Capabilities.
- Author
-
Qu, Long, He, Jiaming, and Assi, Chadi
- Subjects
CROSS layer optimization ,TELECOMMUNICATION systems ,SIGNAL-to-noise ratio ,INTERFERENCE (Telecommunication) ,WIRELESS communications - Abstract
Recently, there has been strong interest in exploiting advanced physical-layer techniques to increase the capacity of multihop wireless networks. Several recent studies have emerged with a particular focus on successive interference cancelation (SIC) as an effective approach to allow multiple adjacent concurrent transmissions to coexist, enabling multipacket reception. This paper is in line with those efforts in that we attempt to understand the benefits of SIC on the throughput performance of wireless networks. We consider a cross-layer design for the joint congestion control, routing, and scheduling problem in wireless networks where nodes are endowed with SIC capabilities and under the general physical signal-to-interference-plus-noise ratio (SINR) interference model. We use duality theory to decompose the joint design problem into congestion control and routing/scheduling subproblems, which interact through congestion prices. This decomposition enables us to solve the joint cross-layer design problem in a completely distributed manner. Given that the problem of scheduling with SIC and under the SINR interference regime is NP-hard, this paper develops a decentralized approach that allows links to coordinate their transmissions and, therefore, efficiently solve the link scheduling problem. Numerically, we show that our decentralized algorithm achieves similar results to those obtained by other centralized methods (e.g., greedy maximal scheduling). We also study the performance gains SIC brings to wireless networks, and we show that flows in the network achieve up to twice their rates in most instances, in comparison with networks without interference cancelation capabilities. These gains are attributed to the capabilities of SIC to better manage the interference and promote higher spatial reuse in the network. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
16. Smart Microgrids: Optimal Joint Scheduling for Electric Vehicles and Home Appliances.
- Author
-
Tushar, Mosaddek Hossain Kamal, Assi, Chadi, Maier, Martin, and Uddin, Mohammad Faisal
- Abstract
The integration of renewable energy sources and electrical vehicles (EVs) into microgrids is becoming a popular green approach. To reduce greenhouse gas emissions, several incentives are given to use renewable energy sources and EVs. By using EVs as electricity storage and renewable energy sources as distributed generators (DGs), microgrids become more reliable, stable, and cost-effective. In this paper, we propose an optimal centralized scheduling method to jointly control the electricity consumption of home appliances and plug-in EVs as well as to discharge the latter ones when they have excess energy, thereby increasing the reliability and stability of microgrids and giving lower electricity prices to customers. We mathematically formulate the scheduling method as a mixed integer linear programming (MILP) problem and solve it to optimality. We compare the optimal solution to that obtained from a scheduling framework, where EVs do not have discharge capabilities, decentralized charge control using game theory and to a solution obtained from a naive scheduling framework. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
17. Coding-aware routing and scheduling in WiMAX-based mesh networks: a cross-layer design approach.
- Author
-
El-Najjar, Jad, Assi, Chadi, and Jaumard, Brigitte
- Subjects
IEEE 802.16 (Standard) ,MESH networks ,WIRELESS communications ,COMPUTER programming ,ROUTING (Computer network management) - Abstract
In this paper, we propose a cross-layer design framework for the joint problem of coding-aware routing and scheduling in WiMAX-based mesh networks with unicast sessions. The model attempts to maximize the system throughput by exploiting opportunistic coding opportunities through appropriate routing and by achieving efficient spectrum reuse through appropriate link scheduling. We assume centralized scheduling at the base station and focus on minimizing the total schedule length to satisfy a certain traffic demand. Minimizing the schedule length is equivalent to maximizing the system throughput. We present a linear programming optimization model for the joint problem, which relies on the enumeration of all possible schedules. Given its complexity, we decompose the problem using a column generation approach. Our numerical results show that significant gains may be achieved when network coding is incorporated into the design. We compare the performance with that of a joint coding-oblivious model with and without transmission power control. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
18. A Joint Transmission Grant Scheduling and Wavelength Assignment in Multichannel SG-EPON.
- Author
-
Meng, Lehan, El-Najjar, Jad, Alazemi, Hamed, and Assi, Chadi
- Published
- 2009
- Full Text
- View/download PDF
19. Resource Management in STARGATE-Based Ethernet Passive Optical Networks (SG-EPONs).
- Author
-
Meng, Lehan, Assi, Chadi M., Maier, Martin, and Dhaini, Ahmad R.
- Published
- 2009
- Full Text
- View/download PDF
20. On the Interplay Between Spatial Reuse and Network Coding in Wireless Networks.
- Author
-
El-Najjar, Jad, AlAzemi, Hamed M.K., and Assi, Chadi
- Abstract
This paper studies the interplay between network coding and spatial reuse in wireless mesh networks. We present a method that attempts to maximize the system performance by exploiting effectively (and not greedily) coding opportunities through appropriate routing and achieving efficient spectrum reuse through opportunistic link scheduling. We show that judiciously selecting coding structures requires proper transmission power allocation to better manage cumulative interference in the network, and thus yield better spectrum spatial reuse and effective multi-hop system throughput. We present an optimization model for this complex design problem, which relies on the enumeration of all possible schedules and decompose it into subproblems which we can solve more efficiently. Our numerical results indicate that optimal joint coding and scheduling with proper power allocation yields a performance enhancement of more than 10% over that with maximal power transmission and more than 45% enhancement over a coding oblivious design model. Our results also revealed that network coding has only marginal benefits (∼ 6%) in a dense network and that in such networks managing interference through proper power allocation yields very good performance. [ABSTRACT FROM PUBLISHER]
- Published
- 2011
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.