uu.seUppsala University Publications
Change search
Link to record
Permanent link

Direct link
BETA
Publications (4 of 4) Show all publications
Ahani, G. & Yuan, D. (2019). BS-assisted Task Offloading for D2D Networks with Presence of User Mobility. In: 2019 IEEE 89TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2019-SPRING): . Paper presented at 89th IEEE Vehicular Technology Conference (VTC Spring), APR 28-MAY 01, 2019, Kuala Lumpur, MALAYSIA. IEEE
Open this publication in new window or tab >>BS-assisted Task Offloading for D2D Networks with Presence of User Mobility
2019 (English)In: 2019 IEEE 89TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2019-SPRING), IEEE , 2019Conference paper, Published paper (Refereed)
Abstract [en]

Task offloading is a key component in mobile edge computing. Offloading a task to a remote server takes communication and networking resources. An alternative is device-to-device (D2D) offloading, where a task of a device is offloaded to some device having computational resource available. The latter requires that the devices are within the range of each other, first for task collection, and later for result gathering. Hence, in mobility scenarios, the performance of D2D offloading will suffer if the contact rates between the devices are low. We enhance the setup to base station (BS) assisted D2D offloading, namely, a BS can act as a relay for task distribution or result collection. However, this would imply additional consumption of wireless resources. The associated cost and the improvement in completion time of task offloading compose a fundamental trade-off. For the resulting optimization problem, we mathematically prove the complexity, and propose an algorithm using Lagrangian duality. The simulation results demonstrate not only that the algorithm has close-to-optimal performance, but also provide structural insights of the optimal trade-off.

Place, publisher, year, edition, pages
IEEE, 2019
Series
IEEE Vehicular Technology Conference Proceedings, ISSN 1550-2252
Keywords
Task offloading, D2D communications, Mobility, Base station, Relay
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-394727 (URN)10.1109/VTCSpring.2019.8746650 (DOI)000482655600307 ()978-1-7281-1217-6 (ISBN)
Conference
89th IEEE Vehicular Technology Conference (VTC Spring), APR 28-MAY 01, 2019, Kuala Lumpur, MALAYSIA
Available from: 2019-10-11 Created: 2019-10-11 Last updated: 2019-10-11Bibliographically approved
Deng, T., Ahani, G., Fan, P. & Yuan, D. (2018). Cost-optimal caching for D2D networks with user mobility: Modeling, analysis, and computational approaches. IEEE Transactions on Wireless Communications, 17(5), 3082-3094
Open this publication in new window or tab >>Cost-optimal caching for D2D networks with user mobility: Modeling, analysis, and computational approaches
2018 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 17, no 5, p. 3082-3094Article in journal (Refereed) Published
National Category
Communication Systems
Identifiers
urn:nbn:se:uu:diva-356502 (URN)10.1109/TWC.2018.2806451 (DOI)000432014300019 ()
Available from: 2018-02-22 Created: 2018-07-30 Last updated: 2018-11-30Bibliographically approved
Ahani, G. & Yuan, D. (2018). On optimal proactive and retention-aware caching with user mobility. In: 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall): . Paper presented at 88th IEEE Vehicular Technology Conference (VTC-Fall), AUG 27-30, 2018, Chicago, IL. IEEE
Open this publication in new window or tab >>On optimal proactive and retention-aware caching with user mobility
2018 (English)In: 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall), IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

Caching popular contents at edge devices is an effective solution to alleviate the burden of the backhaul networks. Earlier investigations commonly neglected the storage cost in caching. More recently, retention-aware caching, where both the downloading cost and storage cost are accounted for, is attracting attention. Motivated by this, we address proactive and retention-aware caching problem with the presence of user mobility, optimizing the sum of the two types of costs. More precisely, a cost-optimal caching problem for vehicle-to-vehicle networks is formulated with joint consideration of the impact of the number of vehicles, cache size, storage cost, and content request probability. This is a combinatorial optimization problem. However, we derive a stream of analytical results and they together lead to an algorithm that guarantees global optimum with polynomial-time complexity. Numerical results show significant improvements in comparison to popular caching and random caching.

Place, publisher, year, edition, pages
IEEE, 2018
Series
IEEE Vehicular Technology Conference Proceedings, ISSN 1550-2252
National Category
Telecommunications
Identifiers
urn:nbn:se:uu:diva-368071 (URN)10.1109/VTCFall.2018.8691020 (DOI)000468872400462 ()978-1-5386-6358-5 (ISBN)
Conference
88th IEEE Vehicular Technology Conference (VTC-Fall), AUG 27-30, 2018, Chicago, IL
Available from: 2019-04-15 Created: 2018-12-03 Last updated: 2019-08-02Bibliographically approved
Deng, T., Ahani, G., Fan, P. & Yuan, D. (2017). Cost-Optimal Caching for D2D Networks with Presence of User Mobility. In: GLOBECOM 2017 - 2017 IEEE Global Communications Conference: . Paper presented at IEEE Global Communications Conference (GLOBECOM), DEC 04-08, 2017, YourSingapore, Singapore, SINGAPORE. IEEE
Open this publication in new window or tab >>Cost-Optimal Caching for D2D Networks with Presence of User Mobility
2017 (English)In: GLOBECOM 2017 - 2017 IEEE Global Communications Conference, IEEE , 2017Conference paper, Published paper (Refereed)
Abstract [en]

Caching popular files at user equipments (UEs) provides an effective way to alleviate the burden of the back-haul networks. Generally, popularity based caching is not a system-wide optimal strategy, especially for mobility scenarios. Motivated by this observation, an optimal caching problem with respect to user mobility is investigated. To be specific, a cost-optimal caching problem (COCP) for device-to-device (D2D) networks is formulated, in which the impact of user mobility, cache size, and total number of encoded file segments are considered. Compared with the related studies, our investigation guarantees that the collected segments are non-overlapping, takes into account the cost of downloading from the network, and provides a rigorous complexity analysis. For problem solving, we first prove that the optimal caching placement of one user, giving other users' caching placements, can be derived in polynomial time. Then, based on this proof, a fast yet effective caching placement algorithm for all users is developed. Simulation results verify the effectiveness of this algorithm by comparing it to conventional caching algorithms.

Place, publisher, year, edition, pages
IEEE, 2017
Series
IEEE Global Communications Conference, ISSN 2334-0983
Keywords
Backhaul networks, caching, D2D, user mobility
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-357086 (URN)10.1109/GLOCOM.2017.8254033 (DOI)000428054300113 ()978-1-5090-5019-2 (ISBN)
Conference
IEEE Global Communications Conference (GLOBECOM), DEC 04-08, 2017, YourSingapore, Singapore, SINGAPORE
Funder
Swedish Research Council
Available from: 2018-08-10 Created: 2018-08-10 Last updated: 2018-08-10Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-1869-6192

Search in DiVA

Show all publications