Searcharxiv⌕ Search

arXiv subjects

Athman Bouguettaya

Publications and source records attributed to Athman Bouguettaya.

At least 73 records · Page 4Linked to original sources

Blockchain-based Trust Information Storage in Crowdsourced IoT Services

We propose a novel distributed integrity-preserving framework for storing trust information in crowdsourced IoT environments. The integrity and availability of the trust information is paramount to ensure accurate trust assessment. Our proposed framework leverages the blockchain to build a distributed storage medium for trust-related information that ensures its integrity. We propose a geo-scoping approach, which ensures that trust-related information is only available where needed, thus, enabling fast access and storage space preservation. We conduct several experiments using real datasets to highlight the effectiveness of our framework.

cs.CR↗

Provider-centric Allocation of Drone Swarm Services

We propose a novel framework for the allocation of drone swarms for delivery services known as Swarm-based Drone-as-a-Service (SDaaS). The allocation framework ensures minimum cost (aka maximum profit) to drone swarm providers while meeting the time requirement of service consumers. The constraints in the delivery environment (e.g., limited recharging pads) are taken into consideration. We propose three algorithms to select the best allocation of drone swarms given a set of requests from multiple consumers. We conduct a set of experiments to evaluate and compare the efficiency of these algorithms considering the provider's profit, feasibility, requests fulfilment, and drones utilization level.

cs.MA↗

Reputation Bootstrapping for Composite Services using CP-nets

We propose a novel framework to bootstrap the reputation of on-demand service compositions. On-demand compositions are usually context-aware and have little or no direct consumer feedback. The reputation bootstrapping of single or atomic services does not consider the topology of the composition and relationships among reputation-related factors. We apply Conditional Preference Networks (CP-nets) of reputation-related factors for component services in a composition. The reputation of a composite service is bootstrapped by the composition of CP-nets. We consider the history of invocation among component services to determine reputation-interdependence in a composition. The composition rules are constructed using the composition topology and four types of reputation-influence among component services. A heuristic-based Q-learning approach is proposed to select the optimal set of reputation-related CP-nets. Experimental results prove the efficiency of the proposed approach.

cs.AI↗

Drone-as-a-Service Composition Under Uncertainty

We propose an uncertainty-aware service approach to provide drone-based delivery services called Drone-as-a-Service (DaaS) effectively. Specifically, we propose a service model of DaaS based on the dynamic spatiotemporal features of drones and their in-flight contexts. The proposed DaaS service approach consists of three components: scheduling, route-planning, and composition. First, we develop a DaaS scheduling model to generate DaaS itineraries through a Skyway network. Second, we propose an uncertainty-aware DaaS route-planning algorithm that selects the optimal Skyways under weather uncertainties. Third, we develop two DaaS composition techniques to select an optimal DaaS composition at each station of the planned route. A spatiotemporal DaaS composer first selects the optimal DaaSs based on their spatiotemporal availability and drone capabilities. A predictive DaaS composer then utilises the outcome of the first composer to enable fast and accurate DaaS composition using several Machine Learning classification methods. We train the classifiers using a new set of spatiotemporal features which are in addition to other DaaS QoS properties. Our experiments results show the effectiveness and efficiency of the proposed approach.

cs.DC↗

A CP-Net based Qualitative Composition Approach for an IaaS Provider

We propose a novel CP-Net based composition approach to qualitatively select an optimal set of consumers for an IaaS provider. The IaaS provider's and consumers' qualitative preferences are captured using CP-Nets. We propose a CP-Net composability model using the semantic congruence property of a qualitative composition. A greedy-based and a heuristic-based consumer selection approaches are proposed that effectively reduce the search space of candidate consumers in the composition. Experimental results prove the feasibility of the proposed composition approach.

cs.AI↗

Sequential Learning-based IaaS Composition

We propose a novel IaaS composition framework that selects an optimal set of consumer requests according to the provider's qualitative preferences on long-term service provisions. Decision variables are included in the temporal conditional preference networks (TempCP-net) to represent qualitative preferences for both short-term and long-term consumers. The global preference ranking of a set of requests is computed using a \textit{k}-d tree indexing based temporal similarity measure approach. We propose an extended three-dimensional Q-learning approach to maximize the global preference ranking. We design the on-policy based sequential selection learning approach that applies the length of request to accept or reject requests in a composition. The proposed on-policy based learning method reuses historical experiences or policies of sequential optimization using an agglomerative clustering approach. Experimental results prove the feasibility of the proposed framework.

cs.DC↗

Long-term IaaS Provider Selection using Short-term Trial Experience

We propose a novel approach to select privacy-sensitive IaaS providers for a long-term period. The proposed approach leverages a consumer's short-term trial experiences for long-term selection. We design a novel equivalence partitioning based trial strategy to discover the temporal and unknown QoS performance variability of an IaaS provider. The consumer's long-term workloads are partitioned into multiple Virtual Machines in the short-term trial. We propose a performance fingerprint matching approach to ascertain the confidence of the consumer's trial experience. A trial experience transformation method is proposed to estimate the actual long-term performance of the provider. Experimental results with real-world datasets demonstrate the efficiency of the proposed approach.

cs.CR↗

An Internet of Things Service Roadmap

We propose a roadmap for leveraging the tremendous opportunities the Internet of Things (IoT) has to offer. We argue that the combination of the recent advances in service computing and IoT technology provide a unique framework for innovations not yet envisaged, as well as the emergence of yet-to-be-developed IoT applications. This roadmap covers: emerging novel IoT services, articulation of major research directions, and suggestion of a roadmap to guide the IoT and service computing community to address key IoT service challenges.

cs.NI↗

Layer-based Composite Reputation Bootstrapping

