Journal of Communications and Networks最新文献

{"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}

{"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}

{"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}

{"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}

{"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}

{"title":"Control-aware scheduling over multi-hop networks","authors":"Polina Kutsevol;Onur Ayan;Wolfgang Kellerer","doi":"10.23919/JCN.2023.000036","DOIUrl":"https://doi.org/10.23919/JCN.2023.000036","url":null,"abstract":"With the proliferation of wireless networks as an indispensable component for a wide range of distributed Cyber-Physical Systems applications, the paradigm of the networking algorithms design independent from application goals abolishes. Thus, the control-aware design of the wireless resource management for wireless networked control systems (WNCSs) is shown to be more effective from the application perspective than the conventional approaches. In WNCS, the controller monitors and actuates the plant through the status updates received from the sensor over the network. This work focuses on application-aware transmission scheduling over multi-hop networks for WNCSs. As an intermediate metric, we use age of information (AoI) that captures the freshness of the data on the controller. Being a widely adopted metric for real-time applications, AoI does not consider the particular goal of control applications. Nevertheless, AoI is tightly coupled with the estimation error at the controller that, in turn, directly impacts control performance. We derive the distribution of AoI in the multi-hop network that exploits a time-varying transmission schedule. Using this distribution, we express the expected estimation error to formulate a minimization objective for the scheduling. We propose exact and heuristic methods for solving the optimization and compare different approaches to resource allocation with respect to estimation error and control costs. The proposed scheduling algorithm improves the control performance by at least 15% compared to the scheduling minimizing AoI. Introducing the schedule variability over time allows for further performance improvement by 30% in scenarios with scarce network resources.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"688-698"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323430","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431264","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}

{"title":"Age of information games between power constrained schedulers and adversaries","authors":"Subhankar Banerjee;Sennur Ulukus;Anthony Ephremides","doi":"10.23919/JCN.2023.000046","DOIUrl":"https://doi.org/10.23919/JCN.2023.000046","url":null,"abstract":"We consider a time slotted communication network consisting of a base station (BS), an adversary, Ν users and N\u0000<inf>s</inf>\u0000 communication channels. In the first part of the paper, we consider the setting where N\u0000<inf>s</inf>\u0000 communication channels N\u0000<inf>s</inf>\u0000 are heterogeneously divided among Ν users. The BS transmits an update to the ¿th user on a subset of the communication channels N\u0000<inf>s,i</inf>\u0000 where N\u0000<inf>s,i</inf>\u0000 ∩ N\u0000<inf>s,j</inf>\u0000 is not necessarily an empty set. At each time slot, the BS transmits an update packet to a user through a communication channel and the adversary aims to block the update packet sent by the BS by blocking a communication channel. The BS has η discrete transmission power levels to communicate with the users and the adversary has m discrete blocking power levels to block the communication channels. The probability of successful transmission of an update packet depends on these power levels. The BS and the adversary have a transmission and blocking average power constraint, respectively. We provide a universal lower bound for the average age of information for this communication network. We prove that the uniform user choosing policy, the uniform communication channel choosing policy with any arbitrary feasible transmission power choosing policy is 4 optimal; and the max-age user choosing policy, the uniform communication channel choosing policy with any arbitrary feasible transmission power choosing policy is 2 optimal. In the second part of the paper, we consider the setting where the BS chooses a transmission policy and the adversary chooses a blocking policy from the set of randomized stationary policies and N\u0000<inf>s,i</inf>\u0000 = N\u0000<inf>s</inf>\u0000 for all i, i.e., all users can receive updates on all channels. We show that a Nash equilibrium may or may not exist for this communication network, and identify special cases where a Nash equilibrium always exists.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"631-642"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323426","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431278","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}

{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2023.000055","DOIUrl":"https://doi.org/10.23919/JCN.2023.000055","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"700-704"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323431","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431268","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}

{"title":"On the age of information of processor sharing systems","authors":"Benat Gandarias;Josu Doncel;Mohamad Assaad","doi":"10.23919/JCN.2023.000042","DOIUrl":"https://doi.org/10.23919/JCN.2023.000042","url":null,"abstract":"In this paper, we examine the age of information (AoI) of a source sending status updates to a monitor through a queue operating under the processor sharing (PS) discipline. In the PS queueing discipline, all the updates are served simultaneously and, therefore, none of of the jobs wait in the queue to get service. While AoI has been well studied for various queuing models and policies, less attention has been given so far to the PS discipline. We first consider the M/M/1/2 queue with and without preemption and provide closed-form expressions for the average AoI in this case. We overcome the challenges of deriving the AoI expression by employing the stochastic hybrid systems (SHS) tool. We then extend the analysis to the M/M/1 queue with one and two sources and provide numerical results for these cases. Our results show that PS can outperform the M/M/1/1∗ queue in some cases.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"643-656"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323427","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431266","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}

{"title":"AoI analysis and optimization in systems with computations-intensive updates","authors":"Saeid Sadeghi Vilni;Mohammad Moltafet;Markus Leinonen;Marian Codreanu","doi":"10.23919/JCN.2023.000040","DOIUrl":"https://doi.org/10.23919/JCN.2023.000040","url":null,"abstract":"We consider a status update system consisting of a sampler, a controller, a processing unit, a transmitter, and a sink. The sampler generates a sample upon receiving a request from the controller and the sample requires further processing before transmission, hence is computation-intensive. This is mathematically modeled by a server called process server. After processing the sample, the status update packet is generated and sent to the transmitter for delivery to the sink. This is mathematically modeled by a server called transmit server. The service time of each packet at the transmit and process servers follow geometric distributions. Moreover, we consider that the servers serve packets under the blocking policy, i.e., whenever a server is busy at the arrival time of a new packet, the new arriving packet is blocked and discarded. We analyze the average age of information (AoI) for two fixed policies, namely, 1) zero-wait-one policy and 2) zero-wait-blocking policy. According to the former policy, the controller requests sampling when there is no packet in the system. According to the zero-wait-blocking policy, the controller requests a sample whenever the process server is idle. Furthermore, we develop an optimal control policy to minimize the average AoI using the tools of Markov decision process (MDP). In numerical results, we evaluate the performance of the policies under different system parameters. Moreover, we analyze the structure of the optimal policy.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"585-597"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323423","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431263","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}