JFJoumana Farah

Joumana Farah

*This is an algorithmically generated author record based on publicly available information.

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


Joumana Farah has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Advanced Resource Allocation Technique for a Fair Downlink Non-Orthogonal Multiple Access System

    by Marie-Rita Hojeij, Charbel Abdel Nour, Joumana Farah, Catherine Douillard

    In this paper, a novel resource allocation technique is proposed for a power-domain non-orthogonal multiple access scheme using successive interference cancellation in a downlink cellular system. It aims at providing a flexible balancing between throughput and fairness maximization and incorporates unequal power repartition among allocated subbands using waterfilling. Its main strength is the ability to achieve a high level of fairness in every scheduling slot, therefore improving the quality of experience for all users. Fairness is achieved by the introduction of a new efficient scheduling metric within the allocation process. Extensive simulation results show that the proposed metric enhances both long-term and short-term fairness, and improves system capacity, when compared to the conventional proportional fairness scheduler.


  • Open Access

    Weighted Proportional Fair Scheduling for Downlink Nonorthogonal Multiple Access

    by Marie-Rita Hojeij, Charbel Abdel Nour, Joumana Farah, Catherine Douillard

    A weighted proportional fair (PF) scheduling method is proposed in the context of nonorthogonal multiple access (NOMA) with successive interference cancellation (SIC) at the receiver side. The new scheme introduces weights that adapt the classical PF metric to the NOMA scenario, improving performance indicators and enabling new services. The distinguishing value of the proposal resides in its ability to improve long‐term fairness and total system throughput while achieving a high level of fairness in every scheduling slot. Finally, it is shown that the additional complexity caused by the weight calculation has only a limited impact on the overall scheduler complexity, while simulation results confirm the claimed improvements, making the proposal an appealing alternative for resource allocation in a cellular downlink system.


  • Fusion techniques for multi-hop relay wireless sensor networks

    by Joumana Farah, Anthony Beylerian, Charles Yaacoub, Ralph Stephan

    Wireless sensor networks have gained considerable interest in the research community during the last decade. In this paper, we target the lower layers in the protocol stack of wireless sensor networks, for the aim of providing a reliable backbone for multimedia applications where error propagation and relatively high error rates are a major concern. Decoding and fusion techniques are developed and evaluated for multi-hop relay wireless sensor networks incorporating the “Amplify and Forward” and “Decode and Forward” relaying protocols, based on turbo codes. Simulation results show a significant gain in bit error rate performance when the different streams are fused at the relays or clustering nodes, compared to the case where these streams are blended at the final fusion center. Results also show that in situations where transmission conditions do not allow for a good exploitation of multi-stream diversity at the fusion center, the “Amplify and Forward” protocol outperforms “Decode and Forward” in terms of improved BER performance and reduced relay complexity, at the expense of a linear increase in transmission rate.


  • Successive refinement of side information using adaptive search area for long duration GOPs in distributed video coding

    by Abdalbassir Abou-Elailah, Frederic Dufaux, Marco Cagnazzo, Beatrice Pesquet-Popescu, Joumana Farah

    In distributed video coding, the reference frames are used to generate a side information at the decoder in order to decode the Wyner-Ziv frame. The quality of side information has a strong impact on the coding efficiency of distributed video coding. The estimation of the side information becomes less accurate when the temporal distance between the neighboring reference frames increases or when the sequence contains fast motion. In this paper, we propose a new method based on successive refinement of the side information by adapting the motion search area after decoding the first DCT band. More specifically, different search areas are initially set, according to the temporal distance between the neighboring reference frames. Furthermore, the size of the search area is adapted to the motion content after decoding the first DCT band by using the partially decoded Wyner-Ziv frame. This adapted search area is used in order to refine the side information after decoding each remaining DCT band. The experimental results show that the proposed technique allows an improvement in rate distortion performance that can reach 0.7 dB for a GOP size of 8, compared to the method where a constant search area is used, and a significant gain up to 3.23 dB, with respect to DISCOVER codec. The improvement in the quality of the final side information reaches 5.6 dB for some frames, compared to constant search area. Moreover, the proposed method reduces significantly the decoding time for all test sequences.


  • Cedar: An optimized network-aware solution for P2P video multicast

    by Elie Gabriel Mora, Claudio Greco, Beatrice Pesquet-Popescu, Marco Cagnazzo, Joumana Farah

    Video multicast is an important application for P2P networks, which can benefit from the load repartitioning and large scale distribution properties they offer. In this context, the Orchard algorithm was developed in 2007, with an aim to build a P2P system meeting video multicast requirements. However, Orchard suffers from a slow overlay construction and a potentially high end-to-end delay. In this work, we propose a new algorithm that we call Cedar. Based on Orchard, it integrates original functionalities to speed-up the tree construction and builds a topologically-aware overlay network in order to minimize end-to-end delay. Simulation results showed that Cedar fulfilled its requirements, as the tree construction speed was increased by at least 64%, and the end-to-end delays reduced from around 20 seconds to a maximum of 5 seconds. The Network Awareness functionality also reduced end-to-end delays by 33%.


  • Effect of mobility on the performance of Amplify-and-Forward cooperation in SC-FDMA systems

    by Youssef Nasser, Joumana Farah, Joseph Kirillos, Stephanie Bassil, Maryline Helard

    Cooperative relay communication is a promising technique in the future wireless communication systems. The cooperation techniques allow mobiles to increase their uplink diversity by relaying the data of other users. In this paper, we analyze the impact of the cooperative region of a mobile terminal on the system performance of the Single-Carrier Frequency Division Multiple Access (SC-FDMA) in dynamic cooperation transmission scenarios. This cooperative region is defined as the area where a mobile terminal has at least 1-connected neighbor. Using the Random Way Point (RWP) mobility model and the Effective Exponential SNR Mapping (EESM), we give an analytical expression of the Bit Error Rate (BER) at the destination in terms of the radius of cooperative region and of the users density. Using two different assumptions for users' distributions, we show that for a cell radius normalized to one unit, and with the RWP model, the optimal cooperative region radius depends on the users density in the network. Compared to the non-cooperative scenario, and depending on the spreading length, the SNR gain obtained through dynamic cooperation can reach few dBs. Our results are validated through simulations.

  • Disparity map estimation under convex constraints using proximal algorithms

    by Mireille El Gheche, Jean-Christophe Pesquet, Joumana Farah, Caroline Chaux, Beatrice Pesquet-Popescu

    In this paper, we propose a new approach for estimating depth maps of stereo images which are prone to various types of noise. This method, based on a parallel proximal algorithm, gives a great flexibility in the choice of the constrained criterion to be minimized, thus allowing us to take into account different types of noise distributions. Our main objective is to present an iterative estimation method based on recent convex optimization algorithms and proximal tools. Results for several error measures demonstrate the effectiveness and robustness of the proposed method for disparity map estimation even in the presence of perturbations.


  • Proximal splitting methods for depth estimation

    by Mireille El Gheche, Jean-Christophe Pesquet, Joumana Farah, Mounir Kaaniche, Beatrice Pesquet-Popescu

    Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In this paper, we address the same estimation problem and pro pose to solve it in a more general convex optimization frame work based on proximal methods. More precisely, unlike previous works where the criterion must satisfy some restrictive conditions in order to be able to numerically solve the minimization problem, this work offers a great flexibility in the choice of the involved criterion. The method is validated in a stereo image coding framework, and the results demonstrate the good performance of the proposed parallel proximal algorithm.


  • Impact of mobility on the performance of dynamic cooperative communications in SC-FDMA systems

    by Youssef Nasser, Joumana Farah, Joseph Kirillos, Stephanie Bassil, Maryline Helard

    Cooperative communication technique has recently gained momentum in the research community. This approach allows mobiles to increase their uplink diversity by relaying data of other users. In this paper, we analyze the impact of the terminal mobility on the system performance of the Single-Carrier Frequency Division Multiple Access (SC-FDMA) in dynamic cooperation transmission scenarios. More precisely, using the Random Way Point (RWP) mobility model and the Effective Exponential SNR Mapping (EESM), we give an analytical expression of the Bit Error Rate (BER) at the destination in terms of the radius of cooperative region and of the users density. We show that for cell radius normalized to one unit, and with the RWP model, the optimal cooperative region radius is equal to 0.8. Compared to the non-cooperative scenario, and depending on the spreading length, the SNR gain obtained through dynamic cooperation can exceed 3 dB. Our results are validated through simulations.