Rugui Yao, Lukun Yao, Xiaoya Zuo, Nan Qi, Yinsheng Liu, Juan Xu
{"title":"Secrecy Energy Efficiency Maximization in a NOMA System","authors":"Rugui Yao, Lukun Yao, Xiaoya Zuo, Nan Qi, Yinsheng Liu, Juan Xu","doi":"10.1109/ICCSN.2019.8905336","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905336","url":null,"abstract":"In this paper, for the downlink of a non-orthogonal multiple access (NOMA) system, the power allocation scheme is proposed for the legitimate users. Attaching importance to the physical layer security and the green requirements of 5G, the secrecy energy efficiency (SEE) has first been defined. Then, we formulate an optimization problem, where each user's power allocation factor and total power allocation factor are determined. For reducing the computational complexity, we decouple the optimization problem into two concatenate subproblems and solve them one by one. Finally, some numerical results are presented to validate our proposed power allocation algorithm.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134189139","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":"An Efficient VNF Deployment Scheme for Cloud Networks","authors":"Jianguo Fu, Guanglei Li","doi":"10.1109/ICCSN.2019.8905349","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905349","url":null,"abstract":"With maturity of cloud network technologies and rapid development of NFV (Network Function Virtualization), the research on NFV based on cloud technologies has gradually increased in academics and industry, aiming to improve scalability, flexibility, and cost-efficiency of network service provision systems. A key challenge of NFV is how to design a cost-effective VNF (Virtualized Network Function) deployment scheme. Most of the existing schemes deploy VNF based on resources requested by users and ignore optimizations during the running time, which causes low capacity utilization. Therefore, we propose an efficient VNF deployment scheme in this paper, which has two parts: over-deployment and automatic migration to improve resource utilization rate and guarantee on-demand capacity provisioning at the same time. The over-deployment approach takes advantage of the characteristic that resources actually used by VNFs are mostly less than the resources requested and deploys VNF based on running load. However, over-deployment may cause PMs (Physical Machines) overloaded at some time, thus, we use the automatic migration approach to solve the overload problem by migrating VNFs. The automatic migration approach moves proper VNFs to lighten the load of overloaded PMs. We perform extensive simulations and numerical results verify benefits of the proposed scheme in terms of the average number of deployed VNFs, active PMs, the rejection rate of VNF requests, and VNF migrations.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129330710","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":"Implementing Randomized Salt on Round Key for Corrected Block Tiny Encryption Algorithm (XXTEA)","authors":"Elbert M. Galas, B. Gerardo","doi":"10.1109/ICCSN.2019.8905270","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905270","url":null,"abstract":"Enhancement of an algorithm is insignificant unless proven. This study implemented a salting algorithm to the round key for the corrected block tiny encryption algorithm otherwise known as XXTEA, to further enhanced its security against known cryptanalysis against it. The enhanced XXTEA (eXXTEA) showcases a 4.97% improvement on the avalanche effect compared to the original algorithm. Moreover, eXXTEA passed all randomness tests identified while the original algorithm failed on the frequency test. It's worth noting that there's a vast difference between the p-value score between those two.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133873960","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":"RSSI Sequence and Vehicle Driving Matrix Based Sybil Nodes Detection in VANET","authors":"Wei Li, Dongmei Zhang","doi":"10.1109/ICCSN.2019.8905261","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905261","url":null,"abstract":"In VANET, Sybil nodes generated by attackers cause serious damages to network protocols, resource allocation mechanisms, and reputation models. Other types of attacks can also be launched on the basis of Sybil attack, which bring more threats to VANET. To solve this problem, this paper proposes a Sybil nodes detection method based on RSSI sequence and vehicle driving matrix - RSDM. RSDM evaluates the difference between the RSSI sequence and the driving matrix by dynamic distance matching to detect Sybil nodes. Moreover, RSDM does not rely on VANET infrastructure, neighbor nodes or specific hardware. The experimental results show that RSDM performs well with a higher detection rate and a lower error rate.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133171232","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":"Design of a Network Coding Concurrent Multipath Transmission Algorithm in Complex Mobile Environment","authors":"Beidi Liu, Ping Dong, Yuyang Zhang","doi":"10.1109/ICCSN.2019.8905369","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905369","url":null,"abstract":"Aiming at the problem of poor network performance in complex mobile environments, this paper proposes a concurrent multipath transmission algorithm based on network coding. This algorithm proposes a multipath concurrent transmission architecture based on multiple 3G/4G networks. In order to overcome the impact of heterogeneity between links, a transmission mechanism based on network coding is proposed. This mechanism utilizes the redundancy of network coding to reduce the impact of timeout retransmission caused by link loss. In addition, the mechanism utilizes a data scheduling algorithm to achieve the goal of increasing network throughput. The simulation results show that the scheme can effectively improve the throughput of network transmission in a complex mobile environment.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121263804","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}
Na Su, Xiaowei Tu, Qinghua Yang, Xuhui Li, Y. Tong
{"title":"Design of Data Communication and Monitoring System Based on Aviation ARINC825 Bus","authors":"Na Su, Xiaowei Tu, Qinghua Yang, Xuhui Li, Y. Tong","doi":"10.1109/ICCSN.2019.8905363","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905363","url":null,"abstract":"According to the requirement of real-time acquisition and monitoring on aeronautical radio incorporated (ARINC) 825 bus multi-channel data and simultaneous information analysis of aircraft parameter information, the author have designed a remote data communication and monitoring system of ARINC825 bus based on LabView software platform of national instrument(NI), which performs the display and storage of the ARINC825 data of multiple different channels in real time, and the interpretation of the data from the original code to the physical meaning of the aircraft through the defined communication protocol. The experimental results show that the system can realize high-reliability data transmission and information sharing between multi-electronic devices as well as multiple systems on the ARINC825 bus, which can parse the data accurately and efficiently and acquire static and dynamic aircraft parameter information. The system has good scalability and versatility.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122734365","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":"K-Means Clustering Analysis Based on Adaptive Weights for Malicious Code Detection","authors":"Sun Haoliang, Wang Dawei, Zhang Ying","doi":"10.1109/ICCSN.2019.8905286","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905286","url":null,"abstract":"Nowadays, a major challenge to network security is malicious codes. However, manual extraction of features is one of the characteristics of traditional detection techniques, which is inefficient. On the other hand, the features of the content and behavior of the malicious codes are easy to change, resulting in more inefficiency of the traditional techniques. In this paper, a K-Means Clustering Analysis is proposed based on Adaptive Weights (AW-MMKM). Identifying malicious codes in the proposed method is based on four types of network behavior that can be extracted from network traffic, including active, fault, network scanning, and page behaviors. The experimental results indicate that the AW-MMKM can detect malicious codes efficiently with higher accuracy.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125991223","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":"SHANZ Algorithm for QoE Enhancement of HTTP Based Adaptive Video Streaming","authors":"Shahid Nabi, M. U. Farooq, Farhan Hussain","doi":"10.1109/ICCSN.2019.8905278","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905278","url":null,"abstract":"In the last decade, there has been an exponential increase in the video traffic over the internet. Social Medias are becoming one of the main sources of live and on-demand video streaming content. With ever-increasing demand of online video streaming services on heterogeneous platforms, new research challenges are arising day by day. Some of the main challenges online video streaming services face are instability of the video, large start-up delay, high video latency, and lesser adaptability of the algorithm. Most of the existing video service providers fail to maintain a balance between stability and efficiency of their algorithm in unstable network conditions. We have proposed a dynamic rate adaptation algorithm with feedback control mechanism and adaptive step up function, which acts as an explicit knob to maintain a balance between stability and efficiency of the algorithm, even in drastic network conditions. Moreover, we have used Randomized download delay to overcome bandwidth overestimation problem occurred in multiple clients. We have simulated our algorithm using ns-3 and compared our results with FESTIVE, PANDA and AAASH algorithms in using multiple test cases. The results demonstrate that our proposed algorithm outperforms other algorithms by achieving higher Quality of Experience.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126121380","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":"Two Design Schemes for LT Codes Degree Distribution by Combining Degree Distribution","authors":"Cong Liu, W. Fei, Sheng Hu","doi":"10.1109/ICCSN.2019.8905331","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905331","url":null,"abstract":"With the rapid development of communication technology and the Internet, digital fountain codes have become a hot topic in many fields. Degree distribution is a key factor affecting the performance of fountain codes. Traditional single degree distribution, such as Ideal Soliton Distribution, Robust Soliton Distribution, and Binary Exponential Distribution cannot satisfy the request of increasing multimedia applications due to their obvious performance defects. So designing a superior performance degree distribution is a challenging task. In this paper, we ought to investigate this challenging issue by presenting two new schemes of degree distribution based on Poisson distribution, Ideal Soliton Distribution and Moved-Robust Soliton Distribution with single-scale coefficient and double-scale coefficient. The simulation results show that the two schemes we proposed have greatly improved in terms of bit error rate, decoding overhead and the ratio of decoding success compared with the known single degree distribution and initial single-scale coefficient combined degree distribution.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"698 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116964370","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":"Security Enhancement of D2D Communication Based on Handshaking Mechanism","authors":"Md. Monjurul Islam, Zhongshan Zhang","doi":"10.1109/ICCSN.2019.8905280","DOIUrl":"https://doi.org/10.1109/ICCSN.2019.8905280","url":null,"abstract":"Device-to-device (D2D) communication is such a paradigm that appears to be a sustainable alleviation for the existing cellular network as the existing network struggling to accommodate the excessive amount of data demand for the cellular users due to the scarcity of the wireless resources. Security threats are the critical impediment to achieve the purpose of the D2D communication as attackers may easily intercept the wireless communication link due to the vulnerable attribute of the wireless communication channel and its broadcasting nature which degrades the performance of the D2D communication. The highest possible security steps need to take into account to upgrade the performance of the D2D communication. In D2D communication, the network layer is the vital layer as data routing and transmission are performed throughout this layer and attackers constantly attempts to affect the transmitted data through this layer. In this paper, we propose three ways secure handshaking mechanism to emphasize the security of the D2D communication by ensuring the secure transmission channel between two users, authenticating the users and encrypting the transmitted data. Thus, the propose handshaking mechanism minimizes security threats and maximizes the performance of D2D communication.","PeriodicalId":330766,"journal":{"name":"2019 IEEE 11th International Conference on Communication Software and Networks (ICCSN)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124011354","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}