Minimizing content download time in mobile collaborative community

Insun Jang, Dongeun Suh, Sangheon Pack

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Mobile collaborative community (MCC) is an emerging technology where multiple mobile nodes (MNs) conduct a job (e.g., large content download) in a cooperative manner. In this paper, we consider a scenario in which multiple MNs form MCC for content download through wireless wide area network (WWAN) and share of the downloaded content through wireless local area network (WLAN). In the collaborative content download for MCC, the content chunk size assigned to an MN and the sharing order of the received chunk should be carefully determined to reduce the content download time. Therefore, we formulate an optimization problem that jointly considers the chunk size and the sharing order to minimize the content download time. Specifically, the optimization problem is formulated as a mixed integer non-linear programming (MINLP) problem that is known as NP-hard. The original optimization problem is relaxed into a linear programming (LP) problem and a heuristic algorithm minimizing the content download time and operating in a polynomial time is proposed based on the 2-opt algorithm. Simulation results demonstrate that the proposed algorithm can achieve near-optimal performance to the MINLP optimal solution and can reduce the content download time compared with other algorithms by choosing proper chunk size and sharing order.

Original languageEnglish
Title of host publication2014 IEEE International Conference on Communications, ICC 2014
PublisherIEEE Computer Society
Pages2490-2495
Number of pages6
ISBN (Print)9781479920037
DOIs
Publication statusPublished - 2014 Jan 1
Event2014 1st IEEE International Conference on Communications, ICC 2014 - Sydney, NSW, Australia
Duration: 2014 Jun 102014 Jun 14

Other

Other2014 1st IEEE International Conference on Communications, ICC 2014
CountryAustralia
CitySydney, NSW
Period14/6/1014/6/14

Fingerprint

Nonlinear programming
Wide area networks
Heuristic algorithms
Wireless local area networks (WLAN)
Linear programming
Wireless networks
Polynomials

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Jang, I., Suh, D., & Pack, S. (2014). Minimizing content download time in mobile collaborative community. In 2014 IEEE International Conference on Communications, ICC 2014 (pp. 2490-2495). [6883697] IEEE Computer Society. https://doi.org/10.1109/ICC.2014.6883697

Minimizing content download time in mobile collaborative community. / Jang, Insun; Suh, Dongeun; Pack, Sangheon.

2014 IEEE International Conference on Communications, ICC 2014. IEEE Computer Society, 2014. p. 2490-2495 6883697.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jang, I, Suh, D & Pack, S 2014, Minimizing content download time in mobile collaborative community. in 2014 IEEE International Conference on Communications, ICC 2014., 6883697, IEEE Computer Society, pp. 2490-2495, 2014 1st IEEE International Conference on Communications, ICC 2014, Sydney, NSW, Australia, 14/6/10. https://doi.org/10.1109/ICC.2014.6883697
Jang I, Suh D, Pack S. Minimizing content download time in mobile collaborative community. In 2014 IEEE International Conference on Communications, ICC 2014. IEEE Computer Society. 2014. p. 2490-2495. 6883697 https://doi.org/10.1109/ICC.2014.6883697
Jang, Insun ; Suh, Dongeun ; Pack, Sangheon. / Minimizing content download time in mobile collaborative community. 2014 IEEE International Conference on Communications, ICC 2014. IEEE Computer Society, 2014. pp. 2490-2495
@inproceedings{e95ede47696348d383b4fe5257e806b4,
title = "Minimizing content download time in mobile collaborative community",
abstract = "Mobile collaborative community (MCC) is an emerging technology where multiple mobile nodes (MNs) conduct a job (e.g., large content download) in a cooperative manner. In this paper, we consider a scenario in which multiple MNs form MCC for content download through wireless wide area network (WWAN) and share of the downloaded content through wireless local area network (WLAN). In the collaborative content download for MCC, the content chunk size assigned to an MN and the sharing order of the received chunk should be carefully determined to reduce the content download time. Therefore, we formulate an optimization problem that jointly considers the chunk size and the sharing order to minimize the content download time. Specifically, the optimization problem is formulated as a mixed integer non-linear programming (MINLP) problem that is known as NP-hard. The original optimization problem is relaxed into a linear programming (LP) problem and a heuristic algorithm minimizing the content download time and operating in a polynomial time is proposed based on the 2-opt algorithm. Simulation results demonstrate that the proposed algorithm can achieve near-optimal performance to the MINLP optimal solution and can reduce the content download time compared with other algorithms by choosing proper chunk size and sharing order.",
keywords = "content download, local search of sorting order (LSSO) algorithm, Mobile collaborative community",
author = "Insun Jang and Dongeun Suh and Sangheon Pack",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/ICC.2014.6883697",
language = "English",
isbn = "9781479920037",
pages = "2490--2495",
booktitle = "2014 IEEE International Conference on Communications, ICC 2014",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Minimizing content download time in mobile collaborative community

AU - Jang, Insun

AU - Suh, Dongeun

AU - Pack, Sangheon

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Mobile collaborative community (MCC) is an emerging technology where multiple mobile nodes (MNs) conduct a job (e.g., large content download) in a cooperative manner. In this paper, we consider a scenario in which multiple MNs form MCC for content download through wireless wide area network (WWAN) and share of the downloaded content through wireless local area network (WLAN). In the collaborative content download for MCC, the content chunk size assigned to an MN and the sharing order of the received chunk should be carefully determined to reduce the content download time. Therefore, we formulate an optimization problem that jointly considers the chunk size and the sharing order to minimize the content download time. Specifically, the optimization problem is formulated as a mixed integer non-linear programming (MINLP) problem that is known as NP-hard. The original optimization problem is relaxed into a linear programming (LP) problem and a heuristic algorithm minimizing the content download time and operating in a polynomial time is proposed based on the 2-opt algorithm. Simulation results demonstrate that the proposed algorithm can achieve near-optimal performance to the MINLP optimal solution and can reduce the content download time compared with other algorithms by choosing proper chunk size and sharing order.

AB - Mobile collaborative community (MCC) is an emerging technology where multiple mobile nodes (MNs) conduct a job (e.g., large content download) in a cooperative manner. In this paper, we consider a scenario in which multiple MNs form MCC for content download through wireless wide area network (WWAN) and share of the downloaded content through wireless local area network (WLAN). In the collaborative content download for MCC, the content chunk size assigned to an MN and the sharing order of the received chunk should be carefully determined to reduce the content download time. Therefore, we formulate an optimization problem that jointly considers the chunk size and the sharing order to minimize the content download time. Specifically, the optimization problem is formulated as a mixed integer non-linear programming (MINLP) problem that is known as NP-hard. The original optimization problem is relaxed into a linear programming (LP) problem and a heuristic algorithm minimizing the content download time and operating in a polynomial time is proposed based on the 2-opt algorithm. Simulation results demonstrate that the proposed algorithm can achieve near-optimal performance to the MINLP optimal solution and can reduce the content download time compared with other algorithms by choosing proper chunk size and sharing order.

KW - content download

KW - local search of sorting order (LSSO) algorithm

KW - Mobile collaborative community

UR - http://www.scopus.com/inward/record.url?scp=84906996833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906996833&partnerID=8YFLogxK

U2 - 10.1109/ICC.2014.6883697

DO - 10.1109/ICC.2014.6883697

M3 - Conference contribution

AN - SCOPUS:84906996833

SN - 9781479920037

SP - 2490

EP - 2495

BT - 2014 IEEE International Conference on Communications, ICC 2014

PB - IEEE Computer Society

ER -