Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024619
Pablo Graubner, Markus Sommer, M. Hollick, Bernd Freisleben
Software-defined networking paradigms have found their way into wireless edge networks, allowing network slicing, mobility management, and resource allocation. This paper presents dynamic role assignment as a novel approach to software-defined network topology management for wireless edge devices, such as laptops, tablets and smartphones. It combines the centralized control of wireless Network Interface Controller (NIC) modes with Network Function Virtualization (NFV) to integrate network topology transitions as well as network service and application service placement within a single mechanism. Our proposal is evaluated with respect to latency, bandwidth, and power consumption of the edge nodes. The experimental results show significant differences in both bandwidth (up to 18%) and power consumption (up to 15%) for playing different roles, and when using (a) a web proxy and (b) an intrusion prevention system as examples of application services.
{"title":"Dynamic role assignment in Software-Defined Wireless Networks","authors":"Pablo Graubner, Markus Sommer, M. Hollick, Bernd Freisleben","doi":"10.1109/ISCC.2017.8024619","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024619","url":null,"abstract":"Software-defined networking paradigms have found their way into wireless edge networks, allowing network slicing, mobility management, and resource allocation. This paper presents dynamic role assignment as a novel approach to software-defined network topology management for wireless edge devices, such as laptops, tablets and smartphones. It combines the centralized control of wireless Network Interface Controller (NIC) modes with Network Function Virtualization (NFV) to integrate network topology transitions as well as network service and application service placement within a single mechanism. Our proposal is evaluated with respect to latency, bandwidth, and power consumption of the edge nodes. The experimental results show significant differences in both bandwidth (up to 18%) and power consumption (up to 15%) for playing different roles, and when using (a) a web proxy and (b) an intrusion prevention system as examples of application services.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"88 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131830426","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.8024508
Berkin Guler, Öznur Özkasap
The prominent cloud services rely on geographically distributed nodes running replication and other fault-tolerance mechanisms so as to provide flawless availability and dependability. In this paper, we address the communication cost of the well known primary-backup replication protocol, and propose compressed periodic incremental checkpoint algorithms to achieve improved throughput. We set up a replicated key-value store on geographically distributed nodes of the PlanetLab platform, and developed compressed incremental checkpointing algorithms to support primary-backup replication. By considering performance metrics of interest including blocking time, checkpointing time, compression ratio, compression/ decompression times, we conducted a comprehensive analysis. We used the well-known benchmarking tool YCSB and established different sample workloads to test where each workload represents diverse plots. Our findings indicate that Zstd is the most competent compression method under all scenarios and through comparing with an uncompressed approach we point out that compressing the communication data disseminated from the primary replica coupled with the periodic incremental checkpointing algorithm not only decreases the average blocking time up to 5% but it also improves the overall system throughput by 4% compared to the no compression case.
{"title":"Compressed incremental checkpointing for efficient replicated key-value stores","authors":"Berkin Guler, Öznur Özkasap","doi":"10.1109/ISCC.2017.8024508","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024508","url":null,"abstract":"The prominent cloud services rely on geographically distributed nodes running replication and other fault-tolerance mechanisms so as to provide flawless availability and dependability. In this paper, we address the communication cost of the well known primary-backup replication protocol, and propose compressed periodic incremental checkpoint algorithms to achieve improved throughput. We set up a replicated key-value store on geographically distributed nodes of the PlanetLab platform, and developed compressed incremental checkpointing algorithms to support primary-backup replication. By considering performance metrics of interest including blocking time, checkpointing time, compression ratio, compression/ decompression times, we conducted a comprehensive analysis. We used the well-known benchmarking tool YCSB and established different sample workloads to test where each workload represents diverse plots. Our findings indicate that Zstd is the most competent compression method under all scenarios and through comparing with an uncompressed approach we point out that compressing the communication data disseminated from the primary replica coupled with the periodic incremental checkpointing algorithm not only decreases the average blocking time up to 5% but it also improves the overall system throughput by 4% compared to the no compression case.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"118 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":"134483533","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.8024575
J. Cichon, Maciej Gebala, M. Zawada
We consider the problem of reliable and minimal delay transmission in a wireless sensor network that uses time division in order to schedule its node-to-node communication in time-bounded manner. We propose an algorithm that uses the message acknowledgment method and solves this problem. We show bounds for its expected value of message delivery time. Moreover, our algorithm is based on simple state machine that do not require much computational power, thus could be executed on very weak devices.
{"title":"Fault tolerant protocol for data collecting in wireless sensor networks","authors":"J. Cichon, Maciej Gebala, M. Zawada","doi":"10.1109/ISCC.2017.8024575","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024575","url":null,"abstract":"We consider the problem of reliable and minimal delay transmission in a wireless sensor network that uses time division in order to schedule its node-to-node communication in time-bounded manner. We propose an algorithm that uses the message acknowledgment method and solves this problem. We show bounds for its expected value of message delivery time. Moreover, our algorithm is based on simple state machine that do not require much computational power, thus could be executed on very weak devices.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"25 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":"114502946","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.8024583
Yue Li, P. A. Frangoudis, Y. H. Aoul, P. Bertin
We focus on QoE-optimized video delivery in a wireless heterogeneous network setting, where users equipped with multi-interface devices access a Dynamic Adaptive Streaming over HTTP (DASH) video service. We provide an Integer Linear Programming (ILP) formulation for the problem of optimal joint video quality and network interface selection and a heuristic algorithm to solve it, shown via simulation and testbed experiments to achieve near-optimal performance in terms of Quality of Experience (QoE), with reduced execution time. We further design a video delivery architecture based on the emerging Mobile Edge Computing (MEC) standard, where our video quality and network selection functionality is executed as a MEC application. Notably, our architecture transparently operates with standard DASH clients.
{"title":"A Mobile Edge Computing-assisted video delivery architecture for wireless heterogeneous networks","authors":"Yue Li, P. A. Frangoudis, Y. H. Aoul, P. Bertin","doi":"10.1109/ISCC.2017.8024583","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024583","url":null,"abstract":"We focus on QoE-optimized video delivery in a wireless heterogeneous network setting, where users equipped with multi-interface devices access a Dynamic Adaptive Streaming over HTTP (DASH) video service. We provide an Integer Linear Programming (ILP) formulation for the problem of optimal joint video quality and network interface selection and a heuristic algorithm to solve it, shown via simulation and testbed experiments to achieve near-optimal performance in terms of Quality of Experience (QoE), with reduced execution time. We further design a video delivery architecture based on the emerging Mobile Edge Computing (MEC) standard, where our video quality and network selection functionality is executed as a MEC application. Notably, our architecture transparently operates with standard DASH clients.","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":"125617784","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.8024667
Ahmed Soua, R. Soua
In wireless hostile environments such as tunnels, tall buildings, undergrounds and dense vegetation where Global Positioning System (GPS) signals can be unavailable, vehicles are prevented from exchanging accurate positions. Hence critical information may be lost or misled. To overcome these limitations, this paper proposes an innovative technique for localization estimation called SuPRANO, a Semi-suPervised manifold leaRning based locAlization algorithm for vehicular NetwOrks. The key innovation in our technique is leverage the theory of semi-supervised learning. Specifically, SuPRANO employs a certain number of well localized vehicles, called leading vehicles, that collect signal measurements from non-localized vehicles (non leading vehicles) to estimate the position of these latter. The resulting technique is naturally realistic and performs very well.
{"title":"SuPRANO: On the localization of connected vehicles in hostile environments: A Semi-suPervised manifold leaRning technique","authors":"Ahmed Soua, R. Soua","doi":"10.1109/ISCC.2017.8024667","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024667","url":null,"abstract":"In wireless hostile environments such as tunnels, tall buildings, undergrounds and dense vegetation where Global Positioning System (GPS) signals can be unavailable, vehicles are prevented from exchanging accurate positions. Hence critical information may be lost or misled. To overcome these limitations, this paper proposes an innovative technique for localization estimation called SuPRANO, a Semi-suPervised manifold leaRning based locAlization algorithm for vehicular NetwOrks. The key innovation in our technique is leverage the theory of semi-supervised learning. Specifically, SuPRANO employs a certain number of well localized vehicles, called leading vehicles, that collect signal measurements from non-localized vehicles (non leading vehicles) to estimate the position of these latter. The resulting technique is naturally realistic and performs very well.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"40 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":"124679095","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.8024504
Tawfiq Nebbou, H. Fouchal, M. Lehsaini, Marwane Ayaida
Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic routing protocols. In such networks, the vehicle dynamics causes rapid changes on the vehicle density and the communication links. In order to be efficient to route messages from a vehicle to another, we need to locate each node (its position), this is achieved by a location service. This study works on simple location service adapted for unicast routing over VANETs in city environment. This service is able to find a route from a route from a source to the destination and this route is the one passing through the most dense path‥ We have implemented our proposal on the OMNET++ simulator and we have conducted extensive simulations in different scenarios to evaluate its scalability and robustness against frequent topology changes. The results obtained have shown that our proposed protocol provides significant improvements in terms of packet delivery ratio, end-to-end delay and overhead compared to EGyTAR protocol.
{"title":"A cooperative location service for VANETs","authors":"Tawfiq Nebbou, H. Fouchal, M. Lehsaini, Marwane Ayaida","doi":"10.1109/ISCC.2017.8024504","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024504","url":null,"abstract":"Routing messages over vehicular ad hoc networks (VANETs) is usually achieved through geographic routing protocols. In such networks, the vehicle dynamics causes rapid changes on the vehicle density and the communication links. In order to be efficient to route messages from a vehicle to another, we need to locate each node (its position), this is achieved by a location service. This study works on simple location service adapted for unicast routing over VANETs in city environment. This service is able to find a route from a route from a source to the destination and this route is the one passing through the most dense path‥ We have implemented our proposal on the OMNET++ simulator and we have conducted extensive simulations in different scenarios to evaluate its scalability and robustness against frequent topology changes. The results obtained have shown that our proposed protocol provides significant improvements in terms of packet delivery ratio, end-to-end delay and overhead compared to EGyTAR protocol.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"5 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":"134120688","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.8024559
Celso A. R. L. Brennand, A. Boukerche, R. Meneguette, L. Villas
An increase of vehicles in a city without an efficient infrastructure of traffic management can cause damages not only financial but also environmental and social. In order to support urban traffic system to relieve the traffic congestion and the damage caused by congestion of vehicles, in this paper, we propose a mechanism for Intelligent Transport Systems named FOg RoutE VEhiculaR (FOREVER), in order to assist the traffic management in Vehicular Networks (VANET). For achieving this, FOREVER will detect and recommend an alternative route for the vehicles to avoid previous congestion. FOREVER is based on FOG computing paradigm that aims of to compute and modify the route of the vehicle to avoid the formation of congestion. Thus, the results show that FOREVER had a reduction about 7.9% of the CO2 emissions, 8.3% the stop time and 7.6% of the trip time.
{"title":"A novel urban traffic management mechanism based on FOG","authors":"Celso A. R. L. Brennand, A. Boukerche, R. Meneguette, L. Villas","doi":"10.1109/ISCC.2017.8024559","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024559","url":null,"abstract":"An increase of vehicles in a city without an efficient infrastructure of traffic management can cause damages not only financial but also environmental and social. In order to support urban traffic system to relieve the traffic congestion and the damage caused by congestion of vehicles, in this paper, we propose a mechanism for Intelligent Transport Systems named FOg RoutE VEhiculaR (FOREVER), in order to assist the traffic management in Vehicular Networks (VANET). For achieving this, FOREVER will detect and recommend an alternative route for the vehicles to avoid previous congestion. FOREVER is based on FOG computing paradigm that aims of to compute and modify the route of the vehicle to avoid the formation of congestion. Thus, the results show that FOREVER had a reduction about 7.9% of the CO2 emissions, 8.3% the stop time and 7.6% of the trip time.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"55 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":"132033616","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.8024675
Limin Li, Yahui Yang, Zhonghai Wu
Cloud storage is a service provided by cloud service provider (CSP). More and more individuals and organizations accept the scheme and outsource their data to CSP seeking to reduce local storage burden. Since the outsourced files are no longer under the data owners' direct control and CSP is not trustworthy, it is necessary for data owners to check the integrity of their files outsourced to CSP. To address this crucial problem, some provable data possession (PDP) protocols have been presented. In order to obtain higher availability, storing multiple replicas is a common strategy in cloud storage. Most recent researches on multiple-replica provable data possession (MR-PDP) use homomorphic linear authenticators (HLAs) to generate aggregated tags for the blocks at the same indices in each replica, but it cannot verify single replica to identify the corrupted replicas. In this paper, we proposed a novel multiple replica provable data possession scheme, named FMR-PDP. In FMR-PDP, we compute tags based on vector dot product instead of expensive group exponentiation operations, and only generate one tag for all blocks at the same indices in each replica. Our FMR-PDP scheme supports a flexible data possession verification, which means the data owner can check any number of replicas in a verification. In addition, we make a comprehensive performance analysis, which shows that our proposed scheme is flexible and efficient.
{"title":"FMR-PDP: Flexible multiple-replica provable data possession in cloud storage","authors":"Limin Li, Yahui Yang, Zhonghai Wu","doi":"10.1109/ISCC.2017.8024675","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024675","url":null,"abstract":"Cloud storage is a service provided by cloud service provider (CSP). More and more individuals and organizations accept the scheme and outsource their data to CSP seeking to reduce local storage burden. Since the outsourced files are no longer under the data owners' direct control and CSP is not trustworthy, it is necessary for data owners to check the integrity of their files outsourced to CSP. To address this crucial problem, some provable data possession (PDP) protocols have been presented. In order to obtain higher availability, storing multiple replicas is a common strategy in cloud storage. Most recent researches on multiple-replica provable data possession (MR-PDP) use homomorphic linear authenticators (HLAs) to generate aggregated tags for the blocks at the same indices in each replica, but it cannot verify single replica to identify the corrupted replicas. In this paper, we proposed a novel multiple replica provable data possession scheme, named FMR-PDP. In FMR-PDP, we compute tags based on vector dot product instead of expensive group exponentiation operations, and only generate one tag for all blocks at the same indices in each replica. Our FMR-PDP scheme supports a flexible data possession verification, which means the data owner can check any number of replicas in a verification. In addition, we make a comprehensive performance analysis, which shows that our proposed scheme is flexible and efficient.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"68 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":"132954915","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.8024571
Antonia Nisioti, Alexios Mylonas, Vasilios Katos, Paul Yoo, A. Chryssanthou
Smartphones have become a vital part of our business and everyday life, as they constitute the primary communication vector. Android dominates the smartphone market (86.2%) and has become pervasive, running in ‘smart’ devices such as tablets, TV, watches, etc. Nowadays, instant messaging applications have become popular amongst smartphone users and since 2016 are the main way of messaging communication. Consequently, their inclusion in any forensics analysis is necessary as they constitute a source of valuable data, which might be used as (admissible) evidence. Often, their examination involves the extraction and analysis of the applications' databases that reside in the device's internal or external memory. The downfall of this method is the fact that databases can be tampered or erased, therefore the evidence might be accidentally or maliciously modified. In this paper, a methodology for retrieving instant messaging data from the volatile memory of Android smartphones is proposed, instead of the traditional database retrieval. The methodology is demonstrated with the use of a case study of four experiments, which provide insights regarding the behavior of such data in memory. Our experimental results show that a large amount of data can be retrieved from the memory, even if the device's battery is removed for a short time. In addition, the retrieved data are not only recent messages, but also messages sent a few months before data acquisition.
{"title":"You can run but you cannot hide from memory: Extracting IM evidence of Android apps","authors":"Antonia Nisioti, Alexios Mylonas, Vasilios Katos, Paul Yoo, A. Chryssanthou","doi":"10.1109/ISCC.2017.8024571","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024571","url":null,"abstract":"Smartphones have become a vital part of our business and everyday life, as they constitute the primary communication vector. Android dominates the smartphone market (86.2%) and has become pervasive, running in ‘smart’ devices such as tablets, TV, watches, etc. Nowadays, instant messaging applications have become popular amongst smartphone users and since 2016 are the main way of messaging communication. Consequently, their inclusion in any forensics analysis is necessary as they constitute a source of valuable data, which might be used as (admissible) evidence. Often, their examination involves the extraction and analysis of the applications' databases that reside in the device's internal or external memory. The downfall of this method is the fact that databases can be tampered or erased, therefore the evidence might be accidentally or maliciously modified. In this paper, a methodology for retrieving instant messaging data from the volatile memory of Android smartphones is proposed, instead of the traditional database retrieval. The methodology is demonstrated with the use of a case study of four experiments, which provide insights regarding the behavior of such data in memory. Our experimental results show that a large amount of data can be retrieved from the memory, even if the device's battery is removed for a short time. In addition, the retrieved data are not only recent messages, but also messages sent a few months before data acquisition.","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":"121151740","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.8024677
S. Tolba, R. Ammar
Underwater robotic swarms have more challenging operating conditions when compared to their ground counterparts. One such major limitation is vastness of the oceanic environment, which significantly increases the possibility of losing swarm members. Although swarms can tolerate losses, if care is not taken in the design of swarm-level behaviors, they can cause a complete failure of the mission. An additional design factor for such systems is, therefore, the spatial constrained-ness of the swarm. Virtual Tether Search (VTS) has been developed to address this concern. Robots use a virtual tether attached to the drop-off location along with dead-reckoning to stay within a maximum-radius distance from that location. Constrained Spiral Flocking (CSF), a previously developed algorithm, Robotic Particle Swarm Optimization (R-PSO), and Simple Sweeping (SSW) are compared to VTS and pros and cons of each algorithm are highlighted. VTS is shown to have a superior behavior in terms of omni-directionality and loss-prevention at the expense of relatively slow, but guaranteed convergence.
{"title":"Virtual Tether Search: A self-constraining search algorithm for swarms in an open ocean","authors":"S. Tolba, R. Ammar","doi":"10.1109/ISCC.2017.8024677","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024677","url":null,"abstract":"Underwater robotic swarms have more challenging operating conditions when compared to their ground counterparts. One such major limitation is vastness of the oceanic environment, which significantly increases the possibility of losing swarm members. Although swarms can tolerate losses, if care is not taken in the design of swarm-level behaviors, they can cause a complete failure of the mission. An additional design factor for such systems is, therefore, the spatial constrained-ness of the swarm. Virtual Tether Search (VTS) has been developed to address this concern. Robots use a virtual tether attached to the drop-off location along with dead-reckoning to stay within a maximum-radius distance from that location. Constrained Spiral Flocking (CSF), a previously developed algorithm, Robotic Particle Swarm Optimization (R-PSO), and Simple Sweeping (SSW) are compared to VTS and pros and cons of each algorithm are highlighted. VTS is shown to have a superior behavior in terms of omni-directionality and loss-prevention at the expense of relatively slow, but guaranteed convergence.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"9 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":"121607346","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
扫码关注我们
求助内容：
应助结果提醒方式：