Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440573
Chulmin Kim, Cheeha Kim
As full duplex radio communication is introduced, it is expected to double the throughput theoretically over full duplex radio for one-to-one communication. However, in the practical environment, it is hard to find such an application that demands the same amount of traffic in the both directions at the same time. To enhance the throughput as much as possible, we need to arrange medium accesses in a different way, not like the contention-based MAC. In this paper, we propose an efficient MAC protocol to maximize throughput for OFDM-based full duplex radio. Our proposed MAC protocol finds stations with uplink traffic in the hidden relation with the station for downlink traffic and provides them transmission opportunities to balance the amount of traffic in the both direction. Our protocol requires one OFDM subcarrier only. Our protocol can achieve higher throughput as compared with that of legacy half duplex MAC protocol and that of basic full duplex MAC protocol.
{"title":"A full duplex MAC protocol for efficient asymmetric transmission in WLAN","authors":"Chulmin Kim, Cheeha Kim","doi":"10.1109/ICCNC.2016.7440573","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440573","url":null,"abstract":"As full duplex radio communication is introduced, it is expected to double the throughput theoretically over full duplex radio for one-to-one communication. However, in the practical environment, it is hard to find such an application that demands the same amount of traffic in the both directions at the same time. To enhance the throughput as much as possible, we need to arrange medium accesses in a different way, not like the contention-based MAC. In this paper, we propose an efficient MAC protocol to maximize throughput for OFDM-based full duplex radio. Our proposed MAC protocol finds stations with uplink traffic in the hidden relation with the station for downlink traffic and provides them transmission opportunities to balance the amount of traffic in the both direction. Our protocol requires one OFDM subcarrier only. Our protocol can achieve higher throughput as compared with that of legacy half duplex MAC protocol and that of basic full duplex MAC protocol.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132126846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440677
Amin Zribi, T. Matsumoto, R. Pyndiah
We consider the problem of joint decoding and data fusion in data gathering for densely deployed sensor networks modeled by the Chief Executive Officer (CEO) problem. More specifically, we consider the binary CEO problem where all sensors observe the same time-correlated binary Markov source corrupted by independent binary noises. Hence, the observations are two-dimensionally (temporary and spatially) correlated. In the proposed scheme, every sensor apply a low-density parity-check (LDPC) code and transmit the corresponding codeword independently over additive white Gaussian noise (AWGN) channels. To reconstruct the original bit sequence, an iterative joint source-channel decoding (JSCD) technique is considered. To exploit the knowledge about the source correlations, we consider an iterative decoding between a sum-product (SP) decoder serially concatenated with BCJR decoder which is applied for every sensor as local iterations. Then, correlation between sensors' data is employed to update extrinsic information received from the SP-BCJR decoders of the different sensors during global iterations. We illustrate the performance of the joint decoder for different correlation setups and with different number of sensors. Simulation results, in terms of bit error rate show promising improvements compared with the separate decoding scheme where the correlation knowledge is not completely utilized in the decoder.
{"title":"Joint source-channel decoding for LDPC-coded error-corrupted binary Markov sources","authors":"Amin Zribi, T. Matsumoto, R. Pyndiah","doi":"10.1109/ICCNC.2016.7440677","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440677","url":null,"abstract":"We consider the problem of joint decoding and data fusion in data gathering for densely deployed sensor networks modeled by the Chief Executive Officer (CEO) problem. More specifically, we consider the binary CEO problem where all sensors observe the same time-correlated binary Markov source corrupted by independent binary noises. Hence, the observations are two-dimensionally (temporary and spatially) correlated. In the proposed scheme, every sensor apply a low-density parity-check (LDPC) code and transmit the corresponding codeword independently over additive white Gaussian noise (AWGN) channels. To reconstruct the original bit sequence, an iterative joint source-channel decoding (JSCD) technique is considered. To exploit the knowledge about the source correlations, we consider an iterative decoding between a sum-product (SP) decoder serially concatenated with BCJR decoder which is applied for every sensor as local iterations. Then, correlation between sensors' data is employed to update extrinsic information received from the SP-BCJR decoders of the different sensors during global iterations. We illustrate the performance of the joint decoder for different correlation setups and with different number of sensors. Simulation results, in terms of bit error rate show promising improvements compared with the separate decoding scheme where the correlation knowledge is not completely utilized in the decoder.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134462879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440668
J. Anderson, Hongxin Hu, U. Agarwal, Craig Lowery, Hongda Li, A. Apon
The network performance of virtual machines plays a critical role in Network Functions Virtualization (NFV), and several technologies have been developed to address hardware-level virtualization shortcomings. Recent advances in operating system level virtualization and deployment platforms such as Docker have made containers an ideal candidate for high performance application encapsulation and deployment. However, Docker and other solutions typically use lower-performing networking mechanisms. In this paper, we explore the feasibility of using technologies designed to accelerate virtual machine networking with containers, in addition to quantifying the network performance of container-based VNFs compared to the state-of-the-art virtual machine solutions. Our results show that containerized applications can provide lower latency and delay variation, and can take advantage of high performance networking technologies previously only used for hardware virtualization.
{"title":"Performance considerations of network functions virtualization using containers","authors":"J. Anderson, Hongxin Hu, U. Agarwal, Craig Lowery, Hongda Li, A. Apon","doi":"10.1109/ICCNC.2016.7440668","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440668","url":null,"abstract":"The network performance of virtual machines plays a critical role in Network Functions Virtualization (NFV), and several technologies have been developed to address hardware-level virtualization shortcomings. Recent advances in operating system level virtualization and deployment platforms such as Docker have made containers an ideal candidate for high performance application encapsulation and deployment. However, Docker and other solutions typically use lower-performing networking mechanisms. In this paper, we explore the feasibility of using technologies designed to accelerate virtual machine networking with containers, in addition to quantifying the network performance of container-based VNFs compared to the state-of-the-art virtual machine solutions. Our results show that containerized applications can provide lower latency and delay variation, and can take advantage of high performance networking technologies previously only used for hardware virtualization.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133854227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440672
Lulu Yang, Long Gong, Zuqing Zhu
In this paper, we leverage the Set-Cover problem to design the multicast-capable routing, modulation and spectrum assignment (MC-RMSA) algorithms that utilizes network coding (NC) to achieve efficient service provisioning in flexible-grid elastic optical networks (EONs). We use a realistic network model that considers the physical impairments from both transmission and light-splitting, and propose to serve each multicast request with a light-forest that includes one or more light-graphs1 to improve spectrum efficiency. For each multicast request, the proposed algorithms firstly use a Set-Cover approach to select the destination subsets to cover all the destinations. Then, for each subset, we calculate the light-graph to cover all the destination in it. The proposed algorithms are evaluated with extensive simulations for dynamic service provisioning, and the simulation results indicate that they can achieve better performance on blocking probability than existing MC-RMSA algorithms.
{"title":"Incorporating network coding to formulate multicast sessions in elastic optical networks","authors":"Lulu Yang, Long Gong, Zuqing Zhu","doi":"10.1109/ICCNC.2016.7440672","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440672","url":null,"abstract":"In this paper, we leverage the Set-Cover problem to design the multicast-capable routing, modulation and spectrum assignment (MC-RMSA) algorithms that utilizes network coding (NC) to achieve efficient service provisioning in flexible-grid elastic optical networks (EONs). We use a realistic network model that considers the physical impairments from both transmission and light-splitting, and propose to serve each multicast request with a light-forest that includes one or more light-graphs1 to improve spectrum efficiency. For each multicast request, the proposed algorithms firstly use a Set-Cover approach to select the destination subsets to cover all the destinations. Then, for each subset, we calculate the light-graph to cover all the destination in it. The proposed algorithms are evaluated with extensive simulations for dynamic service provisioning, and the simulation results indicate that they can achieve better performance on blocking probability than existing MC-RMSA algorithms.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117077637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440709
Xiaokang Ye, X. Cai, Yuquan Shen, X. Yin, Xiang Cheng
In this paper, a recently conducted measurement campaign for High-Speed-Train (HST) channels is introduced where the down-link signals of in-service Long Time Evolution-Advanced (LTE-A) networks deployed along a HST railway between Beijing to Shanghai were acquired. The channel impulse responses (CIRs) are extracted from the received Cell-specific Reference Signals (CRSs). The results show that, most of the channels contain a delay trajectory corresponding to a line-of-sight (LoS) path. The geometry parameters such as the train speed and the minimal distance between the transmitter and the receiver are extracted from the delay trajectories. Furthermore, path loss characteristics along the trajectories are investigated and compared with the model extracted for the Universal Mobile Telecommunications System (UMTS).
{"title":"A geometry-based path loss model for high-speed-train environments in LTE-A networks","authors":"Xiaokang Ye, X. Cai, Yuquan Shen, X. Yin, Xiang Cheng","doi":"10.1109/ICCNC.2016.7440709","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440709","url":null,"abstract":"In this paper, a recently conducted measurement campaign for High-Speed-Train (HST) channels is introduced where the down-link signals of in-service Long Time Evolution-Advanced (LTE-A) networks deployed along a HST railway between Beijing to Shanghai were acquired. The channel impulse responses (CIRs) are extracted from the received Cell-specific Reference Signals (CRSs). The results show that, most of the channels contain a delay trajectory corresponding to a line-of-sight (LoS) path. The geometry parameters such as the train speed and the minimal distance between the transmitter and the receiver are extracted from the delay trajectories. Furthermore, path loss characteristics along the trajectories are investigated and compared with the model extracted for the Universal Mobile Telecommunications System (UMTS).","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126540411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440591
Tinghan Yang, Rongqing Zhang, Xiang Cheng, Liuqing Yang
Recently, the vehicular ad hoc networks (VANETs) and full-duplex (FD) cellular networks have both attracted much research interest. Considering the trend of integrated networks in the future, in this paper, we focus on the FD cellular-VANET heterogeneous networks, where cellular uplinks, downlinks, and vehicle-to-vehicle (V2V) communication links co-exist and are permitted to reuse the same spectrum resources. This also leads to a more complicated interference scenario. In such a scenario, we for the first time study the joint resource blocks assignment and transmit power allocation problem. Specifically, we construct a graph to model the system, and further propose a graph coloring based resource sharing scheme to solve the problem, in order to achieve a relatively good trade-off between the network throughput and the computational complexity. The simulation results demonstrate the efficiency of our proposed algorithm.
{"title":"A graph coloring resource sharing scheme for full-duplex cellular-VANET heterogeneous networks","authors":"Tinghan Yang, Rongqing Zhang, Xiang Cheng, Liuqing Yang","doi":"10.1109/ICCNC.2016.7440591","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440591","url":null,"abstract":"Recently, the vehicular ad hoc networks (VANETs) and full-duplex (FD) cellular networks have both attracted much research interest. Considering the trend of integrated networks in the future, in this paper, we focus on the FD cellular-VANET heterogeneous networks, where cellular uplinks, downlinks, and vehicle-to-vehicle (V2V) communication links co-exist and are permitted to reuse the same spectrum resources. This also leads to a more complicated interference scenario. In such a scenario, we for the first time study the joint resource blocks assignment and transmit power allocation problem. Specifically, we construct a graph to model the system, and further propose a graph coloring based resource sharing scheme to solve the problem, in order to achieve a relatively good trade-off between the network throughput and the computational complexity. The simulation results demonstrate the efficiency of our proposed algorithm.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128653059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440690
Oliver Sawade, Bernd Schäufele, I. Radusch
With the advent of cooperative automated functions a host of novel functions becomes feasible - cooperative driver assistance systems (CoDAS). We present an example for a novel collaborative vehicle-2-infrastructure interaction with the "automated emergency vehicle green-light" (AEVGL) function. In our approach we combine traffic light infrastructure with Dedicated Short Range Communication (DSRC) over IEEE 802.11p to address a serious issue: accidents containing emergency vehicles at intersections. In AEVGL we utilize communication to preemptively switch traffic lights to red for crossing traffic to allow safe passage of the approaching emergency vehicle even in low communication penetration scenarios. This function can serve as blueprint for other novel lightweight CoDAS functions with a very specific scope. GLOSA and AEV are currently tested in the TEAM IP project to facilitate AEVGL.
{"title":"Collaboration over IEEE 802.11p to enable an intelligent traffic light function for emergency vehicles","authors":"Oliver Sawade, Bernd Schäufele, I. Radusch","doi":"10.1109/ICCNC.2016.7440690","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440690","url":null,"abstract":"With the advent of cooperative automated functions a host of novel functions becomes feasible - cooperative driver assistance systems (CoDAS). We present an example for a novel collaborative vehicle-2-infrastructure interaction with the \"automated emergency vehicle green-light\" (AEVGL) function. In our approach we combine traffic light infrastructure with Dedicated Short Range Communication (DSRC) over IEEE 802.11p to address a serious issue: accidents containing emergency vehicles at intersections. In AEVGL we utilize communication to preemptively switch traffic lights to red for crossing traffic to allow safe passage of the approaching emergency vehicle even in low communication penetration scenarios. This function can serve as blueprint for other novel lightweight CoDAS functions with a very specific scope. GLOSA and AEV are currently tested in the TEAM IP project to facilitate AEVGL.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125706810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440561
D. Baba, N. Suematsu, Shun Nabeshima, T. Miyazaki
In this study, we propose a reconfigurable sensor network emulator (ReSNE) that realizes a virtual large-scale sensor network environment by combining pseudo sensor/network devices and real ones. This is necessary as it is difficult to evaluate nationwide sensor networks using a real environment because of the need for a large number of real sensor nodes and related devices such as base stations, in addition to a large dedicated communication network. To emulate sensor network traffic, we also use a sensor data generator that generates sensed data packets in the network based on specific user-defined parameters. Furthermore, we develop an auto-configuration tool to enable us to set up the environment quickly. Here, we discuss details of the proposed ReSNE architecture and present some of the evaluation results obtained.
{"title":"ReSNE: Reconfigurable sensor network emulator virtualizing integrated large-scale sensor network","authors":"D. Baba, N. Suematsu, Shun Nabeshima, T. Miyazaki","doi":"10.1109/ICCNC.2016.7440561","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440561","url":null,"abstract":"In this study, we propose a reconfigurable sensor network emulator (ReSNE) that realizes a virtual large-scale sensor network environment by combining pseudo sensor/network devices and real ones. This is necessary as it is difficult to evaluate nationwide sensor networks using a real environment because of the need for a large number of real sensor nodes and related devices such as base stations, in addition to a large dedicated communication network. To emulate sensor network traffic, we also use a sensor data generator that generates sensed data packets in the network based on specific user-defined parameters. Furthermore, we develop an auto-configuration tool to enable us to set up the environment quickly. Here, we discuss details of the proposed ReSNE architecture and present some of the evaluation results obtained.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130467979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440726
Deli Qiao, Hai-feng Qian, Geoffrey Y. Li
Massive MIMO has been identified as one of the promising disruptive air interface techniques to address the huge capacity requirement demanded by 5G wireless communications. For practical deployment of such systems, the control messages need to be broadcast to all users reliably in the cell using broadbeam. A perfect broadbeam is expected to have the same radiated power in all directions to cover users in any place in a cell. In this paper, we will show that there is no non-trivial solution for perfect broadbeam. Therefore, we develop a method for generating broadbeam that can allow tiny fluctuations in radiated power. Overall, this can serve as an ingredient for practical deployment of the massive MIMO systems.
{"title":"On the design of broadbeam for massive MIMO systems","authors":"Deli Qiao, Hai-feng Qian, Geoffrey Y. Li","doi":"10.1109/ICCNC.2016.7440726","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440726","url":null,"abstract":"Massive MIMO has been identified as one of the promising disruptive air interface techniques to address the huge capacity requirement demanded by 5G wireless communications. For practical deployment of such systems, the control messages need to be broadcast to all users reliably in the cell using broadbeam. A perfect broadbeam is expected to have the same radiated power in all directions to cover users in any place in a cell. In this paper, we will show that there is no non-trivial solution for perfect broadbeam. Therefore, we develop a method for generating broadbeam that can allow tiny fluctuations in radiated power. Overall, this can serve as an ingredient for practical deployment of the massive MIMO systems.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130989891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440624
E. Ayanoglu
Cellular wireless or mobile communications have seen four generations of technological developments. Today, technologists are proposing a Fifth Generation (5G) for around 2020. Most consider this time to be when the infrastructure will need to be renewed. Together with this observation, it is usually argued that, the new generation technology should possess a number of features. There is no consensus on what these new features should be. Some argue that we are facing a new generation of devices that will have continuous Internet connectivity, and consequently there will be more machine to-machine or machine-type communications. It is argued that machine-type communication will require very low latency. Others argue that the demand for services will increase by about three orders of magnitude and the new technology should be designed to support this tremendous increase, perhaps handling each order of magnitude by means of a different approach. In this paper, we discuss the modulation techniques proposed for 5G and their justification.
{"title":"5G today: Modulation technique alternatives","authors":"E. Ayanoglu","doi":"10.1109/ICCNC.2016.7440624","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440624","url":null,"abstract":"Cellular wireless or mobile communications have seen four generations of technological developments. Today, technologists are proposing a Fifth Generation (5G) for around 2020. Most consider this time to be when the infrastructure will need to be renewed. Together with this observation, it is usually argued that, the new generation technology should possess a number of features. There is no consensus on what these new features should be. Some argue that we are facing a new generation of devices that will have continuous Internet connectivity, and consequently there will be more machine to-machine or machine-type communications. It is argued that machine-type communication will require very low latency. Others argue that the demand for services will increase by about three orders of magnitude and the new technology should be designed to support this tremendous increase, perhaps handling each order of magnitude by means of a different approach. In this paper, we discuss the modulation techniques proposed for 5G and their justification.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":" 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132074828","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
扫码关注我们
求助内容：
应助结果提醒方式：