Araştırma Çıktıları | WoS | Scopus | TR-Dizin | PubMed
Permanent URI for this communityhttps://hdl.handle.net/20.500.14719/1741
Browse
4 results
Search Results
Publication Metadata only Age of Information in Two-Hop Multicast Networks(IEEE Computer Society, 2018) Buyukates, Baturalp; Soysal, Alkan; Ulukus, Sennur; Matthews, M.B.; Buyukates, Baturalp, Department of Electrical & Computer Engineering, University of Maryland, College Park, College Park, United States; Soysal, Alkan, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey; Ulukus, Sennur, Department of Electrical & Computer Engineering, University of Maryland, College Park, College Park, United StatesWe consider the age of information in a two-hop multicast network where there is a single source node sending time-sensitive updates to n{2} end nodes through n middle nodes. In the first hop, the source node sends updates to n middle nodes, and in the second hop each middle node relays the update packets that it receives to n end users that are connected to it. We study the age of information experienced by the end nodes, and in particular, its scaling as a function of n. We show that, using an earliest k transmission scheme, the age of information at the end nodes can be made a constant independent of n. In particular, the source node transmits each update packet to the earliest k-{1} of the n middle nodes, and each middle node that receives the update relays it to the earliest k-{2} out of n end nodes that are connected to it. We determine the optimum k-{1} and k-{2} stopping values for arbitrary shifted exponential link delays. © 2023 Elsevier B.V., All rights reserved.Publication Open Access Age of information scaling in large networks with hierarchical cooperation(2019) Buyukates, Baturalp; Soysal, Alkan; Ulukus, Sennur; Buyukates, Baturalp, Department of Electrical & Computer Engineering, A. James Clark School of Engineering, College Park, United States; Soysal, Alkan, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey; Ulukus, Sennur, Department of Electrical & Computer Engineering, A. James Clark School of Engineering, College Park, United StatesGiven n randomly located source-destination (S- D) pairs on a fixed area network that want to communicate with each other, we study the age of information with a particular focus on its scaling as the network size n grows. We propose a three- phase transmission scheme that utilizes textit{hierarchical cooperation} between users along with textit{mega update packets} and show that an average age scaling of O(n{alpha(h)}log n) per-user is achievable where h denotes the number of hierarchy levels and alpha(h) = frac{1}{3cdot2h+1} which tends to 0 as h increases such that asymptotically average age scaling of the proposed scheme is O(log n). To the best of our knowledge, this is the best average age scaling result in a status update system with multiple S-D pairs. © 2024 Elsevier B.V., All rights reserved.Publication Open Access Age of Information Scaling in Large Networks(Institute of Electrical and Electronics Engineers Inc., 2019) Buyukates, Baturalp; Soysal, Alkan; Ulukus, Sennur; Buyukates, Baturalp, Department of Electrical & Computer Engineering, University of Maryland, College Park, College Park, United States; Soysal, Alkan, Department of Electrical & Computer Engineering, University of Maryland, College Park, College Park, United States; Ulukus, Sennur, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, TurkeyWe study age of information in a multiple source-multiple destination setting with a focus on its scaling in large wireless networks. There are n nodes that are randomly paired with each other on a fixed area to form n source-destination (SD) pairs. We propose a three-phase transmission scheme which utilizes local cooperation between the nodes by forming what we call mega update packets to serve multiple S-D pairs at once. We show that under the proposed scheme average age of an S-D pair scales as O(n1/4 log n) as the number of users, n, in the network grows. To the best of our knowledge, this is the best age scaling result for a multiple source-multiple destination setting. © 2019 Elsevier B.V., All rights reserved.Publication Open Access Age of Information in Multicast Networks with Multiple Update Streams(IEEE Computer Society [email protected], 2019) Buyukates, Baturalp; Soysal, Alkan; Ulukus, Sennur; Matthews, M.B.; Buyukates, Baturalp, Department of Electrical & Computer Engineering, A. James Clark School of Engineering, College Park, United States; Soysal, Alkan, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey; Ulukus, Sennur, Department of Electrical & Computer Engineering, A. James Clark School of Engineering, College Park, United StatesWe consider the age of information in a multicast network where there is a single source node that sends time-sensitive updates to n receiver nodes. Each status update is one of two kinds: type I or type II. To study the age of information experienced by the receiver nodes for both types of updates, we consider two cases: update streams are generated by the source node at-will and update streams arrive exogenously to the source node. We show that using an earliest k1 and k2 transmission scheme for type I and type II updates, respectively, the age of information of both update streams at the receiver nodes can be made a constant independent of n. In particular, the source node transmits each type I update packet to the earliest k1 and each type II update packet to the earliest k2 of n receiver nodes. We determine the optimum k1 and k2 stopping thresholds for arbitrary shifted exponential link delays to individually and jointly minimize the average age of both update streams and characterize the pareto optimal curve for the two ages. © 2020 Elsevier B.V., All rights reserved.