Pub Date : 2016-02-15DOI: 10.1109/ICCNC.2016.7440627
Angelos K. Marnerides, A. Mauthe
Botnets compose a major source of malicious activity over a network and their early identification and detection is considered as a top priority by security experts. The majority of botmasters rely heavily on a scan procedure in order to detect vulnerable hosts and establish their botnets via a command and control (C&C) server. In this paper we examine the statistical characteristics of the scan process invoked by the Mariposa and Zeus botnets and demonstrate the applicability of conditional entropy as a robust metric for profiling it using real pre-captured operational data. Our analysis conducted on real datasets demonstrates that the distributional behaviour of conditional entropy for Mariposa and Zeus-related scan flows differs significantly from flows manifested by the commonly used NMAP scans. In contrast with the typically used by attackers Stealth and Connect NMAP scans, we show that consecutive scanning flows initiated by the C&C servers of the examined botnets exhibit a high dependency between themselves in regards of their conditional entropy. Thus, we argue that the observation of such scan flows under our proposed scheme can sufficiently aid network security experts towards the adequate profiling and early identification of botnet activity.
{"title":"Analysis and characterisation of botnet scan traffic","authors":"Angelos K. Marnerides, A. Mauthe","doi":"10.1109/ICCNC.2016.7440627","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440627","url":null,"abstract":"Botnets compose a major source of malicious activity over a network and their early identification and detection is considered as a top priority by security experts. The majority of botmasters rely heavily on a scan procedure in order to detect vulnerable hosts and establish their botnets via a command and control (C&C) server. In this paper we examine the statistical characteristics of the scan process invoked by the Mariposa and Zeus botnets and demonstrate the applicability of conditional entropy as a robust metric for profiling it using real pre-captured operational data. Our analysis conducted on real datasets demonstrates that the distributional behaviour of conditional entropy for Mariposa and Zeus-related scan flows differs significantly from flows manifested by the commonly used NMAP scans. In contrast with the typically used by attackers Stealth and Connect NMAP scans, we show that consecutive scanning flows initiated by the C&C servers of the examined botnets exhibit a high dependency between themselves in regards of their conditional entropy. Thus, we argue that the observation of such scan flows under our proposed scheme can sufficiently aid network security experts towards the adequate profiling and early identification of botnet activity.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115681792","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 : 2016-02-15DOI: 10.1109/ICCNC.2016.7440592
Shuangshuang Han, Kai Zhao, Liuqing Yang, Xiang Cheng
Multi-input multi-output (MEMO) has been a promising technique for wireless communication areas, such as intelligent transportation systems. In this paper, we present performance evaluation of a multi-antenna transceiver for Wireless Access in Vehicular Environments (WAVE) according to IEEE 802.11p standard. Herein, MIMO WAVE is performed by employing three MIMO schemes, namely, Alamouti, vertical BLAST (V-BLAST) and space shift keying (SSK) scheme. The above three MIMO schemes are discussed and compared, considering the influence of different driving velocity and with/without line of sight (LOS) on the system performance. Based on the analysis and simulation results, it can be found that compared with single antenna systems, V-BLAST scheme would significantly increase the transmission data rate, while Alamouti and SSK scheme could improve the reliability and robustness even under poor receive conditions.
{"title":"Performance evaluation for multi-antenna vehicular communication based on IEEE 802.11p standard","authors":"Shuangshuang Han, Kai Zhao, Liuqing Yang, Xiang Cheng","doi":"10.1109/ICCNC.2016.7440592","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440592","url":null,"abstract":"Multi-input multi-output (MEMO) has been a promising technique for wireless communication areas, such as intelligent transportation systems. In this paper, we present performance evaluation of a multi-antenna transceiver for Wireless Access in Vehicular Environments (WAVE) according to IEEE 802.11p standard. Herein, MIMO WAVE is performed by employing three MIMO schemes, namely, Alamouti, vertical BLAST (V-BLAST) and space shift keying (SSK) scheme. The above three MIMO schemes are discussed and compared, considering the influence of different driving velocity and with/without line of sight (LOS) on the system performance. Based on the analysis and simulation results, it can be found that compared with single antenna systems, V-BLAST scheme would significantly increase the transmission data rate, while Alamouti and SSK scheme could improve the reliability and robustness even under poor receive conditions.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133564717","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440608
S. Bettadapura, A. Beex
Time-delay estimation (TDE) sensors can be used to effectively locate a transmitting source. Our aim is to use distributed TDE sensors that are relatively inexpensive. The latter is the result of two constraints: a single analog to digital converter is used for sampling the sum of two sensor output signals, and the sampling interval is substantially larger than the practically required time delay resolution. This approach leads to the requirement for sub-sample interval delay estimation from overlapping different echoes of a received signal. No specific a priori assumptions are made regarding the nature of the received signal. We adapt the time-frequency ratio of mixtures (TFRM) approach for blind source separation for our TDE sensor. Our experimental set-up consists of two microphones placed at non-equal distances from an acoustic source. The TDEs are then used for source localization.
{"title":"Echo decomposition based time delay sensor with sub-sample resolution","authors":"S. Bettadapura, A. Beex","doi":"10.1109/ICCNC.2016.7440608","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440608","url":null,"abstract":"Time-delay estimation (TDE) sensors can be used to effectively locate a transmitting source. Our aim is to use distributed TDE sensors that are relatively inexpensive. The latter is the result of two constraints: a single analog to digital converter is used for sampling the sum of two sensor output signals, and the sampling interval is substantially larger than the practically required time delay resolution. This approach leads to the requirement for sub-sample interval delay estimation from overlapping different echoes of a received signal. No specific a priori assumptions are made regarding the nature of the received signal. We adapt the time-frequency ratio of mixtures (TFRM) approach for blind source separation for our TDE sensor. Our experimental set-up consists of two microphones placed at non-equal distances from an acoustic source. The TDEs are then used for source localization.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117235802","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440666
Jeffery Gouge, A. Seetharam, Swapnoneel Roy
With the exponential growth of content, the Internet is undergoing a transformation from a host-centric approach to a content-centric one, popularly known as an Information Centric Networks (ICN). ICN aims to improve user performance by incorporating in-network caching at storage enabled nodes. In this paper, we explore the scalability and effectiveness of a targeted denial of service attack (DoS) designed for ICN [1]. In this attack, malicious nodes periodically request unpopular content, thereby replacing popular content in the caches enroute to the custodian with unpopular ones. The intuition behind this attack is that legitimate requests for the evicted content cannot be served from enroute caches and have to be forwarded towards the custodian, thus degrading user performance. Our goal in this paper is not to propose a sophisticated attack, but to investigate the scalability and potency of this brute force attack in ICN. By performing exhaustive and rigorous experimentation on realistic Internet topologies, and by exploring a wide range of simulation parameters we observe the following: (i) this attack is moderately successful in small scale networks comprising of less than 100 nodes, (ii) the potency of the attack rapidly decreases, and becomes ineffective as the network size increases to few thousand nodes, and (iii) the attack is more effective against a FIFO caching policy in comparison to LRU. Our results demonstrate that if the entire Internet or large MANETs are transformed into an ICN, this attack is likely to be unsuccessful.
{"title":"On the scalability and effectiveness of a cache pollution based DoS attack in information centric networks","authors":"Jeffery Gouge, A. Seetharam, Swapnoneel Roy","doi":"10.1109/ICCNC.2016.7440666","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440666","url":null,"abstract":"With the exponential growth of content, the Internet is undergoing a transformation from a host-centric approach to a content-centric one, popularly known as an Information Centric Networks (ICN). ICN aims to improve user performance by incorporating in-network caching at storage enabled nodes. In this paper, we explore the scalability and effectiveness of a targeted denial of service attack (DoS) designed for ICN [1]. In this attack, malicious nodes periodically request unpopular content, thereby replacing popular content in the caches enroute to the custodian with unpopular ones. The intuition behind this attack is that legitimate requests for the evicted content cannot be served from enroute caches and have to be forwarded towards the custodian, thus degrading user performance. Our goal in this paper is not to propose a sophisticated attack, but to investigate the scalability and potency of this brute force attack in ICN. By performing exhaustive and rigorous experimentation on realistic Internet topologies, and by exploring a wide range of simulation parameters we observe the following: (i) this attack is moderately successful in small scale networks comprising of less than 100 nodes, (ii) the potency of the attack rapidly decreases, and becomes ineffective as the network size increases to few thousand nodes, and (iii) the attack is more effective against a FIFO caching policy in comparison to LRU. Our results demonstrate that if the entire Internet or large MANETs are transformed into an ICN, this attack is likely to be unsuccessful.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088892","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440639
Spyros Boukoros, Athina Kalampogia, P. Koutsakis
E-mail has become a de-facto means of communication. Mail servers try to manage the explosive growth of e-mail usage and offer users good quality of service, while spam e-mails are expected to account for 90% of the e-mail traffic. The exceedingly heavy workload can lead to the replacement of existing e-mail servers due to their inability to cope with performance standards and storing capacity. In this study, we focus on modeling the workload of the email servers of a medium-sized Greek university, for all types of traffic (user and system e-mails, as well as spam). We collected a vast amount of e-mail logs with high variations in terms of size and volume over time. We tested some of the most popular distributions for workload characterization and used powerful statistical tests to evaluate our findings. Interestingly we come to different conclusions in comparison with previous works in the field. Our work indicates that, with the exception of some outliers, campus email traffic can be modeled and predicted quite accurately.
{"title":"A new highly accurate workload model for campus email traffic","authors":"Spyros Boukoros, Athina Kalampogia, P. Koutsakis","doi":"10.1109/ICCNC.2016.7440639","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440639","url":null,"abstract":"E-mail has become a de-facto means of communication. Mail servers try to manage the explosive growth of e-mail usage and offer users good quality of service, while spam e-mails are expected to account for 90% of the e-mail traffic. The exceedingly heavy workload can lead to the replacement of existing e-mail servers due to their inability to cope with performance standards and storing capacity. In this study, we focus on modeling the workload of the email servers of a medium-sized Greek university, for all types of traffic (user and system e-mails, as well as spam). We collected a vast amount of e-mail logs with high variations in terms of size and volume over time. We tested some of the most popular distributions for workload characterization and used powerful statistical tests to evaluate our findings. Interestingly we come to different conclusions in comparison with previous works in the field. Our work indicates that, with the exception of some outliers, campus email traffic can be modeled and predicted quite accurately.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116042052","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440574
Bitan Bandyopadhyay, A. Seetharam, A. Mukherjee, M. K. Naskar
Information centric networking (ICN) aims to transform today's Internet from a host-centric model to a content-centric one by caching content internally within the network at storage-enabled nodes. Recently, multiple routing and cache management strategies have been proposed [1]-[6] to improve the user-level performance (e.g., content-download latency) in ICN. In this paper, we propose a simple routing strategy that leverages the concept of characteristic time to improve content-download latency. Characteristic time for a content in a cache indicates the amount of time in future a recently accessed content is likely to remain in that cache. Our proposed algorithm (CTR) uses characteristic time information to forward requests to caches where the content is likely to be found. CTR augments native routing strategies (e.g., Dijkstra's algorithm), works with existing cache management policies and thus can be implemented in ICN prototypes with minimal effort. We perform exhaustive simulations using realistic Internet topologies (e.g., GEANT, WIDE, TISCALI, ROCKETFUEL [7]) and demonstrate that the CTR algorithm provides approximately 10-50% improvement in latency over state-of-the-art routing and caching management strategies for ICN for a wide range of simulation parameters.
{"title":"Characteristic time based routing in information centric networks","authors":"Bitan Bandyopadhyay, A. Seetharam, A. Mukherjee, M. K. Naskar","doi":"10.1109/ICCNC.2016.7440574","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440574","url":null,"abstract":"Information centric networking (ICN) aims to transform today's Internet from a host-centric model to a content-centric one by caching content internally within the network at storage-enabled nodes. Recently, multiple routing and cache management strategies have been proposed [1]-[6] to improve the user-level performance (e.g., content-download latency) in ICN. In this paper, we propose a simple routing strategy that leverages the concept of characteristic time to improve content-download latency. Characteristic time for a content in a cache indicates the amount of time in future a recently accessed content is likely to remain in that cache. Our proposed algorithm (CTR) uses characteristic time information to forward requests to caches where the content is likely to be found. CTR augments native routing strategies (e.g., Dijkstra's algorithm), works with existing cache management policies and thus can be implemented in ICN prototypes with minimal effort. We perform exhaustive simulations using realistic Internet topologies (e.g., GEANT, WIDE, TISCALI, ROCKETFUEL [7]) and demonstrate that the CTR algorithm provides approximately 10-50% improvement in latency over state-of-the-art routing and caching management strategies for ICN for a wide range of simulation parameters.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116576223","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440681
Yizirui Zhou, Anfu Zhou, Min Liu
In multiuser MIMO (MU-MIMO) networks, different users can transmit packets to the AP concurrently, thereby network capacity could be significantly improved. Previous works, using the conventional user selection schemes, have shown the promise of MU-MIMO in practical WLANs. However, we find that, to harness the full potential of MU-MIMO, an optimal user selection scheme is required. In this paper, we formulate the user selection problem in MU-MIMO as a discrete constrained optimization problem, and by decomposing and solving this problem, we design an optimal selection scheme called OUS. OUS efficiently allocates network resources so as to improve both the overall throughput of a network and fairness among users. We conduct extensive simulations to evaluate performance of OUS, and the simulation results show that compared with previous works, OUS improves the overall throughput by 40% and improves the fairness by 30% in most cases.
{"title":"OUS: Optimal user selection in MU-MIMO WLAN","authors":"Yizirui Zhou, Anfu Zhou, Min Liu","doi":"10.1109/ICCNC.2016.7440681","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440681","url":null,"abstract":"In multiuser MIMO (MU-MIMO) networks, different users can transmit packets to the AP concurrently, thereby network capacity could be significantly improved. Previous works, using the conventional user selection schemes, have shown the promise of MU-MIMO in practical WLANs. However, we find that, to harness the full potential of MU-MIMO, an optimal user selection scheme is required. In this paper, we formulate the user selection problem in MU-MIMO as a discrete constrained optimization problem, and by decomposing and solving this problem, we design an optimal selection scheme called OUS. OUS efficiently allocates network resources so as to improve both the overall throughput of a network and fairness among users. We conduct extensive simulations to evaluate performance of OUS, and the simulation results show that compared with previous works, OUS improves the overall throughput by 40% and improves the fairness by 30% in most cases.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124696906","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440648
Mingming Guo, N. Pissinou, S. S. Iyengar
Multiple sensors with different functions on sensor-enabled devices on a mobile vehicle are generating large amount of data in real time which consists of a vehicular user's instant context. Context-aware services and applications utilize users' contexts to provide personalized services in return. However, most of the context-aware applications are selfish and very curious of users' sensitive information. In this work, we propose a framework for privacy preserving mobile sensing by caching on mobile vehicles. The framework combines a context releasing component with sensitive data caching capability to achieve strong contextual privacy for mobile vehicles. The main strength of our approach is to improve the privacy level by data caching for sensitive contexts as well as the quality of query results. Finally, we conduct simulations to evaluate our framework for effectiveness and efficiency.
{"title":"Privacy-aware mobile sensing in vehicular networks","authors":"Mingming Guo, N. Pissinou, S. S. Iyengar","doi":"10.1109/ICCNC.2016.7440648","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440648","url":null,"abstract":"Multiple sensors with different functions on sensor-enabled devices on a mobile vehicle are generating large amount of data in real time which consists of a vehicular user's instant context. Context-aware services and applications utilize users' contexts to provide personalized services in return. However, most of the context-aware applications are selfish and very curious of users' sensitive information. In this work, we propose a framework for privacy preserving mobile sensing by caching on mobile vehicles. The framework combines a context releasing component with sensitive data caching capability to achieve strong contextual privacy for mobile vehicles. The main strength of our approach is to improve the privacy level by data caching for sensitive contexts as well as the quality of query results. Finally, we conduct simulations to evaluate our framework for effectiveness and efficiency.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130377277","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440661
Chun-Hao Liu, D. Cabric
Current WiFi systems based on the IEEE 802.11 standard apply carrier sense multiple access with collision avoidance (CSMA/CA) to prevent users from transmitting simultaneously on the same channel. However, due to its random backoff nature, CSMA/CA does not perform well if the number of users is large. In this paper, we first measure traffic statistics, i.e., average ON/OFF periods and duty cycle, on the IEEE 802.11(ac) WLAN channel. Then we exploit the estimated duty cycle to design two functions, i.e., arctangent and Weibull functions, to adapt backoff parameters in CSMA/CA. For these two proposed functions, the backoff parameters initially increase as the estimated duty cycle increases, but they finally saturate and decrease respectively. The simulations show our proposed backoff functions outperform the conventional scheme using constant backoff parameters in terms of throughput performance.
目前基于IEEE 802.11标准的WiFi系统采用载波感知多址防碰撞(carrier sense multiple access with collision avoidance, CSMA/CA)来防止用户在同一信道上同时传输。然而，由于其随机回退性质，如果用户数量很大，CSMA/CA表现不佳。在本文中，我们首先测量了IEEE 802.11(ac) WLAN信道上的流量统计数据，即平均开/关周期和占空比。然后利用估计占空比设计两个函数，即反正切函数和威布尔函数，以适应CSMA/CA中的回退参数。对于这两种提出的函数，随着估计占空比的增加，退退参数开始增加，但最终分别趋于饱和和减小。仿真结果表明，我们提出的回退函数在吞吐量性能方面优于使用恒定回退参数的传统方案。
{"title":"Traffic-aware backoff design for IEEE 802.11(ac)","authors":"Chun-Hao Liu, D. Cabric","doi":"10.1109/ICCNC.2016.7440661","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440661","url":null,"abstract":"Current WiFi systems based on the IEEE 802.11 standard apply carrier sense multiple access with collision avoidance (CSMA/CA) to prevent users from transmitting simultaneously on the same channel. However, due to its random backoff nature, CSMA/CA does not perform well if the number of users is large. In this paper, we first measure traffic statistics, i.e., average ON/OFF periods and duty cycle, on the IEEE 802.11(ac) WLAN channel. Then we exploit the estimated duty cycle to design two functions, i.e., arctangent and Weibull functions, to adapt backoff parameters in CSMA/CA. For these two proposed functions, the backoff parameters initially increase as the estimated duty cycle increases, but they finally saturate and decrease respectively. The simulations show our proposed backoff functions outperform the conventional scheme using constant backoff parameters in terms of throughput performance.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121467402","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440616
P. Kou, Xiaohui Li, Ruohan Guo, Y. Hei
Antenna selection and power optimization are low-cost low-complexity alternative methods to capture many of the advantages of massive MIMO systems. However, the computation complexity of antenna selection and power optimization grows rapidly with the number of antennas. Aiming at this problem, we derive an ergodic expression of energy efficiency for massive MIMO systems. And on the basis of it, we present a joint antenna selection and power optimization algorithm. To solve the joint optimization algorithm, the fractional programming is introduced to accelerate the convergence speed. Moreover, the user selection is considered to get the maximum ergodic energy efficiency. The simulation results show that the proposed algorithm can achieve nearly optimal energy efficiency with low computation complexity and fast convergence speed.
{"title":"Ergodic capacity-based energy optimization algorithm in massive MIMO systems","authors":"P. Kou, Xiaohui Li, Ruohan Guo, Y. Hei","doi":"10.1109/ICCNC.2016.7440616","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440616","url":null,"abstract":"Antenna selection and power optimization are low-cost low-complexity alternative methods to capture many of the advantages of massive MIMO systems. However, the computation complexity of antenna selection and power optimization grows rapidly with the number of antennas. Aiming at this problem, we derive an ergodic expression of energy efficiency for massive MIMO systems. And on the basis of it, we present a joint antenna selection and power optimization algorithm. To solve the joint optimization algorithm, the fractional programming is introduced to accelerate the convergence speed. Moreover, the user selection is considered to get the maximum ergodic energy efficiency. The simulation results show that the proposed algorithm can achieve nearly optimal energy efficiency with low computation complexity and fast convergence speed.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124527389","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
扫码关注我们
求助内容：
应助结果提醒方式：