Selim G. Akl

Selim G. Akl

Auto-generated profile, based on publicly available information

Selim G. Akl

Queen’s University

Research Focus & Metrics

Academic Career Length

45Years (1982-Present)

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

Representative Publications

View All Publications
1 June 2010 in Ad Hoc Networks
Verified
Journal Article
Closed access
WAWaleed Alsalih
Waleed Alsalih
Hossam S. HassaneinHossam S. Hassanein
Hossam S. Hassanein
SASelim Akl
Selim Akl

1 July 2004 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
SASelim G. Akl
Selim G. Akl

6 December 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
FCFabio Campioni
Fabio Campioni
Salimur ChoudhurySalimur Choudhury
Salimur Choudhury
Kai SalomaaKai Salomaa
Kai Salomaa
SASelim G. Akl
Selim G. Akl
Vehicular crowdsensing aims to utilize the plethora of onboard sensors and resources on smart vehicles to gather sensing data in a large coverage area. Recruitment algorithms aim to select participants within a crowdsensing network such that the most sensing data is obtained for the lowest possible cost. In this paper, we consider two such existing recruitment problems for vehicular crowdsensing and propose several heuristics. We also show that existing algorithms to solve these problems can be arbitrarily bad in the worst case. We also compare our algorithms with both optimal solutions (returned by mixed integer programs) as well as existing heuristics. Performance evaluations on our algorithms show that our algorithms outperform existing algorithms and obtain near optimal solutions.

1 February 2006 in International Journal of Parallel, Emergent and Distributed Systems
Verified
Journal Article
Closed access
MNMarius Nagy
Marius Nagy
SASelim G. Akl
Selim G. Akl
The paper is intended to be a survey of all the important aspects and results that have shaped the field of quantum computation and quantum information. The reader is first familiarized with those features and principles of quantum mechanics providing a more efficient and secure information processing. Their applications to the general theory of information, cryptography, algorithms, computational complexity and error-correction are then discussed. Prospects for building a practical quantum computer are also analyzed.

1 December 2007
Verified
Conference Paper
Closed access
WAWaleed Alsalih
Waleed Alsalih
SASelim Akl
Selim Akl
Hossam S. HassaneinHossam S. Hassanein
Hossam S. Hassanein
Due to energy constraints in individual sensor nodes, extending the lifetime is an essential objective in wireless sensor networks (WSNs). Several proposals have aimed at that objective by designing energy efficient protocols at the physical, medium access, and network layers. While the proposed protocols achieve significant energy savings for individual sensor nodes, they fail to solve topology-related problems; an example of such problems is that sensor nodes around the base station become bottlenecks and deplete their battery energy much faster than other nodes. A natural solution to such a problem is to have multiple mobile base stations so that the load is distributed evenly among all nodes. Only few proposals have followed that direction. In this paper we propose a mobile base station placement scheme for extending the lifetime of the network. In our scheme the life of the network is divided into rounds and base stations are moved to new locations at the beginning of each round. While previous work has focused on placing the base stations at predefined spots (e.g., the work in [1]) or at the boundary of the network (e.g., the work in [2]), we define and solve a more general problem in which a base station can be placed anywhere in the sensing field. We formulate the problem as an Integer Linear Program (ILP) and use an ILP solver (with a constant time limit) to find a near-optimal placement of the base stations and to find routing patterns to deliver collected data to base stations. Our experiments show that our scheme makes significant extension to the lifetime of the network.

1 April 2007 in International Journal of Parallel, Emergent and Distributed Systems
Verified
Journal Article
Closed access
MNMarius Nagy
Marius Nagy
SASelim G. Akl
Selim G. Akl
The quantum model of computation not only offers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genuine quantum mechanical terms. We show that the task of distinguishing among entangled quantum states combines entanglement and non-determinism in a way that makes the quantum solution impossible to simulate on any classical machine (even one equipped with the same measurement capabilities as the quantum computational device). A new class of information processing tasks is thus uncovered whose members are readily carried out by a quantum computer, yet are impossible to perform on any classical machine (whether deterministic or probabilistic). In the broad, unconventional context created by quantum mechanics, the computational power of a quantum computer is therefore strictly greater than that of a classical computer.