We propose a novel generic reputation bootstrapping framework for composite services. Multiple reputation-related indicators are considered in a layer-based framework to implicitly reflect the reputation of the component services. The importance of an indicator on the future performance of a component service is learned using a modified Random Forest algorithm. We propose a topology-aware Forest Deep Neural Network (fDNN) to find the correlations between the reputation of a composite service and reputation indicators of component services. The trained fDNN model predicts the reputation of a new composite service with the confidence value. Experimental results with real-world dataset prove the efficiency of the proposed approach.

cs.DC↗

Reliability Model for Incentive-Driven IoT Energy Services

We propose a novel reliability model for composing energy service requests. The proposed model is based on consumers' behavior and history of energy requests. The reliability model ensures the maximum incentives to providers. Incentives are used as a green solution to increase IoT users' participation in a crowdsourced energy sharing environment. Additionally, adaptive and priority scheduling compositions are proposed to compose the most reliable energy requests while maximizing providers' incentives. A set of experiments is conducted to evaluate the proposed approaches. Experimental results prove the efficiency of the proposed approaches.

cs.DC↗

Multi-Perspective Trust Management Framework for Crowdsourced IoT Services

We propose a novel generic trust management framework for crowdsourced IoT services. The framework exploits a multi-perspective trust model that captures the inherent characteristics of crowdsourced IoT services. Each perspective is defined by a set of attributes that contribute to the perspective's influence on trust. The attributes are fed into a machine-learning-based algorithm to generate a trust model for crowdsourced services in IoT environments. We demonstrate the effectiveness of our approach by conducting experiments on real-world datasets.

cs.CR↗

Crowdsharing Wireless Energy Services

We propose a novel self-sustained ecosystem for energy sharing in the IoT environment. We leverage energy harvesting, wireless power transfer, and crowdsourcing that facilitate the development of an energy crowdsharing framework to charge IoT devices. The ubiquity of IoT devices, coupled with the potential ability for sharing energy, provides new and exciting opportunities to crowdsource wireless energy, thus enabling a green alternative for powering IoT devices anytime and anywhere. We discuss the crowdsharing of energy services, open challenges, and proposed solutions.

cs.DC↗

Elastic Composition of Crowdsourced IoT Energy Services

We propose a novel type of service composition, called elastic composition which provides a reliable framework in a highly fluctuating IoT energy provisioning settings. We rely on crowdsourcing IoT energy (e.g., wearables) to provide wireless energy to nearby devices. We introduce the concepts of soft deadline and hard deadline as key criteria to cater for an elastic composition framework. We conduct a set of experiments on real-world datasets to assess the efficiency of the proposed approach.

cs.DC↗

Formation-based Selection of Drone Swarm Services

Swarm of drones are increasingly being asked to carry out missions that can't be completed by one drone. Particularly, in delivery, issues arise due to the swarm's limited flight endurance. Hence, we propose a novel formation-guided framework for selecting Swarm-based Drone-as-a-Service (SDaaS) for delivery. A detailed study is carried out to highlight the effect of swarm formations on energy consumption. Two SDaaS selection approaches, i.e. Fixed and Adaptive, are designed considering the different formation decisions a swarm can take. The proposed framework considers extrinsic constraints including wind speed and direction. We propose SDaaS selection algorithms for each approach. Experimental results prove the efficiency of the proposed algorithms.

cs.RO↗

Long-term IaaS Selection using Performance Discovery

We propose a novel framework to select IaaS providers according to a consumer's long-term performance requirements. The proposed framework leverages free short-term trials to discover the unknown QoS performance of IaaS providers. We design a temporal skyline-based filtering method to select candidate IaaS providers for the short-term trials. A novel cooperative long-term QoS prediction approach is developed that utilizes past trial experiences of similar consumers using a workload replay technique. We propose a new trial workload generation model that estimates a provider's long-term performance in the absence of past trial experiences. The confidence of the prediction is measured based on the trial experience of the consumer. A set of experiments are conducted based on real-world datasets to evaluate the proposed framework.

cs.DC↗

Heuristics based Mosaic of Social-Sensor Services for Scene Reconstruction

We propose a heuristics-based social-sensor cloud service selection and composition model to reconstruct mosaic scenes. The proposed approach leverages crowdsourced social media images to create an image mosaic to reconstruct a scene at a designated location and an interval of time. The novel approach relies on the set of features defined on the bases of the image metadata to determine the relevance and composability of services. Novel heuristics are developed to filter out non-relevant services. Multiple machine learning strategies are employed to produce smooth service composition resulting in a mosaic of relevant images indexed by geolocation and time. The preliminary analytical results prove the feasibility of the proposed composition model.

cs.CV↗

Resilient Composition of Drone Services for Delivery

We propose a novel resilient drone service composition framework for delivery in dynamic weather conditions. We use a skyline approach to select an optimal set of candidate drone services at the source node in a skyway network. Drone services are initially composed using a novel constraint-aware deterministic lookahead algorithm using the multi-armed bandit tree exploration. We propose a heuristic-based resilient service composition approach that adapts to runtime changes and periodically updates the composition to meet delivery expectations. Experimental results prove the efficiency of the proposed approach.

cs.NI↗

Signature-based Selection of IaaS Cloud Services

We propose a novel approach to select IaaS cloud services for a long-term period where the service providers offer limited QoS information. The proposed approach leverages free short-term trials to obtain the previously undisclosed QoS information. A new significance-based trial scheme is proposed using frequency distribution analysis to test a consumer's long-term workloads in a short trial. We introduce a novel IaaS signature technique to uniquely identify the variability of a provider's QoS performance. A Signature-based QoS Performance Discovery (SPD) algorithm is proposed which leverages the combination of free trials and IaaS signatures. A set of exhaustive experiments with real-world datasets is conducted to evaluate the proposed approach.

cs.DC↗