Pub Date : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00091
G. Nardini, G. Stea
Digital Twins (DTs) have been proposed as digital replicas of physical entities (e.g., manufacturing plants), which one can observe and interact with, e.g., to perform what-if analysis. In this paper, we argue that mobile networks need DTs as well, and network simulators appear to be promising candidates to fulfill that role. We discuss the challenges that need be addressed to make this happen, e.g., centralized vs. distributed implementation, gathering input from the physical network, security issues and hosting, and the possibilities offered by network simulation in terms of what-if analysis, defining the concepts of lockstep and branching analysis. We exemplify the above concepts using Simu5G, a popular 5G/B5G simulation library for OMNeT++, as a reference case study.
{"title":"Using network simulators as digital twins of 5G/B5G mobile networks","authors":"G. Nardini, G. Stea","doi":"10.1109/WoWMoM54355.2022.00091","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00091","url":null,"abstract":"Digital Twins (DTs) have been proposed as digital replicas of physical entities (e.g., manufacturing plants), which one can observe and interact with, e.g., to perform what-if analysis. In this paper, we argue that mobile networks need DTs as well, and network simulators appear to be promising candidates to fulfill that role. We discuss the challenges that need be addressed to make this happen, e.g., centralized vs. distributed implementation, gathering input from the physical network, security issues and hosting, and the possibilities offered by network simulation in terms of what-if analysis, defining the concepts of lockstep and branching analysis. We exemplify the above concepts using Simu5G, a popular 5G/B5G simulation library for OMNeT++, as a reference case study.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123005666","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 : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00053
Venkatarami Reddy Chintapalli, Venkateswarlu Gudepu, K. Kondepu, A. Sgambelluri, A. Franklin, T. B. Reddy, P. Castoldi, L. Valcarenghi
The advent of Open Radio Access Network (O-RAN) technology enables intelligent edge solutions for base stations in beyond 5G (B5G) networks. O-RAN Working Group 2 (WG2) focuses on the architecture and specifications of AI/ML workflows, allowing AI/ML applications in O-RAN environments to meet different QoS requirements for different use cases over varying time periods. This study shows the technical challenges in mapping AI/ML functionalities at Near-Real Time (RT) RAN Intelligence Controller (RIC) and/or Non-RT RIC for closed loop control-based resource adaptation in O-RAN. We also present a drift-based solution to avoid performance violations if there is decay in prediction accuracy. Results show that drift-based solution outperforms offline models.
{"title":"WIP: Impact of AI/ML Model Adaptation on RAN Control Loop Response Time","authors":"Venkatarami Reddy Chintapalli, Venkateswarlu Gudepu, K. Kondepu, A. Sgambelluri, A. Franklin, T. B. Reddy, P. Castoldi, L. Valcarenghi","doi":"10.1109/WoWMoM54355.2022.00053","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00053","url":null,"abstract":"The advent of Open Radio Access Network (O-RAN) technology enables intelligent edge solutions for base stations in beyond 5G (B5G) networks. O-RAN Working Group 2 (WG2) focuses on the architecture and specifications of AI/ML workflows, allowing AI/ML applications in O-RAN environments to meet different QoS requirements for different use cases over varying time periods. This study shows the technical challenges in mapping AI/ML functionalities at Near-Real Time (RT) RAN Intelligence Controller (RIC) and/or Non-RT RIC for closed loop control-based resource adaptation in O-RAN. We also present a drift-based solution to avoid performance violations if there is decay in prediction accuracy. Results show that drift-based solution outperforms offline models.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131670998","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 : 2022-06-01DOI: 10.1109/wowmom54355.2022.00010
{"title":"Reviewers: ISMS 2022","authors":"","doi":"10.1109/wowmom54355.2022.00010","DOIUrl":"https://doi.org/10.1109/wowmom54355.2022.00010","url":null,"abstract":"","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121544001","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 : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00022
V. Mancuso, P. Castagno, M. Sereno, M. Marsan
We consider a radio access network slice serving mobile users whose requests imply computing requirements. Service is virtualized over either a powerful but distant cloud infrastructure or an edge computing host. The latter provides less computing and storage capacity with respect to the cloud, but can be reached with much lower delay. A tradeoff thus naturally arises between computing capacity and data transfer latency. We investigate the performance of this service model, discussing how service requests should be routed to edge or cloud servers. We look at the performance of various classes of online algorithms based on different levels of information about the system state. Our investigation is based on analytical models, simulations in OMNeT++, and a prototype implementation over operational cellular networks. First of all, we observe that distributing the load of service requests over edge and cloud is in general beneficial for performance, and simple to implement with a stateless online server selection policy that can be easily configured with near-optimal performance. Second, we shed light on the limited improvements that stateful polices can offer, notwithstanding they base their decisions on the knowledge of server congestion levels or round-trip latency conditions. Third, we unveil that stateful policies are dangerously prone to errors, which may make stateless policies preferable.
{"title":"Stateful Versus Stateless Selection of Edge or Cloud Servers Under Latency Constraints","authors":"V. Mancuso, P. Castagno, M. Sereno, M. Marsan","doi":"10.1109/WoWMoM54355.2022.00022","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00022","url":null,"abstract":"We consider a radio access network slice serving mobile users whose requests imply computing requirements. Service is virtualized over either a powerful but distant cloud infrastructure or an edge computing host. The latter provides less computing and storage capacity with respect to the cloud, but can be reached with much lower delay. A tradeoff thus naturally arises between computing capacity and data transfer latency. We investigate the performance of this service model, discussing how service requests should be routed to edge or cloud servers. We look at the performance of various classes of online algorithms based on different levels of information about the system state. Our investigation is based on analytical models, simulations in OMNeT++, and a prototype implementation over operational cellular networks. First of all, we observe that distributing the load of service requests over edge and cloud is in general beneficial for performance, and simple to implement with a stateless online server selection policy that can be easily configured with near-optimal performance. Second, we shed light on the limited improvements that stateful polices can offer, notwithstanding they base their decisions on the knowledge of server congestion levels or round-trip latency conditions. Third, we unveil that stateful policies are dangerously prone to errors, which may make stateless policies preferable.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115324066","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 : 2022-06-01DOI: 10.1109/wowmom54355.2022.00100
{"title":"Message from the Workshop Chairs: TwinNets 2022","authors":"","doi":"10.1109/wowmom54355.2022.00100","DOIUrl":"https://doi.org/10.1109/wowmom54355.2022.00100","url":null,"abstract":"","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125900954","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 : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00086
R. Kumar, R. S. Bali, G. Aujla
Edge intelligence propelled federated learning as a promising technology for embedding distributed intelligence in the Internet of Things (IoT) ecosystem. The multidimensional data generated by IoT devices is enormous in volume and personalized in nature. Thus, integrating federated learning to train the learning model for performing analysis on source data can be helpful. Despite the above reasons, the current schemes are centralized and depend on the server for aggregation of local parameters. So, in this paper, we have proposed a model that enables the sensor to be part of a defined cluster (based on the type of data generated by the sensor) during the registration process. In this approach, the aggregation is performed at the edge server for sub-global aggregation, which further communicates the aggregated parameters for global aggregation. The sub-global model is trained by selecting an optimal value for local iterations, batch size, and appropriate model selection. The experimental setup based on the tensor flow federated framework is verified on MNSIT-10 datasets for the validity of the proposed methodology.
{"title":"A Federated Leaning Perspective for Intelligent Data Communication Framework in IoT Ecosystem","authors":"R. Kumar, R. S. Bali, G. Aujla","doi":"10.1109/WoWMoM54355.2022.00086","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00086","url":null,"abstract":"Edge intelligence propelled federated learning as a promising technology for embedding distributed intelligence in the Internet of Things (IoT) ecosystem. The multidimensional data generated by IoT devices is enormous in volume and personalized in nature. Thus, integrating federated learning to train the learning model for performing analysis on source data can be helpful. Despite the above reasons, the current schemes are centralized and depend on the server for aggregation of local parameters. So, in this paper, we have proposed a model that enables the sensor to be part of a defined cluster (based on the type of data generated by the sensor) during the registration process. In this approach, the aggregation is performed at the edge server for sub-global aggregation, which further communicates the aggregated parameters for global aggregation. The sub-global model is trained by selecting an optimal value for local iterations, batch size, and appropriate model selection. The experimental setup based on the tensor flow federated framework is verified on MNSIT-10 datasets for the validity of the proposed methodology.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121780911","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 : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00068
Sandra Zimmermann, Paul Schwenteck, Juan A. Cabrera, Giang T. Nguyen, F. Fitzek
Delivering content from a network via a client-server architecture is expensive not only for content owners but also for network operators. Moving content closer to the end user is already used in Content Delivery Networks (CDN). Multi-Access Edge Computing (MEC) enables us to shift the content even closer by using the storage of end users. But, due to the large media files, storage and transport costs for peers increase significantly. Network Coding can reduce these costs. However, peers in CDNs tend to be highly fluctuating and often need to be restored, making continuous availability of data at the network edge a problem. While for uncoded data, individual packets lost due to peer failures can be tracked to determine availability, the availability of coded data is currently distinguished only in two cases: either there are still enough linearly independent packets to decode the file, or there are not. However, we have found that the network’s combined coded cache loses quality over time due to recovery. This quality loss, which we refer to as grade, can be measured by very cost-effective monitoring. If the grade falls below a certain limit, we can intervene in the network by performing a cache refresh to prevent data becoming unavailable preemptively. In this paper, we present the cases in which such monitoring is useful, how the grade is calculated, and when a cache refresh is necessary. The results show that we can reduce network traffic by up to 34% with minimal storage costs through efficient monitoring.
{"title":"Grade to the Edge: How Many Unreliable Nodes Does It Take to Break a Content Delivery Network?","authors":"Sandra Zimmermann, Paul Schwenteck, Juan A. Cabrera, Giang T. Nguyen, F. Fitzek","doi":"10.1109/WoWMoM54355.2022.00068","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00068","url":null,"abstract":"Delivering content from a network via a client-server architecture is expensive not only for content owners but also for network operators. Moving content closer to the end user is already used in Content Delivery Networks (CDN). Multi-Access Edge Computing (MEC) enables us to shift the content even closer by using the storage of end users. But, due to the large media files, storage and transport costs for peers increase significantly. Network Coding can reduce these costs. However, peers in CDNs tend to be highly fluctuating and often need to be restored, making continuous availability of data at the network edge a problem. While for uncoded data, individual packets lost due to peer failures can be tracked to determine availability, the availability of coded data is currently distinguished only in two cases: either there are still enough linearly independent packets to decode the file, or there are not. However, we have found that the network’s combined coded cache loses quality over time due to recovery. This quality loss, which we refer to as grade, can be measured by very cost-effective monitoring. If the grade falls below a certain limit, we can intervene in the network by performing a cache refresh to prevent data becoming unavailable preemptively. In this paper, we present the cases in which such monitoring is useful, how the grade is calculated, and when a cache refresh is necessary. The results show that we can reduce network traffic by up to 34% with minimal storage costs through efficient monitoring.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128636654","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 : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00082
Wanying Guo, Shiraz Ali Wagan, D. Shin, Isma Farah Siddiqui, Jahwan Koo, Nawab Muhammad Faseeh Qureshi
In order to adapt to the change of mobile service needs, a base station sleep method combining long cycle and short cycle style is proposed to realize energy saving in heterogeneous dense networks. In the long-cycle mode, the neighboring base stations cooperate to optimize the activation and deactivation strategy. Meanwhile, a constrained graph game is formulated where each base station is abstracted as a game player with the constraint of traffic load. Then the base station states are solved distributively to reduce signaling overhead and base station power consumption. In the short-cycle mode, the transmission mode and non-transmission mode are introduced to enhance the adaptability to fast-changing services. The base stations are clustered and the mode matrix of the base station cluster is set to form the potential cooperation among base stations, thus energy saving is achieved by reducing inter-base station interference. Then, a distributed iterative algorithm for solving the generalized Nash equilibrium and the selection process of the mode matrix of the base station cluster is given. Simulation results show that the proposed method can respectively save energy by more than 12% and 15% during 24 hours, compared with the reference log-cycle and short-cycle modes.
{"title":"Periodic-Collaboration-Based Energy-Efficient Cell Dormancy in Heterogeneous Dense Networks","authors":"Wanying Guo, Shiraz Ali Wagan, D. Shin, Isma Farah Siddiqui, Jahwan Koo, Nawab Muhammad Faseeh Qureshi","doi":"10.1109/WoWMoM54355.2022.00082","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00082","url":null,"abstract":"In order to adapt to the change of mobile service needs, a base station sleep method combining long cycle and short cycle style is proposed to realize energy saving in heterogeneous dense networks. In the long-cycle mode, the neighboring base stations cooperate to optimize the activation and deactivation strategy. Meanwhile, a constrained graph game is formulated where each base station is abstracted as a game player with the constraint of traffic load. Then the base station states are solved distributively to reduce signaling overhead and base station power consumption. In the short-cycle mode, the transmission mode and non-transmission mode are introduced to enhance the adaptability to fast-changing services. The base stations are clustered and the mode matrix of the base station cluster is set to form the potential cooperation among base stations, thus energy saving is achieved by reducing inter-base station interference. Then, a distributed iterative algorithm for solving the generalized Nash equilibrium and the selection process of the mode matrix of the base station cluster is given. Simulation results show that the proposed method can respectively save energy by more than 12% and 15% during 24 hours, compared with the reference log-cycle and short-cycle modes.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132559041","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 : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00084
Ahmed A. A. Osman, Raouf Abozariba, A. Taufiq Asyhari, Adel Aneiba, M. Ben Farah
WebRTC is a Google-developed project that allows users to communicate directly. It is an open-source tool supported by all major browsers. Since it does not require additional installation steps and provides ultra-low latency streaming, smart city and social network applications such as WhatsApp, Facebook Messenger, and Snapchat use it as the underlying technology on the client-side both on desktop browsers and mobile apps. While the open-source tool is deemed to be secure and despite years of research and security testing, there are still vulnerabilities in the real-time communication application programming interface (API). We show in this paper how eavesdropping can be enabled by exploiting weaknesses and loopholes found in official WebRTC specifications. We demonstrate through real-world implementation how an eavesdropper can intercept WebRTC video calls by installing a malicious code onto the WebRTC webserver. Furthermore, we identify and discuss several, easy to perform, ways to detect wiretapping. Our evaluation shows that several indicators within webrtc-internals API traces can be used to detect anomalous activities, without the need for network monitoring tools.
{"title":"Detection of JavaScript Injection Eavesdropping on WebRTC communications","authors":"Ahmed A. A. Osman, Raouf Abozariba, A. Taufiq Asyhari, Adel Aneiba, M. Ben Farah","doi":"10.1109/WoWMoM54355.2022.00084","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00084","url":null,"abstract":"WebRTC is a Google-developed project that allows users to communicate directly. It is an open-source tool supported by all major browsers. Since it does not require additional installation steps and provides ultra-low latency streaming, smart city and social network applications such as WhatsApp, Facebook Messenger, and Snapchat use it as the underlying technology on the client-side both on desktop browsers and mobile apps. While the open-source tool is deemed to be secure and despite years of research and security testing, there are still vulnerabilities in the real-time communication application programming interface (API). We show in this paper how eavesdropping can be enabled by exploiting weaknesses and loopholes found in official WebRTC specifications. We demonstrate through real-world implementation how an eavesdropper can intercept WebRTC video calls by installing a malicious code onto the WebRTC webserver. Furthermore, we identify and discuss several, easy to perform, ways to detect wiretapping. Our evaluation shows that several indicators within webrtc-internals API traces can be used to detect anomalous activities, without the need for network monitoring tools.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129924082","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 : 2022-06-01DOI: 10.1109/WoWMoM54355.2022.00025
Preti Kumari, Hari Prabhat Gupta, Tanima Dutta, Sajal K. Das
Low Power Wide Area Networks (LPWAN) offer a promising wireless communications technology for Internet of Things (IoT) applications. Among various existing LPWAN technologies, Long-Range WAN (LoRaWAN) consumes minimal power and provides virtual channels for communication through spreading factors. However, LoRaWAN suffers from the interference problem among nodes connected to a gateway that uses the same spreading factor. Such interference increases data communication time, thus reducing data freshness and suitability of LoRaWAN for delay-sensitive applications. To minimize the interference problem, an optimal allocation of the spreading factor is requisite for determining the time duration of data transmission. This paper proposes a game-theoretic approach to estimate the time duration of using a spreading factor that ensures on-time data delivery with maximum network utilization. We incorporate the Age of Information (AoI) metric to capture the freshness of information as demanded by the applications. Our proposed approach is validated through simulation experiments, and its applicability is demonstrated for a crop protection system that ensures real-time monitoring and intrusion control of animals in an agricultural field. The simulation and prototype results demonstrate the impact of the number of nodes, AoI metric, and game-theoretic parameters on the performance of the IoT network.
低功耗广域网(LPWAN)为物联网(IoT)应用提供了一种有前途的无线通信技术。在现有的各种低功耗广域网技术中，远程广域网(LoRaWAN)功耗最小，并通过扩频因子提供虚拟通信通道。然而，LoRaWAN存在与使用相同传播因子的网关连接的节点之间的干扰问题。这种干扰增加了数据通信时间，从而降低了数据的新鲜度和LoRaWAN对延迟敏感应用的适用性。为了最大限度地减少干扰问题，需要对扩频因子进行最优分配，以确定数据传输的时间长度。本文提出了一种博弈论方法来估计使用扩展因子的时间持续时间，以保证数据的准时传输和最大的网络利用率。我们结合了信息时代(Age of Information, AoI)度量来捕获应用程序所要求的信息的新鲜度。通过仿真实验验证了我们提出的方法，并证明了其在作物保护系统中的适用性，该系统可确保农田动物的实时监测和入侵控制。仿真和原型结果验证了节点数量、AoI度量和博弈论参数对物联网网络性能的影响。
{"title":"Improving Age of Information with Interference Problem in Long-Range Wide Area Networks","authors":"Preti Kumari, Hari Prabhat Gupta, Tanima Dutta, Sajal K. Das","doi":"10.1109/WoWMoM54355.2022.00025","DOIUrl":"https://doi.org/10.1109/WoWMoM54355.2022.00025","url":null,"abstract":"Low Power Wide Area Networks (LPWAN) offer a promising wireless communications technology for Internet of Things (IoT) applications. Among various existing LPWAN technologies, Long-Range WAN (LoRaWAN) consumes minimal power and provides virtual channels for communication through spreading factors. However, LoRaWAN suffers from the interference problem among nodes connected to a gateway that uses the same spreading factor. Such interference increases data communication time, thus reducing data freshness and suitability of LoRaWAN for delay-sensitive applications. To minimize the interference problem, an optimal allocation of the spreading factor is requisite for determining the time duration of data transmission. This paper proposes a game-theoretic approach to estimate the time duration of using a spreading factor that ensures on-time data delivery with maximum network utilization. We incorporate the Age of Information (AoI) metric to capture the freshness of information as demanded by the applications. Our proposed approach is validated through simulation experiments, and its applicability is demonstrated for a crop protection system that ensures real-time monitoring and intrusion control of animals in an agricultural field. The simulation and prototype results demonstrate the impact of the number of nodes, AoI metric, and game-theoretic parameters on the performance of the IoT network.","PeriodicalId":275324,"journal":{"name":"2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133278138","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
扫码关注我们
求助内容：
应助结果提醒方式：