The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This work introduces a new model for cloud gaming systems aimed at optimizing the timeliness of video frames based on an age of information (AoI) metric. Mobile clients submit actions through an access network to a game server. The game server generates video frames at a constant frame rate. At the mobile device, the display of these frames represent game status updates. We develop a Markov model...
Fast changing topologies, unpredictable network loads, potential broadcast storms, and identity-location conflation problems in IP networks all impose challenges on connected car system design. Prior approaches have proposed smart flooding using location information, carry and forward, and GeoServer assisted algorithms. Due to the complexity and overhead imposed by these approaches, their applications...
There has been a considerable interest in quantifying the influence that one node exerts on another in a social network. Using directed information, we study the problem for a simple, two-node network that models two users in a Twitter network in which one user (Alice) influences the other user (Bob) through her tweets. Under this setup, we relate the problem of direction of influence to the calculation...
This paper investigates the capacity of a discrete-time channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a discrete-time bufferless queue that drops arriving...
This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet...
In this paper, the design and analysis of a new bandwidth-efficient signaling method over the bandlimited intensity-modulated direct-detection (IM/DD) channel is presented. The channel can be modeled as a bandlimited channel with nonnegative input and additive white Gaussian noise (AWGN). Due to the nonnegativity constraint, standard methods for coherent bandlimited channels cannot be applied here...
In this paper, the design and analysis of a new bandwidth-efficient signalling method over the bandlimited intensity-modulated direct-detection (IM/DD) channel is proposed. The channel can be modeled as a bandlimited channel with nonnegative input and additive white Gaussian noise. Due to the nonnegativity constraint, the methods previously proposed for conventional bandlimited channels cannot be...
In many radar and EW applications, after some processing, the envelope of the received pulse is calculated and is used for target detection. Most of the time only the effect of thermal noise is considered in such detectors, but in most of the practical applications, before envelope detection, the signal should be down converted from radio frequency (RF) to an intermediate frequency (IF). In this case,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.