A new femtocaching file placement algorithm for Telemedicine

Leung, Warren Pak Tao; Shikh-Bahaei, Mohammad

doi:10.1109/embc.2015.7318625

Cited by 4 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The theorem follows from substituting (19) and (20) in (16) and noticing that ν =Ũ for the case of one request per client.…”

Section: Appendix B Proof Of Lemmamentioning

confidence: 99%

“…In this paper, the framework in [2], where caching is utilized to compensate for the weak backhaul capacity, is investigated. However, our focus in this paper is on the content delivery problem, not the content placement problem as in previous works [4,[14][15][16]]. An arbitrary content placement and uniform file popularity are assumed in this paper, and the content delivery problem is solved at both the FCs and the MBS so as to offload the maximum MBS bandwidth.…”

Section: A the Caching Problemmentioning

confidence: 99%

See 1 more Smart Citation

Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks

Shnaiwer

Sorour

Sadeghi

et al. 2018

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

The femtocaching idea was proposed as a solution to compensate for the weak backhaul capacity, by deploying coverage-limited nodes with high storage capacity called femtocaches (FCs). In this paper, the macrocell offloading problem in femtocaching-assisted cellular networks is investigated. The objective is to minimize the number of transmissions by the macrocell base station (MBS) given that all requests should be served simultaneously to satisfy quality-of-experience (QoE) of the clients. We first formulate this MBS offloading problem as an optimization problem over a network coding graph, and show that it is NP-hard. Therefore, we propose an ONC-broadcast offloading scheme that exploits both broadcasting and opportunistic network coding (ONC) to minimize the number of required MBS transmissions. We utilize a random graph model to approximate the performance of the proposed ONC-broadcast scheme in terms of the resultant average number of transmissions by the MBS. Moreover, despite the complexity of finding the optimal solution for each and every case, we prove that this ONC-broadcast scheme is 2 asymptotically optimal, i.e., for large number of requests, the ONC-broadcast scheme achieves a similar macrocell offloading performance to that of the optimal solution. To implement the ONC-broadcast scheme, we devise a heuristic that employs a dual conflict graph or broadcasting at the FCs such that the remaining requests can be served using the minimum number of transmissions at the MBS.Simulations show that the dual graph scheme improves MBS offloading as compared to the traditional separate graph scheme. Furthermore, the simple heuristic proposed to implement the ONC-broadcast scheme achieves a very close performance to the optimal ONC-broadcast scheme.

show abstract

“…The theorem follows from substituting (19) and (20) in (16) and noticing that ν =Ũ for the case of one request per client.…”

Section: Appendix B Proof Of Lemmamentioning

confidence: 99%

Section: A the Caching Problemmentioning

confidence: 99%

Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks

Shnaiwer

Sorour

Sadeghi

et al. 2018

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…The optimization problem is to minimize the overall penalty in order to determine the EMR with the lowest penalty and highest priority to be stored in the edge devices [30]. The staying time of patient in different area is considered.…”

Section: B Medical Files Allocation Algorithm On the Edgementioning

confidence: 99%