Pub Date : 2018-04-23DOI: 10.1109/NOMS.2018.8406304
Yang Yang, He Li, Xue-song Qiu, Shaoyong Guo, XiaoXiao Zeng, Kangting Zhao, Haoran Xin
In order to reduce the cost and energy consumption in wireless sensor network's charging process, this paper proposes a Recharging Scheme based on Lifetime Prediction (RSLP) for wireless rechargeable sensor networks. First of all, based on the historical quantity of electricity variation sequence of the sensor nodes, the lifetime prediction scheme of the sensor nodes is established; and then, considering the sensor nodes need to be recharged and the Sink nodes chosen by the mobile charger (MC) according to the charging value to establish an undirected complete diagram. A Hamilton charging circuit is established by using the Gene-Expressive cuckoo algorithm to solve the charging problem of the rechargeable sensor networks. The simulation experiments show that the proposed algorithm can improve charging efficiency and reduce the mobile energy consumption.
{"title":"Research on lifetime prediction-based recharging scheme in rechargeable WSNs","authors":"Yang Yang, He Li, Xue-song Qiu, Shaoyong Guo, XiaoXiao Zeng, Kangting Zhao, Haoran Xin","doi":"10.1109/NOMS.2018.8406304","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406304","url":null,"abstract":"In order to reduce the cost and energy consumption in wireless sensor network's charging process, this paper proposes a Recharging Scheme based on Lifetime Prediction (RSLP) for wireless rechargeable sensor networks. First of all, based on the historical quantity of electricity variation sequence of the sensor nodes, the lifetime prediction scheme of the sensor nodes is established; and then, considering the sensor nodes need to be recharged and the Sink nodes chosen by the mobile charger (MC) according to the charging value to establish an undirected complete diagram. A Hamilton charging circuit is established by using the Gene-Expressive cuckoo algorithm to solve the charging problem of the rechargeable sensor networks. The simulation experiments show that the proposed algorithm can improve charging efficiency and reduce the mobile energy consumption.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"1 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83323924","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406318
Faisal S. Alsubaei, Abdullah Abuhussein, S. Shiva
As the Internet of things continues to mature, there has been a wide and rapid adoption of Internet of things solutions in many domains. However, the security and privacy of these solutions are often underrated. The lack of security and privacy in the solutions can lead to catastrophic results, especially in sensitive domains like healthcare. Therefore, it is imperative to ensure their security and privacy. Stakeholders often find themselves unguided when assessing the security and privacy of the solutions. This paper proposes a framework to quantitatively assess and compare the security and privacy in Internet of things solutions using Analytic Hierarchy Process. It also provides in-depth security and privacy assessment criteria to enhance security and privacy in the Internet of things solutions. This work aims to fill the gap between consumers and providers by promoting transparency and increasing the security awareness.
{"title":"Quantifying security and privacy in Internet of Things solutions","authors":"Faisal S. Alsubaei, Abdullah Abuhussein, S. Shiva","doi":"10.1109/NOMS.2018.8406318","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406318","url":null,"abstract":"As the Internet of things continues to mature, there has been a wide and rapid adoption of Internet of things solutions in many domains. However, the security and privacy of these solutions are often underrated. The lack of security and privacy in the solutions can lead to catastrophic results, especially in sensitive domains like healthcare. Therefore, it is imperative to ensure their security and privacy. Stakeholders often find themselves unguided when assessing the security and privacy of the solutions. This paper proposes a framework to quantitatively assess and compare the security and privacy in Internet of things solutions using Analytic Hierarchy Process. It also provides in-depth security and privacy assessment criteria to enhance security and privacy in the Internet of things solutions. This work aims to fill the gap between consumers and providers by promoting transparency and increasing the security awareness.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"45 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88092594","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406306
Jiwon Bang, Siwoon Son, Hajin Kim, Yang-Sae Moon, Mi-Jung Choi
Real-time data stream processing technologies such as Apache Storm and Apache Spark are being actively studied to deal with large-capacity data streams that generated rapidly in real time. Because it is difficult to use most real-time processing techniques alone, it is common to use it with a messaging system that supports input and output of data streams. Apache Kafka is a representative distributed messaging system, specialized in delivering large amounts of real-time log data. However, if the production rate of data in Kafka is faster than the consumption rate, data starvation problem may arise. In order to solve the starvation problem, a load shedding technique is needed to limit the incoming data and maintain system performance when the system is under load. Thus, in this paper confirmed the starvation problem that can occur in Kafka, and we designed and implemented a load shedding engine to solve this problem and proposed a solution to the starvation problem in Kafka based on the performance experiment.
{"title":"Design and implementation of a load shedding engine for solving starvation problems in Apache Kafka","authors":"Jiwon Bang, Siwoon Son, Hajin Kim, Yang-Sae Moon, Mi-Jung Choi","doi":"10.1109/NOMS.2018.8406306","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406306","url":null,"abstract":"Real-time data stream processing technologies such as Apache Storm and Apache Spark are being actively studied to deal with large-capacity data streams that generated rapidly in real time. Because it is difficult to use most real-time processing techniques alone, it is common to use it with a messaging system that supports input and output of data streams. Apache Kafka is a representative distributed messaging system, specialized in delivering large amounts of real-time log data. However, if the production rate of data in Kafka is faster than the consumption rate, data starvation problem may arise. In order to solve the starvation problem, a load shedding technique is needed to limit the incoming data and maintain system performance when the system is under load. Thus, in this paper confirmed the starvation problem that can occur in Kafka, and we designed and implemented a load shedding engine to solve this problem and proposed a solution to the starvation problem in Kafka based on the performance experiment.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"14 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76477537","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406292
Xiang Zhang, F. Zhou, Jiayi Ning, Peng Yu, Wenjing Li
With the proliferation of bandwidth-demanding mobile applications in the era of 5G, the aggregation of a few users may lead to extremely high load in cellular base stations, producing traffic hotspot in wireless networks. Therefore the higher requirement is imposed on the flexibility of a 5G network, namely the capability of performing rapid capacity enhancement in hotspot area, which makes hotspot localization and critical prediction functions. In this paper, we proposed to localize hotspots with Gaussian Random Field (GRF)-based spatial traffic density model deduced from load data of base stations, together with the prediction with Holt-Winters. We measured the spatial traffic in a specific area within a short time span and forecasted the spatial traffic density distribution. Numeric results show the proposed approach can localize hotspot efficiently, and during traffic peak hours, hotspot prediction is of high success rate.
随着5G时代对带宽要求较高的移动应用的激增，少量用户的聚集可能会导致蜂窝基站的负载极高，在无线网络中产生流量热点。因此对5G网络的灵活性提出了更高的要求，即在热点区域进行快速扩容的能力，从而实现热点定位和关键预测功能。本文提出了基于高斯随机场(Gaussian Random Field, GRF)的空间交通密度模型，并结合Holt-Winters预测方法对热点区域进行定位。对某一特定区域在短时间内的空间交通流量进行测量，并对空间交通密度分布进行预测。数值结果表明，该方法能有效地定位热点，在交通高峰时段，热点预测成功率高。
{"title":"Hotspot localization and prediction in wireless cellular networks via spatial traffic fitting","authors":"Xiang Zhang, F. Zhou, Jiayi Ning, Peng Yu, Wenjing Li","doi":"10.1109/NOMS.2018.8406292","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406292","url":null,"abstract":"With the proliferation of bandwidth-demanding mobile applications in the era of 5G, the aggregation of a few users may lead to extremely high load in cellular base stations, producing traffic hotspot in wireless networks. Therefore the higher requirement is imposed on the flexibility of a 5G network, namely the capability of performing rapid capacity enhancement in hotspot area, which makes hotspot localization and critical prediction functions. In this paper, we proposed to localize hotspots with Gaussian Random Field (GRF)-based spatial traffic density model deduced from load data of base stations, together with the prediction with Holt-Winters. We measured the spatial traffic in a specific area within a short time span and forecasted the spatial traffic density distribution. Numeric results show the proposed approach can localize hotspot efficiently, and during traffic peak hours, hotspot prediction is of high success rate.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"9 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87619185","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406307
Young-Hoon Goo, Kyu-Seok Shim, Byeong-Min Chae, Myung-Sup Kim
Emergence of high-speed Internet and ubiquitous environment is generating massive traffic, and it has led to a rapid increase of applications and malicious behaviors with various functions. Many of the complex and diverse protocols that occur under these situations, are unknown or proprietary protocols that are at least documented. For efficient network management and network security, protocol reverse engineering that extract the specification of the protocols is very important. While various protocol reverse engineering methods have been studied, there is no single standardized method to extract protocol specification completely yet, and each of methods has some limitations. In this paper, we propose the framework for precise protocol reverse engineering based on network traces. The proposed framework can extract highly elaborative and intuitive message formats, flow formats, and protocol state machine of the unknown protocol. We demonstrate the validity of our framework through an example of HTTP protocol.
{"title":"Framework for precise protocol reverse engineering based on network traces","authors":"Young-Hoon Goo, Kyu-Seok Shim, Byeong-Min Chae, Myung-Sup Kim","doi":"10.1109/NOMS.2018.8406307","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406307","url":null,"abstract":"Emergence of high-speed Internet and ubiquitous environment is generating massive traffic, and it has led to a rapid increase of applications and malicious behaviors with various functions. Many of the complex and diverse protocols that occur under these situations, are unknown or proprietary protocols that are at least documented. For efficient network management and network security, protocol reverse engineering that extract the specification of the protocols is very important. While various protocol reverse engineering methods have been studied, there is no single standardized method to extract protocol specification completely yet, and each of methods has some limitations. In this paper, we propose the framework for precise protocol reverse engineering based on network traces. The proposed framework can extract highly elaborative and intuitive message formats, flow formats, and protocol state machine of the unknown protocol. We demonstrate the validity of our framework through an example of HTTP protocol.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"20 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87079735","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406196
Song Wang, S. Chandrasekharan, K. Gomez, K. Sithamparanathan, A. Al-Hourani, M. R. Asghar, G. Russello, Paul Zanna
Although the popularity of Software-Defined Networking (SDN) is increasing, it is also vulnerable to security attacks such as Denial of Service (DoS) attacks. Since in SDN, the control plane is isolated from the data plane, DoS attackers can easily target the control plane to impair the network infrastructure in addition to the data plane to degrade the user's Quality of Service (QoS). In our previous work, we introduced SECO, an SDN Secure Controller algorithm to detect and defend SDN against DoS attacks. Simulation results showed that SECO successfully defends SDN networks from DoS attacks. In this paper, we present SDN sEcure COntrol and Data Plane (SECOD), which is an improved version of SECO. Basically, SECOD introduces new triggers to detect and prevent DoS attacks in both control and data planes. Moreover, SECOD is implemented and tested using SDN-based hardware testbed, OpenFlow-based switch, and RYU controller to capture the dynamics of realistic hardware and software. The results show that SECOD successfully detects and effectively mitigates DoS attacks on SDN networks keeping data plane performance at 99.72% compared to a network not under attack.
{"title":"SECOD: SDN sEcure control and data plane algorithm for detecting and defending against DoS attacks","authors":"Song Wang, S. Chandrasekharan, K. Gomez, K. Sithamparanathan, A. Al-Hourani, M. R. Asghar, G. Russello, Paul Zanna","doi":"10.1109/NOMS.2018.8406196","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406196","url":null,"abstract":"Although the popularity of Software-Defined Networking (SDN) is increasing, it is also vulnerable to security attacks such as Denial of Service (DoS) attacks. Since in SDN, the control plane is isolated from the data plane, DoS attackers can easily target the control plane to impair the network infrastructure in addition to the data plane to degrade the user's Quality of Service (QoS). In our previous work, we introduced SECO, an SDN Secure Controller algorithm to detect and defend SDN against DoS attacks. Simulation results showed that SECO successfully defends SDN networks from DoS attacks. In this paper, we present SDN sEcure COntrol and Data Plane (SECOD), which is an improved version of SECO. Basically, SECOD introduces new triggers to detect and prevent DoS attacks in both control and data planes. Moreover, SECOD is implemented and tested using SDN-based hardware testbed, OpenFlow-based switch, and RYU controller to capture the dynamics of realistic hardware and software. The results show that SECOD successfully detects and effectively mitigates DoS attacks on SDN networks keeping data plane performance at 99.72% compared to a network not under attack.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"23 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90081568","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406168
I. Vaishnavi, János Czentye, M. Gharbaoui, Giovanni Giuliani, Dávid Haja, J. Harmatos, Dávid Jocha, Yoonhee Kim, B. Martini, Javier Melian, P. Monti, Balázs Németh, Wint Yi Poe, Aurora Ramos, A. Sgambelluri, Balázs Sonkoly, László Toka, F. Tusa, C. Bernardos, R. Szabó
Supporting end-to-end network slices and services across operators has become an important use case of study for 5G networks as can be seen by 5G use cases published in 3GPP, ETSI as well as NGMN. This paper presents the in- depth architecture, implementation and experiment on a multidomain orchestration framework that is ab le to deploy such multi-operator service as well as monitor the service for SLA compliance. Our implemented architecture allows operators to abstract their sensitive details while exposing the relevant amount of information to support inter-operator slice creation. Our experiment shows that the implemented framework is capable of creating services across operators while fulfilling the respective service requirements.
{"title":"Realizing services and slices across multiple operator domains","authors":"I. Vaishnavi, János Czentye, M. Gharbaoui, Giovanni Giuliani, Dávid Haja, J. Harmatos, Dávid Jocha, Yoonhee Kim, B. Martini, Javier Melian, P. Monti, Balázs Németh, Wint Yi Poe, Aurora Ramos, A. Sgambelluri, Balázs Sonkoly, László Toka, F. Tusa, C. Bernardos, R. Szabó","doi":"10.1109/NOMS.2018.8406168","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406168","url":null,"abstract":"Supporting end-to-end network slices and services across operators has become an important use case of study for 5G networks as can be seen by 5G use cases published in 3GPP, ETSI as well as NGMN. This paper presents the in- depth architecture, implementation and experiment on a multidomain orchestration framework that is ab le to deploy such multi-operator service as well as monitor the service for SLA compliance. Our implemented architecture allows operators to abstract their sensitive details while exposing the relevant amount of information to support inter-operator slice creation. Our experiment shows that the implemented framework is capable of creating services across operators while fulfilling the respective service requirements.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"1 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90921126","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}
We present the first Media-Aware Network Element (MANE) for intelligently streaming scalable video sequences in P4 programming language. Our MANE selectively drops queued scalable video packets when the queue occupancy exceeds a threshold. Three packet discarding logics are implemented: (i) tail, (ii) enhancement-layer, and (iii) rate-distortion optimized. Our P4-based MANE implementation is demonstrated in: (i) larger emulated networks in mininet with P4 software switches and (ii) a small real network with a physical P4 switch and multiple Raspberry Pis running P4 software switches.
{"title":"Streaming scalable video sequences with media-aware network elements implemented in P4 programming language","authors":"Guan-Ru Wang, Chien-Chang Chen, Chao-Wen Chen, Li-Wen Pan, Yu-Rong Wang, Ching-Ling Fan, Cheng-Hsin Hsu","doi":"10.1109/NOMS.2018.8406129","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406129","url":null,"abstract":"We present the first Media-Aware Network Element (MANE) for intelligently streaming scalable video sequences in P4 programming language. Our MANE selectively drops queued scalable video packets when the queue occupancy exceeds a threshold. Three packet discarding logics are implemented: (i) tail, (ii) enhancement-layer, and (iii) rate-distortion optimized. Our P4-based MANE implementation is demonstrated in: (i) larger emulated networks in mininet with P4 software switches and (ii) a small real network with a physical P4 switch and multiple Raspberry Pis running P4 software switches.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"1 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91097078","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406258
D. Harutyunyan, Supreeth Herle, Dimitri Maradin, George Agapiu, R. Riggio
WiFi networks are known to be a cost-efficient traffic offloading solution for mobile networks. The Multi Access Packet Data Network Connectivity is a feature introduced in LTE Release 10 in order to allow users to be simultaneously connected to multiple radio access networks (RAN). Although this feature brings many advantages, such as the possibility to implement QoS-based traffic steering, it poses also many challenges, one of which is distributing traffic among the two radio access technologies. In this paper, we propose a traffic- aware user association algorithm for heterogeneous LTE/WiFi RANs. The proposed algorithm is formulated as an Integer Linear Programming (ILP) problem jointly optimizing user association and resource allocation. A heuristic is also proposed in order to address the scalability issues of the ILP-based algorithm. Numerical simulations are used in order to compare the proposed approaches. Finally, we implemented and tested the heuristic in small-scale testbed using the 5G-EmPOWER platform.
{"title":"Traffic-aware user association in heterogeneous LTE/WiFi radio access networks","authors":"D. Harutyunyan, Supreeth Herle, Dimitri Maradin, George Agapiu, R. Riggio","doi":"10.1109/NOMS.2018.8406258","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406258","url":null,"abstract":"WiFi networks are known to be a cost-efficient traffic offloading solution for mobile networks. The Multi Access Packet Data Network Connectivity is a feature introduced in LTE Release 10 in order to allow users to be simultaneously connected to multiple radio access networks (RAN). Although this feature brings many advantages, such as the possibility to implement QoS-based traffic steering, it poses also many challenges, one of which is distributing traffic among the two radio access technologies. In this paper, we propose a traffic- aware user association algorithm for heterogeneous LTE/WiFi RANs. The proposed algorithm is formulated as an Integer Linear Programming (ILP) problem jointly optimizing user association and resource allocation. A heuristic is also proposed in order to address the scalability issues of the ILP-based algorithm. Numerical simulations are used in order to compare the proposed approaches. Finally, we implemented and tested the heuristic in small-scale testbed using the 5G-EmPOWER platform.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"35 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88643594","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406219
N. Shahin, R. Ali, S. Kim, Young-Tak Kim
This paper proposes an adaptively scaled back-off (ASB) mechanism to mitigate the performance degradations in the Binary Exponential Back-off (BEB) of IEEE 802.11 CSMA/CA in the highly dense environment such as IEEE 802.11ax high efficiency WLAN (HEW). The proposed ASB mechanism selects the optimal CW size to achieve maximized network performance adaptively based on the measured conditional collision probability (pc) and the estimated number of contending stations. The ASB protocol can provide higher efficiency than the legacy Binary Exponential Back-off (BEB) that simply adjust the back-off contention window (CW) size by blind exponential increase at repeated collision avoidance and resetting to the minimum value (CWmin) at successful transmission. The performance analysis of the proposed ASB scheme with ns-3 network simulation shows that the proposed ASB scheme can achieve 21.14% higher throughput and take 32.45% less average interval between successful transmissions than the BEB mechanism in highly dense WLANs with saturated traffic environment.1
{"title":"Adaptively scaled back-off (ASB) mechanism for enhanced performance of CSMA/CA in IEEE 802.11ax high efficiency WLAN","authors":"N. Shahin, R. Ali, S. Kim, Young-Tak Kim","doi":"10.1109/NOMS.2018.8406219","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406219","url":null,"abstract":"This paper proposes an adaptively scaled back-off (ASB) mechanism to mitigate the performance degradations in the Binary Exponential Back-off (BEB) of IEEE 802.11 CSMA/CA in the highly dense environment such as IEEE 802.11ax high efficiency WLAN (HEW). The proposed ASB mechanism selects the optimal CW size to achieve maximized network performance adaptively based on the measured conditional collision probability (pc) and the estimated number of contending stations. The ASB protocol can provide higher efficiency than the legacy Binary Exponential Back-off (BEB) that simply adjust the back-off contention window (CW) size by blind exponential increase at repeated collision avoidance and resetting to the minimum value (CWmin) at successful transmission. The performance analysis of the proposed ASB scheme with ns-3 network simulation shows that the proposed ASB scheme can achieve 21.14% higher throughput and take 32.45% less average interval between successful transmissions than the BEB mechanism in highly dense WLANs with saturated traffic environment.1","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"24 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85977453","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
扫码关注我们
求助内容：
应助结果提醒方式：