{"title":"Evaluating Fault Tolerance Properties of Self-Stabilizing Matching Algorithms in Wireless Sensor Networks","authors":"C. Ileri, O. Dagdeviren","doi":"10.1109/BlackSeaCom.2018.8433708","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433708","url":null,"abstract":"Self stabilization is an important paradigm for the autonomous recovery of a distributed system from transient failures such as energy depletion of nodes and disrupted connections. It has been used in wireless sensor networks (WSN) as these networks are expected to automatically recover from a transient fault without human intervention. Graph matching is fundamental a graph theory problem which has a broad application range in WSNs and it has been studied extensively in self-stabilizing settings. In this work, we build a simulation model and perform tests to evaluate the fault tolerance properties of self-stabilizing matching algorithms. To the best of our knowledge, this is the first practical evaluation of these algorithms. Considering WSNs, we assume distributed fair and synchronous schedulers. Simulation results have shown that there is a tradeoff between stabilization time of algorithms and the quality of their results. The improvement algorithms which has better lower bounds give better matchings at the cost of longer durations of instability.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"98 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":"131571750","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}
{"title":"TDOA Measurement Processing for Positioning in Non-Line-of-Sight Conditions","authors":"G. Fokin","doi":"10.1109/BlackSeaCom.2018.8433623","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433623","url":null,"abstract":"In this paper three-stage time difference of arrival (TDOA) measurements processing algorithm is presented for positioning a transmitter in non-line-of-sight (NLOS) conditions when there are up to two receivers with NLOS measurements. The method used for NLOS identification and mitigation exploits the comparison of variance for intermediate location estimates calculated from different combinations of TDOA receivers with thresholds and does not require a priori knowledge. Contribution of proposed algorithm lies in accounting of calculated variances for different combinations within individual set of receivers and among all possible sets of receivers for the case when there up to two NLOS measurement sources. Proposed algorithm was realized in simulation model including TDOA system and link level model subsystems. TDOA system level model represents positioning layout with spatially distributed transmitter, receivers, obstacles and NLOS reflectors. TDOA link level model represents radio links between transmitter, receivers, and NLOS reflectors taking into account actual pathloss, signal modulation, sampling rate, additive noise and cross-correlation calculation. Resulting estimates refine known results for the case of actual pathloss and reveal possibility to reliably identify and exclude up to two NLOS receivers from measurement processing.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"39 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":"122891465","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}
{"title":"Low Complexity Peak-to-Average Power Ratio Reduction in OFDM-IM","authors":"Ebubekir Memisoglu, E. Başar, H. Arslan","doi":"10.1109/BlackSeaCom.2018.8433654","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433654","url":null,"abstract":"Orthogonal frequency division multiplexing with index modulation (OFDM-IM) employs the indices of the active subcarriers for information transmission, as an alternative to conventional OFDM. It offers high spectral efficiency and high energy efficiency in comparison to OFDM thanks to the information bits conveyed by IM. However, OFDM-IM has the drawback of high peak-to-average power ratio (PAPR) similar to OFDM, and this important problem has not been studied well in the literature. Active constellation extension (ACE), which is one of the well-known PAPR reduction methods, can be used to solve this drawback of OFDM-IM. Owing to the fact that this PAPR reduction method is less effective for OFDM-IM, we propose the extension of the constellation over inactive subcarriers through adding clipped signals over them. These subcarriers have a signal power limited by an upper bound, and this causes a slight degradation in the bit error rate (BER) performance. Computer simulation results demonstrate that our proposed method has a better PAPR reduction performance than the ACE method for OFDM and OFDM-IM while being more energy efficient with a very slight degradation in BER performance when a proper clipping threshold level is selected. Additionally, it is shown that the proposed method and ACE can be further combined, and this provides an improved PAPR reduction. In order to decrease the computational complexity of the PAPR reduction method to the linear-logarithmic level, smart gradient projection (SGP) is employed.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"51 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":"124149262","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}
{"title":"DCS - Securing Short-Range Wireless Communication","authors":"Wissam Al Jurdi, J. B. Abdo","doi":"10.1109/BlackSeaCom.2018.8433719","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433719","url":null,"abstract":"Privacy in the connected world is a huge user concern. Short range communication utilizes various inter-entity forms such as end-terminal, token and mobile. Services like micro-payments applied especially in point of sale (POS) terminals and peer-to-peer (P2P) communication mainly use near-field communication (NFC) protocol. This radio-based communication link may be compromised through different attacks including eavesdropping, data corruption and Man-In-the-Middle (MITM) attacks. Existing solutions provide complex proposals mainly for an authentication phase prior to data communication. In this article, we expand on a new key agreement mechanism, dual channel security (DCS) that aims at overcoming the vulnerabilities and attacks that are arising from well-known protocols. This model consists of one major component: an optical key-agreement link. It will ensure the achievement of the security requirements against common eavesdropping, data corruption and MITM attacks. Furthermore, we evaluate the performance and effectiveness of our approach through several tests and comparisons.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"48 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":"117118016","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}
Canberk Sonmez, S. Baghaee, Abdussamed Ergisi, E. Uysal-Biyikoglu
{"title":"Age-of-Information in Practice: Status Age Measured Over TCP/IP Connections Through WiFi, Ethernet and LTE","authors":"Canberk Sonmez, S. Baghaee, Abdussamed Ergisi, E. Uysal-Biyikoglu","doi":"10.1109/BlackSeaCom.2018.8433695","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433695","url":null,"abstract":"The Age of Information (AoI) has gained importance as a Key Performance Indicator (KPI) measuring freshness of information in information-update systems and time-critical applications. Almost all the previous literature on AoI has been theoretical. Most of these theoretical studies assumed knowledge of the statistics of network delays and/or link service times. However, in real-life networks, various factors contribute to these parameters, resulting in a complicated effect on age. This paper reports the results of a real-life implementation measuring the variation of AoI over TCP/IP links served by WiFi, LTE, 3G, 2G and Ethernet for different rates of status update generation by an application running over the Internet.","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":"127766388","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}
{"title":"Sparse MLD Decoder for 1-Bit ADC MIMO Constant Envelope Modulation","authors":"Hany S. Hussein","doi":"10.1109/BlackSeaCom.2018.8433694","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433694","url":null,"abstract":"Due to the power inefficiency of the MIMO-OFDM components (i.e. linear power amplifier and high resolution ADC), the MIMO constant envelope modulation (MIMO-CEM) with 1-bit ADC was introduced as a low power communication system. However, the received MIMO-CEM signal suffers from an enormous distortion as a result of using the 1-bit ADC at MIMO-CEM receiver side (RX). Therefore, a very high complex IF based maximum likelihood decoder (IF-MLD) is used with the MIMO-CEM RX to neutralize the 1-bit ADC quantization effect. In the IF-MLD the whole MIMO-CEM is replicated in the IF band in each MLD state, which is too complex to be practical. Therefore, an efficient low complex kernel sparse MIMO-CEM MLD is proposed. Where, a linear baseband MLD is proposed based on simple yet efficient approximation for the 1-bit ADC. Then, a kernel sparse selector (KSS) based on the correntropy maximization is proposed to nominate number of candidates from the space of aforementioned linear baseband MLD. In which, the higher order statistics (HOS) correntropy is exploited to compensate the mismatch between the MIMO-CEM received signal and the proposed linear approximation baseband MLD. Finally, the IF based MLD is applied on the nominated candidates to accurately estimate the transmitted sequence. The effectiveness of the proposed sparse MLD is tested and verified under different scenarios with different modulation techniques. On average, the proposed kernel sparse MLD achieves a complexity reduction by 99 % and 91 % compared to the conventional (IF-MLD) and recently MIMO-CEM decoder algorithm respectively.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"142 5 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":"124889233","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}
{"title":"Asynchronous Neuro-Spike Array - Based Communication","authors":"Keyvan Aghababaiyan, V. Shah-Mansouri, B. Maham","doi":"10.1109/BlackSeaCom.2018.8433705","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433705","url":null,"abstract":"Nano-networks employ novel nano-scale communication techniques. A new example of nano-networks is the artificial neural system where nano-machines are linked to neurons to treat the neurodegenerative diseases. Many of the nano-scale communication techniques are inspired by biological systems. Neuro-spike communication is one example of this communication paradigm which is exploited to transfer vital information through the nervous system by neurons or nano-machines. Neurons and nano-machines exploit spike rate and the temporal coding to transmit information by action potentials. However, the efficiency of these encoding methods decreases when the transmitter and receiver are asynchronous. Synchronization is beyond the capabilities of nano-machines. In this paper, first we propose a mathematical model for the jitter of the neuro-spike communication channel. Next, we propose an asynchronous neuro-spike array-based communication scheme in which the transmission order of the generated spikes by different elements of the nano-machines array is used to convey information. Thus, in this scheme, there is no need for time synchronization between the transmitter and receiver nano-machines. Finally, we evaluate our proposed scheme via numerical results. It can be observed that our scheme improves the communication rate in comparison to other schemes about 50%.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"89 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":"115961904","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}
{"title":"A New Cross-Layer Approach for MIMO Amplify and Forward Relay System","authors":"Mahsa Shirzadian Gilan, B. Maham","doi":"10.1109/BlackSeaCom.2018.8433707","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433707","url":null,"abstract":"In this paper, we investigate the joint queuing at the data link layer and orthogonal frequency division multiplexing (OFDM) adaptive modulation at the physical layer for multiple-input-multiple-output (MIMO) relay system. A finite state Markov chain (FSMC) for this scenario has been proposed. Moreover, we consider an amplify and forward (AF) cooperative system with finite-length queue at the data link layer which leads to lower delay quantities. Finally, the packet loss rate and average spectral efficiency (ASE) of this system are evaluated in which the numerical results confirm the benefits of using MIMO nodes in our proposed cross-layer design and demonstrates that by employing cross-layer scheme the ASE decreases with respect to the case without queuing. Also, there is a good match between simulation and theoretical results.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"642 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":"131886645","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}
{"title":"Virtualized Cache Placement in an SDN/NFV Assisted SAND Architecture","authors":"S. Clayman, Reza Shokri Kalan, M. Sayıt","doi":"10.1109/BlackSeaCom.2018.8433643","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433643","url":null,"abstract":"Web-caches play an important role in the architecture of a Dynamic Adaptive Streaming over HTTP (DASH) system, which can bring video files near to the clients. In such systems, the placement of the caches affects the performance of the video streaming applications. In this paper we select the optimal network nodes for cache placement by taking into account characteristics such as the bandwidth of the paths, the places, and the number of the online clients, for a given network graph. For this purpose, we use a placement algorithm which is enhanced version of the Pressure algorithm proposed by Clegg which we call PressureCache, in an implementation of virtualized DASH Aware Network Elements (vDANEs). The results show that the proposed approach gives better performance in terms of received quality than random cache placement.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"33 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":"132114634","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}
{"title":"Energy Efficient Price Based Power Allocation in a Small Cell Network by Using a Stackelberg Game","authors":"M. Lashgari, B. Maham, H. Kebriaei","doi":"10.1109/BlackSeaCom.2018.8433625","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2018.8433625","url":null,"abstract":"Small cell networks are playing a pivotal role in increasing coverage and capacity of cellular networks which are extensively in last few years. However, the limited number of methods for optimal control of cross-layer interference and energy efficiency issues are paramount challenges of these networks. In this paper, a novel approach for an energy efficient communication in a two-tier small cell network is proposed. We have suggested pricing on interference and controlling transmit power to mitigate cross-layer interference and improve energy efficiency. In order to formulate the problem, the macrocell base station (MBS) and femtocell base stations (FBSs) act as leader and followers of a Stackelberg game, respectively. The MBS uses the pricing on the amount of the received interference to protect itself against the interference caused by FBSs. The FBSs goal is to maximize their energy efficiency and minimize the amount of price that should be paid to MBS by using a power control under the maximum allowable transmit power constraint. Maximizing energy efficiency is a non-linear fractional programming which is transformed to a subtractive form, and thus, it can be solved by using the iterative power allocation algorithm. The efficiency of the proposed algorithm is investigated through simulation results.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"76 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":"133537818","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}