10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Age of Information in Two-way Updating Systems Using Wireless Power Transfer

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We consider a two-way updating system with a master node and a slave node. In each block, the master node transfers energy and updates to the slave node alternatively. The slave node performs transmission to the master node if it has sufficient energy for current block, i.e., using best-effort policy. Moreover, the slave node generates a new update immediately after the completion of previous update. We examine the freshness of the updates received by the master node in terms of \textit{age of information} (AoI), which is defined as the time elapsed after the generation of the latest received update. We derive average uplink AoI and uplink update rate as functions of downlink update rate in closed form. The obtained results illustrate the performance limit of the unilaterally powered two-way updating system in terms of timeliness and efficiency. The results also specify the achievable tradeoff between the update rates of the two-way updating system.

          Related collections

          Most cited references5

          • Record: found
          • Abstract: not found
          • Article: not found

          On the Age of Information in Status Update Systems With Packet Management

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Implantable biomedical devices: Wireless powering and communication

              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              The Deterministic Time-Linearity of Service Provided by Fading Channels

              In the paper, we study the service process \(S(t)\) of an independent and identically distributed (\textit{i.i.d.}) Nakagami-\(m\) fading channel, which is defined as the amount of service provided, i.e., the integral of the instantaneous channel capacity over time \(t\). By using the Characteristic Function (CF) approach and the infinitely divisible law, it is proved that, other than certain generally recognized curve form {or a stochastic process}, the channel service process \(S(t)\) is a deterministic linear function of time \(t\), namely, \(S(t)=c_m^\ast\cdot t\) where \(c_m^\ast\) is a constant determined by the fading parameter \(m\). Furthermore, we extend it to general \textit{i.i.d.} fading channels and present an explicit form of the constant service rate \(c_p^\ast\). The obtained work provides such a new insight on the system design of joint source/channel coding that there exists a coding scheme such that a receiver can decode with zero error probability and zero high layer queuing delay, if the transmitter maintains a constant data rate no more than \(c_p^\ast\). Finally, we verify our analysis through Monte Carlo simulations.
                Bookmark

                Author and article information

                Journal
                14 December 2017
                Article
                1712.05138
                29a5c66d-b58d-4e29-ba64-88eff47165a6

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                Submitted to IEEE ICC 2018, 6 pages
                cs.IT math.IT

                Comments

                Comment on this article