Pub Date : 2019-06-24DOI: 10.1109/IWCMC.2019.8766479
Ishan Budhiraja, Sudhanshu Tyagi, S. Tanwar, Neeraj Kumar, Nadra Guizani
Energy management of mobile devices is a crucial issue in fifth generation (5G) network due to their limited battery capacity. Simultaneous Wireless Information and Power Transfer (SWIPT) is an emerging technique which allows mobile devices to harvest energy from radio frequency (RF) signals. Moreover, Non-Orthogonal Multiple Access (NOMA) serves multiple users simultaneously using the same subchannel inter-user interference mitigation. By considering the aforementioned issues, in this paper, we propose a subchannel assignment scheme for SWIPT-NOMA based pico base station/femto base station with macro-cellular networks. The energy-efficient subchannel assignment is a probabilistic mixed non-convex optimization problem by considering imperfect channel state information (CSI). To address this problem, many-to-many matching theory is used in the proposal. Numerical results show that the proposed algorithm performs better in terms of numbers of PUs/FUs, average energy efficiency (EE) of the Picocells/Femtocells, in comparison to the orthogonal frequency division access scheme and conventional NOMA.
{"title":"Subchannel Assignment for SWIPT-NOMA based HetNet with Imperfect Channel State Information","authors":"Ishan Budhiraja, Sudhanshu Tyagi, S. Tanwar, Neeraj Kumar, Nadra Guizani","doi":"10.1109/IWCMC.2019.8766479","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766479","url":null,"abstract":"Energy management of mobile devices is a crucial issue in fifth generation (5G) network due to their limited battery capacity. Simultaneous Wireless Information and Power Transfer (SWIPT) is an emerging technique which allows mobile devices to harvest energy from radio frequency (RF) signals. Moreover, Non-Orthogonal Multiple Access (NOMA) serves multiple users simultaneously using the same subchannel inter-user interference mitigation. By considering the aforementioned issues, in this paper, we propose a subchannel assignment scheme for SWIPT-NOMA based pico base station/femto base station with macro-cellular networks. The energy-efficient subchannel assignment is a probabilistic mixed non-convex optimization problem by considering imperfect channel state information (CSI). To address this problem, many-to-many matching theory is used in the proposal. Numerical results show that the proposed algorithm performs better in terms of numbers of PUs/FUs, average energy efficiency (EE) of the Picocells/Femtocells, in comparison to the orthogonal frequency division access scheme and conventional NOMA.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131660051","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-06-24DOI: 10.1109/IWCMC.2019.8766627
Bohui Wang, Hui Yang, Q. Yao, Ao Yu, Tao Hong, Jie Zhang, M. Kadoch, M. Cheriet
With the rapid evolution of smart city all over the world, the appealing services of IoT and big data analytics have prompted the design of more reliable assurance mechanism for network quality. It has been a crucial issue of network operation that once multiple links fail simultaneously, the transmission of real-time services cannot be guaranteed. Therefore, rapid locating of faults is the premise for network to recover quickly. However, current faults location methods can’t satisfy the requirement due to the expansion scale of wireless and optical networks and the growing demands of customers. In this paper, we propose an efficient multi-link faults location algorithm based on Hopfield Neural Network (HNN). We make full use of the information of network topology and the services transmitted to model the relationship between fault set and alarm set. HNN is used as an optimization method to analyze the uncertainty of faults and alarms and to find where the faults most likely occur by constructing a proper energy function. It has been proved by experiments that this method can achieve real-time faults location while ensuring positioning accuracy, which provides a good solution for smart city service assurance.
{"title":"Hopfield Neural Network-based Fault Location in Wireless and Optical Networks for Smart City IoT","authors":"Bohui Wang, Hui Yang, Q. Yao, Ao Yu, Tao Hong, Jie Zhang, M. Kadoch, M. Cheriet","doi":"10.1109/IWCMC.2019.8766627","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766627","url":null,"abstract":"With the rapid evolution of smart city all over the world, the appealing services of IoT and big data analytics have prompted the design of more reliable assurance mechanism for network quality. It has been a crucial issue of network operation that once multiple links fail simultaneously, the transmission of real-time services cannot be guaranteed. Therefore, rapid locating of faults is the premise for network to recover quickly. However, current faults location methods can’t satisfy the requirement due to the expansion scale of wireless and optical networks and the growing demands of customers. In this paper, we propose an efficient multi-link faults location algorithm based on Hopfield Neural Network (HNN). We make full use of the information of network topology and the services transmitted to model the relationship between fault set and alarm set. HNN is used as an optimization method to analyze the uncertainty of faults and alarms and to find where the faults most likely occur by constructing a proper energy function. It has been proved by experiments that this method can achieve real-time faults location while ensuring positioning accuracy, which provides a good solution for smart city service assurance.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115436949","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-06-24DOI: 10.1109/IWCMC.2019.8766509
S. Feki, A. Belghith, F. Zarai
Device-to-Device (D2D) communication is an emergent technology that provides many advantages for the LTE-A networks as higher spectral efficiency and wireless Peer-to-Peer services. It is considered as a promising technology used in many different fields like public safety, network traffic offloading, and social applications and services. However, the integration of D2D communications in cellular networks creates two main challenges. First, the interference caused by the D2D links to the cellular links could significantly affect the performance of the cellular devices. Second, the minimum QoS requirements of D2D communications need to be guaranteed. Thus, the synchronization between devices becomes a necessity while Radio Resource Management (RRM) always represents a challenge. In this paper, we study the RRM problem for Vehicle-to-Vehicle (V2V) communication. A dynamic neural Q-learning-based resource allocation and resource sharing algorithm is proposed for D2D-based V2V communication in the LTE-A cellular networks. Simulation results show that the proposed algorithm is able to offer the best-performing allocations to improve network performance.
{"title":"A Reinforcement Learning-based Radio Resource Management Algorithm for D2D-based V2V Communication","authors":"S. Feki, A. Belghith, F. Zarai","doi":"10.1109/IWCMC.2019.8766509","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766509","url":null,"abstract":"Device-to-Device (D2D) communication is an emergent technology that provides many advantages for the LTE-A networks as higher spectral efficiency and wireless Peer-to-Peer services. It is considered as a promising technology used in many different fields like public safety, network traffic offloading, and social applications and services. However, the integration of D2D communications in cellular networks creates two main challenges. First, the interference caused by the D2D links to the cellular links could significantly affect the performance of the cellular devices. Second, the minimum QoS requirements of D2D communications need to be guaranteed. Thus, the synchronization between devices becomes a necessity while Radio Resource Management (RRM) always represents a challenge. In this paper, we study the RRM problem for Vehicle-to-Vehicle (V2V) communication. A dynamic neural Q-learning-based resource allocation and resource sharing algorithm is proposed for D2D-based V2V communication in the LTE-A cellular networks. Simulation results show that the proposed algorithm is able to offer the best-performing allocations to improve network performance.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117297080","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-06-24DOI: 10.1109/IWCMC.2019.8766553
A. Ivanov, Andrey Savinov, D. Yarotsky
In this paper, we propose a new candidates list re-calculating to improve performance of iterative nonlinear detection and decoding in Multi-User (MU) Massive Multiple Input, Multiple Output (MIMO) system. The proposed nonlinear iterative detector includes a new algorithm of users (UEs) sorting before QR decomposition (QRD) and a new sorting-reduced (SR) K-best method. If MIMO detector is based on a candidates list updates, the performance can be improved by the candidates list re-calculating or using a priori information in the list generation. This is natural, because the quality of the candidates list is likely to be improved by using the decoder output as a priori information. We analyze the convergence of combining the detection algorithms with the soft low-density parity-check (LDPC) decoder. Simulation results are presented in 5G QuaDRiGa channel with QAM64 modulation in 48 × 64 MIMO system and compared with other state-of-art approaches.
为了提高多用户(MU)海量多输入多输出(MIMO)系统的迭代非线性检测和解码性能，提出了一种新的候选列表重计算方法。提出的非线性迭代检测器包括一种新的QR分解前用户排序(ue)算法和一种新的排序简化(SR) k -优方法。如果MIMO检测器基于候选列表更新，则可以通过重新计算候选列表或在列表生成中使用先验信息来提高性能。这是很自然的，因为使用解码器输出作为先验信息可能会提高候选列表的质量。分析了检测算法与软低密度奇偶校验(LDPC)解码器相结合的收敛性。给出了在48 × 64 MIMO系统中采用QAM64调制的5G QuaDRiGa信道下的仿真结果，并与其他最先进的方法进行了比较。
{"title":"Iterative Nonlinear Detection and Decoding in Multi-User Massive MIMO","authors":"A. Ivanov, Andrey Savinov, D. Yarotsky","doi":"10.1109/IWCMC.2019.8766553","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766553","url":null,"abstract":"In this paper, we propose a new candidates list re-calculating to improve performance of iterative nonlinear detection and decoding in Multi-User (MU) Massive Multiple Input, Multiple Output (MIMO) system. The proposed nonlinear iterative detector includes a new algorithm of users (UEs) sorting before QR decomposition (QRD) and a new sorting-reduced (SR) K-best method. If MIMO detector is based on a candidates list updates, the performance can be improved by the candidates list re-calculating or using a priori information in the list generation. This is natural, because the quality of the candidates list is likely to be improved by using the decoder output as a priori information. We analyze the convergence of combining the detection algorithms with the soft low-density parity-check (LDPC) decoder. Simulation results are presented in 5G QuaDRiGa channel with QAM64 modulation in 48 × 64 MIMO system and compared with other state-of-art approaches.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121909257","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-06-24DOI: 10.1109/IWCMC.2019.8766567
Josef Schmid, Mathias Schneider, A. Höß, Björn Schuller
Nowadays, on-board sensor data is primarily used to detect nascent threats during automated driving. Since the range of this data is locally restricted, centralized server architectures are taken into consideration to alleviate challenges caused by highly automated driving at higher speeds. Therefore, a server accumulates this sensor data and provides aggregated information about the traffic situation utilizing mobile network-based vehicle to server communication. To schedule communication traffic on this fluctuating channel reliably, various approaches on throughput prediction are conducted. On one hand there are models based on aggregation depending on the position, e.g. connectivity maps. On the other hand there are traditional machine learning approaches, i.a. Support Vector Regression. This work implements the latter including OSM-based feature engineering and conducts a comprehensive comparison on the performance of these models utilizing a uniform dataset.
{"title":"A Comparison of AI-Based Throughput Prediction for Cellular Vehicle-To-Server Communication","authors":"Josef Schmid, Mathias Schneider, A. Höß, Björn Schuller","doi":"10.1109/IWCMC.2019.8766567","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766567","url":null,"abstract":"Nowadays, on-board sensor data is primarily used to detect nascent threats during automated driving. Since the range of this data is locally restricted, centralized server architectures are taken into consideration to alleviate challenges caused by highly automated driving at higher speeds. Therefore, a server accumulates this sensor data and provides aggregated information about the traffic situation utilizing mobile network-based vehicle to server communication. To schedule communication traffic on this fluctuating channel reliably, various approaches on throughput prediction are conducted. On one hand there are models based on aggregation depending on the position, e.g. connectivity maps. On the other hand there are traditional machine learning approaches, i.a. Support Vector Regression. This work implements the latter including OSM-based feature engineering and conducts a comprehensive comparison on the performance of these models utilizing a uniform dataset.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122044784","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-06-24DOI: 10.1109/IWCMC.2019.8766554
H. Ferjani, Haifa Touati
Recent advances in wireless communications and electronics have enabled the development of nano sensor nodes that are able to process and transmit sensed data. These tiny sensor nodes leverage the idea of nano sensor networks that are expected to find several applications such as health care monitoring, wildlife surveillance, etc. The networking of several nano-devices is still a major open issue. In fact, the very limited transmission ranges in the terahertz band renders direct communication between nano-devices unfeasible most of the time. Hence, multihop communication among nano-nodes is currently regarded as the viable solution for nano-network realization. However, the simplicity and energy constraints of nano-sensor nodes are far from the complexity of classical multi-hop routing and forwarding protocols. On the other hand, researches on dedicated communications protocols for Wireless Nano Sensor Networks (WNSNs) are still in their early stage. In this paper, we propose a geographic routing algorithm for efficient data dissemination in electromagnetic WNSN. We evaluate our solution in the context of a health-monitoring application where multiple nano-devices are deployed in an artery. We compare our proposal to the flooding scheme and results confirm that the geographic routing scheme is scalable and energy efficient without impairing the packet delivery ratio.
{"title":"Efficient Data Dissemination in Electromagnetic Wireless Nano-Sensor Networks","authors":"H. Ferjani, Haifa Touati","doi":"10.1109/IWCMC.2019.8766554","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766554","url":null,"abstract":"Recent advances in wireless communications and electronics have enabled the development of nano sensor nodes that are able to process and transmit sensed data. These tiny sensor nodes leverage the idea of nano sensor networks that are expected to find several applications such as health care monitoring, wildlife surveillance, etc. The networking of several nano-devices is still a major open issue. In fact, the very limited transmission ranges in the terahertz band renders direct communication between nano-devices unfeasible most of the time. Hence, multihop communication among nano-nodes is currently regarded as the viable solution for nano-network realization. However, the simplicity and energy constraints of nano-sensor nodes are far from the complexity of classical multi-hop routing and forwarding protocols. On the other hand, researches on dedicated communications protocols for Wireless Nano Sensor Networks (WNSNs) are still in their early stage. In this paper, we propose a geographic routing algorithm for efficient data dissemination in electromagnetic WNSN. We evaluate our solution in the context of a health-monitoring application where multiple nano-devices are deployed in an artery. We compare our proposal to the flooding scheme and results confirm that the geographic routing scheme is scalable and energy efficient without impairing the packet delivery ratio.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125012124","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-06-24DOI: 10.1109/IWCMC.2019.8766746
N. Albakay, M. Hempel, M. Alahmad, H. Sharif
This paper presents a novel machine learning-based algorithm to estimate the frequency offset in wireless communication systems from the received signal’s IQ constellations. The algorithm focuses on dividing the received signal symbols into clusters and finding the centroid of each cluster using a modified k-means algorithm. The constellation rotation angle, corresponding to the frequency offset, is then found from the angel between the obtained centroids’ coordinates and the coordinates of the corresponding modulation format. The simulation results have shown 100% estimation accuracy for constellation rotation angles within the (-45, 45) degrees range. The proposed algorithm provides a low-complexity scheme that eliminates the overhead required for training preamble (TP) based techniques, thus improving the communication system’s efficiency. The algorithm can be applied to wide range of communication systems especially those used in high speed train and vehicular communications.
{"title":"Novel Frequency Offset Estimation Scheme for Reliable Wireless Communication using Modified K-Means Clustering","authors":"N. Albakay, M. Hempel, M. Alahmad, H. Sharif","doi":"10.1109/IWCMC.2019.8766746","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766746","url":null,"abstract":"This paper presents a novel machine learning-based algorithm to estimate the frequency offset in wireless communication systems from the received signal’s IQ constellations. The algorithm focuses on dividing the received signal symbols into clusters and finding the centroid of each cluster using a modified k-means algorithm. The constellation rotation angle, corresponding to the frequency offset, is then found from the angel between the obtained centroids’ coordinates and the coordinates of the corresponding modulation format. The simulation results have shown 100% estimation accuracy for constellation rotation angles within the (-45, 45) degrees range. The proposed algorithm provides a low-complexity scheme that eliminates the overhead required for training preamble (TP) based techniques, thus improving the communication system’s efficiency. The algorithm can be applied to wide range of communication systems especially those used in high speed train and vehicular communications.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121589086","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-06-24DOI: 10.1109/IWCMC.2019.8766630
Salah Zemmoudj, Nabila Bermad, Mawloud Omar
The emergence of IoT technology can integrate connected digital wearable devices in the health field. In this context, the smart hospital is created to facilitate and improve the quality of patient’s medical life. However, uncontrolled access to personal and health information of patients can disrupt the smooth functioning of smart hospital services. Consequently, the protection of patient privacy remains a big issue that must be addressed. In this paper, we propose a Context-Aware Privacy Model (CAPM). It aims to secure the exchanged and shared patient’s information during his hospital stay. To evaluate effectiveness of our proposal, a series of simulations are carried out using NS3. The obtained results demonstrate the efficiency of our protocol in terms of communication delay, Authentication delay, and pseudonym generation time.
{"title":"CAPM: Context-Aware Privacy Model for IoT-Based Smart Hospitals","authors":"Salah Zemmoudj, Nabila Bermad, Mawloud Omar","doi":"10.1109/IWCMC.2019.8766630","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766630","url":null,"abstract":"The emergence of IoT technology can integrate connected digital wearable devices in the health field. In this context, the smart hospital is created to facilitate and improve the quality of patient’s medical life. However, uncontrolled access to personal and health information of patients can disrupt the smooth functioning of smart hospital services. Consequently, the protection of patient privacy remains a big issue that must be addressed. In this paper, we propose a Context-Aware Privacy Model (CAPM). It aims to secure the exchanged and shared patient’s information during his hospital stay. To evaluate effectiveness of our proposal, a series of simulations are carried out using NS3. The obtained results demonstrate the efficiency of our protocol in terms of communication delay, Authentication delay, and pseudonym generation time.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122730525","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}
In contrast to the host-centric model where the communication is directed using the destination address, Information-Centric Networking (ICN) adopts the content name as the pillar network element to provide data discovery and delivery process, as well as in other network functionalities. Named Data Networking (NDN) is an active ICN project that uses hierarchical unbounded names. These names are used in both interest and data packets and other data structures that may consume more memory with long lookup time. This paper targets the naming aspect in vehicular named data networks and proposes a Name-to-Hash Encoding scheme. The idea consists of hashing each name components separately to a fixed length, then perform a heuristic Wu-Manber-like algorithm lookup process. The former process enhances the NDN to consume less memory compared to hierarchical names, the latter process provides a fast lookup time. We have evaluated the proposed scheme against different related solutions using real domain datasets. Both theoretical analysis and experiments prove that the proposed scheme is efficient in terms of complexity, memory consumption, and lookup time.
{"title":"A Name-to-Hash Encoding Scheme for Vehicular Named Data Networks","authors":"Hakima Khelifi, Senlin Luo, Boubakr Nour, Hassine Moungla","doi":"10.1109/IWCMC.2019.8766564","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766564","url":null,"abstract":"In contrast to the host-centric model where the communication is directed using the destination address, Information-Centric Networking (ICN) adopts the content name as the pillar network element to provide data discovery and delivery process, as well as in other network functionalities. Named Data Networking (NDN) is an active ICN project that uses hierarchical unbounded names. These names are used in both interest and data packets and other data structures that may consume more memory with long lookup time. This paper targets the naming aspect in vehicular named data networks and proposes a Name-to-Hash Encoding scheme. The idea consists of hashing each name components separately to a fixed length, then perform a heuristic Wu-Manber-like algorithm lookup process. The former process enhances the NDN to consume less memory compared to hierarchical names, the latter process provides a fast lookup time. We have evaluated the proposed scheme against different related solutions using real domain datasets. Both theoretical analysis and experiments prove that the proposed scheme is efficient in terms of complexity, memory consumption, and lookup time.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127016097","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-06-24DOI: 10.1109/IWCMC.2019.8766591
N. Rao, A. Maleki, F. Chen, Wenting Chen, C. Zhang, N. Kaur, A. Haque
Network service providers tend to focus on the quality of service (QoS) they provide to their customers. This entails analysis of various QoS metrics (such as bandwidth, packet loss and jitter) in order to be able to improve their services. This is a single-dimensional approach to a problem that needs to be analyzed not only from a business improvement perspective but also from a customer satisfaction perspective. QoS metrics do not directly translate to customer experience, which is more qualitative than quantitative. Thus, it is necessary to correlate qualitative metrics that customers relate to with quantitative metrics that can be analyzed and improved upon by service providers. This is a non-trivial problem that needs deeper exploration. In this paper, we attempt to correlate video conferencing QoE (Quality of Experience) with network QoS. In order to do this, we developed a novel Docker image called Lime, to be able to automate the experiments and emulate the network environment. We performed 144 separate video conferences under predefined network handicaps (scenarios). We discovered that bandwidth is directly proportional to the perceived quality of the video implying that higher bandwidth is preferred. On the other hand, frequently fluctuating bandwidth quickly reduced the user-opinion, and also resulted in slower subsequent climb in opinion after a period of high fluctuation. This indicated that steady bandwidth is preferred over irregularly increasing bandwidth. Jitter and packet loss were found to contribute to negative user-opinion as well as low bandwidth. Conversely, increasing jitter and packet loss was mostly forgiven if the bandwidth stayed stable and high. Lime is shown to be a novel tool to fulfill requirements related to video conferencing experiments under pre-defined network scenarios.
{"title":"Analysis of the Effect of QoS on Video Conferencing QoE","authors":"N. Rao, A. Maleki, F. Chen, Wenting Chen, C. Zhang, N. Kaur, A. Haque","doi":"10.1109/IWCMC.2019.8766591","DOIUrl":"https://doi.org/10.1109/IWCMC.2019.8766591","url":null,"abstract":"Network service providers tend to focus on the quality of service (QoS) they provide to their customers. This entails analysis of various QoS metrics (such as bandwidth, packet loss and jitter) in order to be able to improve their services. This is a single-dimensional approach to a problem that needs to be analyzed not only from a business improvement perspective but also from a customer satisfaction perspective. QoS metrics do not directly translate to customer experience, which is more qualitative than quantitative. Thus, it is necessary to correlate qualitative metrics that customers relate to with quantitative metrics that can be analyzed and improved upon by service providers. This is a non-trivial problem that needs deeper exploration. In this paper, we attempt to correlate video conferencing QoE (Quality of Experience) with network QoS. In order to do this, we developed a novel Docker image called Lime, to be able to automate the experiments and emulate the network environment. We performed 144 separate video conferences under predefined network handicaps (scenarios). We discovered that bandwidth is directly proportional to the perceived quality of the video implying that higher bandwidth is preferred. On the other hand, frequently fluctuating bandwidth quickly reduced the user-opinion, and also resulted in slower subsequent climb in opinion after a period of high fluctuation. This indicated that steady bandwidth is preferred over irregularly increasing bandwidth. Jitter and packet loss were found to contribute to negative user-opinion as well as low bandwidth. Conversely, increasing jitter and packet loss was mostly forgiven if the bandwidth stayed stable and high. Lime is shown to be a novel tool to fulfill requirements related to video conferencing experiments under pre-defined network scenarios.","PeriodicalId":363800,"journal":{"name":"2019 15th International Wireless Communications & Mobile Computing Conference (IWCMC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115070239","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
扫码关注我们
求助内容：
应助结果提醒方式：