Basem Shihada

King Abdullah University of Science and Technology, Djidda, Makkah, Saudi Arabia

Are you Basem Shihada?

Claim your profile

Publications (60)36.53 Total impact

  • Amr Elrasad, Basem Shihada
    IEEE International Conference on High Performance Switching and Routing (HPSR); 07/2015
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, two resource allocation schemes for energy efficient cognitive radio systems are proposed. Our design considers resource allocation approaches that adopt spectrum sharing combined with soft-sensing information, adaptive sensing thresholds, and adaptive power to achieve an energy efficient system. An energy per good-bit metric is considered as an energy efficient objective function. A multi-carrier system, such as, orthogonal frequency division multiplexing, is considered in the framework. The proposed resource allocation schemes, using different approaches, are designated as sub-optimal and optimal. The sub-optimal approach is attained by optimizing over a channel inversion power policy. The optimal approach utilizes the calculus of variation theory to optimize a problem of instantaneous objective function subject to average and instantaneous constraints with respect to functional optimization variables. In addition to the analytical results, selected numerical results are provided to quantify the impact of soft-sensing information and the optimal adaptive sensing threshold on the system performance.
    IEEE Transactions on Wireless Communications 05/2015; 14(5):2455-2469. DOI:10.1109/TWC.2014.2387161 · 2.76 Impact Factor
  • Amr Elrasad, Basem Shihada
    International Conference on Computer Communications (INFOCOM) Student Workshop; 04/2015
  • [Show abstract] [Hide abstract]
    ABSTRACT: Reliable data transmission is a fundamental challenge in resource-constrained wireless sensor networks. In current implementations, a single bit error requires retransmitting the entire frame. This incurs extra processing overhead and power consumption, especially for large frames. Frame fragmentation into small blocks with individual error detection codes can reduce the unnecessary retransmission of the correctly received blocks. The optimal block size, however, varies based on the wireless channel conditions. In this paper, we propose an interference-aware frame fragmentation scheme called iFrag. iFrag dynamically adjusts the number of blocks inside a frame based on current channel conditions, and effectively addresses all challenges associated with such dynamic partitioning. Through analytical and experimental results, we show that iFrag achieves up to improvement in goodput when the channel is noisy, while reducing the delay by 12 % compared to other static fragmentation approaches. On average, it shows a 13 % gain in goodput across all channel conditions used in our experiments. Our testbed results also show that iFrag lowers the energy consumed per useful bit by 60 %, as improved data transmission reliability reduces the number of frame retransmissions which increases the motes energy efficiency.
    Wireless Networks 10/2014; 20(7):1-18. DOI:10.1007/s11276-014-0722-1 · 1.06 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider a cognitive radio multi-input–multi-output environment, in which we adapt our beamformer to maximize both energy efficiency (EE) and signal-to-interference-plus-noise ratio (SINR) metrics. Our design considers an underlaying communication using adaptive beamforming schemes combined with sensing information to achieve optimal energy-efficient systems. The proposed schemes maximize EE and SINR metrics subject to cognitive radio and quality-of-service constraints. The analysis of the proposed schemes is classified into two categories based on knowledge of the secondary-transmitter-to-primary-receiver channel. Since the optimizations of EE and SINR problems are not convex problems, we transform them into a standard semidefinite programming (SDP) form to guarantee that the optimal solutions are global. An analytical solution is provided for one scheme, while the second scheme is left in a standard SDP form. Selected numerical results are used to quantify the impact of the sensing information on the proposed schemes compared to the benchmark ones.
    IEEE Transactions on Wireless Communications 09/2014; 13(9):5095-5106. DOI:10.1109/TWC.2014.2323962 · 2.76 Impact Factor
  • Ahmad Showail, Kamran Jamshaid, Basem Shihada
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we consider a cognitive radio multi-input multi-output environment in which we adapt our beamformer to maximize both energy efficiency and signal to interference plus noise ratio (SINR) metrics. Our design considers an underlaying communication using adaptive beamforming schemes combined with the sensing information to achieve an optimal energy efficient system. The proposed schemes maximize the energy efficiency and SINR metrics subject to cognitive radio and quality of service constraints. Since the optimization of energy efficiency problem is not a convex problem, we transform it into a standard semi-definite programming (SDP) form to guarantee a global optimal solution. Analytical solution is provided for one scheme, while the other scheme is left in a standard SDP form. Selected numerical results are used to quantify the impact of the sensing information on the proposed schemes compared to the benchmark ones.
    2014 IEEE International Symposium on Information Theory (ISIT); 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: Next-generation passive optical network (PON) has been considered in the past few years as a cost-effective broadband access technology. With the ever-increasing power saving concern, energy efficiency has been an important issue in its operations. In this paper, we propose a novel sleep-time sizing and scheduling framework for the implementation of green bandwidth allocation (GBA) in TDMA-PONs. The proposed framework leverages the batch-mode transmission feature of GBA to minimize the overhead due to frequent ONU on–off transitions. The optimal sleeping time sequence of each ONU is determined in every cycle without violating the maximum delay requirement. With multiple ONUs possibly accessing the shared media simultaneously, a collision may occur. To address this problem, we propose a new sleep-time sizing mechanism, namely Sort-And-Shift (SAS), in which the ONUs are sorted according to their expected transmission start times, and their sleep times are shifted to resolve any possible collision while ensuring maximum energy saving. Results show the effectiveness of the proposed framework and highlight the merits of our solutions .
    IEEE/ACM Transactions on Networking 06/2014; 22(3):850-863. DOI:10.1109/TNET.2013.2259596 · 1.99 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: We analyze the problem of buffer sizing for backlogged TCP flows in 802.11-based wireless mesh networks. Our objective is to maintain high network utilization while providing low queueing delays. Unlike wired networks where a single link buffer feeds a bottleneck link, the radio spectral resource in a mesh network is shared among a set of contending mesh routers. We account for this by formulating the buffer size problem as sizing a collective buffer distributed over a set of interfering nodes. In this paper we propose mechanisms for sizing and distributing this collective buffer among the mesh nodes constituting the network bottleneck. Our mechanism factors in the network topology and wireless link rates, improving on pre-set buffer allocations that cannot optimally work across the range of configurations achievable with 802.11 radios. We evaluate our mechanisms using simulations as well as experiments on a testbed. Our results show that we can reduce the RTT of a flow by 6×6× or more, at the cost of less than 10% drop in end-to-end flow throughput.
    Ad Hoc Networks 05/2014; 16. DOI:10.1016/j.adhoc.2014.01.002 · 1.94 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Leak and backflow detection are essential aspects of Water Distribution System (WDS) monitoring. Most existing solutions for leak/backflow detection in WDSs focus on the placement of expensive static sensors located strategically. In contrast to these, we propose a solution whereby mobile sensors (i.e., their movement aided only by the inherent water flow in the system) detect leaks/backflow. Information about the leaks/backflow is collected from the sensors either by physically capturing them, or through wireless communication. Specifically, we propose models to maximize leak/backflow detection given a cost constraint (a limit on the number of sensors). Through extensive simulations, we demonstrate the superior performance of our proposed solution when compared with the state of the art solutions (e.g., algorithms/protocols and analysis).
    2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA); 05/2014
  • Ismail Alqerm, Basem Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: Radio resource management becomes an important aspect of the current wireless networks because of spectrum scarcity and applications heterogeneity. Cognitive radio is a potential candidate for resource management because of its capability to satisfy the growing wireless demand and improve network efficiency. Decision-making is the main function of the radio resources management process as it determines the radio parameters that control the use of these resources. In this paper, we propose an adaptive decision-making scheme (ADMS) for radio resources management of different types of network applications including: power consuming, emergency, multimedia, and spectrum sharing. ADMS exploits genetic algorithm (GA) as an optimization tool for decision-making. It consists of the several objective functions for the decision-making process such as minimizing power consumption, packet error rate (PER), delay, and interference. On the other hand, maximizing throughput and spectral efficiency. Simulation results and test bed evaluation demonstrate ADMS functionality and efficiency.
    2014 IEEE 28th International Conference on Advanced Information Networking and Applications (AINA); 05/2014
  • Amr Elrasad, Basem Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper introduces a novel approach called Delayed Excess Scheduling (DES), which practically reuse the excess bandwidth in EPONs system. DES is suitable for the industrial deployment as it requires no timing constraint and achieves better performance compared to the previously reported schemes.
    Optical Fiber communication (OFC), Moscone Convention Center, San Francisco, California, USA; 03/2014
  • Li Xia, Basem Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study the optimisation problem of transmission power and delay in a multi-hop wireless network consisting of multiple nodes. The goal is to determine the optimal policy of transmission rates at various buffer and channel states in order to minimise the power consumption and the queueing delay of the whole network. With the assumptions of interference-free links and independently and identically distributed (i.i.d.) channel states, we formulate this problem using a semi-open Jackson network model for data transmission and a Markov model for channel states transition. We derive a difference equation of the system performance under any two different policies. The necessary and sufficient condition of optimal policy is obtained. We also prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate and the optimal transmission rate can be either maximal or minimal. That is, the ‘bang-bang’ control is an optimal control. This optimality structure greatly reduces the problem complexity. Furthermore, we develop an iterative algorithm to find the optimal solution. Finally, we conduct the simulation experiments to demonstrate the effectiveness of our approach. We hope our work can shed some insights on solving this complicated optimisation problem.
    International Journal of Control 02/2014; 87(6). DOI:10.1080/00207179.2013.873953 · 1.14 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.
    Ad Hoc Networks 02/2014; 13:414–427. DOI:10.1016/j.adhoc.2013.09.002 · 1.94 Impact Factor
  • Source
    Ahmed Elwhishi, Han Ho, K Naik, Basem Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are pos-sibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outper-forms all the counterpart multi-copy encounter-based routing protocols considered in the study.
    Wireless Networks 11/2013; 24(7). DOI:10.1007/s11276-013-0588-7 · 1.06 Impact Factor
  • Li Xia, Basem Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we discuss the decentralized optimization of delay and energy consumption in a multi-hop wireless network. The goal is to minimize the energy consumption of energy-critical nodes and the overall packet transmission delay of the network. The transmission rates of energy-critical nodes are adjustable according to the local information of nodes, i.e., the length of packets queued. The multi-hop network is modeled as a queueing network.We prove that the system performance is monotone w.r.t. (with respect to) the transmission rate, thus the “bang-bang” control is an optimal control. We also prove that there exists a threshold type control policy which is optimal. We propose a decentralized algorithm to control transmission rates of these energy-critical nodes. Some simulation experiments are conducted to demonstrate the effectiveness of our approach.
    American Control Conference (ACC), 2013; 06/2013
  • Source
    Ahmed Elwhishi, Pin-Han Ho, K. Naik, Basem Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts.
    IEEE Transactions on Parallel and Distributed Systems 05/2013; 24(5):871-880. DOI:10.1109/TPDS.2012.197 · 2.17 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study the problem of video quality prediction over the wireless 4G network. Video transmission data is collected from a real 4G SCM testbed for investigating factors that affect video quality. After feature transformation and selection on video and network parameters, video quality is predicted by solving as regression problem. Experimental results show that the dominated factor on video quality is the channel attenuation and video quality can be well estimated by our models with small errors.
    17th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2013); 04/2013
  • Source
    Li Xia, Basem Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: In this technical note, we discuss the optimality properties of service rate control in closed Jackson networks. We prove that when the cost function is linear to a particular service rate, the system performance is monotonic w.r.t. (with respect to) that service rate and the optimal value of that service rate can be either maximum or minimum (we call it Max–Min optimality); When the second-order derivative of the cost function w.r.t. a particular service rate is always positive (negative), which makes the cost function strictly convex (concave), the optimal value of such service rate for the performance maximization (minimization) problem can be either max-imum or minimum. To the best of our knowledge, this is the most general result for the optimality of service rates in closed Jackson networks and all the previous works only involve the first conclusion. Moreover, our result is also valid for both the state-dependent and load-dependent service rates, under both the time-average and customer-average performance criteria. Index Terms—Closed Jackson network, discrete event dynamic systems (DEDS), perturbation analysis, service rate control.
    IEEE Transactions on Automatic Control 04/2013; 58(4):1051-1056. DOI:10.1109/TAC.2012.2218145 · 3.17 Impact Factor
  • Basem Shihada, Sami El-Ferik, Pin-Han Ho
    [Show abstract] [Hide abstract]
    ABSTRACT: FAST TCP is important for promoting data-intensive applications since it can cleverly react to both packet loss and delay for detecting network congestion. This paper provides a continuous time model and extensive stability analysis of FAST TCP congestion-control mechanism in bufferless Optical Burst Switched Networks (OBS). The paper first shows that random burst contentions are essential to stabilize the network, but cause throughput degradation in FAST TCP flows when a burst with all the packets from a single round is dropped. Second, it shows that FAST TCP is vulnerable to burst delay and fails to detect network congestion due to the little variation of round-trip time, thus unstable. Finally it shows that introducing extra delays by implementing burst retransmission stabilizes FAST TCP over OBS. The paper proves that FAST TCP is not stable over barebone OBS. However, it is locally, exponentially, and asymptotically stable over OBS with burst retransmission.
    Optical Switching and Networking 04/2013; 10(2):107–118. DOI:10.1016/j.osn.2012.09.001 · 0.91 Impact Factor

Publication Stats

127 Citations
36.53 Total Impact Points

Institutions

  • 2011–2014
    • King Abdullah University of Science and Technology
      • Department of Computer Science
      Djidda, Makkah, Saudi Arabia
    • University of Cambridge
      • Computer Laboratory
      Cambridge, ENG, United Kingdom
  • 2013
    • University of Michigan
      Ann Arbor, Michigan, United States
  • 2010
    • Stanford University
      • Department of Computer Science
      Palo Alto, California, United States
  • 2005–2008
    • University of Waterloo
      • Department of Electrical & Computer Engineering
      Waterloo, Ontario, Canada