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.
Cache-enabled base station (BS) densification, denoted as a fog radio access network (F-RAN), is foreseen as a key component of 5G cellular networks. F-RAN enables storing popular files at the network edge (i.e., BS caches), which empowers local communication and alleviates traffic congestions at the core/backhaul network. The hitting probability, which is the probability of successfully transmitting...
This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are...
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS)....
The problem of minimizing the decoding delay in Generalized instantly decodable network coding (G-IDNC) for both perfect and lossy feedback scenarios is formulated as a maximum weight clique problem over the G-IDNC graph in . In this letter, we introduce a new lossy G-IDNC graph (LG-IDNC) model to further minimize the decoding delay in lossy feedback scenarios. Whereas the G-IDNC graph represents...
In this paper, we study the effect of packet feedback loss events on the broadcast completion delay performance of instantly decodable network coding. These feedback loss events result in a continuous lack of knowledge about the reception status at different subsets of receivers. This lack of knowledge creates a challenge in selecting efficient packet combinations in subsequent transmissions. To solve...
In this paper, we consider the problem of minimizing the broadcast completion delay for instantly decodable network coding with limited feedback. We first extend the stochastic shortest path formulation of the full feedback scenario in [1] to the limited feedback scenario. We then show that the resulting formulation is more complicated to solve than the original one but has its same properties and...
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.