Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.000049
Ilya Timokhin;Fedor Ivanov
Polar codes have gained significant attention in recent years as they offer a promising solution for reliable communication in the presence of channel noise. However, decoding these codes remains a critical challenge, particularly for practical implementations. Traditional decoding methods such as belief propagation and successive cancellation suffer from complexity and performance issues. To address these challenges, authors have researched several low-complexity decoding techniques, including bit-flipping decoding with critical set construction. Bitflipping decoding methods operate by flipping a limited number of bits in the received codeword to bring the decoder output closer to the transmitted message. The critical set construction is an essential component of these methods, which identifies the set of bits to be flipped. This paper compares various bit-flipping decoding methods with different critical set constructions, including revised critical set, subblocks-based critical set, key set and others. The performance of these methods is evaluated in terms of bit error rate, computational complexity, and an average number of operations. In summary, this paper provides a comprehensive overview of bit-flipping decoding methods with critical set construction for polar codes. The paper's findings highlight the potential of these methods to improve the performance and reliability of polar codes, making them a viable option for practical implementation in modern communication systems.
{"title":"Overview of various methods for decoding and constructing critical sets of polar codes","authors":"Ilya Timokhin;Fedor Ivanov","doi":"10.23919/JCN.2023.000049","DOIUrl":"https://doi.org/10.23919/JCN.2023.000049","url":null,"abstract":"Polar codes have gained significant attention in recent years as they offer a promising solution for reliable communication in the presence of channel noise. However, decoding these codes remains a critical challenge, particularly for practical implementations. Traditional decoding methods such as belief propagation and successive cancellation suffer from complexity and performance issues. To address these challenges, authors have researched several low-complexity decoding techniques, including bit-flipping decoding with critical set construction. Bitflipping decoding methods operate by flipping a limited number of bits in the received codeword to bring the decoder output closer to the transmitted message. The critical set construction is an essential component of these methods, which identifies the set of bits to be flipped. This paper compares various bit-flipping decoding methods with different critical set constructions, including revised critical set, subblocks-based critical set, key set and others. The performance of these methods is evaluated in terms of bit error rate, computational complexity, and an average number of operations. In summary, this paper provides a comprehensive overview of bit-flipping decoding methods with critical set construction for polar codes. The paper's findings highlight the potential of these methods to improve the performance and reliability of polar codes, making them a viable option for practical implementation in modern communication systems.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"760-777"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387277","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.10387284
{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2023.10387284","DOIUrl":"https://doi.org/10.23919/JCN.2023.10387284","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"867-869"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387284","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.000039
Lluís Casals;Carles Gomez;Rafael Vidal
LoRaWAN has become a flagship LPWAN technology, and one of the main connectivity alternatives for IoT devices. Since LoRaWAN was designed for low energy consumption, it is fundamental to understand its energy performance. In this paper, we study the impact of packet size on LoRaWAN device energy consumption per delivered data bit (EPB). By means of extensive simulations, we show that, when network performance is very high or very low, EPB decreases steadily with packet size; otherwise, EPB may show an “asymmetric U” shape as a function of packet size, with a minimum EPB value that is achieved for a medium packet size. We also provide detailed insights on the reasons that produce the observed behaviors.
{"title":"Understanding the impact of packet size on the energy efficiency of LoRaWAN","authors":"Lluís Casals;Carles Gomez;Rafael Vidal","doi":"10.23919/JCN.2023.000039","DOIUrl":"https://doi.org/10.23919/JCN.2023.000039","url":null,"abstract":"LoRaWAN has become a flagship LPWAN technology, and one of the main connectivity alternatives for IoT devices. Since LoRaWAN was designed for low energy consumption, it is fundamental to understand its energy performance. In this paper, we study the impact of packet size on LoRaWAN device energy consumption per delivered data bit (EPB). By means of extensive simulations, we show that, when network performance is very high or very low, EPB decreases steadily with packet size; otherwise, EPB may show an “asymmetric U” shape as a function of packet size, with a minimum EPB value that is achieved for a medium packet size. We also provide detailed insights on the reasons that produce the observed behaviors.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"814-824"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387281","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.000038
Nguyen Duy Tan;Van-Hau Nguyen
When designing routing protocols for wireless sensor networks, the principal challenge is to prolong the network's lifespan by effectively using the limited battery energy of the sensor nodes. To address this issue, we propose an energy-efficient routing protocol employing a two-level tree-based clustering (called EE-TLT) approach to stabilize and efficiently use the sensor node's energy. In EE-TLT, the regional network is logically divided into clusters, with the number of nodes balanced in each cluster. Within each cluster, the nodes are again separated into polygons and the data is transmitted only via short links using a two-level routing tree, which is composed of one or more minimum spanning trees based on the Kruskal algorithm with a sub-cluster head (sub-CH) node serving as the root and a two-level tree linking sub-CHs at different polygons and the base station (BS). To determine the cluster head or relay cluster head node in each polygon or sector respectively, EE-TLT considers the energy residual and distance among candidate nodes and the BS. Furthermore, EE-TLT selects the optimal data transmission stage length in each round, significantly increasing the number of data packets that the BS receives. Our experimental results demonstrate that EE-TLT not only further balances the energy consumption among sensors but also improves the ratio of data packets accepted by BS and energy efficiency compared to the LEACH-VA, PEGCP, and STDC by approximately 25%, 15%, and 10%, respectively, in both homogeneous and heterogeneous networks. The code and the simulation results of EE-TLT may be found at https://tinyurl.com/ee-tlt-wsn.
{"title":"EE-TLT: Energy-efficient routing protocol using two-level tree-based clustering in wireless sensor network","authors":"Nguyen Duy Tan;Van-Hau Nguyen","doi":"10.23919/JCN.2023.000038","DOIUrl":"https://doi.org/10.23919/JCN.2023.000038","url":null,"abstract":"When designing routing protocols for wireless sensor networks, the principal challenge is to prolong the network's lifespan by effectively using the limited battery energy of the sensor nodes. To address this issue, we propose an energy-efficient routing protocol employing a two-level tree-based clustering (called EE-TLT) approach to stabilize and efficiently use the sensor node's energy. In EE-TLT, the regional network is logically divided into clusters, with the number of nodes balanced in each cluster. Within each cluster, the nodes are again separated into polygons and the data is transmitted only via short links using a two-level routing tree, which is composed of one or more minimum spanning trees based on the Kruskal algorithm with a sub-cluster head (sub-CH) node serving as the root and a two-level tree linking sub-CHs at different polygons and the base station (BS). To determine the cluster head or relay cluster head node in each polygon or sector respectively, EE-TLT considers the energy residual and distance among candidate nodes and the BS. Furthermore, EE-TLT selects the optimal data transmission stage length in each round, significantly increasing the number of data packets that the BS receives. Our experimental results demonstrate that EE-TLT not only further balances the energy consumption among sensors but also improves the ratio of data packets accepted by BS and energy efficiency compared to the LEACH-VA, PEGCP, and STDC by approximately 25%, 15%, and 10%, respectively, in both homogeneous and heterogeneous networks. The code and the simulation results of EE-TLT may be found at https://tinyurl.com/ee-tlt-wsn.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"734-749"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387275","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.000018
Juncal Uriol;Juan Felipe Mogollón;Mikel Serón;Roberto Viola;Ángel Martín;Mikel Zorrilla;Jon Montalbán
The growth of network traffic and the rise of new network applications having heterogeneous requirements are stressing the telecommunication infrastructure and pushing network management to undergo profound changes. Network management is becoming a core research area to push the network and its performance to the limits, as it aims at applying dynamic changes across the network nodes to fit the requirements of each specific network traffic or application. Here, solutions and frameworks based on software-defined networking (SDN) and network function virtualization (NFV) facilitate the monitorization and control of both the network infrastructure and the network services running on top of it. This article identifies and analyzes different implemented solutions to perform experiments on network management. In this context, an innovative experimental testbed is described and implemented to allow experimentation. A predictive path routing algorithm is later proposed and tested by designing experiments with specific network topologies and configurations deployed through the testbed. The algorithm exploits predictions on network latency to change the routing rules. Finally, the article identifies the open challenges and missing functions to achieve next-generation network management.
{"title":"Predictive path routing algorithm for low-latency traffic in NFV-based experimental testbed","authors":"Juncal Uriol;Juan Felipe Mogollón;Mikel Serón;Roberto Viola;Ángel Martín;Mikel Zorrilla;Jon Montalbán","doi":"10.23919/JCN.2023.000018","DOIUrl":"https://doi.org/10.23919/JCN.2023.000018","url":null,"abstract":"The growth of network traffic and the rise of new network applications having heterogeneous requirements are stressing the telecommunication infrastructure and pushing network management to undergo profound changes. Network management is becoming a core research area to push the network and its performance to the limits, as it aims at applying dynamic changes across the network nodes to fit the requirements of each specific network traffic or application. Here, solutions and frameworks based on software-defined networking (SDN) and network function virtualization (NFV) facilitate the monitorization and control of both the network infrastructure and the network services running on top of it. This article identifies and analyzes different implemented solutions to perform experiments on network management. In this context, an innovative experimental testbed is described and implemented to allow experimentation. A predictive path routing algorithm is later proposed and tested by designing experiments with specific network topologies and configurations deployed through the testbed. The algorithm exploits predictions on network latency to change the routing rules. Finally, the article identifies the open challenges and missing functions to achieve next-generation network management.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"789-805"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387279","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.000033
Shen Fu;Vishak Narayanan;Mathew L. Wymore;Vishal Deep;Henry Duwe;Daji Qiao
The emergence of the Internet of things (IoT) brings a new paradigm of ubiquitous sensing and computing. Yet as an increasing number of wireless IoT devices are deployed, powering them with batteries becomes expensive and unsustainable. Batteryless systems harvesting energy from the ambient environment offer a promising solution to this problem. However, due to the unpredictability of the ambient energy sources and the relatively weak harvesting strength, these systems may operate intermittently, presenting a series of unique challenges above and beyond the challenges of traditional duty-cycled networks. In this article, we present and discuss the challenges and opportunities in batteryless intermittent networks. We make the case for, and propose, the first formal intermittency-aware network stack. Finally, we present future research directions for batteryless intermittent networks, with the expectation that research of this type can pave the way for batteryless intermittent networks as the next generation of ubiquitous IoT devices.
{"title":"No battery, no problem: Challenges and opportunities in batteryless intermittent networks","authors":"Shen Fu;Vishak Narayanan;Mathew L. Wymore;Vishal Deep;Henry Duwe;Daji Qiao","doi":"10.23919/JCN.2023.000033","DOIUrl":"https://doi.org/10.23919/JCN.2023.000033","url":null,"abstract":"The emergence of the Internet of things (IoT) brings a new paradigm of ubiquitous sensing and computing. Yet as an increasing number of wireless IoT devices are deployed, powering them with batteries becomes expensive and unsustainable. Batteryless systems harvesting energy from the ambient environment offer a promising solution to this problem. However, due to the unpredictability of the ambient energy sources and the relatively weak harvesting strength, these systems may operate intermittently, presenting a series of unique challenges above and beyond the challenges of traditional duty-cycled networks. In this article, we present and discuss the challenges and opportunities in batteryless intermittent networks. We make the case for, and propose, the first formal intermittency-aware network stack. Finally, we present future research directions for batteryless intermittent networks, with the expectation that research of this type can pave the way for batteryless intermittent networks as the next generation of ubiquitous IoT devices.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"806-813"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387280","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.10387272
{"title":"Reviewer list for 2023","authors":"","doi":"10.23919/JCN.2023.10387272","DOIUrl":"https://doi.org/10.23919/JCN.2023.10387272","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"841-855"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387272","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.10387271
This index covers all papers that appeared in JCN during 2023. The Author Index contains the primary entry for each item, listed under the first author's name, and cross-references from all coauthors. The Title Index contains paper titles for each Division in the alphabetical order from No. 1 to No. 6. Please refer to the primary entry in the Author Index for the exact title, coauthors, and comments / corrections.
{"title":"2023 Index: Journal of communications and networks, volume 25","authors":"","doi":"10.23919/JCN.2023.10387271","DOIUrl":"https://doi.org/10.23919/JCN.2023.10387271","url":null,"abstract":"This index covers all papers that appeared in JCN during 2023. The Author Index contains the primary entry for each item, listed under the first author's name, and cross-references from all coauthors. The Title Index contains paper titles for each Division in the alphabetical order from No. 1 to No. 6. Please refer to the primary entry in the Author Index for the exact title, coauthors, and comments / corrections.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"856-861"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387271","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-01DOI: 10.23919/JCN.2023.000050
Mason Thammawichai;Thiansiri Luangwilai
Energy optimization routing protocol is considered an essential problem in wireless sensor networks (WSNs) as it can affect the network lifetime. Most of the existing routing algorithms are designed for two-dimensional networks, which cannot be transferred to three-dimensional WSNs. Due to a lack of knowledge about the third dimension, 2D routing algorithms perform badly in a real-life 3D environment such as a hill, an urban area, an underground area, an underwater area, and so forth. These networks also suffer from problems such as routing stretch, energy efficiency, and load balancing. Therefore, in this paper, a mixed integer linear programming is formulated as an optimal WSN topology control problem to address the energy optimization routing problem in 3D terrain. The proposed method is a self-organized network that uses clustering and sleep/wake-up schemes to maximize the network lifetime and minimize energy consumption. Simulations revealed that our algorithm is robust to various terrains and significantly increases the network lifetime when compared to a well-known protocol, i.e., the multi-hop low energy adaptive clustering hierarchy (LEACH), with an improved average of 44.94 %. The results also suggested that the energy balancing strategy provided better solutions than the minimizing total energy scheme due to the optimal load balancing scheme of the cluster head selection at each decision round. Furthermore, our global optimal solutions can serve as a benchmark for all heuristic algorithms. Though the number of variables in our optimization problem grows nonlinearly with the number of sensor nodes, the computation time is rather practical as the problem is linear.
{"title":"An energy-optimization topology control for three-dimensional wireless sensor networks","authors":"Mason Thammawichai;Thiansiri Luangwilai","doi":"10.23919/JCN.2023.000050","DOIUrl":"https://doi.org/10.23919/JCN.2023.000050","url":null,"abstract":"Energy optimization routing protocol is considered an essential problem in wireless sensor networks (WSNs) as it can affect the network lifetime. Most of the existing routing algorithms are designed for two-dimensional networks, which cannot be transferred to three-dimensional WSNs. Due to a lack of knowledge about the third dimension, 2D routing algorithms perform badly in a real-life 3D environment such as a hill, an urban area, an underground area, an underwater area, and so forth. These networks also suffer from problems such as routing stretch, energy efficiency, and load balancing. Therefore, in this paper, a mixed integer linear programming is formulated as an optimal WSN topology control problem to address the energy optimization routing problem in 3D terrain. The proposed method is a self-organized network that uses clustering and sleep/wake-up schemes to maximize the network lifetime and minimize energy consumption. Simulations revealed that our algorithm is robust to various terrains and significantly increases the network lifetime when compared to a well-known protocol, i.e., the multi-hop low energy adaptive clustering hierarchy (LEACH), with an improved average of 44.94 %. The results also suggested that the energy balancing strategy provided better solutions than the minimizing total energy scheme due to the optimal load balancing scheme of the cluster head selection at each decision round. Furthermore, our global optimal solutions can serve as a benchmark for all heuristic algorithms. Though the number of variables in our optimization problem grows nonlinearly with the number of sensor nodes, the computation time is rather practical as the problem is linear.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"778-788"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387278","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01DOI: 10.23919/JCN.2023.000032
Vishrant Tripathi;Nicholas Jones;Eytan Modiano
We consider the design of distributed scheduling algorithms that minimize age of information (AoI) in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting; hence, our goal is to design a distributed carrier sense multiple access (CSMA) scheme that can mimic its performance. To that end, we propose a distributed protocol called Fresh-CSMA and show that in an idealized setting, Fresh-CSMA can match the scheduling decisions of the max-weight policy with high probability in each frame, and also match the theoretical performance guarantees of the max-weight policy over the entire time horizon. We then consider a more realistic setting and study the impact of protocol parameters on the probability of collisions and the overhead caused by the distributed nature of the protocol. We also consider the monitoring of Markov sources and extend our approach to CSMA protocols that incorporate age of incorrect information (AoII) instead of AoI. Finally, we provide simulations that support our theoretical results and show that the performance gap between the ideal and realistic versions of Fresh-CSMA is small.
{"title":"Fresh-CSMA: A distributed protocol for minimizing age of information","authors":"Vishrant Tripathi;Nicholas Jones;Eytan Modiano","doi":"10.23919/JCN.2023.000032","DOIUrl":"https://doi.org/10.23919/JCN.2023.000032","url":null,"abstract":"We consider the design of distributed scheduling algorithms that minimize age of information (AoI) in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting; hence, our goal is to design a distributed carrier sense multiple access (CSMA) scheme that can mimic its performance. To that end, we propose a distributed protocol called Fresh-CSMA and show that in an idealized setting, Fresh-CSMA can match the scheduling decisions of the max-weight policy with high probability in each frame, and also match the theoretical performance guarantees of the max-weight policy over the entire time horizon. We then consider a more realistic setting and study the impact of protocol parameters on the probability of collisions and the overhead caused by the distributed nature of the protocol. We also consider the monitoring of Markov sources and extend our approach to CSMA protocols that incorporate age of incorrect information (AoII) instead of AoI. Finally, we provide simulations that support our theoretical results and show that the performance gap between the ideal and realistic versions of Fresh-CSMA is small.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"556-569"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323421","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：