Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024715
Hussain Albarakati, A. Amamra, Raafat S. Elfouly, R. Ammar
Underwater sensor networks are bounded by data sensing, transmitting, and forwarding limitations. The transmitting of large volumes of data can require a large amount of time and power. This has led researchers to focus on the new technology of underwater computing systems, in which information is extracted under the water using embedded processors via data mining and/or data compression. In this paper, a set of underwater embedded system (UWES) architectures is developed that can handle different network configurations. These developed architectures have a single processing node and are assumed to be homogenous. An architecture is selected to match a given set of requirements including data rate, processing node capabilities, gathering nodes capabilities, and water depth. Analytical models are developed for each type of architecture, which estimate both end to end delay and power consumption. Simulations that verify the results and evaluate the performance of the architectures are also provided.
{"title":"Reconfigurable underwater embedded systems architectures","authors":"Hussain Albarakati, A. Amamra, Raafat S. Elfouly, R. Ammar","doi":"10.1109/ISCC.2017.8024715","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024715","url":null,"abstract":"Underwater sensor networks are bounded by data sensing, transmitting, and forwarding limitations. The transmitting of large volumes of data can require a large amount of time and power. This has led researchers to focus on the new technology of underwater computing systems, in which information is extracted under the water using embedded processors via data mining and/or data compression. In this paper, a set of underwater embedded system (UWES) architectures is developed that can handle different network configurations. These developed architectures have a single processing node and are assumed to be homogenous. An architecture is selected to match a given set of requirements including data rate, processing node capabilities, gathering nodes capabilities, and water depth. Analytical models are developed for each type of architecture, which estimate both end to end delay and power consumption. Simulations that verify the results and evaluate the performance of the architectures are also provided.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123596121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024628
Nils Schmidt, Lars Baumgärtner, Patrick Lampe, K. Geihs, Bernd Freisleben
In this paper, we present MiniWorld, a novel distributed network emulator. It is based on full virtualization using QEMU/KVM, offers three network backends for emulating both wired and wireless communication, and provides several mobility patterns as well as distance-based link quality models. A snapshot boot mode is offered for accelerated booting of identical environments and repeating emulation runs. To decrease runtimes, MiniWorld supports distributed emulation across multiple computers, based on a resource-aware virtual machine (VM) scheduler. Experimental results demonstrate the performance of MiniWorld with respect to VM boot times, network bandwidth, round trip times, and topology switching times.
{"title":"MiniWorld: Resource-aware distributed network emulation via full virtualization","authors":"Nils Schmidt, Lars Baumgärtner, Patrick Lampe, K. Geihs, Bernd Freisleben","doi":"10.1109/ISCC.2017.8024628","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024628","url":null,"abstract":"In this paper, we present MiniWorld, a novel distributed network emulator. It is based on full virtualization using QEMU/KVM, offers three network backends for emulating both wired and wireless communication, and provides several mobility patterns as well as distance-based link quality models. A snapshot boot mode is offered for accelerated booting of identical environments and repeating emulation runs. To decrease runtimes, MiniWorld supports distributed emulation across multiple computers, based on a resource-aware virtual machine (VM) scheduler. Experimental results demonstrate the performance of MiniWorld with respect to VM boot times, network bandwidth, round trip times, and topology switching times.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125014829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024573
Andrea Pinna, Giuseppe Portaluri, S. Giordano
This paper introduces a feasibility study of a low cost and power effective wireless acoustic sensor network for shooter localization. Currently deployed sensors for this application use a time domain gunshot signal analysis and high sampling rates, in the order of MS/s. We investigate an alternative Short Time Fourier Transform with a lower sampling rate (250 kS/s). We focus on a single channel single sensor approach for shooter ranging and we provide new experimental data. We implement a centralized gateway on top of the open and programmable board named ZedBoard. Our approach localizes the shooter with a distance error that ranges between roughly half and three meters, so the results are encouraging for further studies.
{"title":"Shooter localization in wireless acoustic sensor networks","authors":"Andrea Pinna, Giuseppe Portaluri, S. Giordano","doi":"10.1109/ISCC.2017.8024573","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024573","url":null,"abstract":"This paper introduces a feasibility study of a low cost and power effective wireless acoustic sensor network for shooter localization. Currently deployed sensors for this application use a time domain gunshot signal analysis and high sampling rates, in the order of MS/s. We investigate an alternative Short Time Fourier Transform with a lower sampling rate (250 kS/s). We focus on a single channel single sensor approach for shooter ranging and we provide new experimental data. We implement a centralized gateway on top of the open and programmable board named ZedBoard. Our approach localizes the shooter with a distance error that ranges between roughly half and three meters, so the results are encouraging for further studies.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130260408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024690
Z. Mao, Jing Ma, Yuming Jiang, Bin Yao
WiFi Direct is a recent device-to-device communication technology standardized by the WiFi Alliance. Its increasing availability on popular mobile systems (e.g. Android) presents a unique opportunity for developers to implement mobile social networks (MSNs), a new paradigm that facilitates data dissemination without Internet access by leveraging human mobility and short-range communication technologies. Since WiFi Direct is not originally designed for such applications, it is significant to learn its performance in practice. In this paper, we investigate goodput and fairness of WiFi Direct for data dissemination in MSNs. To this end, we develop an MSN application and conduct three sets of experiments on a testbed comprising several Android devices. Experimental results show that the data loads and mobility of nodes greatly impact the goodput and fairness.
{"title":"Performance evaluation of WiFi Direct for data dissemination in mobile social networks","authors":"Z. Mao, Jing Ma, Yuming Jiang, Bin Yao","doi":"10.1109/ISCC.2017.8024690","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024690","url":null,"abstract":"WiFi Direct is a recent device-to-device communication technology standardized by the WiFi Alliance. Its increasing availability on popular mobile systems (e.g. Android) presents a unique opportunity for developers to implement mobile social networks (MSNs), a new paradigm that facilitates data dissemination without Internet access by leveraging human mobility and short-range communication technologies. Since WiFi Direct is not originally designed for such applications, it is significant to learn its performance in practice. In this paper, we investigate goodput and fairness of WiFi Direct for data dissemination in MSNs. To this end, we develop an MSN application and conduct three sets of experiments on a testbed comprising several Android devices. Experimental results show that the data loads and mobility of nodes greatly impact the goodput and fairness.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130751083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024519
P. Vansteenwegen, Corrinne Luteyn
In this research, we look for the possible reduction in vehicle kilometers that can be obtained when a cooperation of delivery companies has the ability to suggest network improvements to the local government. Different network changes are considered in our research: re-opening existing roads for the vehicles of the cooperation, widening roads in the network or converting existing roads into a one-way road with a higher speed. To find the best set of improvements given a fixed budget in a realistic road network, an Adaptive Large Neighborhood Search (ALNS) is proposed. Both the destroy and repair methods in this ALNS are unique for this problem. In order to get an indication of the possible reduction in vehicle kilometers and to test the performance of the heuristic, experiments on a set of 16 benchmark instances are executed. These benchmark instances are generated from a realistic city road network. Based on these experimental results, we can conclude that a set of 1 up to 4 network improvements can lead to a reduction in vehicle kilometers of on average around 2.4% over these 16 benchmark instances, while implementing a set of 2 up to 9 improvements can lead to a reduction of on average around 3.3% over this set of benchmark instances.
{"title":"Reducing logistic vehicle kilometers in a city area based on network changes","authors":"P. Vansteenwegen, Corrinne Luteyn","doi":"10.1109/ISCC.2017.8024519","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024519","url":null,"abstract":"In this research, we look for the possible reduction in vehicle kilometers that can be obtained when a cooperation of delivery companies has the ability to suggest network improvements to the local government. Different network changes are considered in our research: re-opening existing roads for the vehicles of the cooperation, widening roads in the network or converting existing roads into a one-way road with a higher speed. To find the best set of improvements given a fixed budget in a realistic road network, an Adaptive Large Neighborhood Search (ALNS) is proposed. Both the destroy and repair methods in this ALNS are unique for this problem. In order to get an indication of the possible reduction in vehicle kilometers and to test the performance of the heuristic, experiments on a set of 16 benchmark instances are executed. These benchmark instances are generated from a realistic city road network. Based on these experimental results, we can conclude that a set of 1 up to 4 network improvements can lead to a reduction in vehicle kilometers of on average around 2.4% over these 16 benchmark instances, while implementing a set of 2 up to 9 improvements can lead to a reduction of on average around 3.3% over this set of benchmark instances.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129770479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024689
J. M. Silva, K. Bispo, P. Carvalho, S. R. Lima
Adaptability and energy-efficient sensing are essential properties to sustain the easy deployment and lifetime of WSNs. These properties assume a stronger role in autonomous sensing environments where the application objectives or the parameters under measurement vary, and human intervention is not viable. In this context, this paper proposes LiteSense, a self-adaptive sampling scheme for WSNs, which aims at capturing accurately the behavior of the physical parameters of interest in each WSN context yet reducing the overhead in terms of sensing events and, consequently, the energy consumption. For this purpose, a set of low-complexity rules auto-regulates the sensing frequency depending on the observed parameter variation. Resorting to real environmental datasets, we provide statistical results showing the ability of LiteSense in reducing sensing activity and power consumption, while keeping the estimation accuracy of sensing events.
{"title":"LiteSense: An adaptive sensing scheme for WSNs","authors":"J. M. Silva, K. Bispo, P. Carvalho, S. R. Lima","doi":"10.1109/ISCC.2017.8024689","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024689","url":null,"abstract":"Adaptability and energy-efficient sensing are essential properties to sustain the easy deployment and lifetime of WSNs. These properties assume a stronger role in autonomous sensing environments where the application objectives or the parameters under measurement vary, and human intervention is not viable. In this context, this paper proposes LiteSense, a self-adaptive sampling scheme for WSNs, which aims at capturing accurately the behavior of the physical parameters of interest in each WSN context yet reducing the overhead in terms of sensing events and, consequently, the energy consumption. For this purpose, a set of low-complexity rules auto-regulates the sensing frequency depending on the observed parameter variation. Resorting to real environmental datasets, we provide statistical results showing the ability of LiteSense in reducing sensing activity and power consumption, while keeping the estimation accuracy of sensing events.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129682530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024603
Yuhang Ye, Brian A. Lee, R. Flynn, Niall Murray, Yuansong Qiao
Named Data Networking (NDN) is a promising Future Internet architecture to support efficient content distribution. Specifically, P2P may gain benefits from NDN, as NDN inherently provides a flexible forwarding plane for multi-source and multi-path communications. Existing studies in this area have proposed solutions, but these are adversely affected by link latency. This leads to illogical resource allocation and low link utilization for P2P. In this paper, we propose a new Heterogeneous-Latency Adaptive Forwarding (HLAF) strategy for peer-assisted video streaming in NDN. In peer-assisted video streaming, users (peers) proactively share the available content to others. By measuring the performance of forwarding interfaces, using both the level of congestion and the round-trip time, HLAF enables efficient P2P communication, which minimizes the latency and enhances the throughput. The experimental results show that the proposed strategy can enhance the peers' Quality of Experience (QoE).
{"title":"HLAF: Heterogeneous-Latency Adaptive Forwarding strategy for Peer-Assisted Video Streaming in NDN","authors":"Yuhang Ye, Brian A. Lee, R. Flynn, Niall Murray, Yuansong Qiao","doi":"10.1109/ISCC.2017.8024603","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024603","url":null,"abstract":"Named Data Networking (NDN) is a promising Future Internet architecture to support efficient content distribution. Specifically, P2P may gain benefits from NDN, as NDN inherently provides a flexible forwarding plane for multi-source and multi-path communications. Existing studies in this area have proposed solutions, but these are adversely affected by link latency. This leads to illogical resource allocation and low link utilization for P2P. In this paper, we propose a new Heterogeneous-Latency Adaptive Forwarding (HLAF) strategy for peer-assisted video streaming in NDN. In peer-assisted video streaming, users (peers) proactively share the available content to others. By measuring the performance of forwarding interfaces, using both the level of congestion and the round-trip time, HLAF enables efficient P2P communication, which minimizes the latency and enhances the throughput. The experimental results show that the proposed strategy can enhance the peers' Quality of Experience (QoE).","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129822196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024505
Walid Bouksani, B. A. Bensaber
We propose in this paper a security protocol based on a dynamic change of pseudonyms for privacy in Vehicular Ad hoc NETworks (VANET). Our proposal ensures privacy for the driver and his vehicle whether he is transmitter or receiver of the message. By handling all possible cases of changes in vehicle behavior during traffic, we ensure a safe and secure traffic management. We built the architecture of our solution on three essential devices designed for VANET. In three steps, the anonymity is guaranteed by our Real Initial New protocol (RIN). This latest provides a high security to vehicles.
{"title":"An efficient and dynamic pseudonyms change system for privacy in VANET","authors":"Walid Bouksani, B. A. Bensaber","doi":"10.1109/ISCC.2017.8024505","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024505","url":null,"abstract":"We propose in this paper a security protocol based on a dynamic change of pseudonyms for privacy in Vehicular Ad hoc NETworks (VANET). Our proposal ensures privacy for the driver and his vehicle whether he is transmitter or receiver of the message. By handling all possible cases of changes in vehicle behavior during traffic, we ensure a safe and secure traffic management. We built the architecture of our solution on three essential devices designed for VANET. In three steps, the anonymity is guaranteed by our Real Initial New protocol (RIN). This latest provides a high security to vehicles.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128799836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024696
Konrad-Felix Krentz, C. Meinel, Hendrik Graupner
Generating seeds on Internet of things (IoT) devices is challenging because these devices typically lack common entropy sources, such as user interaction or hard disks. A promising replacement is to use power-up static random-access memory (SRAM) states, which are partly random due to manufacturing deviations. Thus far, there, however, seems to be no method for extracting close-to-uniformly distributed seeds from power-up SRAM states in an information-theoretically secure and practical manner. Moreover, the min-entropy of power-up SRAM states reduces with temperature, thereby rendering this entropy source vulnerable to so-called freezing attacks. In this paper, we mainly make three contributions. First, we propose a new method for extracting uniformly distributed seeds from power-up SRAM states. Unlike current methods, ours is information-theoretically secure, practical, and freezing attack-resistant rolled into one. Second, we point out a trick that enables using power-up SRAM states not only for self-seeding at boot time, but also for reseeding at runtime. Third, we compare the energy consumption of seeding an IoT device either with radio noise or power-up SRAM states. While seeding with power-up SRAM states turned out to be more energy efficient, we argue for mixing both these entropy sources.
{"title":"Secure self-seeding with power-up SRAM states","authors":"Konrad-Felix Krentz, C. Meinel, Hendrik Graupner","doi":"10.1109/ISCC.2017.8024696","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024696","url":null,"abstract":"Generating seeds on Internet of things (IoT) devices is challenging because these devices typically lack common entropy sources, such as user interaction or hard disks. A promising replacement is to use power-up static random-access memory (SRAM) states, which are partly random due to manufacturing deviations. Thus far, there, however, seems to be no method for extracting close-to-uniformly distributed seeds from power-up SRAM states in an information-theoretically secure and practical manner. Moreover, the min-entropy of power-up SRAM states reduces with temperature, thereby rendering this entropy source vulnerable to so-called freezing attacks. In this paper, we mainly make three contributions. First, we propose a new method for extracting uniformly distributed seeds from power-up SRAM states. Unlike current methods, ours is information-theoretically secure, practical, and freezing attack-resistant rolled into one. Second, we point out a trick that enables using power-up SRAM states not only for self-seeding at boot time, but also for reseeding at runtime. Third, we compare the energy consumption of seeding an IoT device either with radio noise or power-up SRAM states. While seeding with power-up SRAM states turned out to be more energy efficient, we argue for mixing both these entropy sources.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126113002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024522
Walid Serrai, A. Abdelli, L. Mokdad, Ashref Serrai
Nowadays, web service selection has become a very challenging issue. As the number of web services is increasing drastically, different QoS parameters are added in their description in addition to their functional parameters (Inputs and outputs) to distinguish them and ease their selection. Hence, web service selection consists to find out among services having the same functionalities the optimal elements that satisfy user QoS requirements. When the user request deals with value constrains on the QoS parameters, the mainstream approach operates by removing from the search space web services that do not satisfy the user constraints. However, such an approach is not always appropriate especially when the resulting search space is empty or very small. In this case, the discarded services may be of interest in the selection process. To tackle this issue, we propose to use a combination of two MCDM (Multi Criteria Decision Making) methods, that are AHP (Analytical Hierarchy Process) and RIM (Reference Ideal Method). AHP is used to encode an normalize weights constraints assigned to QoS criteria at the first stage. Then to deal with user value constraints, we consider RIM to rank discarded web services relatively to their proximity to the required value constraints. We compare our method with existing approaches by performing tests on a real dataset.
{"title":"Dealing with user constraints in MCDM based web service selection","authors":"Walid Serrai, A. Abdelli, L. Mokdad, Ashref Serrai","doi":"10.1109/ISCC.2017.8024522","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024522","url":null,"abstract":"Nowadays, web service selection has become a very challenging issue. As the number of web services is increasing drastically, different QoS parameters are added in their description in addition to their functional parameters (Inputs and outputs) to distinguish them and ease their selection. Hence, web service selection consists to find out among services having the same functionalities the optimal elements that satisfy user QoS requirements. When the user request deals with value constrains on the QoS parameters, the mainstream approach operates by removing from the search space web services that do not satisfy the user constraints. However, such an approach is not always appropriate especially when the resulting search space is empty or very small. In this case, the discarded services may be of interest in the selection process. To tackle this issue, we propose to use a combination of two MCDM (Multi Criteria Decision Making) methods, that are AHP (Analytical Hierarchy Process) and RIM (Reference Ideal Method). AHP is used to encode an normalize weights constraints assigned to QoS criteria at the first stage. Then to deal with user value constraints, we consider RIM to rank discarded web services relatively to their proximity to the required value constraints. We compare our method with existing approaches by performing tests on a real dataset.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127112145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：