2016 IEEE Symposium on Computers and Communication (ISCC)最新文献_第5页

Primary user activity classification aided channel assignment in cognitive radio networks 认知无线网络中主用户活动分类辅助信道分配

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543840

Gulnur Selda Uyanik, S. Oktug

{"title":"Primary user activity classification aided channel assignment in cognitive radio networks","authors":"Gulnur Selda Uyanik, S. Oktug","doi":"10.1109/ISCC.2016.7543840","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543840","url":null,"abstract":"Cognitive radio networks (CRNs) are composed of unprivileged users as called secondary users (SUs) that utilize the spectrum opportunities produced by the absence of co-located privileged primary users (PUs). Providing a certain level of quality of service (QoS) to these SUs is a very challenging problem as these users are constrained strictly by PU arrivals. Many existing works tackled this problem by centralized and complex optimization techniques and complex mac layer protocols. As opposed to the existing QoS management schemes, in this paper, we propose a fast, distributed, PU temporal activity estimation aided spectrum assignment scheme for the SUs with traffic demands at different QoS levels. We designed our heuristic method by leveraging low prioritized (LP) packets over high prioritized (HP) packets on channels in heavy use in terms of temporal PU activity and used the opposite manner for the channels being in sparse use. We modeled our proposed scheme along with the network model we employed in MATLAB® and evaluated its performance with respect to a native scheme that utilities every spectrum opportunity for the HP traffic. Our simulations validated the effectiveness of the proposed channel assignment scheme in terms of Figure of Merit metric we defined reflecting the weighted sum of the throughput ratio values for packets of different QoS levels that successfully reached at the destination SU.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132281393","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}

引用次数: 1

Multi-locality correlation feature learning for image recognition 图像识别中的多局部相关特征学习

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543846

Shuzhi Su, H. Ge, Yunhao Yuan

引用次数: 2

A storage approach for OpenFlow switch based on Protocol Oblivious Forwarding 一种基于协议无关转发的OpenFlow交换机存储方法

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543891

Jinghong Wu, Hong Ni, Xuewen Zeng, Liping Ding, Xiaozhou Ye

{"title":"A storage approach for OpenFlow switch based on Protocol Oblivious Forwarding","authors":"Jinghong Wu, Hong Ni, Xuewen Zeng, Liping Ding, Xiaozhou Ye","doi":"10.1109/ISCC.2016.7543891","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543891","url":null,"abstract":"OpenFlow, which facilitates decoupling between the forwarding and control plane, is developing rapidly and has already been widely studied in various fields. OpenFlow switches perform certain actions under the guidance of flow tables, which are configured by the controller. Currently, most of the work based on OpenFlow switch is concerned with switching performance such as forwarding rate, forwarding latency and flow table efficiency. In contrast, little work has been done on storage for OpenFlow switches. However, directly imposing storage functionality on OpenFlow switches with large capacity storage devices will lead to a series of problems. The most protruding and apparent one is the degradation of forwarding rate, which is one of the most important figure of merits for OpenFlow switch. This paper analyses the typical problems in this context and proposes a novel storage approach based on Protocol Oblivious Forwarding (POF), which is an enhancement to OpenFlow-based SDN forwarding architecture. The preliminary experimental results on Linux-based POF soft switch validate the effectiveness and efficiency of our approach.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114364267","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}

引用次数: 3

MARS: An SDN-based malware analysis solution MARS:基于sdn的恶意软件分析解决方案

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543792

J. Ceron, C. Margi, L. Granville

引用次数: 33

COLLEGA middleware for the management of participatory Mobile Health Communities 用于管理参与式移动卫生社区的中间件

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543867

Carlos Roberto de Rolt, R. Montanari, Marcelo Luiz Brocardo, L. Foschini, J. S. Dias

{"title":"COLLEGA middleware for the management of participatory Mobile Health Communities","authors":"Carlos Roberto de Rolt, R. Montanari, Marcelo Luiz Brocardo, L. Foschini, J. S. Dias","doi":"10.1109/ISCC.2016.7543867","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543867","url":null,"abstract":"Recent advancements in wireless technologies and the widespread availability of smartphones equipped with several physical and virtual sensors are leading to the emergence of novel mobile healthcare scenarios where patients with critical physical/behavioral conditions can be provided with anywhere and anytime care assistance even while on the move. Crowdsensing, through the massive use of smartphone sensors further enhances the potential of supporting participatory management of emergency scenarios. This paper presents a macro process modelling of crowdsourced-based participatory emergency scenarios and, accordingly, proposes a crowdsensing-based middleware called COLLEGA that provides comprehensive management functionalities for supporting prompt assistance in case of a medical emergency. In particular, through participatory and opportunistic sensing, the COLLEGA framework allows dynamic formation of ad-hoc assistance groups formed by passing-by users capable of assisting mobile patients in need of help while waiting for professional caregivers and provides support for understanding the emergency situation and effectively planning and executing assistance actions.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115905897","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}

引用次数: 9

DPListCF: A differentially private approach for listwise collaborative filtering DPListCF:用于列表协同过滤的一种不同的私有方法

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543856

Yuncheng Wu, Juru Zeng, Hong Chen, Yao Wu, Wenjuan Liang, Hui Peng, Cuiping Li

引用次数: 0

A GPU parallel implementation of the Local Principal Component Analysis overcomplete method for DW image denoising 局部主成分分析过完备方法在DW图像去噪中的GPU并行实现

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543709

S. Cuomo, P. D. Michele, A. Galletti, L. Marcellino

引用次数: 19

Signals from the depths: Properties of percolation strategies with the Argo dataset 来自深度的信号:Argo数据集的渗透策略属性

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543768

Flaviano Di Rienzo, M. Girolami, S. Chessa, F. Paparella, A. Caruso

{"title":"Signals from the depths: Properties of percolation strategies with the Argo dataset","authors":"Flaviano Di Rienzo, M. Girolami, S. Chessa, F. Paparella, A. Caruso","doi":"10.1109/ISCC.2016.7543768","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543768","url":null,"abstract":"Underwater communications through acoustic modems rise several networking challenges for the Underwater Acoustic Sensor Networks (UASN). In particular, opportunistic routing is a novel but promising technique that can remarkably increase the reliability of the UASN, but its use in this context requires studies on the nature of mobility in UASN. Our goal is to study a real-world mobility dataset obtained from the Argo project. In particular, we observe the mobility of 51 free-drifting floats deployed on the Mediterranean Sea for approximately one year and we analyze some important properties of the underwater network we built. Specifically, we analyze the contact-time, inter-contact time as well density and network degree while varying the connectivity degree of the whole dataset. We then consider three known routing algorithms, namely Epidemic, PROPHET and Direct Delivery, with the goal of measuring their performance in real conditions for USAN. We finally discuss the opportunities arising from the adoption of opportunistic routing in UASN showing that, even in a very sparse and strongly disconnected network, it is still possible to build a limited but working networking framework.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128570841","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}

引用次数: 3

Trend of FEV1 in Cystic Fibrosis patients: A telehomecare experience 囊性纤维化患者FEV1趋势:远程家庭护理经验

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543752

F. Murgia, I. Tagliente, I. Zoppis, G. Mauri, F. Sicurello, F. Bella, Vanessa Mercuri, E. Santoro, G. Castelnuovo, S. Bella

引用次数: 0

A multi-population based parallel genetic algorithm for multiprocessor task scheduling with Communication Costs 考虑通信代价的多处理机任务调度的多种群并行遗传算法

2016 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2016-06-27 DOI: 10.1109/ISCC.2016.7543829

Rashid Morady, D. Dal

{"title":"A multi-population based parallel genetic algorithm for multiprocessor task scheduling with Communication Costs","authors":"Rashid Morady, D. Dal","doi":"10.1109/ISCC.2016.7543829","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543829","url":null,"abstract":"Multiprocessor task scheduling is one of the hardest combinatorial optimization problems in parallel and distributed systems. It is known as NP-hard and therefore, scanning the whole search space using an exact algorithm to find the optimal solution is not practical. Instead, metaheuristics are mostly employed to find a near-optimal solution in a reasonable amount of time. In this paper, a multi-population based parallel genetic algorithm is presented for the optimization of multiprocessor task scheduling in the presence of communication costs. To the best of our knowledge, this parallel genetic algorithm approach is applied to the problem at hand for the first time using a benchmark set that includes well-known task graphs from different sources. Our experiments conducted on several task graphs with different sizes from the benchmark set showed the superiority of the approach over a conventional genetic algorithm and the related works in the literature in terms of two different performance metrics. Our parallel implementation not only decreased the execution time but also increased the quality of the scheduling solutions considerably.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128675581","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}

引用次数: 12