{"title":"Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication","authors":"Qingyu Liu, Haibo Zeng, Minghua Chen","doi":"10.1145/3323679.3326502","DOIUrl":"https://doi.org/10.1145/3323679.3326502","url":null,"abstract":"We consider the scenario where a sender periodically sends a batch of data to a receiver over a multi-hop network, possibly using multiple paths. Our objective is to minimize peak/average Age-of-Information (AoI) subject to throughput requirements. The consideration of batch generation and multi-path communication differentiates our AoI study from existing ones. We first show that our AoI minimization problems are NP-hard, but only in the weak sense, as we develop an optimal algorithm with a pseudo-polynomial time complexity. We then prove that minimizing AoI and minimizing maximum delay are \"roughly\" equivalent, in the sense that any optimal solution of the latter is an approximate solution of the former with bounded optimality loss. We leverage this understanding to design a general approximation framework for our problems. It can build upon any α-approximation algorithm of the maximum delay minimization problem, e.g., the algorithm in [13] with α = 1 + ε given any user-defined ε > 0, to construct an (α + c)-approximate solution for minimizing AoI. Here c is a constant depending on the throughput requirements. Simulations over various network topologies validate the effectiveness of our approach.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132157966","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}
Y. O. Basciftci, Ahmed S. Bendary, A. Abdelaziz, C. E. Koksal
{"title":"MIMO with Energy Recycling","authors":"Y. O. Basciftci, Ahmed S. Bendary, A. Abdelaziz, C. E. Koksal","doi":"10.1145/3323679.3326531","DOIUrl":"https://doi.org/10.1145/3323679.3326531","url":null,"abstract":"In this paper, multiple-input-single-output (MISO) point-to-point communication system is considered, in which a multiple-input-multiple-output (MIMO) energy recycling (ER) transmitter is designed such that, each antenna can transmit information (multi-input) or recycle energy (multi-output) at any given point in time. The rate by such an ER-MISO communication system under an average transmission power constraint is shown to be achievable. Moreover, the optimal power allocation and the dynamic antenna selection policies that achieve the maximum communication rate are derived. The optimal dynamic antenna selection policy carefully switches the mode of the antennas between active-antennas (transmitting) and ER-antennas, where most of the harvested energy occurs from the neighboring antennas' transmissions, i.e., recycling. In addition, it is shown that, with ER, the achievable rate exceeds the capacity of the classical non-recycling counterpart. Since the complexity of the optimal dynamic antenna selection is exponential with the number of antennas, a linearithmic algorithm that has a minimal degradation in the achievable rate is proposed. Numerical results show that notable gain can be obtained by enabling ER. To address the major questions on the capability of ER and the impact of antenna coupling, hardware setup and experimental results for a four-antenna ER-transmitter are developed, based on a uniform linear array (ULA). As a result, hardware measurements indicate that the loss in the rate due to antenna coupling can be eliminated with sufficient antenna spacing and therefore, ER can achieve a significant gain.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126907561","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":"Forever Young: Aging Control For Hybrid Networks","authors":"E. Altman, R. E. Azouzi, D. Menasché, Yuedong Xu","doi":"10.1145/3323679.3326507","DOIUrl":"https://doi.org/10.1145/3323679.3326507","url":null,"abstract":"The demand for Internet services that require frequent updates through small messages, also known as microblogging, has tremendously grown in the past few years. Although the use of such applications by domestic users is usually free, their access from mobile devices is subject to fees and consumes energy from limited batteries. If a user activates his mobile device and is in the range of a publisher, an update is received at the expense of monetary and energy costs. Thus, users face a tradeoff between such costs and their messages aging. The goal of this paper is to show how to cope with such a tradeoff, by devising aging control policies. An aging control policy consists of deciding, based on the utility of the owned content, whether to activate the mobile device, and if so, which technology to use (WiFi or cellular). We present a model that yields the optimal aging control policy. Our model is based on a Markov Decision Process (MDP) in which states correspond to content ages. Using our model, we show the existence of an optimal strategy in the class of threshold strategies, wherein users activate their mobile devices if the age of their poadcasts surpasses a given threshold and remain inactive otherwise. The accuracy of our model is validated against traces from the UMass DieselNet bus network.","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125556972","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":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","authors":"","doi":"10.1145/3323679","DOIUrl":"https://doi.org/10.1145/3323679","url":null,"abstract":"","PeriodicalId":205641,"journal":{"name":"Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128860344","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}