Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631777
Jinho Choi, M. Jeon
We consider an adaptive scheme to determine the access probability for random access when the number of sensors is varying in a wireless sensor network (WSN) to reconstruct a target field (i.e., a 2-dimensional process). In particular, we consider mobile sensor units (MSUs) that are sensor units on cars or unmanned aerial vehicles (UAVs), The access probability is adaptively decided within a session that consists of multiple time slots by estimating the number of MSUs. An access point (AP) is to estimate the number of the MSUs that transmit preambles and fed back this information so that the MSUs can determine their access probability to maximize the throughput. Simulation results confirm that the proposed adaptive scheme can provide a near optimal throughput although the initial estimate of the total number of MSUs is overestimated.
{"title":"Adaptive Random Access for Mobile Sensors Based Field Reconstruction","authors":"Jinho Choi, M. Jeon","doi":"10.1109/ICSPCS.2018.8631777","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631777","url":null,"abstract":"We consider an adaptive scheme to determine the access probability for random access when the number of sensors is varying in a wireless sensor network (WSN) to reconstruct a target field (i.e., a 2-dimensional process). In particular, we consider mobile sensor units (MSUs) that are sensor units on cars or unmanned aerial vehicles (UAVs), The access probability is adaptively decided within a session that consists of multiple time slots by estimating the number of MSUs. An access point (AP) is to estimate the number of the MSUs that transmit preambles and fed back this information so that the MSUs can determine their access probability to maximize the throughput. Simulation results confirm that the proposed adaptive scheme can provide a near optimal throughput although the initial estimate of the total number of MSUs is overestimated.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117151456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631721
Taku Sugimoto, S. Suyama, Satoshi Nagata, N. Miki
In mobile-communication systems such as 5G and beyond, extremely high performance levels are required for a single radio access network to support very different types of traffic. The requisite channel codes in mobile-communication systems require higher throughput, extremely low latency, and low power consumption and have different inherent error rates. Also essential is a rate-compatible structure, which can generate the arbitrary coding rates. One of the ways in which the diverse demands of such systems could be met is through the use of polar codes. For polar codes, information bits need to be selected properly, as inappropriate information bits degrade the performance of the code. We propose the rate-compatible polar codes to achieve the required block-error rates. We have verified their performance by using a computer simulation and can show the effectiveness of our proposed method.
{"title":"Investigation on Rate-Compatible Polar Codes Achieving Required Block Error Rates","authors":"Taku Sugimoto, S. Suyama, Satoshi Nagata, N. Miki","doi":"10.1109/ICSPCS.2018.8631721","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631721","url":null,"abstract":"In mobile-communication systems such as 5G and beyond, extremely high performance levels are required for a single radio access network to support very different types of traffic. The requisite channel codes in mobile-communication systems require higher throughput, extremely low latency, and low power consumption and have different inherent error rates. Also essential is a rate-compatible structure, which can generate the arbitrary coding rates. One of the ways in which the diverse demands of such systems could be met is through the use of polar codes. For polar codes, information bits need to be selected properly, as inappropriate information bits degrade the performance of the code. We propose the rate-compatible polar codes to achieve the required block-error rates. We have verified their performance by using a computer simulation and can show the effectiveness of our proposed method.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122895176","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}
There is phase distortion in squint Frequency Modulated Continuous Wave Synthetic Aperture Radar (FMCW-SAR), and the phase distortion may affect the imaging process. In this paper, the echo signal model of squint FMCW-SAR is established, and the phase error caused by squint is analysed. Then in this paper, an improved Range-Doppler (RD) imaging algorithm based on FMCW-SAR is proposed from the point of view of real-time processing. The algorithm has the characteristics of small computation and high precision, and is suitable for real-time imaging. Finally, the feasibility and validity of the algorithm are verified by simulation analysis.
{"title":"Improved Range Doppler Algorithm Based on Squint FMCW-SAR","authors":"Zhuoqun Wang, Yajun Li, Sheng Shao, Shuangshuang Li, Jinguo Xiao, JunQiang Wu","doi":"10.1109/ICSPCS.2018.8631767","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631767","url":null,"abstract":"There is phase distortion in squint Frequency Modulated Continuous Wave Synthetic Aperture Radar (FMCW-SAR), and the phase distortion may affect the imaging process. In this paper, the echo signal model of squint FMCW-SAR is established, and the phase error caused by squint is analysed. Then in this paper, an improved Range-Doppler (RD) imaging algorithm based on FMCW-SAR is proposed from the point of view of real-time processing. The algorithm has the characteristics of small computation and high precision, and is suitable for real-time imaging. Finally, the feasibility and validity of the algorithm are verified by simulation analysis.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121676328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631786
Saisai Yuan, Chengzeng Chen, Xiaojian Xu
Parametric model based ultra-wideband fusion of multiple radar band data is usually not directly applicable to radar image processing for large sized complex targets, due to the fact that the required model orders are extremely high. In this paper, a block-division based data fusion technique is proposed, which can be used for multiple radar band fusion over ultra-wide bandwidth and image resolution enhancement for complex targets. In image domain, a large sized complex target is first divided into small blocks for each radar band. Each block is then equivalent to a small sized simple target whose missing phase history data between two different radar bands can be interpolated based on parametric models derived from the measurement data of the corresponding bands. Resolution enhanced image can then be reconstructed by integrating all the image blocks generated from the multi-band fused data. Numerical examples are presented to demonstrate the usefulness of the proposed technique.
{"title":"Block-Division Based Ultra-Wideband Fusion of Multiple Radar Bands for Resolution Enhanced Imagery","authors":"Saisai Yuan, Chengzeng Chen, Xiaojian Xu","doi":"10.1109/ICSPCS.2018.8631786","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631786","url":null,"abstract":"Parametric model based ultra-wideband fusion of multiple radar band data is usually not directly applicable to radar image processing for large sized complex targets, due to the fact that the required model orders are extremely high. In this paper, a block-division based data fusion technique is proposed, which can be used for multiple radar band fusion over ultra-wide bandwidth and image resolution enhancement for complex targets. In image domain, a large sized complex target is first divided into small blocks for each radar band. Each block is then equivalent to a small sized simple target whose missing phase history data between two different radar bands can be interpolated based on parametric models derived from the measurement data of the corresponding bands. Resolution enhanced image can then be reconstructed by integrating all the image blocks generated from the multi-band fused data. Numerical examples are presented to demonstrate the usefulness of the proposed technique.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127558894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631727
Bingpeng Zhou, An Liu, V. Lau
In this paper, the localization issue for LiFi users is studied. Due to the nonlinear dependency of received visible light strength on user geometric location parameters, LiFi localization is a non-convex problem and hence it is of great challenge. In order to reduce the problem complexity, previous solutions usually require a known height of user equipment or a perfect alignment of transceiver orientation angles, which limits the application of such solutions. To solve this problem, we propose a novel algorithm to achieve an easy LiFi localization solution without any requirement on perfect alignment transceiver orientations or prior knowledge of user equipment height. By exploring the inherent convex structure of the problem, the proposed algorithm gives an efficient closed-form update equation for both user location and orientation angle, thus achieving an accurate solution with fast convergence rate. The performance of the proposed localization algorithm is verified by simulations, and it is shown that the proposed algorithm can achieve a huge localization performance gain over existing approaches due to the joint optimization of user location and orientation angle as well as the problem-specific parameter update rule design.
{"title":"Robust Visible Light-Based Positioning Under Unknown User Device Orientation Angle","authors":"Bingpeng Zhou, An Liu, V. Lau","doi":"10.1109/ICSPCS.2018.8631727","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631727","url":null,"abstract":"In this paper, the localization issue for LiFi users is studied. Due to the nonlinear dependency of received visible light strength on user geometric location parameters, LiFi localization is a non-convex problem and hence it is of great challenge. In order to reduce the problem complexity, previous solutions usually require a known height of user equipment or a perfect alignment of transceiver orientation angles, which limits the application of such solutions. To solve this problem, we propose a novel algorithm to achieve an easy LiFi localization solution without any requirement on perfect alignment transceiver orientations or prior knowledge of user equipment height. By exploring the inherent convex structure of the problem, the proposed algorithm gives an efficient closed-form update equation for both user location and orientation angle, thus achieving an accurate solution with fast convergence rate. The performance of the proposed localization algorithm is verified by simulations, and it is shown that the proposed algorithm can achieve a huge localization performance gain over existing approaches due to the joint optimization of user location and orientation angle as well as the problem-specific parameter update rule design.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134572195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631709
D. Umehara, Takuma Yamamoto, Jinhong Yuan
For future machine-type communication systems, the frame duration will shorten because the sensor data size is small and the PHY rate gets higher. The contention interval caused by the propagation delay and the processing time becomes relatively larger as compared with the frame duration. The advantage of carrier sense function for random access protocols is impaired. To enhance the energy efficiency of wireless communication devices, the frequent use of carrier sense function will not be desirable because the receiver is active during sensing the wireless channel. In this paper, we propose a non-persistent slotted ALOHA (SALOHA) that the transceiver is in the sleep mode except for transmit and observation slots on the assumption of immediate ACK or self ACK. We incorporate a success prioritized backoff algorithm into SALOHA in order to enhance the throughput and reduce the energy efficiency and the delay. We clarify the closed-form expressions of network throughput and per-node consumed current for given saturated network traffic. A network simulator shows the unsaturated network performances such as the network throughput and the average delay. Furthermore, we design the contention window (CW) so as to maximize the network throughput.
{"title":"Success Prioritized Slotted ALOHA with Sleep Function","authors":"D. Umehara, Takuma Yamamoto, Jinhong Yuan","doi":"10.1109/ICSPCS.2018.8631709","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631709","url":null,"abstract":"For future machine-type communication systems, the frame duration will shorten because the sensor data size is small and the PHY rate gets higher. The contention interval caused by the propagation delay and the processing time becomes relatively larger as compared with the frame duration. The advantage of carrier sense function for random access protocols is impaired. To enhance the energy efficiency of wireless communication devices, the frequent use of carrier sense function will not be desirable because the receiver is active during sensing the wireless channel. In this paper, we propose a non-persistent slotted ALOHA (SALOHA) that the transceiver is in the sleep mode except for transmit and observation slots on the assumption of immediate ACK or self ACK. We incorporate a success prioritized backoff algorithm into SALOHA in order to enhance the throughput and reduce the energy efficiency and the delay. We clarify the closed-form expressions of network throughput and per-node consumed current for given saturated network traffic. A network simulator shows the unsaturated network performances such as the network throughput and the average delay. Furthermore, we design the contention window (CW) so as to maximize the network throughput.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133078573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631724
Jiaman Li, Le Chung Tran, F. Safaei
In this paper, throughput and bit error performance of an in-band full duplex (IBFD) relaying system assisted by the radio frequency energy harvesting technique and the polarization-enabled digital self-interference cancellation (PDC) scheme are investigated. In particular, the relay node harvests power from the wireless radio frequency signal transmitted from the source node and uses this power to amplify and forward signals to the destination. Meanwhile, the PDC scheme is used at the relay node to cancel the self-interference signal in order to facilitate the concurrent in-band transmission and reception. The impact of both energy harvesting and self-interference cancellation on the throughput and the error performance of the system is evaluated. Our simulation results show that the full-duplex energy harvesting relaying system almost doubles the system throughput, compared to the half-duplex energy harvesting relaying system, at the cost of about 5 dB inferior error performance, partially because of the noise effect of the PDC scheme. We also show that to achieve a high throughput along with a good error performance in the full-duplex energy harvesting relaying system, a combined selection of a high signal-to-noise ratio and a suitable energy harvesting time is required.
{"title":"Performance Evaluation of Full-Duplex Energy Harvesting Relaying Networks Using PDC Self-Interference Cancellation","authors":"Jiaman Li, Le Chung Tran, F. Safaei","doi":"10.1109/ICSPCS.2018.8631724","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631724","url":null,"abstract":"In this paper, throughput and bit error performance of an in-band full duplex (IBFD) relaying system assisted by the radio frequency energy harvesting technique and the polarization-enabled digital self-interference cancellation (PDC) scheme are investigated. In particular, the relay node harvests power from the wireless radio frequency signal transmitted from the source node and uses this power to amplify and forward signals to the destination. Meanwhile, the PDC scheme is used at the relay node to cancel the self-interference signal in order to facilitate the concurrent in-band transmission and reception. The impact of both energy harvesting and self-interference cancellation on the throughput and the error performance of the system is evaluated. Our simulation results show that the full-duplex energy harvesting relaying system almost doubles the system throughput, compared to the half-duplex energy harvesting relaying system, at the cost of about 5 dB inferior error performance, partially because of the noise effect of the PDC scheme. We also show that to achieve a high throughput along with a good error performance in the full-duplex energy harvesting relaying system, a combined selection of a high signal-to-noise ratio and a suitable energy harvesting time is required.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128882384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631752
Melissa Stola, M. Lech, R. Bolia, Michael Skinner
One of the problems limiting the accuracy of speech emotion recognition (SER) is difficulty in the differentiation between acoustically-similar emotions. Since it is not clear how emotions differ in acoustic terms, it is difficult to design new, more efficient SER strategies. In this study, amplitude-frequency analysis of emotional speech was performed to determine relative differences between seven emotional categories of speech in the Berlin Emotional Speech (EMO-DB) database. The analysis transformed short J-second blocks of speech into RGB images of spectrograms using four different frequency scales. The images were used to train a convolutional neural network (CNN) to recognize emotions. By training the network with different combinations of frequency scales and color components of the RGB images that emphasized different frequency and spectral amplitude values, links between different emotions and corresponding amplitude-frequency characteristics of speech were determined.
{"title":"Acoustic Characteristics of Emotional Speech Using Spectrogram Image Classification","authors":"Melissa Stola, M. Lech, R. Bolia, Michael Skinner","doi":"10.1109/ICSPCS.2018.8631752","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631752","url":null,"abstract":"One of the problems limiting the accuracy of speech emotion recognition (SER) is difficulty in the differentiation between acoustically-similar emotions. Since it is not clear how emotions differ in acoustic terms, it is difficult to design new, more efficient SER strategies. In this study, amplitude-frequency analysis of emotional speech was performed to determine relative differences between seven emotional categories of speech in the Berlin Emotional Speech (EMO-DB) database. The analysis transformed short J-second blocks of speech into RGB images of spectrograms using four different frequency scales. The images were used to train a convolutional neural network (CNN) to recognize emotions. By training the network with different combinations of frequency scales and color components of the RGB images that emphasized different frequency and spectral amplitude values, links between different emotions and corresponding amplitude-frequency characteristics of speech were determined.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128701607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631735
Paul James Wambi, O. Falowo
This paper addresses the energy usage concerns in Ultra-Dense Networks (UDNs) with focus on the energy consumption of the base stations (BSs), given that base stations consume 80% of the total network energy. It models the Network Energy Efficiency (NEE) optimization problem using stochastic geometry. The NEE optimization problem takes into consideration the user's Quality-of-service (QoS), inter-cell interference as well as each user's spectral efficiency. The formulated NEE optimization problem is of type NP-hard, due to the user-cell association. The proposed solution to the formulated optimization problem makes use of constraint relaxation to transform the NP-hard problem into a more solvable, convex and linear optimization one. This combined with Lagrangian dual decomposition is used to create a distributed solution. After cell-association and resource allocation phases, the proposed solution performs a Cell On/Off to further reduce power consumption. Then finally, the performance of the proposed scheme is examined in comparison to four other UDN NEE management schemes under different network scenarios. The results obtained show that the proposed scheme's performance is the closest to the Exhaustive Search algorithm, which demonstrates the superiority of the proposed scheme to the other sub-optimal schemes.
{"title":"Towards Optimum Energy Efficiency in Ultra-Dense Networks Using Distributed Resource Allocation with Cell On & Off","authors":"Paul James Wambi, O. Falowo","doi":"10.1109/ICSPCS.2018.8631735","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631735","url":null,"abstract":"This paper addresses the energy usage concerns in Ultra-Dense Networks (UDNs) with focus on the energy consumption of the base stations (BSs), given that base stations consume 80% of the total network energy. It models the Network Energy Efficiency (NEE) optimization problem using stochastic geometry. The NEE optimization problem takes into consideration the user's Quality-of-service (QoS), inter-cell interference as well as each user's spectral efficiency. The formulated NEE optimization problem is of type NP-hard, due to the user-cell association. The proposed solution to the formulated optimization problem makes use of constraint relaxation to transform the NP-hard problem into a more solvable, convex and linear optimization one. This combined with Lagrangian dual decomposition is used to create a distributed solution. After cell-association and resource allocation phases, the proposed solution performs a Cell On/Off to further reduce power consumption. Then finally, the performance of the proposed scheme is examined in comparison to four other UDN NEE management schemes under different network scenarios. The results obtained show that the proposed scheme's performance is the closest to the Exhaustive Search algorithm, which demonstrates the superiority of the proposed scheme to the other sub-optimal schemes.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125402405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ICSPCS.2018.8631746
Bisma Manzoor, A. Al-Hourani, K. G. Chavez, S. Kandeepan, Ming Ding
With the advent of Internet of Things (IoT) more devices are connecting to the network. As such, a robust network is required to properly deal with this huge traffic. The Fifth Generation (5G) technology is anticipated to have capability of handling huge data generated by massive number of devices. In the literature, most of the geometric network models that have been proposed are in two dimensions (2D). This paper focuses on modelling networks that considers massive number of devices (IoT-devices) in three dimensions (3D) using the tools of stochastic modelling. The location of the devices and Base Stations (BS) in terms of third dimension is considered using the distribution of heights of buildings put forth by ITU - R. Additionally, 3D coverage probability of the dense network for Melbourne Central Business District (CBD) is analysed and compared with 2D simulations. Our results show that it is important to model IoT-based networks taking into account heights of nodes, as there is a significant shift in contact distances in 3D as compared to 2D. This sequentially proves to have a considerable effect on the cellular characteristics such as coverage probability.
{"title":"2D Versus 3D Geometric Modelling for Massive Access Networks in 5G-IoT Applications","authors":"Bisma Manzoor, A. Al-Hourani, K. G. Chavez, S. Kandeepan, Ming Ding","doi":"10.1109/ICSPCS.2018.8631746","DOIUrl":"https://doi.org/10.1109/ICSPCS.2018.8631746","url":null,"abstract":"With the advent of Internet of Things (IoT) more devices are connecting to the network. As such, a robust network is required to properly deal with this huge traffic. The Fifth Generation (5G) technology is anticipated to have capability of handling huge data generated by massive number of devices. In the literature, most of the geometric network models that have been proposed are in two dimensions (2D). This paper focuses on modelling networks that considers massive number of devices (IoT-devices) in three dimensions (3D) using the tools of stochastic modelling. The location of the devices and Base Stations (BS) in terms of third dimension is considered using the distribution of heights of buildings put forth by ITU - R. Additionally, 3D coverage probability of the dense network for Melbourne Central Business District (CBD) is analysed and compared with 2D simulations. Our results show that it is important to model IoT-based networks taking into account heights of nodes, as there is a significant shift in contact distances in 3D as compared to 2D. This sequentially proves to have a considerable effect on the cellular characteristics such as coverage probability.","PeriodicalId":179948,"journal":{"name":"2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126796603","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
扫码关注我们
求助内容：
应助结果提醒方式：