Papers by Mohamed Ould-Khaoua
Distributed Computing and Networking
Several analytical performance models for Circuit Switching (CS) in k-ary n-cubes have been repor... more Several analytical performance models for Circuit Switching (CS) in k-ary n-cubes have been reported in the literature. However, to the best of our knowledge, the performance properties of CS have not been investigated in the mesh networks. To address this shortcoming, this paper proposes the first analytical modeling approach to predict the mean message latency in 2-D mesh interconnect networks using CS augmented with virtual channels. Analytical approximations of the model are confirmed by comparing with those obtained through simulation experiments.
ICC 2022 - IEEE International Conference on Communications
Smart Car Parks (SCPs) based on Wireless Sensor Networks (WSNs) are one of the most interesting I... more Smart Car Parks (SCPs) based on Wireless Sensor Networks (WSNs) are one of the most interesting IoT applications. The present study addresses the deployment optimization problem of two-tiered WSNs dedicated to fire monitoring in smart parking lots. Networks deployed inside the SCP consist of three types of nodes: Sensor Nodes (SNs) which cover the spots within the parking area, Relay Nodes (RNs) which forward alert messages generated by SNs, and the Sink node which is connected to the outside world (e.g, firefighters), through a high bandwidth connection. This paper proposes an algorithm based on chaos theory and Whale Optimization Algorithm (WOA), which minimizes simultaneously the deployed number of SNs, RNs, and the maximum distance from SNs to the sink node (network diameter) while ensuring coverage and connectivity. To evaluate the effectiveness of our proposal, we have conducted extensive tests. The results show that the Chaos WOA (CWOA) outperforms the original WOA in terms of solution quality and computation time and by comparison with the exact method, CWOA finds results very close to the optimal in terms of fitness value and is efficient in terms of computational time when the problem becomes more complex.
HAL (Le Centre pour la Communication Scientifique Directe), Feb 23, 2022
HAL (Le Centre pour la Communication Scientifique Directe), Apr 26, 2021
2021 International Wireless Communications and Mobile Computing (IWCMC), 2021
The exponential growth of the Internet-of-Things (IoT) technology paradigm has resulted in new ap... more The exponential growth of the Internet-of-Things (IoT) technology paradigm has resulted in new applications and on-line services. Smart car park is one interesting example among others that can take advantage of applications based on wireless sensor networks (WSNs) Which constitute the core of IoT. This paper focuses on the deployment optimization problem of WSNs dedicated to the fire detection in a smart car park. In such networks, the nodes are classified into two categories: Sensor Nodes (SNs) deployed within the smart car park for targets coverage and Relay Nodes (RNs) whose task is to relay alert messages generated by the sensor nodes up to the sink node. In this study, we propose a Multi-Objective Binary Integer Linear Programming (MOBILP) which minimizes simultaneously the number of sensor nodes, relay nodes and the maximum distance from sensor nodes to the sink node, while ensuring coverage and connectivity. We have conducted extensive tests in order to evaluate the performance of our proposal. The results demonstrate that the MOBILP outperforms the existing approaches in terms of quality of solutions compared to a sequential deployment method, which consists to deploy SNs then RNs, and in terms of the ability to find other efficient solutions compared to a simultaneous deployment method using a mono-objective function, which consists to deploy SNs and RNs simultaneously.
Elhadi Shakshuki, Acadia University, Canada Darcy Benoit, Acadia University, Canada Mieso Denko, ... more Elhadi Shakshuki, Acadia University, Canada Darcy Benoit, Acadia University, Canada Mieso Denko, University of Guelph, Canada ... Abdel Obaid, University of Quebec, Canada Agustinus Borgy Waluyo, Institute for Infocomm Research, Singapore Ahmed Khoumsi, University of ...
Low power dissipation (PD) during testing is emerging as one of the major objectives of a built-i... more Low power dissipation (PD) during testing is emerging as one of the major objectives of a built-in self-test (BIST) designer. In this paper we examine the testability of multipliers based on Booth encoding and Wallace tree summation of the partial products and we present a methodology for deriving a low power BIST scheme for them. We propose several design rules for designing the Wallace tree in order to be fully testable under the cell fault model. The proposed low power BIST scheme for the derived multipliers is achieved by: (a) introducing suitable test pattern generators (TPGs), (b) properly assigning the TPG outputs to the multiplier inputs and (c) significantly reducing the test set length. Results indicate that the total power dissipated, the average power per test vector and the peak PD during testing can be reduced up to 73%, 27% and 36% respectively with respect to earlier schemes, depending on the implementation of the basic cells and the size of the multiplier. The test application time is also significantly reduced, while the introduced BIST scheme implementation area is small.
Proper use of a probabilistic broadcasting method in MANETs can reduce the number of rebroadcasts... more Proper use of a probabilistic broadcasting method in MANETs can reduce the number of rebroadcasts, and consequently reduce the chance of contention and collision among neighbouring nodes. In this paper we evaluate the performance of Adjusted Probabilistic flooding by comparing it to "blind" flooding as used with the Ad Hoc on Demand Distance Vector (AODV) routing protocol as well as a fixed probabilistic approach. The results show that the Adjusted Probabilistic flooding exhibits superior performance in terms of both reachability and saved
International Journal of Computers and Applications
... Figure 4 depicts latency results predicted by the ana-lytical model plotted against those pro... more ... Figure 4 depicts latency results predicted by the ana-lytical model plotted against those provided by the simula-tor for two-dimensional 8 × 8 and 16 ... [7] NR Adiga, MA Blumrich, D. Chen, P. Coteus, A. Gara, ME Giampapa, P. Heidelberger, S. Singh, BD Steinmacher-Burow, T ...
Parallel Algorithms and Applications
This paper proposes a parallel algorithm for computing anN( = K) point Lagrange interpolation on ... more This paper proposes a parallel algorithm for computing anN( = K) point Lagrange interpolation on fc-ary n-cube networks. The algorithm consists of three phases: initialisation, main and final. There is no computation in the initialisation phase. The main phase is composed of N/2 steps, each consisting of four multiplications and four subtractions, and an additional step including one division and
Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks - PM2HW2N '06
Proceedings of the 2nd ACM international workshop on Geotagging and its applications in multimedia - GeoMM '13
International Journal of Computers and Applications
... 4. W. Qiao & L. Ni, Efficient processor allocation for 3D tori, Technical Report, Michiga... more ... 4. W. Qiao & L. Ni, Efficient processor allocation for 3D tori, Technical Report, Michigan ... 6. C.-Y. Chang & P. Mohapatra, Performance improvement of allocation schemes for mesh-connected ... 7. I. Ababneh & F. Fraij, Folding contiguous and non-contiguous space sharing policies ...
MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2000
The Markov-Modulated Poisson Process (MMPP) has been extensively used for modelling bursty traflc... more The Markov-Modulated Poisson Process (MMPP) has been extensively used for modelling bursty traflc generated by multimedia applications because it is able to model the time-varying arrival rate and capture the important correlation between inter-arrival times. However, interconnection networks used in current multicomputers have been mainly anahsed under the assumption of the "non-bursty " Poisson arrival process. This study extends further the application of the MMPP to queueing networks in order to develop a new analytical model for computing message latency in pipelined circuit-switched interconnection networks. Simulation experiments reveal that the model exhibits a good degree of accuracy under various operating conditions.
2007 International Conference on Parallel and Distributed Systems, 2007
12th International Conference on Parallel and Distributed Systems - (ICPADS'06), 2006
Uploads
Papers by Mohamed Ould-Khaoua