Pub Date : 2018-11-01DOI: 10.1109/COMNET.2018.8622289
Ons Chikhaoui, Aida Ben Chehida Douss, Ryma Abassi, S. Fatmi
Vehicular Ad hoc NETworks (VANETs) mainly intend to increase road safety by exchanging safety related messages. In order to provide a secure communication in VANETs, a key requirement is to enable receivers to authenticate received messages while preserving the privacy of the identities of sending vehicles. However, if a misbehavior takes place, involved vehicles should be identified and evicted from the network. To this end, we proposed in a previous work [1] a ticket-based authentication scheme for VANETs preserving privacy, in which vehicles use temporary tickets to communicate with other vehicles in the network while conditionally maintaining their privacy. A vehicle’s ticket is formed through two stages: an offline stage and an online stage. Besides, the ticket should be updated whenever its vehicle enters into a new domain (containing few Road Side Units), and modified whenever its validity period expires. In this paper, we propose an optimization of that previously proposed work in order to decrease the cryptographic delay. In fact, the Identity Based Online/Offline Signature (IBOOS) technique and Shamir’s trick are introduced, already verified tickets are stored by receiving vehicles for reference later and the signature size is reduced.
{"title":"Towards the Optimization of a Ticket-based Authentication Scheme for VANETs","authors":"Ons Chikhaoui, Aida Ben Chehida Douss, Ryma Abassi, S. Fatmi","doi":"10.1109/COMNET.2018.8622289","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622289","url":null,"abstract":"Vehicular Ad hoc NETworks (VANETs) mainly intend to increase road safety by exchanging safety related messages. In order to provide a secure communication in VANETs, a key requirement is to enable receivers to authenticate received messages while preserving the privacy of the identities of sending vehicles. However, if a misbehavior takes place, involved vehicles should be identified and evicted from the network. To this end, we proposed in a previous work [1] a ticket-based authentication scheme for VANETs preserving privacy, in which vehicles use temporary tickets to communicate with other vehicles in the network while conditionally maintaining their privacy. A vehicle’s ticket is formed through two stages: an offline stage and an online stage. Besides, the ticket should be updated whenever its vehicle enters into a new domain (containing few Road Side Units), and modified whenever its validity period expires. In this paper, we propose an optimization of that previously proposed work in order to decrease the cryptographic delay. In fact, the Identity Based Online/Offline Signature (IBOOS) technique and Shamir’s trick are introduced, already verified tickets are stored by receiving vehicles for reference later and the signature size is reduced.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124479712","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-11-01DOI: 10.1109/COMNET.2018.8622298
Amel Khodmi, S. Rejeb, Z. Choukair
Driven by the increase of data traffic, heterogeneous ultra-dense network (H-UDN) is considered a promising technology in 5G wireless network. Ultra dense network (UDN) refers to the idea of densifying the cellular networks, which reduces the distance between the access nodes and the users, achieving the highest possible transmission rates and enhancing the quality of service (QoS). In this paper, we develop a joint power allocation and relay selection based on multi-hop relay in H-UDN using a low computational complexity iterative water-filling. The simulation results shows that our proposed algorithm can achieve the optimal power allocation and improve the performances of the system in term of coverage, capacity among other architectures.
{"title":"Iterative Water Filling Power Allocation And Relay Selection Based On Two-hop Relay in 5G/Heterogeneous Ultra Dense Network","authors":"Amel Khodmi, S. Rejeb, Z. Choukair","doi":"10.1109/COMNET.2018.8622298","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622298","url":null,"abstract":"Driven by the increase of data traffic, heterogeneous ultra-dense network (H-UDN) is considered a promising technology in 5G wireless network. Ultra dense network (UDN) refers to the idea of densifying the cellular networks, which reduces the distance between the access nodes and the users, achieving the highest possible transmission rates and enhancing the quality of service (QoS). In this paper, we develop a joint power allocation and relay selection based on multi-hop relay in H-UDN using a low computational complexity iterative water-filling. The simulation results shows that our proposed algorithm can achieve the optimal power allocation and improve the performances of the system in term of coverage, capacity among other architectures.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127668292","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-11-01DOI: 10.1109/COMNET.2018.8621928
Leila Nasraoui, L. N. Atallah, M. Siala
The rapid growth of mobile and wireless data services has spurred the requirement of the future 5G network for a very high throughput efficiency. In this paper, we investigate throughput maximization via optimized energy allocation and Automatic Repeat reQuest (ARQ) retransmission protocol. Using default energy allocation showed an inefficiency in average consumed energy throughout all retransmission attempts carried out to succeed an error-free packet reception. To overcome this limitation, we here suggest a judicious allotment of the available energy budget along transmission attempts (first transmission and potential retransmission) while keeping the total energy cost steady for each transmitted packet. For a given Signal to Noise Ratio (SNR), the optimal distribution of total available energy along all transmission attempts is determined through a Genetic Algorithm based search that exploits the throughput efficiency as a fitness function. Numerical results demonstrate the efficiency of the proposed strategy in terms of maximizing the average throughput efficiency and accordingly reveal the improvement in reducing the probability of packet erasure as well as the number of required transmissions to achieve high throughput.
{"title":"Throughput Maximization with Optimum Energy Allocation for ARQ Retransmission Protocol","authors":"Leila Nasraoui, L. N. Atallah, M. Siala","doi":"10.1109/COMNET.2018.8621928","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8621928","url":null,"abstract":"The rapid growth of mobile and wireless data services has spurred the requirement of the future 5G network for a very high throughput efficiency. In this paper, we investigate throughput maximization via optimized energy allocation and Automatic Repeat reQuest (ARQ) retransmission protocol. Using default energy allocation showed an inefficiency in average consumed energy throughout all retransmission attempts carried out to succeed an error-free packet reception. To overcome this limitation, we here suggest a judicious allotment of the available energy budget along transmission attempts (first transmission and potential retransmission) while keeping the total energy cost steady for each transmitted packet. For a given Signal to Noise Ratio (SNR), the optimal distribution of total available energy along all transmission attempts is determined through a Genetic Algorithm based search that exploits the throughput efficiency as a fitness function. Numerical results demonstrate the efficiency of the proposed strategy in terms of maximizing the average throughput efficiency and accordingly reveal the improvement in reducing the probability of packet erasure as well as the number of required transmissions to achieve high throughput.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122213352","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-11-01DOI: 10.1109/COMNET.2018.8622301
M. O. Damen, G. R. Othman
In this work we propose a new low-complexity, essentially optimal detection algorithm for n × n TAST codes over n-mode optical fiber channels with Mode-Dependent Loss (MDL). Our algorithm is derived from the analysis of the Orthogonality Defect Factor (ODF) of the equivalent channel matrix where we derive its closed-form expression for general n as well as characterize its statistical properties. Using the ODF properties allows us to modify the detection algorithm such that it still achieves essentially optimal performance but at a much smaller cost than exhaustive or sphere decoding algorithms. The theoretical results are validated by simulations.
在这项工作中，我们提出了一种新的低复杂度、本质上最优的n × n TAST码检测算法，该算法适用于具有模式相关损耗(MDL)的n模光纤信道。我们的算法是从等效信道矩阵的正交缺陷因子(ODF)的分析中推导出来的，我们推导了它对一般n的封闭形式表达式，并表征了它的统计性质。使用ODF属性允许我们修改检测算法，这样它仍然可以获得本质上最优的性能，但成本比穷尽或球面解码算法要小得多。通过仿真验证了理论结果。
{"title":"Near-Optimal Detection of TAST Codes Over Multimode Optical Fiber Channels","authors":"M. O. Damen, G. R. Othman","doi":"10.1109/COMNET.2018.8622301","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622301","url":null,"abstract":"In this work we propose a new low-complexity, essentially optimal detection algorithm for n × n TAST codes over n-mode optical fiber channels with Mode-Dependent Loss (MDL). Our algorithm is derived from the analysis of the Orthogonality Defect Factor (ODF) of the equivalent channel matrix where we derive its closed-form expression for general n as well as characterize its statistical properties. Using the ODF properties allows us to modify the detection algorithm such that it still achieves essentially optimal performance but at a much smaller cost than exhaustive or sphere decoding algorithms. The theoretical results are validated by simulations.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130504468","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-11-01DOI: 10.1109/COMNET.2018.8622295
Sondes Sidaoui, Anis Kacem, S. E. Asmi
In this paper, we present an applying of a finite volume variational approach to the mesh smoothing using local weights. This approach is able to effectively remove undesirable noise and provides a very good performance. While conserving outstanding geometric features of a 3D mesh surface such as curved shape surface regions, sharp edges, and fine details. Extensive experimental results on various 3D models demonstrate the effectiveness of our proposed iterative algorithm, which shows a satisfactory output results in only one single iteration.
{"title":"A Finite Volume Variational Approach for 3D Mesh Smoothing","authors":"Sondes Sidaoui, Anis Kacem, S. E. Asmi","doi":"10.1109/COMNET.2018.8622295","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622295","url":null,"abstract":"In this paper, we present an applying of a finite volume variational approach to the mesh smoothing using local weights. This approach is able to effectively remove undesirable noise and provides a very good performance. While conserving outstanding geometric features of a 3D mesh surface such as curved shape surface regions, sharp edges, and fine details. Extensive experimental results on various 3D models demonstrate the effectiveness of our proposed iterative algorithm, which shows a satisfactory output results in only one single iteration.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129872567","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-11-01DOI: 10.1109/COMNET.2018.8622288
N. Dahi, N. Hamdi
This paper investigates cooperative non-orthogonal multiple access (NOMA) with energy harvesting (EH) radio networks. This promising technology is the key to address an important issue of next-generation wireless communication Systems.EH is a well known technique for reducing energy consumption of battery-limited devices by collecting energy received from high power equipments. Closed-form expression of outage probability is derived at relay assisted transmission scheme with Nakagami-m fading channels.Simulation results validate the proposed theorem. We consider the impact of time splitting fraction on system maintainability.
{"title":"Outage Performance in Cooperative NOMA Systems with Energy Harvesting in Nakagami-m Fading","authors":"N. Dahi, N. Hamdi","doi":"10.1109/COMNET.2018.8622288","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622288","url":null,"abstract":"This paper investigates cooperative non-orthogonal multiple access (NOMA) with energy harvesting (EH) radio networks. This promising technology is the key to address an important issue of next-generation wireless communication Systems.EH is a well known technique for reducing energy consumption of battery-limited devices by collecting energy received from high power equipments. Closed-form expression of outage probability is derived at relay assisted transmission scheme with Nakagami-m fading channels.Simulation results validate the proposed theorem. We consider the impact of time splitting fraction on system maintainability.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123895532","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-11-01DOI: 10.1109/COMNET.2018.8622281
Wafa Khrouf, M. Siala, F. Abdelkefi
OFDM/OQAM is considered as one of the modulation candidates for 5G systems. In this paper, we derive the analytical expression of the signal to interference ratio (SIR) in OFDM/OQAM systems, for time and frequency dispersive channels, using the multiplicative approach.
{"title":"Derivation of The Analytical Expression of The SIR in OFDM/OQAM Systems Using The Multiplicative Approach","authors":"Wafa Khrouf, M. Siala, F. Abdelkefi","doi":"10.1109/COMNET.2018.8622281","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622281","url":null,"abstract":"OFDM/OQAM is considered as one of the modulation candidates for 5G systems. In this paper, we derive the analytical expression of the signal to interference ratio (SIR) in OFDM/OQAM systems, for time and frequency dispersive channels, using the multiplicative approach.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"8 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114114753","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-11-01DOI: 10.1109/COMNET.2018.8621933
Rihab Jmal, L. Chaari
Content-Centric-Networking (CCN) and Software Defined Networking (SDN) are considered to be the promising paradigms to build the Future Internet. They are assembling a significant consideration from academic world and manufacturing. The integration of CCN capabilities with OpenFlow operation presents an attractive compromise. However, deployment issues require a gradual approach to allow the development and improvement of the new Internet. The existent solutions integrating CCN with OpenFlow have not been inspected sufficiently.In this paper, we propose CCNFlow, a new approach based– on CCN managed by OpenFlow controller, which provides programmable forwarding policy and caching strategies depending on Popularity of contents. CCNFlow doesn’t necessitate a full network upgrade, it presents an overlay approach.
{"title":"CCNFlow:Content-Centric Networking Managed by OpenFlow Controller","authors":"Rihab Jmal, L. Chaari","doi":"10.1109/COMNET.2018.8621933","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8621933","url":null,"abstract":"Content-Centric-Networking (CCN) and Software Defined Networking (SDN) are considered to be the promising paradigms to build the Future Internet. They are assembling a significant consideration from academic world and manufacturing. The integration of CCN capabilities with OpenFlow operation presents an attractive compromise. However, deployment issues require a gradual approach to allow the development and improvement of the new Internet. The existent solutions integrating CCN with OpenFlow have not been inspected sufficiently.In this paper, we propose CCNFlow, a new approach based– on CCN managed by OpenFlow controller, which provides programmable forwarding policy and caching strategies depending on Popularity of contents. CCNFlow doesn’t necessitate a full network upgrade, it presents an overlay approach.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114227089","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-11-01DOI: 10.1109/COMNET.2018.8622300
Kmar Thaalbi, M. Missaoui, N. Tabbane
Cloud Radio Access Network (C-RAN) is a promising solution to meet the 5GGP requirements for 5G Networks. The C-RAN is based on the idea of splitting the conventional eNB into two parts: the Remote Radio Head (RRH) and the Base Band Unit (BBU). The RRH will be responsible for the RF transmission and it will be densified to enhance the capacity of the network and the quality of service in response to the ever-increasing high demand for the applications. The BBU will care about the computational processing. To reduce the installation and maintenance costs and to enable and improve advanced features of the network such as Coordinated Multi-Point (CoMP) and enhanced Inter-Cell Interference Coordination (e-ICIC), the RRHs should be pooled and grouped into clusters. Several RRHs will be assigned to one BBU which will break with the conventional one-to-one mapping. The Clustering task is considered to be an NP-Hard problem. This article surveys the literature on Clustering algorithms and techniques as they apply to C-RAN Architecture and evaluate the resulting configuration of BBU pools.
{"title":"Short Survey on Clustering Techniques for RRH in 5G networks","authors":"Kmar Thaalbi, M. Missaoui, N. Tabbane","doi":"10.1109/COMNET.2018.8622300","DOIUrl":"https://doi.org/10.1109/COMNET.2018.8622300","url":null,"abstract":"Cloud Radio Access Network (C-RAN) is a promising solution to meet the 5GGP requirements for 5G Networks. The C-RAN is based on the idea of splitting the conventional eNB into two parts: the Remote Radio Head (RRH) and the Base Band Unit (BBU). The RRH will be responsible for the RF transmission and it will be densified to enhance the capacity of the network and the quality of service in response to the ever-increasing high demand for the applications. The BBU will care about the computational processing. To reduce the installation and maintenance costs and to enable and improve advanced features of the network such as Coordinated Multi-Point (CoMP) and enhanced Inter-Cell Interference Coordination (e-ICIC), the RRHs should be pooled and grouped into clusters. Several RRHs will be assigned to one BBU which will break with the conventional one-to-one mapping. The Clustering task is considered to be an NP-Hard problem. This article surveys the literature on Clustering algorithms and techniques as they apply to C-RAN Architecture and evaluate the resulting configuration of BBU pools.","PeriodicalId":177399,"journal":{"name":"2018 Seventh International Conference on Communications and Networking (ComNet)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114505037","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
扫码关注我们
求助内容：
应助结果提醒方式：