Sonia Aissa

Sonia Aissa

Auto-generated profile, based on publicly available information

Sonia Aissa

University of Quebec Montreal QC Canada

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
6 January 2011 in IEEE Communications Letters
Verified
Journal Article
Closed access
Yuli YangYuli Yang
Yuli Yang
SASonia Aissa
Sonia Aissa
In the context of multiple-input multiple-output (MIMO) communications, we propose a bit-padding information guided channel hopping (BP-IGCH) scheme which breaks the limitation that the number of transmit antennas has to be a power of two based on the IGCH concept. The proposed scheme prescribes different bit-lengths to be mapped onto the indices of the transmit antennas and then uses padding technique to avoid error propagation. Numerical results and comparisons, on both the capacity and the bit error rate performances, are provided and show the advantage of the proposed scheme. The BP-IGCH scheme not only offers lower complexity to realize the design flexibility, but also achieves better performance.

11 March 2014 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Yuli YangYuli Yang
Yuli Yang
Khaled Nabil SalamaKhaled Nabil Salama
Khaled Nabil Salama
SASonia Aissa
Sonia Aissa
In this paper, a hierarchical cell structure (HCS) is considered, where an access point (AP) broadcasts to local nodes (LNs) over orthogonal frequency subbands within a local cell located in a macrocell. Since the local cell shares the spectrum licensed to the macrocell, a given LN is interfered with by the macrocell user (MU)'s transmissions over the same subband. To improve the performance of the AP's broadcast service, a novel transmission strategy is proposed to mitigate the interference from the MU to the LN while achieving diversity gain. For the purpose of performance evaluation, the ergodic capacity of the proposed scheme is quantified, and the corresponding closed-form expression is obtained. By comparing with the traditional transmission scheme, which suffers from MU's interference, illustrative numerical results substantiate that the proposed scheme achieves better performance than the traditional scheme as the MU-LN mean channel power gain is larger than half of the AP-LN mean channel power gain. Subsequently, we develop an optimized network design by maximizing the area spectral efficiency (ASE) of the AP's broadcast in the local cell.

14 February 2014 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
PDF file
Yuli YangYuli Yang
Yuli Yang
HMHao Ma
Hao Ma
SASonia Aissa
Sonia Aissa
In this paper, we propose a partial quality-of-service (QoS)-oriented relay selection scheme with a decode-and-forward (DF) relaying protocol, to reduce the feedback amount required for relay selection. In the proposed scheme, the activated relay is the one with the maximum signal-to-noise power ratio (SNR) in the second hop among those whose packet loss rates (PLRs) in the first hop achieve a predetermined QoS level. For the purpose of evaluating the performance of the proposed scheme, we exploit it with transmission constraints imposed on the transmit power budget and interference to other users. By analyzing the statistics of received SNRs in the first and second hops, we obtain the end-to-end PLR of this scheme in closed form under the considered scenario. Moreover, to compare the proposed scheme with popular relay selection schemes, we also derive the closed-form PLR expressions for partial relay selection (PRS) and opportunistic relay selection (ORS) criteria in the same scenario under study. Illustrative numerical results demonstrate the accuracy of our derivations and substantiate that the proposed relay selection scheme is a promising alternative with respect to the tradeoff between performance and complexity.

1 May 2008 in Wireless Communications and Mobile Computing
Verified
Journal Article
Closed access
PDF file
YPYa‐Han Pan
Ya‐Han Pan
SASonia Aïssa
Sonia Aïssa

30 June 2013 in arXiv
Verified
Preprint
Open access
PDF file
QAQasim Zeeshan Ahmed
Qasim Zeeshan Ahmed
KPKi-Hong Park
Ki-Hong Park
MAMohamed-Slim Alouini
Mohamed-Slim Alouini
SASonia Aissa
Sonia Aissa
This paper investigates and compares the performance of wireless sensor networks where sensors operate on the principles of cooperative communications. We consider a scenario where the source transmits signals to the destination with the help of $L$ sensors. As the destination has the capacity of processing only $U$ out of these $L$ signals, the strongest $U$ signals are selected while the remaining $(L-U)$ signals are suppressed. A preprocessing block similar to channel-shortening is proposed in this contribution. However, this preprocessing block employs a rank-reduction technique instead of channel-shortening. By employing this preprocessing, we are able to decrease the computational complexity of the system without affecting the bit error rate (BER) performance. From our simulations, it can be shown that these schemes outperform the channel-shortening schemes in terms of computational complexity. In addition, the proposed schemes have a superior BER performance as compared to channel-shortening schemes when sensors employ fixed gain amplification. However, for sensors which employ variable gain amplification, a tradeoff exists in terms of BER performance between the channel-shortening and these schemes. These schemes outperform channel-shortening scheme for lower signal-to-noise ratio.