Pub Date : 2019-04-01DOI: 10.1109/WCNCW.2019.8902632
Marco Araújo, L. Ekenberg, J. Confraria
Risks are significant when implementing large-scale projects such as 5G. The higher the overall risk of the 5G project, the lower the operators’ willingness to invest in millimetre wave spectrum and vice-versa; i.e. the price of the spectrum should be negatively correlated with the overall project risk. In this paper, we propose an array-based method for estimating financial risks when introducing 5G and its correspondence with spectrum prices. The method is based on Monte Carlo simulations, for deriving an appropriate maximum value for the operator’ willingness to pay for a 5G license.
{"title":"Risk assessment in 5G infrastructure deployment: an aid tool for estimating spectrum auction prices","authors":"Marco Araújo, L. Ekenberg, J. Confraria","doi":"10.1109/WCNCW.2019.8902632","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902632","url":null,"abstract":"Risks are significant when implementing large-scale projects such as 5G. The higher the overall risk of the 5G project, the lower the operators’ willingness to invest in millimetre wave spectrum and vice-versa; i.e. the price of the spectrum should be negatively correlated with the overall project risk. In this paper, we propose an array-based method for estimating financial risks when introducing 5G and its correspondence with spectrum prices. The method is based on Monte Carlo simulations, for deriving an appropriate maximum value for the operator’ willingness to pay for a 5G license.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133256024","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 : 2019-04-01DOI: 10.1109/WCNCW.2019.8902617
J. Zang, Vahid Towhidlou, M. Shikh-Bahaei
In this paper we investigate collision detection and avoidance in a vehicular network of full duplex (FD) operating nodes. Each vehicle in this network senses the energy level of the channel before and during its transmission. The measured energy is compared against a dynamic threshold which is preset based on the target detection probability, transmitter’s power, sensing time and self-interference cancellation (SIC) capability of the vehicles’ on board units (OBU). Probabilities of detection and false alarm, detection threshold before and during transmission, and effect of residual self interference (SI) on these metrics have been formulated. It is shown that the proposed scheme would experience a shorter collision duration. Meanwhile, it also requires a minimum SIC capability for acceptable operation, below which, system throughput would be poor due to high false alarm probability. Numerical simulations verify the accuracy of our analysis. They also illustrate that the proposed model perform better than the fixed threshold strategy. A trade-off between half duplex (HD) and FD has been found and the scheme would be applicable even if SIC capability of OBUs is relatively poor, with no need for complicated and expensive devices for future vehicular communication.
{"title":"Collision Avoidance in V2X Communication Networks","authors":"J. Zang, Vahid Towhidlou, M. Shikh-Bahaei","doi":"10.1109/WCNCW.2019.8902617","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902617","url":null,"abstract":"In this paper we investigate collision detection and avoidance in a vehicular network of full duplex (FD) operating nodes. Each vehicle in this network senses the energy level of the channel before and during its transmission. The measured energy is compared against a dynamic threshold which is preset based on the target detection probability, transmitter’s power, sensing time and self-interference cancellation (SIC) capability of the vehicles’ on board units (OBU). Probabilities of detection and false alarm, detection threshold before and during transmission, and effect of residual self interference (SI) on these metrics have been formulated. It is shown that the proposed scheme would experience a shorter collision duration. Meanwhile, it also requires a minimum SIC capability for acceptable operation, below which, system throughput would be poor due to high false alarm probability. Numerical simulations verify the accuracy of our analysis. They also illustrate that the proposed model perform better than the fixed threshold strategy. A trade-off between half duplex (HD) and FD has been found and the scheme would be applicable even if SIC capability of OBUs is relatively poor, with no need for complicated and expensive devices for future vehicular communication.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120847430","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 : 2019-04-01DOI: 10.1109/WCNCW.2019.8902915
Li-Hsing Yen, Chia-Han Chang, Yi Chia Chen
Multi-access edge computing (MEC) as an emerging technology which provides cloud service in the edge of multi-radio access networks aims to reduce the service latency experienced by end devices. When individual MEC systems do not have adequate resource capacity to fulfill service requests, forming MEC federations for resource sharing could provide economic incentive to MEC operators. To this end, we need to maximize social welfare in each federation, which involves efficient federation structure generations, federation profit maximization by resource provisioning configuration, and fair profit distribution among participants. We model the problem as a coalition game with difference from prior work in the assumption of latency and locality constraints and also in the consideration of various service policies/demand preferences. Simulation results show that the proposed approach always increases profits. If local requests are served with local resource with priority, federation improves profits without sacrificing request acceptance rates.
{"title":"Profit Maximization by Forming Federations of Geo-Distributed MEC Platforms","authors":"Li-Hsing Yen, Chia-Han Chang, Yi Chia Chen","doi":"10.1109/WCNCW.2019.8902915","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902915","url":null,"abstract":"Multi-access edge computing (MEC) as an emerging technology which provides cloud service in the edge of multi-radio access networks aims to reduce the service latency experienced by end devices. When individual MEC systems do not have adequate resource capacity to fulfill service requests, forming MEC federations for resource sharing could provide economic incentive to MEC operators. To this end, we need to maximize social welfare in each federation, which involves efficient federation structure generations, federation profit maximization by resource provisioning configuration, and fair profit distribution among participants. We model the problem as a coalition game with difference from prior work in the assumption of latency and locality constraints and also in the consideration of various service policies/demand preferences. Simulation results show that the proposed approach always increases profits. If local requests are served with local resource with priority, federation improves profits without sacrificing request acceptance rates.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123831703","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 : 2019-04-01DOI: 10.1109/WCNCW.2019.8902854
Michael S. Mollel, Metin Öztürk, Michael Kisangiri, S. Kaijage, Oluwakayode Onireti, M. Imran, Q. Abbasi
Millimeter Wave (mm-Wave) provides high bandwidth and is expected to increase the capacity of the network thousand-fold in the future generations of mobile communications. However, since mm-Wave is sensitive to blockage and incurs in a high penetration loss, it has increased complexity and bottleneck in the realization of substantial gain. Network densification, as a solution for sensitivity and blockage, increases handover (HO) rate, unnecessary and ping-pong HO’s, which in turn reduces the throughput of the network. On the other hand, to minimize the effect of increased HO rate, Time to Trigger (TTT) and Hysteresis factor (H) have been used in Long Term Evolution (LTE). In this paper, we primarily present two different networks based on Evolved NodeB (eNB) density: sparse and dense. As their name also suggests, the eNB density in the dense network is higher than the sparse network. Hence, we proposed an optimal eNB selection mechanism for 5G intra-mobility HO based on spatial information of the sparse eNB network. In this approach, User Equipment (UE) in the dense network is connected only to a few selected eNBs, which are delivered from the sparse network, in the first place. HO event occurs only when the serving eNB can no longer satisfy the minimum Signal-to-Noise Ratio (SNR) threshold. For the eNBs, which are deployed in the dense network, follow the conventional HO procedure. Results reveal that the HO rate is decreased significantly with the proposed approach for the TTT values between 0 ms to 256 ms while keeping the radio link failure (RLF) at an acceptable level; less than 2% for the TTT values between 0 ms to 160 ms. This study paves a way for HO management in the future 5G network.
毫米波(mm-Wave)提供高带宽，预计在未来几代移动通信中将使网络容量增加数千倍。然而，由于毫米波对堵塞很敏感，并且具有很高的穿透损失，增加了其复杂性和实现实质性增益的瓶颈。网络致密化作为灵敏度和阻塞的解决方案，增加了切换(HO)率、不必要的乒乓HO，从而降低了网络的吞吐量。另一方面，为了尽量减少增加的HO率的影响，在长期演进(LTE)中使用了触发时间(TTT)和迟滞因子(H)。在本文中，我们主要提出了两种不同的基于eNB (Evolved NodeB)密度的网络:稀疏和密集。顾名思义，密集网络中的eNB密度高于稀疏网络。为此，我们提出了一种基于稀疏eNB网络空间信息的5G内移动HO最优eNB选择机制。在这种方法中，密集网络中的用户设备(UE)首先只连接到从稀疏网络中交付的几个选定的enb。只有当服务的eNB不能再满足最小信噪比(SNR)阈值时才会发生HO事件。对于部署在密集网络中的enb，请遵循传统的HO程序。结果表明，当TTT值在0 ms ~ 256 ms之间时，该方法可以显著降低HO速率，同时使无线电链路故障(RLF)保持在可接受的水平;在0 ms到160 ms之间的TTT值小于2%。本研究为未来5G网络的HO管理铺平了道路。
{"title":"Handover Management in Dense Networks with Coverage Prediction from Sparse Networks","authors":"Michael S. Mollel, Metin Öztürk, Michael Kisangiri, S. Kaijage, Oluwakayode Onireti, M. Imran, Q. Abbasi","doi":"10.1109/WCNCW.2019.8902854","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902854","url":null,"abstract":"Millimeter Wave (mm-Wave) provides high bandwidth and is expected to increase the capacity of the network thousand-fold in the future generations of mobile communications. However, since mm-Wave is sensitive to blockage and incurs in a high penetration loss, it has increased complexity and bottleneck in the realization of substantial gain. Network densification, as a solution for sensitivity and blockage, increases handover (HO) rate, unnecessary and ping-pong HO’s, which in turn reduces the throughput of the network. On the other hand, to minimize the effect of increased HO rate, Time to Trigger (TTT) and Hysteresis factor (H) have been used in Long Term Evolution (LTE). In this paper, we primarily present two different networks based on Evolved NodeB (eNB) density: sparse and dense. As their name also suggests, the eNB density in the dense network is higher than the sparse network. Hence, we proposed an optimal eNB selection mechanism for 5G intra-mobility HO based on spatial information of the sparse eNB network. In this approach, User Equipment (UE) in the dense network is connected only to a few selected eNBs, which are delivered from the sparse network, in the first place. HO event occurs only when the serving eNB can no longer satisfy the minimum Signal-to-Noise Ratio (SNR) threshold. For the eNBs, which are deployed in the dense network, follow the conventional HO procedure. Results reveal that the HO rate is decreased significantly with the proposed approach for the TTT values between 0 ms to 256 ms while keeping the radio link failure (RLF) at an acceptable level; less than 2% for the TTT values between 0 ms to 160 ms. This study paves a way for HO management in the future 5G network.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126158918","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 : 2019-04-01DOI: 10.1109/WCNCW.2019.8902736
G. Yue, Bohan Zhang, Xiao-Feng Qi, L. Cimini
In this paper, we consider the feedback and precoding designs for massive multiple-input multiple-output (MIMO) systems. Based on a recently introduced two-stage beamforming framework, termed as joint spatial division and multiplexing (JSDM), we propose a generalized JSDM approach to deal with the practical issue that the user’s channel usually has multiple scattering clusters for mobile broadband which may incur significant performance degradation with original JSDM. In particular, we propose a new feedback approach where the users feed back additional channel measurements, referred to as inter-group channel state information (CSI) feedback. To utilize the inter-group CSI, we first provide the joint group precoding (JGP) approaches, then propose a novel virtual user based low-complexity per-group precoding (PGP) method with interference avoidance. Finally, we explore a general PGP approach with power allocations for interference management. Simulation results show that the spectral efficiency is significantly improved with proposed designs.
{"title":"Generalized JSDM with Enhanced Interference Management for Massive MIMO Systems","authors":"G. Yue, Bohan Zhang, Xiao-Feng Qi, L. Cimini","doi":"10.1109/WCNCW.2019.8902736","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902736","url":null,"abstract":"In this paper, we consider the feedback and precoding designs for massive multiple-input multiple-output (MIMO) systems. Based on a recently introduced two-stage beamforming framework, termed as joint spatial division and multiplexing (JSDM), we propose a generalized JSDM approach to deal with the practical issue that the user’s channel usually has multiple scattering clusters for mobile broadband which may incur significant performance degradation with original JSDM. In particular, we propose a new feedback approach where the users feed back additional channel measurements, referred to as inter-group channel state information (CSI) feedback. To utilize the inter-group CSI, we first provide the joint group precoding (JGP) approaches, then propose a novel virtual user based low-complexity per-group precoding (PGP) method with interference avoidance. Finally, we explore a general PGP approach with power allocations for interference management. Simulation results show that the spectral efficiency is significantly improved with proposed designs.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114873004","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 : 2019-04-01DOI: 10.1109/WCNCW.2019.8902644
Fenyu Jiang, Y. Sun, C. Phillips
The Information-Centric Network (ICN) is regarded as a promising network paradigm as it can reduce network congestion and data retrieval latency with the help of its intra-network caching, especially in regard to the Internet of Things (IoT). In multiple caches systems, a global caching gain can be obtained by coded caching during the cache placement stage between the content originator and cache routers. Additionally, the use of a distributed, simultaneous transmission technique enabled and dynamic context supported protocol can provide extra performance gains. In this paper, we propose a Cache Migration Protocol (CMP) to support the dynamic simultaneous transmission during the content delivery stage between cache routers and consumers in a distributed manner. The design of CMP is evaluated via simulations using OPNET. The simulations show that CMP is able to select appropriate nodes for supporting simultaneous transmissions when the network context is changed. Meanwhile, it is demonstrated that CMP outperforms the traditional ICN content delivery method Named Data Networking (NDN) in terms of reduced number of transmissions, the average end-to-end delay and average throughput.
{"title":"Cache Migration Protocol for Information-Centric Networks","authors":"Fenyu Jiang, Y. Sun, C. Phillips","doi":"10.1109/WCNCW.2019.8902644","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902644","url":null,"abstract":"The Information-Centric Network (ICN) is regarded as a promising network paradigm as it can reduce network congestion and data retrieval latency with the help of its intra-network caching, especially in regard to the Internet of Things (IoT). In multiple caches systems, a global caching gain can be obtained by coded caching during the cache placement stage between the content originator and cache routers. Additionally, the use of a distributed, simultaneous transmission technique enabled and dynamic context supported protocol can provide extra performance gains. In this paper, we propose a Cache Migration Protocol (CMP) to support the dynamic simultaneous transmission during the content delivery stage between cache routers and consumers in a distributed manner. The design of CMP is evaluated via simulations using OPNET. The simulations show that CMP is able to select appropriate nodes for supporting simultaneous transmissions when the network context is changed. Meanwhile, it is demonstrated that CMP outperforms the traditional ICN content delivery method Named Data Networking (NDN) in terms of reduced number of transmissions, the average end-to-end delay and average throughput.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123119095","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}
To support emerging real-time monitoring and control applications, the timeliness of computation results is of critical importance to mobile-edge computing (MEC) systems. We propose a performance metric called age of task (AoT) based on the concept of age of information (AoI), to evaluate the temporal value of computation tasks. In this paper, we consider a system consisting of a single MEC server and one mobile device running several applications. We study an age minimization problem by jointly considering task scheduling, computation offloading and energy consumption. To solve the problem efficiently, we propose a light-weight task scheduling and computation offloading algorithm. Through performance evaluation, we show that our proposed age-based solution is competitive when compared with traditional strategies.
{"title":"Age Based Task Scheduling and Computation Offloading in Mobile-Edge Computing Systems","authors":"Xianxin Song, Xiaoqi Qin, Yunzheng Tao, Baoling Liu, Ping Zhang","doi":"10.1109/WCNCW.2019.8902529","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902529","url":null,"abstract":"To support emerging real-time monitoring and control applications, the timeliness of computation results is of critical importance to mobile-edge computing (MEC) systems. We propose a performance metric called age of task (AoT) based on the concept of age of information (AoI), to evaluate the temporal value of computation tasks. In this paper, we consider a system consisting of a single MEC server and one mobile device running several applications. We study an age minimization problem by jointly considering task scheduling, computation offloading and energy consumption. To solve the problem efficiently, we propose a light-weight task scheduling and computation offloading algorithm. Through performance evaluation, we show that our proposed age-based solution is competitive when compared with traditional strategies.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125577007","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 : 2019-04-01DOI: 10.1109/WCNCW.2019.8902591
Hong Wang, Ying Wang, Ruijin Sun, Shan Guo, Honglin Li
The rapid increasing of mobile video traffic has put heavy burden on mobile networks. Mobile edge computing (MEC) has become a promising paradigm to provide caching, computing and context awareness ability within the radio access network (RAN) so as to cache popular videos and provide multi-bitrate video streaming to users nearby. In this paper, we propose joint user association and cache strategy to maximize the system revenue by combining caching, transcoding and adaptive bitrate streaming (ABR) technology. The backhaul bandwidth saved by caching and transcoding is regarded as the system gains and the system resources (eg., cache resources, transcoding resources) consumed are as cost so as to use limited system resources to bring greater benefits to the system. Finally, the optimization problem is solved by using many-to-many matching algorithm. The experimental results show that the proposed cache scheme has a better performance than other cache schemes.
{"title":"Joint Video Caching and User Association With Mobile Edge Computing","authors":"Hong Wang, Ying Wang, Ruijin Sun, Shan Guo, Honglin Li","doi":"10.1109/WCNCW.2019.8902591","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902591","url":null,"abstract":"The rapid increasing of mobile video traffic has put heavy burden on mobile networks. Mobile edge computing (MEC) has become a promising paradigm to provide caching, computing and context awareness ability within the radio access network (RAN) so as to cache popular videos and provide multi-bitrate video streaming to users nearby. In this paper, we propose joint user association and cache strategy to maximize the system revenue by combining caching, transcoding and adaptive bitrate streaming (ABR) technology. The backhaul bandwidth saved by caching and transcoding is regarded as the system gains and the system resources (eg., cache resources, transcoding resources) consumed are as cost so as to use limited system resources to bring greater benefits to the system. Finally, the optimization problem is solved by using many-to-many matching algorithm. The experimental results show that the proposed cache scheme has a better performance than other cache schemes.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134418225","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 : 2019-04-01DOI: 10.1109/WCNCW.2019.8902722
Daniel Zucchetto, A. Munari, A. Zanella
The interest in asynchronous ALOHA protocols has recently been revived by the diffusion of low-power, long-range communication technologies proposed for Machine-to-Machine scenarios. This work focuses on ad hoc sensor networks where nodes communicate in pairs generating mutual interference, and tackles the fundamental yet still open question of how to set the transmission rate so as to maximise throughput. Elaborating on a previous stochastic geometry model, we consider a SINR decoding threshold that depends on the transmission rate, and analyse the interplay between interference and noise power to find the optimal transmission rate. Results reveal important design insights, showing that: i) the optimal rate relates to other system parameters in a rather complex manner but can be expressed by a single equation and is solvable via numeric evaluation; ii) in the interference-limited region, the optimal rate depends only on the bandwidth and the path-loss exponent; iii) this optimal rate yields close-to-optimal throughput also in the noise-limited region for standard values of the path loss coefficient; iv) using the optimal rate can significantly improve network throughput compared to the use of near-optimal rates.
{"title":"On the Optimal Rate of Ad Hoc ALOHA Networks","authors":"Daniel Zucchetto, A. Munari, A. Zanella","doi":"10.1109/WCNCW.2019.8902722","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902722","url":null,"abstract":"The interest in asynchronous ALOHA protocols has recently been revived by the diffusion of low-power, long-range communication technologies proposed for Machine-to-Machine scenarios. This work focuses on ad hoc sensor networks where nodes communicate in pairs generating mutual interference, and tackles the fundamental yet still open question of how to set the transmission rate so as to maximise throughput. Elaborating on a previous stochastic geometry model, we consider a SINR decoding threshold that depends on the transmission rate, and analyse the interplay between interference and noise power to find the optimal transmission rate. Results reveal important design insights, showing that: i) the optimal rate relates to other system parameters in a rather complex manner but can be expressed by a single equation and is solvable via numeric evaluation; ii) in the interference-limited region, the optimal rate depends only on the bandwidth and the path-loss exponent; iii) this optimal rate yields close-to-optimal throughput also in the noise-limited region for standard values of the path loss coefficient; iv) using the optimal rate can significantly improve network throughput compared to the use of near-optimal rates.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121238332","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 : 2019-04-01DOI: 10.1109/WCNCW.2019.8902867
I. Yildirim, E. Başar, I. Altunbas
One of the main drawbacks in the use of reconfigurable antennas for index modulation (IM) is the need to obtain an integer power of two number of uncorrelated channel realizations. In this study, we present media-based modulation with golden angle modulation (GAM-MBM) scheme as a new solution to this fractional bits problem by using symmetrical structure of golden angle modulation (GAM). We present a comprehensive overview of the fractional bits problem in spatial modulation (SM) and media-based modulation (MBM) and we show that the proposed scheme can be considered as a candidate for the next generation technologies with its versatile structure, which can be easily integrated into various concepts. Simulation results also show that GAM-MBM exhibits significant improvements in error performance over the existing fractional bits solutions.
{"title":"Fractional Media-Based Modulation with Golden Angle Modulation","authors":"I. Yildirim, E. Başar, I. Altunbas","doi":"10.1109/WCNCW.2019.8902867","DOIUrl":"https://doi.org/10.1109/WCNCW.2019.8902867","url":null,"abstract":"One of the main drawbacks in the use of reconfigurable antennas for index modulation (IM) is the need to obtain an integer power of two number of uncorrelated channel realizations. In this study, we present media-based modulation with golden angle modulation (GAM-MBM) scheme as a new solution to this fractional bits problem by using symmetrical structure of golden angle modulation (GAM). We present a comprehensive overview of the fractional bits problem in spatial modulation (SM) and media-based modulation (MBM) and we show that the proposed scheme can be considered as a candidate for the next generation technologies with its versatile structure, which can be easily integrated into various concepts. Simulation results also show that GAM-MBM exhibits significant improvements in error performance over the existing fractional bits solutions.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130834902","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
扫码关注我们
求助内容：
应助结果提醒方式：