Pub Date : 2017-05-21DOI: 10.1109/ICC.2017.7997451
Georgios Bouloukakis, I. Moscholios, N. Georgantas, V. Issarny
Internet of Things (IoT) applications consist of diverse Things (sensors and devices) in terms of hardware resources. Furthermore, such applications are characterized by the Things' mobility and multiple interaction types, such as synchronous, asynchronous, and streaming. Middleware IoT protocols consider the above limitations and support the development of effective applications by providing several Quality of Service (QoS) features. These features aim to enable application developers to tune an application by switching different levels of response times and delivery success rates. However, the profusion of the developed IoT protocols and the intermittent connectivity of mobile Things, result to a non-trivial application tuning. In this paper, we model the performance of the middleware overlay infrastructure using Queueing Network Models (QNMs). To represent the mobile Thing's connections/disconnections, we model and solve analytically an ON/OFF queueing center. We apply our approach to Streaming interactions with mobile peers. Finally, we validate our model using simulations. The deviations between the performance results foreseen by the analytical model and the ones provided by the simulator are shown to be less than 5%.
{"title":"Performance modeling of the middleware overlay infrastructure of mobile things","authors":"Georgios Bouloukakis, I. Moscholios, N. Georgantas, V. Issarny","doi":"10.1109/ICC.2017.7997451","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997451","url":null,"abstract":"Internet of Things (IoT) applications consist of diverse Things (sensors and devices) in terms of hardware resources. Furthermore, such applications are characterized by the Things' mobility and multiple interaction types, such as synchronous, asynchronous, and streaming. Middleware IoT protocols consider the above limitations and support the development of effective applications by providing several Quality of Service (QoS) features. These features aim to enable application developers to tune an application by switching different levels of response times and delivery success rates. However, the profusion of the developed IoT protocols and the intermittent connectivity of mobile Things, result to a non-trivial application tuning. In this paper, we model the performance of the middleware overlay infrastructure using Queueing Network Models (QNMs). To represent the mobile Thing's connections/disconnections, we model and solve analytically an ON/OFF queueing center. We apply our approach to Streaming interactions with mobile peers. Finally, we validate our model using simulations. The deviations between the performance results foreseen by the analytical model and the ones provided by the simulator are shown to be less than 5%.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"5 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":"87297933","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.7997164
Ermin Sakic, Fragkiskos Sardis, Jochen W. Guck, W. Kellerer
State synchronisation in clustered Software Defined Networking controller deployments ensures that all instances of the controller have the same state information in order to provide redundancy. Current implementations of controllers use a strong consistency model, where configuration changes must be synchronised across a number of instances before they are applied on the network infrastructure. For large deployments, this blocking process increases the delay of state synchronisation across cluster members and consequently has a detrimental effect on network operations that require rapid response, such as fast failover and Quality of Service applications. In this paper, we introduce an adaptive consistency model for SDN Controllers that employs concepts of eventual consistency models along with a novel ‘cost-based’ approach where strict synchronisation is employed for critical operations that affect a large portion of the network resources while less critical changes are periodically propagated across cluster nodes. We use simulation to evaluate our model and demonstrate the potential gains in performance.
{"title":"Towards adaptive state consistency in distributed SDN control plane","authors":"Ermin Sakic, Fragkiskos Sardis, Jochen W. Guck, W. Kellerer","doi":"10.1109/ICC.2017.7997164","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997164","url":null,"abstract":"State synchronisation in clustered Software Defined Networking controller deployments ensures that all instances of the controller have the same state information in order to provide redundancy. Current implementations of controllers use a strong consistency model, where configuration changes must be synchronised across a number of instances before they are applied on the network infrastructure. For large deployments, this blocking process increases the delay of state synchronisation across cluster members and consequently has a detrimental effect on network operations that require rapid response, such as fast failover and Quality of Service applications. In this paper, we introduce an adaptive consistency model for SDN Controllers that employs concepts of eventual consistency models along with a novel ‘cost-based’ approach where strict synchronisation is employed for critical operations that affect a large portion of the network resources while less critical changes are periodically propagated across cluster nodes. We use simulation to evaluate our model and demonstrate the potential gains in performance.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86928671","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.7997473
M. Mushtaq, S. Fowler, A. Mellouk
It is a critical requirement of the future 5G communication networks to provide high speed and significantly reduce the network energy consumption. Energy efficient networks along with an energy saving strategy in mobile devices play a vital role in the mobile revolution. The new strategies should not only focus on wireless base stations, which consumes most of the power, but also considers the other power consumption elements for future mobile communication networks, including User Equipment (UE). In this paper, we have proposed a method that calculates the power consumption of a 5G network by considering its main elements based on current vision of 5G network infrastructure. Our proposed model uses the component based methodology that simplifies the process by taking into account the different high power consuming elements. The proposed method is evaluated by considering the three UE's DRX models and Virtual Base Station (VBS) with respect to different DRX timer in terms of Power Saving (PS) and delay as performance parameters.
{"title":"Power saving model for mobile device and virtual base station in the 5G era","authors":"M. Mushtaq, S. Fowler, A. Mellouk","doi":"10.1109/ICC.2017.7997473","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997473","url":null,"abstract":"It is a critical requirement of the future 5G communication networks to provide high speed and significantly reduce the network energy consumption. Energy efficient networks along with an energy saving strategy in mobile devices play a vital role in the mobile revolution. The new strategies should not only focus on wireless base stations, which consumes most of the power, but also considers the other power consumption elements for future mobile communication networks, including User Equipment (UE). In this paper, we have proposed a method that calculates the power consumption of a 5G network by considering its main elements based on current vision of 5G network infrastructure. Our proposed model uses the component based methodology that simplifies the process by taking into account the different high power consuming elements. The proposed method is evaluated by considering the three UE's DRX models and Virtual Base Station (VBS) with respect to different DRX timer in terms of Power Saving (PS) and delay as performance parameters.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"5 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":"90457028","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.7997428
Omer Narmanlioglu, E. Zeydan
Radio Access Network (RAN) sharing and Cloud-RAN (C-RAN) are two major candidates for next generation mobile networks. RAN sharing ensures efficient usage of network equipments among multiple mobile network operators (MNOs) and C-RAN benefits installation, evolution, management and performance improvements. Similarly, Software-Defined Networking (SDN) concept provides many features including hardware abstraction, programmable networking and centralized policy control. One of the main benefits that can be used along with these features is virtualization of RAN and core/backhaul networks to ensure network sharing among MNOs and efficient usage of the network equipments. In this work, we propose SDN-based C-RAN architecture including RAN controller integrated to virtualization controller that is crucial for core/backhaul network sharing towards next generation cellular network. In proposed architecture, eNodeB functions are shifted to the top of C-RAN controller as a consequence of separating baseband units from remote radio heads (RRHs). We further provide RRH assignment based load balancing algorithm that is executed at the top of the controller and allows sharing of RRHs among multiple MNOs. We evaluate its performance using traditional RRH distribution as benchmark and simulation results reveal that our proposed algorithm outperforms traditional distribution in terms of average number of connected user equipments to RRHs.
{"title":"New era in shared C-RAN and core network: A case study for efficient RRH usage","authors":"Omer Narmanlioglu, E. Zeydan","doi":"10.1109/ICC.2017.7997428","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997428","url":null,"abstract":"Radio Access Network (RAN) sharing and Cloud-RAN (C-RAN) are two major candidates for next generation mobile networks. RAN sharing ensures efficient usage of network equipments among multiple mobile network operators (MNOs) and C-RAN benefits installation, evolution, management and performance improvements. Similarly, Software-Defined Networking (SDN) concept provides many features including hardware abstraction, programmable networking and centralized policy control. One of the main benefits that can be used along with these features is virtualization of RAN and core/backhaul networks to ensure network sharing among MNOs and efficient usage of the network equipments. In this work, we propose SDN-based C-RAN architecture including RAN controller integrated to virtualization controller that is crucial for core/backhaul network sharing towards next generation cellular network. In proposed architecture, eNodeB functions are shifted to the top of C-RAN controller as a consequence of separating baseband units from remote radio heads (RRHs). We further provide RRH assignment based load balancing algorithm that is executed at the top of the controller and allows sharing of RRHs among multiple MNOs. We evaluate its performance using traditional RRH distribution as benchmark and simulation results reveal that our proposed algorithm outperforms traditional distribution in terms of average number of connected user equipments to RRHs.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89794376","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.7997000
S. Yamashita, Koji Yamamoto, T. Nishio, M. Morikura
In database-driven spectrum sharing for 5G mobile networks, a primary user (PU) may experience harmful interference caused by unpredictable propagation paths, even when secondary users (SUs) follow a spectrum sharing policy established on the basis of a database. A framework for determining the optimal radius of a circular primary exclusive region (PER) on the basis of SU's information has been proposed. However, a practical PER can be complex-shaped and should be designed on the basis of the directivity of the PU antenna, and the SU information in each region. In this paper, we present a stochastic geometry analysis in a spatial grid-based spectrum database, and propose a design for an optimal complex-shaped PER. The database determines the transmission probability of the SUs on each divided annular sector. By regarding the SU's locations on each annular sector as an inhomogeneous Poisson point process, we analytically derive a PU's outage probability (OP), where the PU's OP is defined as the probability that the aggregate interference power at a PU from the SUs exceeds a threshold. Using the derived expression, we formulate an optimization problem to maximize the number of transmitting SUs, which optimizes the SU's transmission probability on each annular sector. Then, we numerically evaluate the solution of the optimization problem in various scenarios. The results show that the accuracy of the PER improves as the grid size decreases. In addition, we successfully design a complex-shaped PER with holes in which the SUs are permitted to transmit.
{"title":"Optimization of primary exclusive region in spatial grid-based spectrum database using stochastic Geometry","authors":"S. Yamashita, Koji Yamamoto, T. Nishio, M. Morikura","doi":"10.1109/ICC.2017.7997000","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997000","url":null,"abstract":"In database-driven spectrum sharing for 5G mobile networks, a primary user (PU) may experience harmful interference caused by unpredictable propagation paths, even when secondary users (SUs) follow a spectrum sharing policy established on the basis of a database. A framework for determining the optimal radius of a circular primary exclusive region (PER) on the basis of SU's information has been proposed. However, a practical PER can be complex-shaped and should be designed on the basis of the directivity of the PU antenna, and the SU information in each region. In this paper, we present a stochastic geometry analysis in a spatial grid-based spectrum database, and propose a design for an optimal complex-shaped PER. The database determines the transmission probability of the SUs on each divided annular sector. By regarding the SU's locations on each annular sector as an inhomogeneous Poisson point process, we analytically derive a PU's outage probability (OP), where the PU's OP is defined as the probability that the aggregate interference power at a PU from the SUs exceeds a threshold. Using the derived expression, we formulate an optimization problem to maximize the number of transmitting SUs, which optimizes the SU's transmission probability on each annular sector. Then, we numerically evaluate the solution of the optimization problem in various scenarios. The results show that the accuracy of the PER improves as the grid size decreases. In addition, we successfully design a complex-shaped PER with holes in which the SUs are permitted to transmit.","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":"89973471","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.7997103
Minghui Min, Liang Xiao, Caixia Xie, M. Hajimirsadeghi, N. Mandayam
An Advanced Persistent Threat (APT) attacker applies multiple sophisticated methods to continuously and stealthily attack targeted cyber systems. In this paper, the interactions between an APT attacker and a cloud system defender in their allocation of the Central Processing Units (CPUs) over multiple devices are formulated as a Colonel Blotto game (CBG), which models the competition of two players under given resource constraints over multiple battlefields. The Nash equilibria (NEs) of the CBG-based APT defense game are derived for the case with symmetric players and the case with asymmetric players each with different total number of CPUs. The expected data protection level and the utility of the defender are provided for each game at the NE. An APT defense strategy based on the policy hill-climbing (PHC) algorithm is proposed for the defender to achieve the optimal CPU allocation distribution over the devices in the dynamic defense game without being aware of the APT attack model. Simulation results have verified the efficacy of our proposed algorithm, showing that both the data protection level and the utility of the defender are improved compared with the benchmark greedy allocation algorithm.
{"title":"Defense against advanced persistent threats: A Colonel Blotto game approach","authors":"Minghui Min, Liang Xiao, Caixia Xie, M. Hajimirsadeghi, N. Mandayam","doi":"10.1109/ICC.2017.7997103","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997103","url":null,"abstract":"An Advanced Persistent Threat (APT) attacker applies multiple sophisticated methods to continuously and stealthily attack targeted cyber systems. In this paper, the interactions between an APT attacker and a cloud system defender in their allocation of the Central Processing Units (CPUs) over multiple devices are formulated as a Colonel Blotto game (CBG), which models the competition of two players under given resource constraints over multiple battlefields. The Nash equilibria (NEs) of the CBG-based APT defense game are derived for the case with symmetric players and the case with asymmetric players each with different total number of CPUs. The expected data protection level and the utility of the defender are provided for each game at the NE. An APT defense strategy based on the policy hill-climbing (PHC) algorithm is proposed for the defender to achieve the optimal CPU allocation distribution over the devices in the dynamic defense game without being aware of the APT attack model. Simulation results have verified the efficacy of our proposed algorithm, showing that both the data protection level and the utility of the defender are improved compared with the benchmark greedy allocation algorithm.","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":"90909757","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.7996322
Anahid Attarkashani, W. Hamouda
In this paper, a cross-layer-based sensor node selection scheme in a cooperative network with equally spatially correlated channels is proposed. The equally correlated model can be used as a worst-case benchmark or as a rough approximation by assuming equal correlation coefficients for all channels. By considering the physical and link layer characteristics, one or multiple sensor nodes are selected to maximize the link layer throughput. Based on the channel characteristics, the best performance is achieved by using one cooperative sensor node in poor links and multiple relays/sensors in high quality links. The performance of the proposed scheme is compared with the capacity-based scheme and considerable improvement in performance is achieved in both correlated and uncorrelated channels. The proposed scheme is examined for both decode-and-forward (DF) and amplify-and-forward (AF) relaying, and also for relay selection and subcarrier allocation in an orthogonal-frequency-division multiplexing (OFDM)-based systems. In all cases, the cross-layer technique is shown to offer significant improvement relative to physical-layer optimization techniques.
{"title":"Throughput maximization using cross-layer design in wireless sensor networks","authors":"Anahid Attarkashani, W. Hamouda","doi":"10.1109/ICC.2017.7996322","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996322","url":null,"abstract":"In this paper, a cross-layer-based sensor node selection scheme in a cooperative network with equally spatially correlated channels is proposed. The equally correlated model can be used as a worst-case benchmark or as a rough approximation by assuming equal correlation coefficients for all channels. By considering the physical and link layer characteristics, one or multiple sensor nodes are selected to maximize the link layer throughput. Based on the channel characteristics, the best performance is achieved by using one cooperative sensor node in poor links and multiple relays/sensors in high quality links. The performance of the proposed scheme is compared with the capacity-based scheme and considerable improvement in performance is achieved in both correlated and uncorrelated channels. The proposed scheme is examined for both decode-and-forward (DF) and amplify-and-forward (AF) relaying, and also for relay selection and subcarrier allocation in an orthogonal-frequency-division multiplexing (OFDM)-based systems. In all cases, the cross-layer technique is shown to offer significant improvement relative to physical-layer optimization techniques.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"106 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":"75726524","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.7996485
Hakim Ghazzai, Mahdi Ben Ghorbel, A. Kadri, Md. Jahangir Hossain
Micro unmanned aerial vehicles (MUAVs) have attracted much interest as flexible communication means for multiple applications due to their versatility. Most of the MUAV-based applications require a time-limited access to the spectrum to complete data transmission due to limited battery capacity of the flying units. These characteristics are the origin of two main challenges faced by MUAV-based communication: 1) efficient-energy management, and 2) opportunistic spectrum access. This paper proposes an energy-efficient solution, considering the hover and communication energy, to address these issues by integrating cognitive radio (CR) technology with MUAVs. A non-convex optimization problem exploiting the mobility of MUAVs is developed for the underlay CR technique. The objective is to determine an optimized three-dimension (3D) location, for a secondary MUAV, at which it can complete its data transfer with minimum energy consumption and without harming the data rate requirement of the primary spectrum owner. Two algorithms are proposed to solve these optimization problems: a meta-heuristic particle swarm optimization algorithm (PSO) and a deterministic algorithm based on Weber formulation. Selected numerical results show the behavior of the MUAV versus various system parameters and that the proposed solutions achieve very close results in spite of the different conceptional constructions.
{"title":"Energy efficient 3D positioning of micro unmanned aerial vehicles for underlay cognitive radio systems","authors":"Hakim Ghazzai, Mahdi Ben Ghorbel, A. Kadri, Md. Jahangir Hossain","doi":"10.1109/ICC.2017.7996485","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996485","url":null,"abstract":"Micro unmanned aerial vehicles (MUAVs) have attracted much interest as flexible communication means for multiple applications due to their versatility. Most of the MUAV-based applications require a time-limited access to the spectrum to complete data transmission due to limited battery capacity of the flying units. These characteristics are the origin of two main challenges faced by MUAV-based communication: 1) efficient-energy management, and 2) opportunistic spectrum access. This paper proposes an energy-efficient solution, considering the hover and communication energy, to address these issues by integrating cognitive radio (CR) technology with MUAVs. A non-convex optimization problem exploiting the mobility of MUAVs is developed for the underlay CR technique. The objective is to determine an optimized three-dimension (3D) location, for a secondary MUAV, at which it can complete its data transfer with minimum energy consumption and without harming the data rate requirement of the primary spectrum owner. Two algorithms are proposed to solve these optimization problems: a meta-heuristic particle swarm optimization algorithm (PSO) and a deterministic algorithm based on Weber formulation. Selected numerical results show the behavior of the MUAV versus various system parameters and that the proposed solutions achieve very close results in spite of the different conceptional constructions.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"17 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":"75890110","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.7996797
Yaru Fu, Lou Salaün, C. Sung, Chung Shue Chen, M. Coupechoux
This paper investigates the subcarrier and power allocation for the downlink of a multicarrier non-orthogonal multiple access (MC-NOMA) system. A three-step algorithm is proposed to deal with the sum rate maximization problem. In Step 1, we assume that each user can use all the subcarriers simultaneously and apply the synchronous iterative waterfilling algorithm (SIWA) to obtain a power vector for each user. In Step 2, subcarriers are assigned to users by a heuristic greedy method based on the achieved power allocation result of Step 1. In Step 3, SIWA is used once again to further improve the system performance with the obtained subcarrier assignment result of Step 2. The convergence of SIWA in Step 3 is proved when the number of multiplexed users is no more than two. Since SIWA is applied twice, we call our three-step method Double Iterative Waterfilling Algorithm (DIWA). Numerical results show that the proposed DIWA achieves comparable performance to an existing near-optimal solution but with much lower time complexity.
{"title":"Double iterative waterfilling for sum rate maximization in multicarrier NOMA systems","authors":"Yaru Fu, Lou Salaün, C. Sung, Chung Shue Chen, M. Coupechoux","doi":"10.1109/ICC.2017.7996797","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996797","url":null,"abstract":"This paper investigates the subcarrier and power allocation for the downlink of a multicarrier non-orthogonal multiple access (MC-NOMA) system. A three-step algorithm is proposed to deal with the sum rate maximization problem. In Step 1, we assume that each user can use all the subcarriers simultaneously and apply the synchronous iterative waterfilling algorithm (SIWA) to obtain a power vector for each user. In Step 2, subcarriers are assigned to users by a heuristic greedy method based on the achieved power allocation result of Step 1. In Step 3, SIWA is used once again to further improve the system performance with the obtained subcarrier assignment result of Step 2. The convergence of SIWA in Step 3 is proved when the number of multiplexed users is no more than two. Since SIWA is applied twice, we call our three-step method Double Iterative Waterfilling Algorithm (DIWA). Numerical results show that the proposed DIWA achieves comparable performance to an existing near-optimal solution but with much lower time complexity.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"32 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":"82706719","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.7996804
Ruidong Li, H. Asaeda, Jie Li, Xiaoming Fu
In an Information-Centric Internet of Things (ICIoT) environment for big data sharing, IoT data can be cached throughout the network. Such distributed data caching poses a challenge on flexible authorization and identity verification. For fine-grained data access authorization in a distributed manner, Ciphertext-Policy Attribute-Based Encryption (CP-ABE) has been identified as a promising approach. However in the existing CP-ABE based scheme, each publisher would need to retrieve the attributes from the centralized server for encrypting data, resulting in high communication overhead. Moreover, valid authorization period and distributed authentication are still not addressed and seamlessly incorporated. In this paper, we propose a Verifiable and Flexible Data Sharing (VFDS) mechanism for ICIoT, which exploits CP-ABE for authorization and Identity-Based Signature (IBS) for the distributed verification of the identities. In VFDS, publishers retrieve the attributes from the nearby cache holders. In addition, the Attribute Manifest (AM) and the Automatic Attribute Update (AAU) realize efficient attribute updates within the distributed caches to achieve valid authorization period. Meanwhile, VFDS provides the public parameters of IBS in local domain, which enables the efficient identity verifications. Our system evaluations show that the VFDS can achieve lower bandwidth cost compared to the existing schemes for both authentication and flexible authorization.
{"title":"A Verifiable and Flexible Data Sharing mechanism for Information-Centric IoT","authors":"Ruidong Li, H. Asaeda, Jie Li, Xiaoming Fu","doi":"10.1109/ICC.2017.7996804","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996804","url":null,"abstract":"In an Information-Centric Internet of Things (ICIoT) environment for big data sharing, IoT data can be cached throughout the network. Such distributed data caching poses a challenge on flexible authorization and identity verification. For fine-grained data access authorization in a distributed manner, Ciphertext-Policy Attribute-Based Encryption (CP-ABE) has been identified as a promising approach. However in the existing CP-ABE based scheme, each publisher would need to retrieve the attributes from the centralized server for encrypting data, resulting in high communication overhead. Moreover, valid authorization period and distributed authentication are still not addressed and seamlessly incorporated. In this paper, we propose a Verifiable and Flexible Data Sharing (VFDS) mechanism for ICIoT, which exploits CP-ABE for authorization and Identity-Based Signature (IBS) for the distributed verification of the identities. In VFDS, publishers retrieve the attributes from the nearby cache holders. In addition, the Attribute Manifest (AM) and the Automatic Attribute Update (AAU) realize efficient attribute updates within the distributed caches to achieve valid authorization period. Meanwhile, VFDS provides the public parameters of IBS in local domain, which enables the efficient identity verifications. Our system evaluations show that the VFDS can achieve lower bandwidth cost compared to the existing schemes for both authentication and flexible authorization.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"55 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84795468","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
扫码关注我们
求助内容：
应助结果提醒方式：