Sameh Sorour

Sameh Sorour

Auto-generated profile, based on publicly available information

Sameh Sorour

University of Toronto

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
6 December 2010 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
SSSameh Sorour
Sameh Sorour
SVShahrokh Valaee
Shahrokh Valaee
Network coding has recently attracted attention as a substantial improvement to packet retransmission schemes in wireless multicast broadcast services (MBS). Since the problem of finding the optimal network code maximizing the bandwidth efficiency is hard to solve and hard to approximate, two main network coding heuristic schemes, namely opportunistic and full network coding, were suggested in the literature to improve the MBS bandwidth efficiency. However, each of these two schemes usually outperforms the other in different receiver, demand, and feedback settings. The continuous and rapid change of these settings in wireless networks limits the bandwidth efficiency gains if only one scheme is always employed. In this paper, we propose an adaptive scheme that maintains the highest bandwidth efficiency obtainable by both opportunistic and full network coding schemes in wireless MBS. The proposed scheme adaptively selects, between these two schemes, the one that is expected to achieve the better bandwidth efficiency performance. The core contribution in this adaptive selection scheme lies in our derivation of performance metrics for opportunistic network coding, using random graph theory, which achieves efficient selection when compared to appropriate full network coding parameters. To compare between different complexity levels, we present three approaches to compute the performance metric for opportunistic coding using different levels of knowledge about the opportunistic coding graph. For the three considered approaches, simulation results show that our proposed scheme almost achieves the bandwidth efficiency performance that could be obtained by the optimal selection between the opportunistic and full coding schemes.

19 August 2012 in International Journal of Wireless Information Networks
Verified
Journal Article
Closed access
PDF file
CFChen Feng
Chen Feng
SVShahrokh Valaee
Shahrokh Valaee
AAAnthea Wain Sy Au
Anthea Wain Sy Au
SRSophia Reyes
Sophia Reyes
SSSameh Sorour
Sameh Sorour
MEMoshe Eizenman
Moshe Eizenman

19 October 2011 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
RKRonny Yongho Kim
Ronny Yongho Kim
YKYoung Yong Kim
Young Yong Kim
AYAmin Alamdar Yazdi
Amin Alamdar Yazdi
SSSameh Sorour
Sameh Sorour
SVShahrokh Valaee
Shahrokh Valaee
The reductions of peak-to-average power ratio (PAPR) and block error rate (BLER) are two challenges in wireless systems employing orthogonal frequency-division multiplexing (OFDM)/orthogonal frequency-division multiple access. High BLER renders the system unreliable, and high PAPR is associated with power inefficiency and nonlinearity of the system. These two issues have separately been studied in the literature, but few works have studied simultaneous reductions of PAPR and BLER. In this paper, we propose a new scheme to jointly reduce and tradeoff PAPR and BLER in OFDM systems using random network coding (NC). In our proposed scheme, different representations of the input information block are generated using a special form of NC matrices, for which we prove it achieves the minimum BLER. We then propose an additional step to our proposed scheme to tradeoff a further improvement in PAPR against degradation in BLER using encoded block puncturing. Simulation results show that the proposed scheme achieves the same PAPR as conventional selective mapping (C-SLM) schemes while achieving the minimum BLER. We also show through simulations the PAPR gains achieved by our proposed additional step over C-SLM and the tradeoff of this gain against BLER degradation. Simulations finally show that our proposed scheme achieves the same results for the recently developed cubic metric.

13 February 2012 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JLJu Yong Lee
Ju Yong Lee
SSSameh Sorour
Sameh Sorour
SVShahrokh Valaee
Shahrokh Valaee
WPWonyoung Park
Wonyoung Park
M-LWWF/M-LWDF scheduling schemes have attracted much interest due to their ability to both stabilize queues whenever possible and control delay through parameter selection. However, a good implementation of these schedulers would require a mechanism to minimize the required fraction of the bandwidth while satisfying its stability and delay requirements. To the best of our knowledge, previous works on these scheduling policies did not address the problem of minimizing the bandwidth utilization while satisfying delay constraints. In this paper, we explore the solution of this problem using a joint bandwidth and weight adaptation approach. We characterize the problem solution space for M-LWWF and M-LWDF scheduling, assuming time-varying traffic. We also show that, starting from any point in the solution space, simple dynamic bandwidth and weight updates can surely lead to the convergence to the optimal operation point in this space. Based on these characteristics, we propose a dynamic parameter adaptation algorithm that is able to track the time-varying optimal operation points for dynamic traffic and channel conditions. Simulation results show the efficiency of our proposed algorithm in tracking the optimal operation points in dynamic traffic and channel settings.