Basem Shihada

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

Are you Basem Shihada?

Claim your profile

Publications (48)22.05 Total impact

  • Wireless Networks 10/2014; · 0.74 Impact Factor
  • Ahmad Showail, Kamran Jamshaid, Basem Shihada
    08/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
  • Source
    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 01/2014; 87(6). · 1.01 Impact Factor
  • A.R. Dhaini, P.-H. Ho, G. Shen, B. Shihada
    [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 01/2014; 22(3):850-863. · 2.01 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. 01/2014; 13:414–427.
  • [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. 01/2014;
  • 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; · 0.74 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. · 1.80 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
  • 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. · 0.72 Impact Factor
  • 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 01/2013; 58:1051-1056. · 2.72 Impact Factor
  • Chun Pong Lau, K. Jamshaid, B. Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we consider a wireless multimedia system by mapping scalable video coded (SVC) bit stream upon superposition coded (SPC) signals, referred to as (SVC-SPC) architecture. Empirical experiments using a software-defined radio(SDR) emulator are conducted to gain a better understanding of its efficiency, specifically, the impact of the received signal due to different power allocation ratios. Our experimental results show that to maintain high video quality, the power allocated to the base layer should be approximately four times higher than the power allocated to the enhancement layer.
    Advanced Information Networking and Applications (AINA), 2013 IEEE 27th International Conference on; 01/2013
  • Chun Pong Lau, B. Shihada, Pin-Han Ho
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we investigate cross-layer superposition coded multicast (SCM). Previous studies have proven its effectiveness in exploiting better channel capacity and service granularities via both analytical and simulation approaches. However, it has never been practically implemented using a commercial 4G system. This paper demonstrates our prototype in achieving the SCM using a standard 802.16 based testbed for scalable video transmissions. In particular, to implement the superposition coded (SPC) modulation, we take advantage a novel software approach, namely logical SPC (L-SPC), which aims to mimic the physical layer superposition coded modulation. The emulation results show improved throughput comparing with generic multicast method.
    Advanced Information Networking and Applications Workshops (WAINA), 2013 27th International Conference on; 01/2013
  • M. Felamban, B. Shihada, K. Jamshaid
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Sensor Networks (WSN) are expected to play a vital role in the exploration and monitoring of underwater areas which are not easily reachable by humans. However, underwater communication via acoustic waves is subject to several performance limitations that are very different from those used for terresstrial networks. In this paper, we investigate node placement for building an initial underwater WSN infrastructure. We formulate this problem as a nonlinear mathematical program with the objective of minimizing the total transmission loss under a given number of sensor nodes and targeted coverage volume. The obtained solution is the location of each node represented via a truncated octahedron to fill out the 3D space. Experiments are conducted to verify the proposed formulation, which is solved using Matlab optimization tool. Simulation is also conducted using an ns-3 simulator, and the simulation results are consistent with the obtained results from mathematical model with less than 10% error.
    Advanced Information Networking and Applications (AINA), 2013 IEEE 27th International Conference on; 01/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Multi-copy utility based routing strategies have been con-sidered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). They allow multiple message replicas to be launched to increase the ratio of message delivery or reduce its delay. This advan-tage, nonetheless, is at the expense of taking more buffer space at each node. The combination of custody and repli-cation entails high buffer and bandwidth overhead. There-fore, efficient scheduling policies are needed to decide which messages to forward first when the available bandwidth is limited, and which messages to drop first when the buffer operates close to its capacity. This paper investigates an efficient message scheduling and dropping policies based on the theory of the encounter-based message forwarding, and the expected number of copies of the message that have been disseminated in the network, such that the forwarding and dropping decisions result in optimal message delivery de-lays. Extensive simulations results, based on a synthetic mobility model and real mobility traces, show that the pro-posed scheduling framework can achieve superb performance against its counterparts in terms of delivery delay.
    01/2012;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Fast and unambiguous failure localization for shared risk link groups (SRLGs) with multiple links is essential for building a fully survivable and functional transparent all-optical mesh network. Monitoring trails (m-trails) have been proposed as an effective approach to achieve this goal. However, each m-trail traverses through each link by constantly taking a wavelength channel, causing a significant amount of resource consumption. In this paper, a novel framework of all-optical monitoring for SRLG failure localization is proposed. We investigate the feasibility of periodically launching optical bursts along each m-trail instead of assigning it a dedicated supervisory lightpath to probe the set of fiber segments along the m-trail, aiming to achieve a graceful compromise between resource consumption and failure localization latency. This paper defines the proposed framework and highlights the relevant issues regarding its feasibility. We provide theoretical justifications of the scheme. Asa proof of concept, we formulate the optimal burst scheduling problem via an integer linear program (ILP) and implement the method in networks of all possible SRLGs with up to d = 3 links. A heuristic method is also proposed and implemented for multiple-link SRLG failure localization, keeping all the assumptions the same as in the ILP method. Numerical results for small networks show that the scheme is able to localize single-link and multiple-link SRLG failures unambiguously with a very small amount of failure localization latency.
    Journal of Optical Communications and Networking 01/2012; 4(8):628-638. · 1.43 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Acyclic flow networks, present in many infrastructures of national importance (e.g., oil and gas and water distribution systems), have been attracting immense research interest. Existing solutions for detecting and locating attacks against these infrastructures have been proven costly and imprecise, particularly when dealing with large-scale distribution systems. In this article, to the best of our knowledge, for the first time, we investigate how mobile sensor networks can be used for optimal event detection and localization in acyclic flow networks. We propose the idea of using sensors that move along the edges of the network and detect events (i.e., attacks). To localize the events, sensors detect proximity to beacons, which are devices with known placement in the network. We formulate the problem of minimizing the cost of monitoring infrastructure (i.e., minimizing the number of sensors and beacons deployed) in a predetermined zone of interest, while ensuring a degree of coverage by sensors and a required accuracy in locating events using beacons. We propose algorithms for solving the aforementioned problem and demonstrate their effectiveness with results obtained from a realistic flow network simulator.
    Distributed Computing and Networking - 13th International Conference, ICDCN 2012, Hong Kong, China, January 3-6, 2012. Proceedings; 01/2012
  • Source
    A. Elrasad, M.G. Khafagy, B. Shihada
    [Show abstract] [Hide abstract]
    ABSTRACT: Conference code: 94596, Export Date: 31 January 2013, Source: Scopus, Art. No.: 6356888, doi: 10.1109/ICCChina.2012.6356889, Language of Original Document: English, Correspondence Address: Elrasad, A.; King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia; email: amr.rasad@kaust.edu.sa, References: Shen, G., Tucker, R.S., Chae, T., Fixed Mobile Convergence (FMC) Architectures for Broadband Access: Integration of EPON and WiMAX (2007) IEEE Communications Magazine, 45 (8), pp. 44-50;
    2012 1st IEEE International Conference on Communications in China, ICCC 2012; 01/2012

Publication Stats

55 Citations
22.05 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
  • 2005–2013
    • University of Waterloo
      • Department of Electrical & Computer Engineering
      Waterloo, Ontario, Canada
  • 2010
    • Stanford University
      • Department of Computer Science
      Palo Alto, California, United States