2018 IEEE Symposium on Computers and Communications (ISCC)最新文献_第9页

Multi-agent Communication with Attentional and Recurrent Message Integration 多智能体通信的注意和重复信息集成

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538766

Zhaoqing Peng, Libo Zhang, Tiejian Luo

引用次数: 1

Increasing LoRaWAN Application-Layer Message Delivery Success Rates 提高LoRaWAN应用层消息传递的成功率

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538457

S. Wang, Tzu-Yang Chen

引用次数: 6

Reducing the Variability in Routing Decisions in Wireless Mesh Networks 减少无线网状网络中路由决策的可变性

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538715

B. Silva, D. Passos, C. Albuquerque

引用次数: 2

Using Probabilistic Data Structures for Monitoring of Multi-tenant P4-based Networks 使用概率数据结构监控基于p4的多租户网络

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538352

Regis F. T. Martins, F. Verdi, R. Villaça, L. U. Garcia

引用次数: 5

Algorithms for BPRN Coloring of a Digraph 有向图的BPRN着色算法

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538690

F. G. Gomes, Leonardo da Silva Costa, L. Rocha, G. V. R. Viana, F. C. S. Dias

{"title":"Algorithms for BPRN Coloring of a Digraph","authors":"F. G. Gomes, Leonardo da Silva Costa, L. Rocha, G. V. R. Viana, F. C. S. Dias","doi":"10.1109/ISCC.2018.8538690","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538690","url":null,"abstract":"A radio network consists of a set of transceiver nodes that make use of radio transmissions to communicate with each other. Because these wireless networks share the communication channel, collisions may occur in transmissions, whether through primary or secondary interference. Considering that to a large extent these networks have multi-hops in their composition, thus it is possible the spatial reuse in the channel sharing, with the prevention of collisions and with this reducing the loss of data transmitted. In the context of these networks, several approaches are used to medium control access, in order to coordinate access to the wireless channel to avoid overlapping of transmissions in the use of the channel. A wireless network can be represented as a digraph, and the PRN (Packet Radio Network) coloring model is applied as a scheduling criterion for MAC protocols. The BPRN (Backbone PRN) model represents a generalization of the PRN coloring, applying a more realistic approach where it is considered only a subset of links that will be colored, which we call the backbone network. The backbone network considers the fact that in a multi-hop wireless network, a transceiver node communicates only with some of its neighbors. In this work, the backbone network is represented by a tree oriented towards a root node, due to its relationship to the domain of the wireless sensor networks. Thus, this work proposes the development of algorithms for coloring graphs based on the BPRN coloring model, with emphasis on the TDMA channel allocation technique, since it will be used for the scheduling of links in the context of multi-hop wireless networks.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130117002","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}

引用次数: 0

Parallel Polar Encoding in 5G Communication 5G通信中的并行极化编码

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538743

Yang Guo, Shaolin Xie, Zijun Liu, Lei Yang, Donglin Wang

引用次数: 5

Performance Issues in a Low Cost Multi-Channel Multi-Interface Wireless Mesh Network 低成本多通道多接口无线网状网络的性能问题

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538458

Marcos Antônio Filho, Matheus Ribeiro, Ivyson Silva, A. Santos, C. Oliveira, R. Braga

引用次数: 1

IoT Device Programmable Language Customization for Home Automation 用于家庭自动化的物联网设备可编程语言定制

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538503

Francisco R. P. da Ponte, R. Gomes, J. Celestino, E. Madeira, Ahmed Patel

引用次数: 2

Osmotic Computing: Software Defined Membranes meet Private/Federated Blockchains 渗透计算:软件定义膜满足私有/联邦区块链

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538546

M. Villari, A. Galletta, A. Celesti, Lorenzo Carnevale, M. Fazio

引用次数: 8

QoS Guaranteed Batch Scheduling for Optical Switches Based on Unequal Weight Sequence 基于不等权序列的光交换机QoS保证批调度

2018 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2018-06-01 DOI: 10.1109/ISCC.2018.8538553

Yan Guan, Bin Wu, Zhipeng Zhao, Boyu Li, Shu Fu

{"title":"QoS Guaranteed Batch Scheduling for Optical Switches Based on Unequal Weight Sequence","authors":"Yan Guan, Bin Wu, Zhipeng Zhao, Boyu Li, Shu Fu","doi":"10.1109/ISCC.2018.8538553","DOIUrl":"https://doi.org/10.1109/ISCC.2018.8538553","url":null,"abstract":"Due to the reconfiguration overhead of optical fabrics, batch scheduling method is generally used to schedule an optical packet switch, with a necessary speedup inside the switch to ensure 100% throughput with a bounded packet delay. Existing algorithms take each traffic matrix as a batch, and adopt traffic matrix decomposition techniques to decompose it into the sum of a set of weighted permutation matrices (which are then used as switch configurations). Nevertheless, existing algorithms adopt an equal weight for all switch configurations, meaning that each configuration should be held for the same time duration to transmit packets. We observe that this rigid strategy may limit the flexibility of the scheduling and result in a large speedup requirement due to inefficient time slot utilization. Motivated by this observation, we propose a UWS (Unequal Weight Sequence) algorithm to decompose the traffic matrix. UWS uses a different weight for each switch configuration. It first takes an arithmetic progression as the starting weight sequence, and then adjusts the weights for configurations to ensure 100% throughput with a bounded packet delay (such that QoS can be guaranteed). We theoretically prove that the worst case speedup of UWS will never be larger than that of the best existing ADAPT algorithm. Simulation results indeed demonstrate a speedup improvement of around 15%.","PeriodicalId":233592,"journal":{"name":"2018 IEEE Symposium on Computers and Communications (ISCC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134621705","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}

引用次数: 0