The artificial noise (AN) aided beamforming design in the MISOME (multiple-input, single-output, multiple-eavesdropper) wiretap channel is studied from the perspective of secrecy outage. Unlike many existing works which directly adopted the traditional null-space AN scheme, we start with a general assumption on the structure of the transmit signal, and seek to find the optimal structure by solving a secrecy outage probability (SOP) constrained secrecy rate maximization problem. By generalizing several existing conclusions regarding a single-antenna eavesdropper, we prove that the null-space AN scheme is indeed optimal for an arbitrary number of the eavesdropper's antennas from the perspective of secrecy outage. The power allocation problem is also studied and the closed-form optimal solution is obtained. It is found that the increase in the eavesdropper's antenna number is equivalent to requiring a smaller SOP.
{"title":"Artificial-noise-aided beamforming design against a multi-antenna eavesdropper under secrecy outage constraint","authors":"Bo Wang, Pengcheng Mu, Zongze Li, Weile Zhang, Huiming Wang, Qinye Yin","doi":"10.1109/ICC.2017.7996336","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996336","url":null,"abstract":"The artificial noise (AN) aided beamforming design in the MISOME (multiple-input, single-output, multiple-eavesdropper) wiretap channel is studied from the perspective of secrecy outage. Unlike many existing works which directly adopted the traditional null-space AN scheme, we start with a general assumption on the structure of the transmit signal, and seek to find the optimal structure by solving a secrecy outage probability (SOP) constrained secrecy rate maximization problem. By generalizing several existing conclusions regarding a single-antenna eavesdropper, we prove that the null-space AN scheme is indeed optimal for an arbitrary number of the eavesdropper's antennas from the perspective of secrecy outage. The power allocation problem is also studied and the closed-form optimal solution is obtained. It is found that the increase in the eavesdropper's antenna number is equivalent to requiring a smaller SOP.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90257049","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-05-21DOI: 10.1109/ICC.2017.7997479
Gang Yang, Ying-Chang Liang, Qianqian Zhang
In ambient backscatter communications (Am-BC), a backscatter device can harvest power from ambient RF signals and modulate its information symbols over the ambient carriers without using complex RF transmitter. Conventional receiver design for AmBC focuses on tackling the direct link interference from the RF source. In this paper, a novel receiver, which is called cooperative receiver, is proposed to recover signals not only from the ambient backscatter device (A-BD), but also from the RF source. We first study the optimal maximum-likelihood (ML) detection for such system. Then, by exploiting the structural property of the system model, linear detectors and successive interference cancellation (SIC) based detectors are proposed. We also derive the closed-form bit error rate (BER) expressions for both ML detection and the proposed SIC algorithms. Finally, extensive numerical results show that the existence of backscattered signal in the considered system can significantly enhance the ML detection performance of the source signal, and the proposed SIC-based detectors can achieve near-ML detection performance for typical application scenarios.
{"title":"Cooperative receiver for ambient backscatter communications with multiple antennas","authors":"Gang Yang, Ying-Chang Liang, Qianqian Zhang","doi":"10.1109/ICC.2017.7997479","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997479","url":null,"abstract":"In ambient backscatter communications (Am-BC), a backscatter device can harvest power from ambient RF signals and modulate its information symbols over the ambient carriers without using complex RF transmitter. Conventional receiver design for AmBC focuses on tackling the direct link interference from the RF source. In this paper, a novel receiver, which is called cooperative receiver, is proposed to recover signals not only from the ambient backscatter device (A-BD), but also from the RF source. We first study the optimal maximum-likelihood (ML) detection for such system. Then, by exploiting the structural property of the system model, linear detectors and successive interference cancellation (SIC) based detectors are proposed. We also derive the closed-form bit error rate (BER) expressions for both ML detection and the proposed SIC algorithms. Finally, extensive numerical results show that the existence of backscattered signal in the considered system can significantly enhance the ML detection performance of the source signal, and the proposed SIC-based detectors can achieve near-ML detection performance for typical application scenarios.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"24 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84007944","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-05-21DOI: 10.1109/ICC.2017.7997335
T. Berisha, P. Svoboda, Stephan Ojak, C. Mecklenbräuker
Two solutions are presented to overcome the coverage and low bit rate problems for cellular network services in high mobility: amplify-and-forward Moving Relay Nodes (MRNs) and prototype windows on-board Wi-Fi enabled High Speed Trains (HSTs). This paper focuses on 3G/4G User Equipments (UEs) located on-board the high Vehicular Penetration Loss (VPL) vehicles travelling throughout long-range geographical routes. This work is supported by extensive real-world measurements conducted along Austrian railways such as from Vienna to Salzburg and from Vienna to Graz. We propose a novelistic approach and we call SegHyPer. The approach is established by multi-level non-parametric hypotheses tests based on route segmentation link quality parameters to enable micro-analysis in current and future cellular networks for mobile users on-board railjet HST with- and without treatment.
{"title":"SegHyPer: Segmentation- and hypothesis based network performance evaluation for high speed train users","authors":"T. Berisha, P. Svoboda, Stephan Ojak, C. Mecklenbräuker","doi":"10.1109/ICC.2017.7997335","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997335","url":null,"abstract":"Two solutions are presented to overcome the coverage and low bit rate problems for cellular network services in high mobility: amplify-and-forward Moving Relay Nodes (MRNs) and prototype windows on-board Wi-Fi enabled High Speed Trains (HSTs). This paper focuses on 3G/4G User Equipments (UEs) located on-board the high Vehicular Penetration Loss (VPL) vehicles travelling throughout long-range geographical routes. This work is supported by extensive real-world measurements conducted along Austrian railways such as from Vienna to Salzburg and from Vienna to Graz. We propose a novelistic approach and we call SegHyPer. The approach is established by multi-level non-parametric hypotheses tests based on route segmentation link quality parameters to enable micro-analysis in current and future cellular networks for mobile users on-board railjet HST with- and without treatment.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"147 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83805960","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-05-21DOI: 10.1109/ICC.2017.7997208
Jingwei Zhang, Yong Zeng, Rui Zhang
Wireless communication by leveraging the use of low-altitude unmanned aerial vehicles (UAVs) has received significant interests recently due to its low-cost and flexibility in providing wireless connectivity in areas without infrastructure coverage. This paper studies a UAV-enabled mobile relaying system, where a high-mobility UAV is deployed to assist in the information transmission from a ground source to a ground destination with their direct link blocked. By assuming that the UAV adopts the energy-efficient circular trajectory and employs time-division duplexing (TDD) based decode-and-forward (DF) relaying, we maximize the spectrum efficiency (SE) in bits/second/Hz as well as energy efficiency (EE) in bits/Joule of the considered system by jointly optimizing the time allocations for the UAV's relaying together with its flying speed and trajectory. It is revealed that for UAV-enabled mobile relaying with the UAV propulsion energy consumption taken into account, there exists a trade-off between the maximum achievable SE and EE by exploiting the new degree of freedom of UAV trajectory design.
{"title":"Spectrum and energy efficiency maximization in UAV-enabled mobile relaying","authors":"Jingwei Zhang, Yong Zeng, Rui Zhang","doi":"10.1109/ICC.2017.7997208","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997208","url":null,"abstract":"Wireless communication by leveraging the use of low-altitude unmanned aerial vehicles (UAVs) has received significant interests recently due to its low-cost and flexibility in providing wireless connectivity in areas without infrastructure coverage. This paper studies a UAV-enabled mobile relaying system, where a high-mobility UAV is deployed to assist in the information transmission from a ground source to a ground destination with their direct link blocked. By assuming that the UAV adopts the energy-efficient circular trajectory and employs time-division duplexing (TDD) based decode-and-forward (DF) relaying, we maximize the spectrum efficiency (SE) in bits/second/Hz as well as energy efficiency (EE) in bits/Joule of the considered system by jointly optimizing the time allocations for the UAV's relaying together with its flying speed and trajectory. It is revealed that for UAV-enabled mobile relaying with the UAV propulsion energy consumption taken into account, there exists a trade-off between the maximum achievable SE and EE by exploiting the new degree of freedom of UAV trajectory design.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"4 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88015495","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-05-21DOI: 10.1109/ICC.2017.7996877
Leonardo Babun, Hidayet Aksu, A. Uluagac
The use of counterfeit smart grid devices throughout the smart grid communication infrastructure represents a real problem. Hence, monitoring and early detection of counterfeit smart grid devices is critical for protecting smart grid's components and data. To address these concerns, in this paper, we introduce a novel system level approach to identify counterfeit smart grid devices. Specifically, our approach is a configurable framework that combines system and function call tracing techniques and statistical analysis to detect counterfeit smart grid devices based on their behavioural characteristics. Moreover, we measure the efficacy of our framework with a realistic testbed that includes both resource-limited and resource-rich counterfeit devices. In total, we analyze six different counterfeit devices in our testbed. The devices communicate via an open source version of the IEC61850 protocol suite (i.e., libiec61850). Experimental results reveal an excellent rate on the detection of smart grid counterfeit devices. Finally, the performance analysis demonstrates that the use of the proposed framework has minimal overhead on the smart grid devices' computing resources.
{"title":"Identifying counterfeit smart grid devices: A lightweight system level framework","authors":"Leonardo Babun, Hidayet Aksu, A. Uluagac","doi":"10.1109/ICC.2017.7996877","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996877","url":null,"abstract":"The use of counterfeit smart grid devices throughout the smart grid communication infrastructure represents a real problem. Hence, monitoring and early detection of counterfeit smart grid devices is critical for protecting smart grid's components and data. To address these concerns, in this paper, we introduce a novel system level approach to identify counterfeit smart grid devices. Specifically, our approach is a configurable framework that combines system and function call tracing techniques and statistical analysis to detect counterfeit smart grid devices based on their behavioural characteristics. Moreover, we measure the efficacy of our framework with a realistic testbed that includes both resource-limited and resource-rich counterfeit devices. In total, we analyze six different counterfeit devices in our testbed. The devices communicate via an open source version of the IEC61850 protocol suite (i.e., libiec61850). Experimental results reveal an excellent rate on the detection of smart grid counterfeit devices. Finally, the performance analysis demonstrates that the use of the proposed framework has minimal overhead on the smart grid devices' computing resources.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"142 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74947878","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}
Given v sets and an incoming item e, multi-set membership query is to report which set contains item e. Multi-set membership query is a fundamental problem in computer systems and applications. All existing data structures cannot achieve small memory usage, fast query speed and high accuracy at the same time. In this paper, we propose a novel probabilistic data structure named Difference Bloom Filter (DBF) for fast multi-set membership query, which not only is more accurate than the state-of-the-art, but has a faster query speed. There are two key design principles for DBF. The first one is to make the representation of the membership of elements exclusive by writing different number of 1s and 0s in the same filter, and the second one is to use the slow but cheap DRAM memory to improve the accuracy of the filter on the fast but expensive SRAM memory. Experimental results show that in terms of accuracy, DBF has a great advantage compared to state-of-the-art, being hundreds of times more accurate than the state-of-the-art vBF and ShBF. Furthermore, we have made the source code of our DBF available at our homepage [1] and GitHub [2].
{"title":"Difference Bloom Filter: A probabilistic structure for multi-set membership query","authors":"Dongsheng Yang, Deyu Tian, Junzhi Gong, Siang Gao, Tong Yang, Xiaoming Li","doi":"10.1109/ICC.2017.7996678","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996678","url":null,"abstract":"Given v sets and an incoming item e, multi-set membership query is to report which set contains item e. Multi-set membership query is a fundamental problem in computer systems and applications. All existing data structures cannot achieve small memory usage, fast query speed and high accuracy at the same time. In this paper, we propose a novel probabilistic data structure named Difference Bloom Filter (DBF) for fast multi-set membership query, which not only is more accurate than the state-of-the-art, but has a faster query speed. There are two key design principles for DBF. The first one is to make the representation of the membership of elements exclusive by writing different number of 1s and 0s in the same filter, and the second one is to use the slow but cheap DRAM memory to improve the accuracy of the filter on the fast but expensive SRAM memory. Experimental results show that in terms of accuracy, DBF has a great advantage compared to state-of-the-art, being hundreds of times more accurate than the state-of-the-art vBF and ShBF. Furthermore, we have made the source code of our DBF available at our homepage [1] and GitHub [2].","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79891789","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}
Geographic routing protocols route packets in a hop-by-hop manner, where a node selects a relay node to forward packets among the (1-hop) neighboring nodes based on the obtained (geographic) location information of the neighboring nodes. To employ geographic routing protocols, two neighboring nodes need to exchange the location information with each other periodically. In a mobile ad hoc network, however, a packet transmitted between two neighboring nodes may be lost due to the out-of-date location information, resulting in demanding extra energy to retransmit the packet. In this paper, by considering the out-of-date neighboring location information, we propose two methods capable of augmenting geographic routing protocols to reduce energy consumption in mobile ad hoc networks. The first one considers a tradeoff between the progress distance and the energy consumption when selecting a relay node. The second one puts emphasis only on the energy consumption when selecting a relay node, and it consumes minimum energy to route a packet between a source-destination pair in the continuous domain. Simulations show that geographic routing protocols augmented with our methods can significantly reduce the energy consumption while preserving the high packet delivery rate.
{"title":"Energy consumption reduction methods of geographic routing protocols with out-of-date location information in mobile ad hoc networks","authors":"Yao-Jen Tang, Chung-Wei Lee, Meng-Han Lin, Bing-Hong Liu, Ming-Jer Tsai","doi":"10.1109/ICC.2017.7996329","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996329","url":null,"abstract":"Geographic routing protocols route packets in a hop-by-hop manner, where a node selects a relay node to forward packets among the (1-hop) neighboring nodes based on the obtained (geographic) location information of the neighboring nodes. To employ geographic routing protocols, two neighboring nodes need to exchange the location information with each other periodically. In a mobile ad hoc network, however, a packet transmitted between two neighboring nodes may be lost due to the out-of-date location information, resulting in demanding extra energy to retransmit the packet. In this paper, by considering the out-of-date neighboring location information, we propose two methods capable of augmenting geographic routing protocols to reduce energy consumption in mobile ad hoc networks. The first one considers a tradeoff between the progress distance and the energy consumption when selecting a relay node. The second one puts emphasis only on the energy consumption when selecting a relay node, and it consumes minimum energy to route a packet between a source-destination pair in the continuous domain. Simulations show that geographic routing protocols augmented with our methods can significantly reduce the energy consumption while preserving the high packet delivery rate.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"10 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78085654","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-05-21DOI: 10.1109/ICC.2017.7996333
Xin Chen, Jun Wu, Shaoyan Sun, Q. Tian
Different kinds of features hold some distinct merits, making them complementary to each other. Inspired by this idea an index level multiple feature fusion scheme via similarity matrix pooling is proposed in this paper. We first compute the similarity matrix of each index, and then a novel scheme is used to pool on these similarity matrices for updating the original indices. Compared with the existing fusion schemes, the proposed scheme performs feature fusion at index level to save memory and reduce computational complexity. On the other hand, the proposed scheme treats different kinds of features adaptively based on its importance, thus improves retrieval accuracy. The performance of the proposed approach is evaluated using two public datasets, which significantly outperforms the baseline methods in retrieval accuracy with low memory consumption and computational complexity.
{"title":"Multi-index fusion via similarity matrix pooling for image retrieval","authors":"Xin Chen, Jun Wu, Shaoyan Sun, Q. Tian","doi":"10.1109/ICC.2017.7996333","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996333","url":null,"abstract":"Different kinds of features hold some distinct merits, making them complementary to each other. Inspired by this idea an index level multiple feature fusion scheme via similarity matrix pooling is proposed in this paper. We first compute the similarity matrix of each index, and then a novel scheme is used to pool on these similarity matrices for updating the original indices. Compared with the existing fusion schemes, the proposed scheme performs feature fusion at index level to save memory and reduce computational complexity. On the other hand, the proposed scheme treats different kinds of features adaptively based on its importance, thus improves retrieval accuracy. The performance of the proposed approach is evaluated using two public datasets, which significantly outperforms the baseline methods in retrieval accuracy with low memory consumption and computational complexity.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"45 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77435971","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-05-21DOI: 10.1109/ICC.2017.7996461
Yanda Li, Liang Xiao, H. Dai, H. Poor
Multiple-input multiple-output (MIMO) systems are threatened by smart attackers, who apply programmable radio devices such as software defined radios to perform multiple types of attacks such as eavesdropping, jamming and spoofing. In this paper, MIMO transmission in the presence of smart attacks is formulated as a noncooperative game, in which a MIMO transmitter chooses its transmit power level and a smart attacker determines its attack type accordingly. A Nash equilibrium of this secure MIMO transmission game is derived and conditions assuring its existence are provided to reveal the impact of the number of antennas and the costs of the attacker to launch each type of attack. A power control strategy based on Q-learning is proposed for the MIMO transmitter to suppress the attack motivation of smart attackers in a dynamic version of MIMO transmission game without being aware of the attack and the radio channel model. Simulation results show that our proposed scheme can reduce the attack rate of smart attackers and improve the secrecy capacity compared with the benchmark strategy.
{"title":"Game theoretic study of protecting MIMO transmissions against smart attacks","authors":"Yanda Li, Liang Xiao, H. Dai, H. Poor","doi":"10.1109/ICC.2017.7996461","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996461","url":null,"abstract":"Multiple-input multiple-output (MIMO) systems are threatened by smart attackers, who apply programmable radio devices such as software defined radios to perform multiple types of attacks such as eavesdropping, jamming and spoofing. In this paper, MIMO transmission in the presence of smart attacks is formulated as a noncooperative game, in which a MIMO transmitter chooses its transmit power level and a smart attacker determines its attack type accordingly. A Nash equilibrium of this secure MIMO transmission game is derived and conditions assuring its existence are provided to reveal the impact of the number of antennas and the costs of the attacker to launch each type of attack. A power control strategy based on Q-learning is proposed for the MIMO transmitter to suppress the attack motivation of smart attackers in a dynamic version of MIMO transmission game without being aware of the attack and the radio channel model. Simulation results show that our proposed scheme can reduce the attack rate of smart attackers and improve the secrecy capacity compared with the benchmark strategy.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"33 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81157393","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-05-21DOI: 10.1109/ICC.2017.7997367
Yufan Huang, H. Dai
In this work, we investigate information spreading in multiplex networks, adopting the gossip (random-walk) based model. Two key features of multiplex networks allow potentially much faster information spreading: availability of multiple channels and communication actions for each user, and more choices on neighbor contacting. As a first work in this area, we explore the impact of layer number, layer similarity, and average node degree on the efficiency of information spreading, and theoretically prove our results. Another observation is that multiplex network structure can improve network connectivity. Simulation results are provided to support and complement theoretical analysis.
{"title":"On information spreading in multiplex networks with gossip mechanism","authors":"Yufan Huang, H. Dai","doi":"10.1109/ICC.2017.7997367","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997367","url":null,"abstract":"In this work, we investigate information spreading in multiplex networks, adopting the gossip (random-walk) based model. Two key features of multiplex networks allow potentially much faster information spreading: availability of multiple channels and communication actions for each user, and more choices on neighbor contacting. As a first work in this area, we explore the impact of layer number, layer similarity, and average node degree on the efficiency of information spreading, and theoretically prove our results. Another observation is that multiplex network structure can improve network connectivity. Simulation results are provided to support and complement theoretical analysis.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"25 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82042682","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
扫码关注我们
求助内容：
应助结果提醒方式：