Pub Date : 2017-06-01DOI: 10.1109/BlackSeaCom.2017.8277718
Koray Necip Aytac, Tolga Girici, M. Yuksel, A. Telli, Ilter Koksal
In this study, we construct a detailed simulation model in order to quantify the benefits of device-to-device (D2D) caching for video content delivery. Simulation model involves caches at the evolved packet core, radio access network (RAN) and end user devices. We compare the bandwidth cost savings for different caching strategies at the EPC, RAN and devices and find the best joint strategy.
{"title":"Device-to-device caching for video content delivery","authors":"Koray Necip Aytac, Tolga Girici, M. Yuksel, A. Telli, Ilter Koksal","doi":"10.1109/BlackSeaCom.2017.8277718","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277718","url":null,"abstract":"In this study, we construct a detailed simulation model in order to quantify the benefits of device-to-device (D2D) caching for video content delivery. Simulation model involves caches at the evolved packet core, radio access network (RAN) and end user devices. We compare the bandwidth cost savings for different caching strategies at the EPC, RAN and devices and find the best joint strategy.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123620498","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277683
Demir Y. Yavas, Ibrahim Hökelek, Bilge Günsel
In this paper, we present a discrete-time fluid-flow model to characterize the behavior of an overloaded Session Initiation Protocol (SIP) server under the lossy network conditions. The model considers both redundant retransmissions due to excessive queuing delays in an overloaded server and non-redundant retransmissions due to message loss in the network and calculates the number of failed call attempts and the average response delay from sending INVITE request until receiving a 100-Trying response. The accuracy of the model is verified with the simulations. The experiments show that losses in the network reduce the amount of the offered traffic to the SIP server and decreases the severity of the overload situation.
{"title":"Modeling of SIP retransmission traffic under lossy network conditions","authors":"Demir Y. Yavas, Ibrahim Hökelek, Bilge Günsel","doi":"10.1109/BlackSeaCom.2017.8277683","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277683","url":null,"abstract":"In this paper, we present a discrete-time fluid-flow model to characterize the behavior of an overloaded Session Initiation Protocol (SIP) server under the lossy network conditions. The model considers both redundant retransmissions due to excessive queuing delays in an overloaded server and non-redundant retransmissions due to message loss in the network and calculates the number of failed call attempts and the average response delay from sending INVITE request until receiving a 100-Trying response. The accuracy of the model is verified with the simulations. The experiments show that losses in the network reduce the amount of the offered traffic to the SIP server and decreases the severity of the overload situation.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130207098","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277696
Mahsa Shirzadian Gilan, A. Olfat
Two-path successive relaying is used as a method of transmission for recovering the bandwidth loss of conventional relay networks. In this paper, a new beamforming method is employed alongside the proposed distributed space-time coding (DSTC) transmission scheme in a two-path successive relay network which enjoys SNR-based selection relaying protocol. A closed-form expression for the end-to-end bit error rate (BER) of the system is derived. Regardless of the fading in inter-relay channel, the proposed scheme ensures that full rate and full diversity can be attained in the presence of decoding errors at the relay nodes. Simulation results, show a significant power saving about 2.5 dB at BER (10−4) in comparison to other conventional methods.
{"title":"On the performance of distributed space-time coding with selection relaying and beamforming for two-path successive relay network","authors":"Mahsa Shirzadian Gilan, A. Olfat","doi":"10.1109/BlackSeaCom.2017.8277696","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277696","url":null,"abstract":"Two-path successive relaying is used as a method of transmission for recovering the bandwidth loss of conventional relay networks. In this paper, a new beamforming method is employed alongside the proposed distributed space-time coding (DSTC) transmission scheme in a two-path successive relay network which enjoys SNR-based selection relaying protocol. A closed-form expression for the end-to-end bit error rate (BER) of the system is derived. Regardless of the fading in inter-relay channel, the proposed scheme ensures that full rate and full diversity can be attained in the presence of decoding errors at the relay nodes. Simulation results, show a significant power saving about 2.5 dB at BER (10−4) in comparison to other conventional methods.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130668460","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277711
Cem Dincer, E. Zeydan
Today's mobile operators (MOs) are experiencing tremendous amount of data usage of their subscribers. This results in data tsunami arriving from various sources inside MOs' network infrastructures. On the other hand, handling this data increase in an elegant manner will be utmost importance for designing the next generation cellular 5G network infrastructure. In this evolving 5G architecture, there will also be many vertical market players from different domains (e.g. car manufacturers, retailers, banks, transportation providers) as well as third party players (e.g. application developers) that will be interacting with MO's subscribers private data through many innovative big data applications. These big data applications can provide additional value added services to MOs. On the other hand, ensuring the security of these applications utilizing big data will be another dimension that needs to be provisioned carefully. In this paper, we study the various security requirements and challenges of running big data application services by MOs themselves. Based on the system architecture that is studied, we have also run extensive vulnerability tests against one example of big data application deployed inside MO's premises. Our results indicate key security findings and map some of the missing requirements into the considered big data application scenario.
{"title":"Big data security: Requirements, challenges and preservation of private data inside mobile operators","authors":"Cem Dincer, E. Zeydan","doi":"10.1109/BlackSeaCom.2017.8277711","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277711","url":null,"abstract":"Today's mobile operators (MOs) are experiencing tremendous amount of data usage of their subscribers. This results in data tsunami arriving from various sources inside MOs' network infrastructures. On the other hand, handling this data increase in an elegant manner will be utmost importance for designing the next generation cellular 5G network infrastructure. In this evolving 5G architecture, there will also be many vertical market players from different domains (e.g. car manufacturers, retailers, banks, transportation providers) as well as third party players (e.g. application developers) that will be interacting with MO's subscribers private data through many innovative big data applications. These big data applications can provide additional value added services to MOs. On the other hand, ensuring the security of these applications utilizing big data will be another dimension that needs to be provisioned carefully. In this paper, we study the various security requirements and challenges of running big data application services by MOs themselves. Based on the system architecture that is studied, we have also run extensive vulnerability tests against one example of big data application deployed inside MO's premises. Our results indicate key security findings and map some of the missing requirements into the considered big data application scenario.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128855600","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277672
Mesut Toka, O. Kucur
In this study, we present a full-duplex (FD) transmission scheme based on conventional Alamouti coding technique and investigate end-to-end (e2e) outage probability (OP) performance over independent identically distributed Rayleigh fading channels in dual-hop relay networks. We assume that direct link is not available due to channel impairments, so that the communication between the source and destination is maintained only via a single relay. In the network, the relay is equipped with one receive and one transmit antennas, and adopts amplify-and-forward (AF) and decode-and-forward (DF) protocols. While Alamouti code is used at the transmitter side, maximal-ratio combining (MRC) technique is employed at the destination in order to provide higher diversity order. OP expressions are derived in single integral and closed forms for AF and DF protocols, respectively. In addition, in order to provide insight into OP, asymptotic OP expressions are also derived. The analytical derivations are verified by the Monte Carlo simulations. Results show that e2e performance of the system is improved at low signal-to-noise ratio (SNR) region by increasing the number of antennas at the destination and DF provides approximately 2 dB SNR gain as compared to AF.
{"title":"Outage performance of dual hop full-duplex relaying with Alamouti/MRC over Rayleigh fading channels","authors":"Mesut Toka, O. Kucur","doi":"10.1109/BlackSeaCom.2017.8277672","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277672","url":null,"abstract":"In this study, we present a full-duplex (FD) transmission scheme based on conventional Alamouti coding technique and investigate end-to-end (e2e) outage probability (OP) performance over independent identically distributed Rayleigh fading channels in dual-hop relay networks. We assume that direct link is not available due to channel impairments, so that the communication between the source and destination is maintained only via a single relay. In the network, the relay is equipped with one receive and one transmit antennas, and adopts amplify-and-forward (AF) and decode-and-forward (DF) protocols. While Alamouti code is used at the transmitter side, maximal-ratio combining (MRC) technique is employed at the destination in order to provide higher diversity order. OP expressions are derived in single integral and closed forms for AF and DF protocols, respectively. In addition, in order to provide insight into OP, asymptotic OP expressions are also derived. The analytical derivations are verified by the Monte Carlo simulations. Results show that e2e performance of the system is improved at low signal-to-noise ratio (SNR) region by increasing the number of antennas at the destination and DF provides approximately 2 dB SNR gain as compared to AF.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122595337","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277701
H. Yalcin
As smartphones have been increasingly adopted by mobile phone users, the applications market for mobile operating systems also developed into a giant market for advertising business. Smartphone companies allow third parties to develop apps to provide different services to users and third party app developers publish these applications in app markets relevant to the mobile operating system. Users download from a range of app categories including games, productivity, education, social networking, etc. Processing smartphone data is very appealing, since app usage on a mobile phone indicates important clues about the lifestyle and interests of the user. Although processing the data collected from smartphones is very attractive, usually the data is not available to the research community. Usually governmental organizations impose regulations on the telecommunications companies as far as the disclosure of the data collected by these companies. The data to be serviced publicly has to be organized such that it is anonymized and the identity of the customers cannot be tracked. In this paper, we propose a probabilistic model to predict the user profile of a customer, namely gender and age, based on usage behaviors of mobile applications, phone brand and model. The probabilistic model infers these demographics from the statistical characteristics profiled from a huge pool of information hidden in a dataset provided by TalkingData company. Building the probabilistic model on this dataset is a more practicable user profiling method, since it can be used to deliver personalized services without posing privacy risks to the users and it eliminates the necessity for continuously tracking users' online activities or smartphone usage and maintaining historical records. Our experimental results indicate that promising information can be tracked down through the proposed approach, especially information about user tendencies which are of crucial importance to the targeted advertisement.
{"title":"Extracting user profiles from mobile data","authors":"H. Yalcin","doi":"10.1109/BlackSeaCom.2017.8277701","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277701","url":null,"abstract":"As smartphones have been increasingly adopted by mobile phone users, the applications market for mobile operating systems also developed into a giant market for advertising business. Smartphone companies allow third parties to develop apps to provide different services to users and third party app developers publish these applications in app markets relevant to the mobile operating system. Users download from a range of app categories including games, productivity, education, social networking, etc. Processing smartphone data is very appealing, since app usage on a mobile phone indicates important clues about the lifestyle and interests of the user. Although processing the data collected from smartphones is very attractive, usually the data is not available to the research community. Usually governmental organizations impose regulations on the telecommunications companies as far as the disclosure of the data collected by these companies. The data to be serviced publicly has to be organized such that it is anonymized and the identity of the customers cannot be tracked. In this paper, we propose a probabilistic model to predict the user profile of a customer, namely gender and age, based on usage behaviors of mobile applications, phone brand and model. The probabilistic model infers these demographics from the statistical characteristics profiled from a huge pool of information hidden in a dataset provided by TalkingData company. Building the probabilistic model on this dataset is a more practicable user profiling method, since it can be used to deliver personalized services without posing privacy risks to the users and it eliminates the necessity for continuously tracking users' online activities or smartphone usage and maintaining historical records. Our experimental results indicate that promising information can be tracked down through the proposed approach, especially information about user tendencies which are of crucial importance to the targeted advertisement.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134296683","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277681
Mehmet Akif Yazici, Kasim Oztoprak
If the packets of a flow are carried on separate physical paths for forward and reverse directions, the flow is said to be asymmetrically routed. Routing asymmetry causes problems regarding flow identification, traffic shaping, policy enforcement, quota management etc. in DPI systems. Clustering and state sharing are the two existing methods to overcome routing asymmetry. State sharing works only for stateful traffic flows whereas clustering leads to large traffic overhead. A hybrid scheme, the “Hybrid Asymmetric Traffic Classifier” (HATC) has recently been proposed to merge the better aspects of clustering and state sharing. HATC can handle both stateful and stateless flows with reduced overhead compared to clustering. In this study, we propose a novel flow identification method, the “Policy Broker-centric Traffic Classifier” (PBTC), which employs policy broker devices that undertake policy and charging rules functions in the provider's network. The performance of the proposed method is compared against that of HATC under two real traffic traces and several simulated scenarios to demonstrate that PBTC outperforms HATC.
{"title":"Policy broker-centric traffic classifier architecture for deep packet inspection systems with route asymmetry","authors":"Mehmet Akif Yazici, Kasim Oztoprak","doi":"10.1109/BlackSeaCom.2017.8277681","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277681","url":null,"abstract":"If the packets of a flow are carried on separate physical paths for forward and reverse directions, the flow is said to be asymmetrically routed. Routing asymmetry causes problems regarding flow identification, traffic shaping, policy enforcement, quota management etc. in DPI systems. Clustering and state sharing are the two existing methods to overcome routing asymmetry. State sharing works only for stateful traffic flows whereas clustering leads to large traffic overhead. A hybrid scheme, the “Hybrid Asymmetric Traffic Classifier” (HATC) has recently been proposed to merge the better aspects of clustering and state sharing. HATC can handle both stateful and stateless flows with reduced overhead compared to clustering. In this study, we propose a novel flow identification method, the “Policy Broker-centric Traffic Classifier” (PBTC), which employs policy broker devices that undertake policy and charging rules functions in the provider's network. The performance of the proposed method is compared against that of HATC under two real traffic traces and several simulated scenarios to demonstrate that PBTC outperforms HATC.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129127655","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277697
M. Rezaee, B. Maham
The two-user relay-assisted X channel is considered when no channel state information (CSI) is available at the transmitter side. It is known that with a 2M-antenna relay and M-antenna users a DoF of is achieved in this channel if CSI is available at the relay. This is equal to the maximum achievable DoF in the ordinary X-channel (with no relay) with perfect CSI at the transmitters. An efficient CSI feedback method is proposed which reduces the amount of feedback necessary for the relay in order to maintain the maximum DoF. In addition, a quantization method is proposed for the case of limited feedback. The proposed method outperforms the conventional methods in terms of the number of feedback bits. Simulation results show performance improvement in the finite-SNR regime.
{"title":"An efficient method for channel state information feedback in the relay X-channel","authors":"M. Rezaee, B. Maham","doi":"10.1109/BlackSeaCom.2017.8277697","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277697","url":null,"abstract":"The two-user relay-assisted X channel is considered when no channel state information (CSI) is available at the transmitter side. It is known that with a 2M-antenna relay and M-antenna users a DoF of is achieved in this channel if CSI is available at the relay. This is equal to the maximum achievable DoF in the ordinary X-channel (with no relay) with perfect CSI at the transmitters. An efficient CSI feedback method is proposed which reduces the amount of feedback necessary for the relay in order to maintain the maximum DoF. In addition, a quantization method is proposed for the case of limited feedback. The proposed method outperforms the conventional methods in terms of the number of feedback bits. Simulation results show performance improvement in the finite-SNR regime.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121091374","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277706
E. Khorov, A. Krasilov, A. Malyshev
A hot topic recently attracted much interest in 3GPP community is ultra reliable low latency communications. While specific protocols for such type of communications are under development, in this paper we evaluate how well we can meet strict quality of service requirements in the current LTE/LTE-Advanced networks. Specifically, we design a new two-step radio resource management algorithm for reliable low latency communications. At the first step, the algorithm forms a high-priority group of users which can be reliably served within the given delay budget. At the second step, the algorithm solves a linear optimization problem and allocates resource blocks to meet quality of service requirements at least for the users from the high-priority group. With simulations, we show that the proposed algorithm outperforms existing ones in terms of goodput, PLR and the number of satisfied users.
{"title":"Reliable low latency communications in LTE networks","authors":"E. Khorov, A. Krasilov, A. Malyshev","doi":"10.1109/BlackSeaCom.2017.8277706","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277706","url":null,"abstract":"A hot topic recently attracted much interest in 3GPP community is ultra reliable low latency communications. While specific protocols for such type of communications are under development, in this paper we evaluate how well we can meet strict quality of service requirements in the current LTE/LTE-Advanced networks. Specifically, we design a new two-step radio resource management algorithm for reliable low latency communications. At the first step, the algorithm forms a high-priority group of users which can be reliably served within the given delay budget. At the second step, the algorithm solves a linear optimization problem and allocates resource blocks to meet quality of service requirements at least for the users from the high-priority group. With simulations, we show that the proposed algorithm outperforms existing ones in terms of goodput, PLR and the number of satisfied users.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123466168","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-06-01DOI: 10.1109/BlackSeaCom.2017.8277709
C. Ileri, O. Dagdeviren
Matching problem has been attracting a growing attention in network design, especially in wireless communication networks. Although there is an exact polynomial-time sequential algorithm for the weighted version of the problem, all the related distributed algorithms are approximation algorithms. In this paper we present a distributed heuristic which improves the weight of a given matching in time proportional to the number of nodes. Our algorithm assumes the asynchronous communication model in which the message size is limited to O (log n) bits. To the best of our knowledge, it is the first distributed weighted matching algorithm which benefits from augmentation of alternating paths having size larger than 3 and uses small messages. We also provide results of our simulations on random geometric graphs. Computational results show that our algorithm improves the approximated solutions of other weighted matching algorithms roughly by 1–3% and closes the gap between the approximation ratio and the optimum solution by 9–26%.
{"title":"Improving distributed maximum weighted matchings for communication networks","authors":"C. Ileri, O. Dagdeviren","doi":"10.1109/BlackSeaCom.2017.8277709","DOIUrl":"https://doi.org/10.1109/BlackSeaCom.2017.8277709","url":null,"abstract":"Matching problem has been attracting a growing attention in network design, especially in wireless communication networks. Although there is an exact polynomial-time sequential algorithm for the weighted version of the problem, all the related distributed algorithms are approximation algorithms. In this paper we present a distributed heuristic which improves the weight of a given matching in time proportional to the number of nodes. Our algorithm assumes the asynchronous communication model in which the message size is limited to O (log n) bits. To the best of our knowledge, it is the first distributed weighted matching algorithm which benefits from augmentation of alternating paths having size larger than 3 and uses small messages. We also provide results of our simulations on random geometric graphs. Computational results show that our algorithm improves the approximated solutions of other weighted matching algorithms roughly by 1–3% and closes the gap between the approximation ratio and the optimum solution by 9–26%.","PeriodicalId":126747,"journal":{"name":"2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"650 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122700770","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
扫码关注我们
求助内容：
应助结果提醒方式：