{"title":"Convergent Approximate Message Passing","authors":"D. Slock","doi":"10.1109/MeditCom55741.2022.9928636","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928636","url":null,"abstract":"Generalized Approximate Message Passing (GAMP) allows for Bayesian inference in linear models with non iden-tically independently distributed (n.i.i.d.) priors and n.i.i.d. measurements of the linear mixture outputs. It represents an efficient technique for approximate inference which becomes accurate when both rows and columns of the measurement matrix can be treated as sets of independent vectors and both dimensions become large. It has been shown that the fixed points of GAMP correspond to extrema of a large system limit of the Bethe Free Energy (LSL-BFE), which represents a meaningful approximation optimization criterion regardless of whether the measurement matrix exhibits the independence properties. How-ever, the convergence of (G)AMP can be notoriously problematic for certain measurement matrices and the only sure fix so far is damping (by a difficult to determine amount). In this paper we revisit the GAMP algorithm by rigorously applying an alternating constrained minimization strategy to an appropriately reparameterized LSL-BFE with matched variable and constraint partitioning. This guarantees convergence, at least to a local optimum.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128561586","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}
{"title":"Deep Reinforcement Learning for Power control in Multi-tasks Wireless Cellular Networks","authors":"Alexis Anzaldo, Á. G. Andrade","doi":"10.1109/MeditCom55741.2022.9928617","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928617","url":null,"abstract":"Extensive spectrum reuse due to the massive deployment of small base stations will incur high interference in future networks. One solution to deal with this interference is implementing power control schemes. However, solving the power allocation in denser wireless networks becomes challenging due to the computational complexity involved and the complete Channel State Information (CSI) required. One alternative to address these challenges is implementing Deep Reinforcement Learning (DRL) models, which may find solutions faster and with fewer CSI requirements. In this work, we implement a Centralized Training scheme for training a DRL model over a wireless network environment consisting of different tasks (i.e., UE location and CSI). Training over various tasks may degrade the performance of older tasks. Therefore, to retain the knowledge of older tasks, we implement a memory-based strategy to split the buffer for storing relevant experiences based on the action-space exploration. Additionally, we implement a rehearsal method for reusing samples of similar environments. The results show a learning performance improvement when learning newer tasks. Further, the degradation due to learning multi-task is reduced compared to classic DQN models with FIFO buffer.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125569439","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}
Kostis Trantzas, C. Tranoris, S. Denazis, Rafael Direito, D. Gomes, Jorge Gallego-Madrid, Ana Hermosilla, A. Gómez-Skarmeta
{"title":"Implementing a holistic approach to facilitate the onboarding, deployment and validation of NetApps","authors":"Kostis Trantzas, C. Tranoris, S. Denazis, Rafael Direito, D. Gomes, Jorge Gallego-Madrid, Ana Hermosilla, A. Gómez-Skarmeta","doi":"10.1109/MeditCom55741.2022.9928721","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928721","url":null,"abstract":"The 5G system promises to deliver an environment for applications and markets that can easily capitalize on the new services and advanced interfaces that the 5G developments introduce. Recently, in the context of European research and innovation actions, the term NetApp was introduced. A NetApp, in the context of the 5G System, is defined as a set of services that provide certain functionalities to the verticals and their associated use cases. While there is no specific standard for describing the NetApp concept, the ETSI NFV model is adopted to describe the delivery and deployment of NetApps. This work presents an approach for automating the deployment and testing of NetApps in the context of the 5G system. The envisaged process focuses on innovations related to the operation of experiments and tests across several domains, providing software support tools for Continuous Integration and Continuous Deployment (CI/CD) of NetApps and their artifacts in a secure and trusted environment.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"51 Pt 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126235846","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}
{"title":"Optimal Time-Switching for Simultaneous Wireless Information and Power Transfer","authors":"R.P. Ketcham, Jeroen Verdyck, M. Moonen","doi":"10.1109/MeditCom55741.2022.9928708","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928708","url":null,"abstract":"The receiver is an important part of a simultaneous wireless information and power transfer (SWIPT) system. A single receiver that can simultaneously decode and harvest power from the same signal has yet to be developed, so practical schemes utilizing multiple co-located receivers have been utilized instead. Time-switching is one such scheme in which a receiver either performs information decoding or power harvesting, the durations of which are determined by the time-switching ratio. Existing methods to optimize the time-switching ratio either exploit problem convexity or reformulate it into a form that can utilize the Lambert W function. However, these techniques do not easily lend themselves for use with more complicated non-convex problem formulations. As an alternative, this paper examines the geometrical relationship between the optimal time-switching ratio and the weights used to solve the resource allocation problem when framed as a weighted sum. A simple relation is derived that will form the basis for an optimization algorithm in future works.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"121 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120861968","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}
{"title":"Multi-AP coordination in Wi-Fi 7 exploiting time resources sharing","authors":"Pasquale Imputato, S. Avallone, D. Magrin","doi":"10.1109/MeditCom55741.2022.9928663","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928663","url":null,"abstract":"The multi-AP coordination is a key feature of Wi-Fi 7 (EHT) and is a promising approach to improving the utilization of limited radio resources. However, the APs coordination requires the exchange of information among the APs in the coordination set in order to make the optimal sharing decision with regard to specific performance parameters. In this work, we present the control frames defined for this purpose and the transmission procedures defined in EHT for the multi-AP coordination. We implemented the new frames and EHT procedures in ns-3. Furthermore, we designed and implemented a scheduler with the aim to improving the performance of EHT network in non-saturated conditions by sharing the time resources, i.e., C-TDMA. Then, we assessed the performance of the proposed scheduler in ns-3. Multi-AP coordination through C-TDMA allows for reduction of the network latency of one order of magnitude while keeping the network throughput stable.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"70 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124384382","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}
{"title":"Multi-User Active RIS Communications: Joint Power, Gain and Phase Shifts Optimization","authors":"Mohamed M. H. Shalma, E. Maher, A. El-Mahdy","doi":"10.1109/MeditCom55741.2022.9928771","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928771","url":null,"abstract":"In this paper, we address the problem of optimizing the users' transmit power jointly with the amplification factors and phase shifts of an active reconfigurable intelligent surface (RIS) where each element is optimized individually. We consider a multi-user uplink scenario with inter-user interference. The non-convex problem of maximizing the sum-rate is transformed into a convex one using the multi-variate Taylor expansion and solved using the Lagrangian and gradient descent methods to provide a suboptimal solution in return for a feasible complexity. Numerical results show that active RISs with each amplification factor optimized individually effectively outperform passive ones in fading and highly interfering situations.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123112714","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}
Sirine Bouhoula, Marios Avgeris, Aris Leivadeas, I. Lambadaris
{"title":"Computational Offloading for the Industrial Internet of Things: A Performance Analysis","authors":"Sirine Bouhoula, Marios Avgeris, Aris Leivadeas, I. Lambadaris","doi":"10.1109/MeditCom55741.2022.9928770","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928770","url":null,"abstract":"The challenge of minimizing mission response times and the energy consumption of computationally-constrained IoT devices, is becoming increasingly important in Industry 4.0 environments, where mission-critical tasks require real-time and latency-sensitive processing. In this context, the computational offloading paradigm becomes an attractive alternative for utilising remote, computationally capable resources placed at the network Edge, to execute demanding applications. In this paper, an analysis of the main options for task execution (ondevice, Edge and Cloud) is performed, under different sensing and actuation scenarios. These results outline the need of an intelligent decision making mechanism to dynamically alternate between the available execution environments, as a response to the varying networking conditions.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"735 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116990274","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}
Filippos Pelekoudas Oikonomou, G. Zachos, G. Mantas, J. Ribeiro, J. Bastos, Jonathan Rodriguez
{"title":"A Scalable Approach of Practical Byzantine Fault Tolerance Algorithms for IoMT Blockchains","authors":"Filippos Pelekoudas Oikonomou, G. Zachos, G. Mantas, J. Ribeiro, J. Bastos, Jonathan Rodriguez","doi":"10.1109/MeditCom55741.2022.9928737","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928737","url":null,"abstract":"Blockchain-based solutions for Internet of Things (IoT) networks constitutes a current trend in cybersecurity and brings significant benefits into current centralized IoT-based health monitoring systems by addressing security challenges. Complex and power intense blockchain solutions do not perform satisfactory in the resource-constrained IoT, and especially Internet of Medical Things (IoMT), devices of these systems due to the latter's limited processing power, storage capacity, and battery life. Therefore, in this paper, we propose a scalable Practical Byzantine Fault Tolerance (PBFT) consensus algorithm for IoMT blockchains to: i) enhance scalability in IoMT blockchains, ii) reduce communication overhead, iii) enhance security while reducing the computational cost for suitability to the resource constraint nature of IoMT devices, iv) facilitate decentralized accountability, and v) eliminate single point of failure.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116011380","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}
Faïçal Sawadogo, John Violos, Aroosa Hameed, Aris Leivadeas
{"title":"An Unsupervised Machine Learning Approach for IoT Device Categorization","authors":"Faïçal Sawadogo, John Violos, Aroosa Hameed, Aris Leivadeas","doi":"10.1109/MeditCom55741.2022.9928766","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928766","url":null,"abstract":"Internet of Things (IoT) along with the advances in the recently emerged Edge Computing environment, have allowed the introduction of new and very diverse applications that can facilitate our everyday life. However, one intrinsic characteristic of IoT is the heterogeneity of the IoT devices that are continuously connected and disconnected, creating a highly volatile communication environment. In addition to that, new types of IoT devices are constantly manufactured making a supervised categorization approach not applicable due to the lack of historical data. Nonetheless, the classification or type identification of the IoT devices is important for the management and the decision making of the IoT applications, and can be used for traffic characterization, density prediction, network planning and security reasons among others. Accordingly, in this paper we propose for the first time an unsupervised machine learning methodology for the IoT device categorization that leverages traffic characteristics obtained at the network level. To this end, we tackle the limitation of requiring an annotated dataset, while our model could also work efficiently with new and not previously detected IoT devices. To do so, we experimentally evaluate our approach using two clustering algorithms namely, the K-Means and the BIRCH in a real dataset. The experimental evaluation presents promising results that enhance the applicability of unsupervised approaches for the IoT device categorization problem.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130706006","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}
Jean-Pierre H. Asdikian, Leila Askari, Omran Ayoub, F. Musumeci, S. Bregni, M. Tornatore
{"title":"Availability Evaluation of Service Function Chains Under Different Protection Schemes","authors":"Jean-Pierre H. Asdikian, Leila Askari, Omran Ayoub, F. Musumeci, S. Bregni, M. Tornatore","doi":"10.1109/MeditCom55741.2022.9928709","DOIUrl":"https://doi.org/10.1109/MeditCom55741.2022.9928709","url":null,"abstract":"Network Function Virtualization (NFV) calls for a new resource management approach where virtualized network functions (VNFs) replace traditional network hardware appliances. Thanks to NFV, operators are given a much greater flexibility, as these VNFs can be deployed as virtual nodes and chained together to form Service Function Chains (SFCs). An SFC represents a set of dedicated virtualized resources deployed to provide a certain service to the consumer. One of its most important performance requirements is availability. In this paper, the availability achieved by SFCs is evaluated analytically, by modelling several protection schemes and given different availability values for the network components. The cost of each protection scheme, based on its network resource consumption, is also taken into account. Extensive numerical results are reported, considering various SFC characteristics, such as availability requirements, number of NFV nodes and availability values of network components. The lowest-cost protection strategy, in terms of number of occupied network components, which meets availability requirement, is identified. Our analysis demonstrates that, in most cases, resource-greedy protection schemes, such as end-to-end protection, can be replaced by less aggressive schemes, even when availability requirements are in the order of five or six nines, depending on the number of elements in the service function chain.","PeriodicalId":206258,"journal":{"name":"2022 IEEE International Mediterranean Conference on Communications and Networking (MeditCom)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129220148","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}