Browsing by Author "Taleb, Tarik"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    One-Step Approach for Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks
    (IEEE Communications Society, 2016-06) Cheli, Ali; Bagaa, Miloud; Djenouri, Djamel; Balasingham, Ilangko; Taleb, Tarik
    We consider in this letter the problem of constrained relay node (RN) placement where sensor nodes must be connected to base stations by using a minimum number of RNs. The latter can only be deployed at a set of predefined locations, and the two-tiered topology is considered where only RNs are responsible for traffic forwarding. We propose a one-step constrained RN placement (OSRP) algorithm which yields a network tree. The performance of OSRP in terms of the number of added RNs is investigated in a simulation study by varying the network density, the number of sensor nodes, and the number of candidate RN positions. The results show that OSRP outperforms the only algorithm in the literature for two-tiered constrained RNs placement.
  • Thumbnail Image
    Item
    Optimal Placement of Relay Nodes Over Limited Positions in Wireless Sensor Networks
    (IEEE, 2017-04) Bagaa, Miloud; Cheli, Ali; Djenouri, Djamel; Taleb, Tarik; Balasingham, Ilangko; Kansanen, Kimmo
    This paper tackles the challenge of optimally placing relay nodes (RNs) in wireless sensor networks given a limited set of positions. The proposed solution consists of: 1) the usage of a realistic physical layer model based on a Rayleigh blockfading channel; 2) the calculation of the signal-to-interferenceplus- noise ratio (SINR) considering the path loss, fast fading, and interference; and 3) the usage of a weighted communication graph drawn based on outage probabilities determined from the calculated SINR for every communication link. Overall, the proposed solution aims for minimizing the outage probabilities when constructing the routing tree, by adding a minimum number of RNs that guarantee connectivity. In comparison to the state-of-the art solutions, the conducted simulations reveal that the proposed solution exhibits highly encouraging results at a reasonable cost in terms of the number of added RNs. The gain is proved high in terms of extending the network lifetime, reducing the end-to-end- delay, and increasing the goodput.
  • Thumbnail Image
    Item
    User mobility-aware Virtual Network Function placement for Virtual 5G Network Infrastructure
    (IEEE, ) Taleb, Tarik; Bagaa, Miloud; Ksentini, Adlen
    Cloud offerings represent a promising solution for mobile network operators to cope with the surging mobile traffic. The concept of carrier cloud has therefore emerged as an important topic of inquiry. For a successful carrier cloud, algorithms for optimal placement of Virtual Network Functions (VNFs) on federated cloud are of crucial importance. In this paper, we introduce different VNF placement algorithms for carrier cloud with two main design goals: i) minimizing path between users and their respective data anchor gateways and ii) optimizing their sessions' mobility. The two design goals effectively represent two conflicting objectives, that we deal with considering the mobility features and service usage behavioral patterns of mobile users, in addition to the mobile operators' cost in terms of the total number of instantiated VNFs to build a Virtual Network Infrastructure (VNI). Different solutions are evaluated based on different metrics and encouraging results are obtained.