When to Pull Data for Minimum Age Penalty

Yavascan, Orhan T.
Ceran Arslan, Elif Tuğçe
Cakir, Zeynep
Uysal, Elif
Kaya, Onur
© 2021 IFIP.A communication receiver that wants to pull data from a remote sensor by exploiting wireless energy transfer is considered. The receiver has a long-term average energy budget for this operation, and its goal is to keep the time average of a general age penalty function as small as possible. The channel from the source to the receiver is a two-state (ON/OFF) communication link whose state is IID or Markovian, and known instantaneously by the receiver. Modeling the problem as a constrained Markov decision problem, we obtain a randomized threshold-based decision policy that achieves the minimum possible average age penalty. We determine the optimal time average Age of Information and age violation probabilities by exploiting the optimality of the derived policy.
19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, WiOpt 2021


Impacts of Routing Attacks on Surveillance Wireless Sensor Networks
Sert, Seyyit Alper; Yazıcı, Adnan; Coşar, Ahmet (2015-08-25)
Surveillance Wireless Sensor Networks (SWSNs) are the result of abundant data gathering requirements occurring in Wireless Sensor Networks, specifically for surveillance reasons. Most SWSNs operate by sensing the environment and transmitting the acquired data to a sink in order to utilize it for decision making processes such as object detection, classification, localization, or event detection. In this respect, secure routing of acquired data is crucial since a decision making process is performed accordin...
Analysis of target detection probability in randomly deployed sensor networks
Onur, Ertan; Delic, Hakan (Institute of Electrical and Electronics Engineers (IEEE), 2007-10-01)
The main functionality of a surveillance wireless sensor network is to detect unauthorized traversals in a field. In this paper, we develop a formulation to determine the probability of detecting a randomly positioned target by a set of binary sensors to serve as the deployment quality measure. This formulation leads to a recipe to determine the number of sensors required to deliver a certain deployment quality level. The sensing- and communication-neighbor degrees which can be used as design criteria in a ...
How many sensors for an acceptable breach detection probability?
Onur, Ertan; Delic, H (Elsevier BV, 2006-01-10)
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the number of sensors and the breach detection probability considering the effects of sensor parameters. We present the weakest breach path problem formulation and provide a solution by utilizing the Dijkstra's shortest path algorithm. We propose a method to determine the required number of sensors to be deployed and to gain insight about...
Average Throughput Performance of Myopic Policy in Energy Harvesting Wireless Sensor Networks
Gül, Ömer Melih; Demirekler, Mübeccel (MDPI AG, 2017-9-26)
This paper considers a single-hop wireless sensor network where a fusion center collects data from M energy harvesting wireless sensors. The harvested energy is stored losslessly in an infinite-capacity battery at each sensor. In each time slot, the fusion center schedules K sensors for data transmission over K orthogonal channels. The fusion center does not have direct knowledge on the battery states of sensors, or the statistics of their energy harvesting processes. The fusion center only has information ...
Energy Efficient Transmission Scheduling for Channel-adaptive Wireless Energy Transfer
Bacınoğlu, Baran Tan; Kaya, Onur; Uysal, Elif (2018-04-18)
We consider a fading communication link where the transmitter is powered by the receiver through wireless energy transfer (WET). A typical application scenario for this is the transmitter being a simple sensor while the demand for data is created by an application running at the receiver side and pulled from the transmitter as needed. We formulate two offline transmission scheduling problems: the transmitter-centric WET transmission optimization problem, where the schedule is computed by the transmitter, an...
Citation Formats
O. T. Yavascan, E. T. Ceran Arslan, Z. Cakir, E. Uysal, and O. Kaya, “When to Pull Data for Minimum Age Penalty,” presented at the 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, WiOpt 2021, Pennsylvania, Amerika Birleşik Devletleri, 2021, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85119533185&origin=inward.