发布求助
文献互助 智能选刊 最新文献

2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)最新文献

筛选
英文 中文
Multi Topology Routing Based Failure Protection for Software Defined Networks 基于多拓扑路由的软件定义网络故障保护
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433706
S. Cevher
{"title":"Multi Topology Routing Based Failure Protection for Software Defined Networks","authors":"S. Cevher","doi":"10.1109/BlackSeaCom.2018.8433706","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433706","url":null,"abstract":"The fast recovery from network failures in the data plane of Software Defined Networks (SDN) is a stringent requirement to seamlessly support the real-time communications. IETF standardized Multi Topology Routing (MTR) which provides a redundancy in routing tables by computing virtual topologies (VTs) which differ in their link weights. MTR based failure recovery techniques use VTs each of which assigns a very high weight to certain links in the physical topology so that these links are not traversed by the shortest paths. When a network component actually fails, the routing tables corresponding to the VT isolating the component are activated for traffic forwarding. In this paper, the architecture for MTR based failure protection (MTR-P) in SDN is defined and implemented, and its performance is analyzed using different network topologies. The experimental results expose important properties of MTR-P for fast failure recovery in SDN.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"44 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":"115532200","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
Ontology Model of Telecom Operator Big Data 电信运营商大数据本体模型
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433710
L. Globa, R. Novogrudska, A. Koval
{"title":"Ontology Model of Telecom Operator Big Data","authors":"L. Globa, R. Novogrudska, A. Koval","doi":"10.1109/BlackSeaCom.2018.8433710","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433710","url":null,"abstract":"The paper describes the approach to the representation of telecom operator Big Data by means of ontology model. Big Data characteristics are described as ontology classes, attributes and exemplars that are linked by relations. It was proposed to divide general ontology of telecom operator Big Data into three components: ontology of billing system, ontology of services quality and ontology of monitoring system. In the research all elements of each component are described. Based on ontology searching engine and logical inference is performed.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"151 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":"123146390","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
Prognostic-Reactive NFV Resource Allocation Method for Implementation in Virtualized Mobile Network EPC of Ukraine 乌克兰虚拟化移动网络EPC实现的预测反应型NFV资源分配方法
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433602
L. Globa, V. Prokopets, Nataliia Gvozdetska
{"title":"Prognostic-Reactive NFV Resource Allocation Method for Implementation in Virtualized Mobile Network EPC of Ukraine","authors":"L. Globa, V. Prokopets, Nataliia Gvozdetska","doi":"10.1109/BlackSeaCom.2018.8433602","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433602","url":null,"abstract":"The rapid growth of mobile data traffic and simultaneous increase in the diversity and complexity of services is a modern trend in the field of ICT. To deal with new challenges appearing, NFV (Network Function Virtualization) and Cloud Technologies are used. In this paper the possibility of prognostic-reactive method of dynamic NFV resource allocation implementation in virtualized mobile network EPC (Evolved Packet Core) of Ukraine is analyzed. The main goal of the method is to maintain the resource amount sufficient to meet SLA (Service Level Agreement) requirements, avoiding redundancy. It allows to use hardware resources more efficiently saving electricity and reducing emissions. An approach is evaluated on example of virtualized mobile network EPC of Ukraine using Matlab modeling. The results of proposed approach case study showed a gain of 41,78% resource savings while meeting the SLA requirements.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"26 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113974563","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
Density-Aware Probabilistic Clustering in Ad Hoc Networks Ad Hoc网络中的密度感知概率聚类
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433605
Doğanalp Ergenç, M. L. Eksert, E. Onur
{"title":"Density-Aware Probabilistic Clustering in Ad Hoc Networks","authors":"Doğanalp Ergenç, M. L. Eksert, E. Onur","doi":"10.1109/BlackSeaCom.2018.8433605","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433605","url":null,"abstract":"Clustering makes an ad hoc network scalable forming easy-to-manage local groups. However, it brings an extra control overhead to create and maintain clustered network topology. In this paper, we propose Probabilistic Clustering Algorithm that is a simple and efficient clustering algorithm with minimal overhead. In this algorithm, cluster heads are determined probabilistically in a distributed fashion. An analytic model is introduced for nodes to compute the probability of declaring themselves as cluster heads. We validate the analytic model by Monte-Carlo simulations. Furthermore, we propose a cross-layer clustered stack and simulate simple applications in stationary and dynamic topologies using OMNeT++. Discrete event simulation results show that Probabilistic Clustering Algorithm eliminates a significant amount of control overhead and the performance of the algorithm is considerably better compared to its opponent, Identity-based Clustering Algorithm.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"16 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":"116778987","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
WirelessEnergySim: A Discrete Event Simulator for an Energy-Neutral Operation of IoT Nodes WirelessEnergySim:用于物联网节点能量中立操作的离散事件模拟器
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433689
S. Baghaee, S. Chamanian, H. Uluşan, Ö. Zorlu
{"title":"WirelessEnergySim: A Discrete Event Simulator for an Energy-Neutral Operation of IoT Nodes","authors":"S. Baghaee, S. Chamanian, H. Uluşan, Ö. Zorlu","doi":"10.1109/BlackSeaCom.2018.8433689","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433689","url":null,"abstract":"The objective of this study is to design a comprehensive energy simulator to estimate the lifetime and energy consumption of IoT nodes. The design of WirelessEnergySim relies on the empirical data obtained from wireless sensor nodes with energy harvesters. The inputs of the simulator are: the measurements of the power for MCU operation, data transmission, listening/reception, LED activation and characteristics of the in-house electromagnetic energy harvester recorded under different node duty cycles. The outputs are the power consumption of each component of the node, current flow variations, the operation lifetime and the amount of harvested energy. WirelessEnergySim predictions agree with experimental observations of the power level and the lifetime of the IoT node.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"99 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":"116803171","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
On Hardness of Connectivity Maintenance Problem in Drone Networks 无人机网络连通性维护问题的硬度研究
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433713
V. Akram, O. Dagdeviren
{"title":"On Hardness of Connectivity Maintenance Problem in Drone Networks","authors":"V. Akram, O. Dagdeviren","doi":"10.1109/BlackSeaCom.2018.8433713","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433713","url":null,"abstract":"Drone networks have attracted great interest from researchers very recently. One of the vital requirements of drone networks is to preserve the connectivity between nodes in the network for providing reliable data communication. Connectivity maintenance in a drone network can be a complicated task because moving any node can affect the existing links between other nodes. In this paper, we study on the movement assisted connectivity restoration problem (MACR) in drone networks. We investigate the Steiner tree problem with minimum number of Steiner points and bounded edge length (STP-MSPBEL) which is one of the known NP-Hard problems. We prove that MACR problem is also an NP-Hard problem by reducing STP-MSPBEL to MACR. This theoretical finding is important to show the hardness of the emerging problem.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"59 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":"127969334","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
Role-Based Access Control for Vehicular Adhoc Networks 基于角色的车载自组织网络访问控制
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433628
M. Kalinin, V. Krundyshev, E. Rezedinova, P. D. Zegzhda
{"title":"Role-Based Access Control for Vehicular Adhoc Networks","authors":"M. Kalinin, V. Krundyshev, E. Rezedinova, P. D. Zegzhda","doi":"10.1109/BlackSeaCom.2018.8433628","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433628","url":null,"abstract":"VANET, the vehicular ad-hoc network, is a new communication technology that is characterized by a large amount of moving hosts, dynamic topology, and permanently changing data flows. VANE T specific features result in poor access control and isolation of sensitive data in intranetwork. Our paper discusses this issue and adapts the role-based access control to VANET with a hierarchy of objects and roles to ensure access control and improve data confidentiality.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"9 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":"115347364","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}
引用次数: 16
2018 IEEE International Black Sea Conference on Communications and Networking, BlackSeaCom 2018, Batumi, Georgia, June 4-7, 2018 2018 IEEE国际黑海通信与网络会议，BlackSeaCom 2018, Batumi, Georgia, 2018年6月4-7日
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/blackseacom.2018.8433712
{"title":"2018 IEEE International Black Sea Conference on Communications and Networking, BlackSeaCom 2018, Batumi, Georgia, June 4-7, 2018","authors":"","doi":"10.1109/blackseacom.2018.8433712","DOIUrl":"https://doi.org/10.1109/blackseacom.2018.8433712","url":null,"abstract":"","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"100 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":"114256779","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
Relay Probability Characteristics in a Social Ad-Hoc Network with Different Intimacy Calculation Models and Social Network Structure Models 不同亲密度计算模型和社会网络结构模型下的社会自组织网络中继概率特征
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433597
Tianran Luo, E. Lua, T. Murase
{"title":"Relay Probability Characteristics in a Social Ad-Hoc Network with Different Intimacy Calculation Models and Social Network Structure Models","authors":"Tianran Luo, E. Lua, T. Murase","doi":"10.1109/BlackSeaCom.2018.8433597","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433597","url":null,"abstract":"We discuss a method of creating a wireless ad-hoc network in which nodes are connected by considering human relationships (i.e., intimacy) in social networks. Here, this is called a social ad-hoc network, and it could solve the incentive problem in which one has to relay the data of other people. Previous work showed that a social ad-hoc network is useful to connect to a specific destination through some nodes. A simple intimacy-based relationship model was evaluated with a criteria and relay probability. In order to better understand the relay probability characteristics of a social ad-hoc network, we use a variety of intimacy models in terms of intimacy distributions, indirect intimacy calculation methods and social network topologies. We then evaluate how the social ad-hoc network is useful. The results show a significant difference of 40% between different intimacy distribution models. We also discover that the density of the social network has a stronger effect on the relay probabilities than other parameters.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"75 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":"114412507","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
An Accelerated Variational Framework for Face Expression Recognition 人脸表情识别的加速变分框架
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) Pub Date : 2018-06-01 DOI: 10.1109/BlackSeaCom.2018.8433687
Wentao Fan, N. Bouguila
{"title":"An Accelerated Variational Framework for Face Expression Recognition","authors":"Wentao Fan, N. Bouguila","doi":"10.1109/BlackSeaCom.2018.8433687","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433687","url":null,"abstract":"In this paper we examine the problem of the modeling of positive vectors that are naturally generated by several signal and image processing applications. We consider a statistical framework based on a Dirichlet process mixture of inverted Dirichlet distributions like the one previously proposed in [1]. The choice of inverted Dirichlet is motivated by its flexibility to model positive features. The proposed approach can be viewed as an infinite inverted Dirichlet mixture model. As compared to [1], the infinite framework is learned via an accelerated variational approach. The accelerated variational approach offers a good compromise between frequentist techniques and purely Bayesian inference and improves the simple variational approach used in [1]. The merits of the proposed model are validated via a challenging application that involves face expression recognition.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"145 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":"124951358","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信