Change search
ReferencesLink to record
Permanent link

Direct link
Energy-Aware Opportunistic Mobile Data Offloading Under Full and Limited Cooperation
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-9176-3454
KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-3704-1338
2016 (English)In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 84, 84-95 p.Article in journal (Refereed) Epub ahead of print
Abstract [en]

Opportunistic networking (a.k.a. device-to-device communication) is considered a feasible means for offloading mobile data traffic. Since mobile nodes are battery-powered, opportunistic networks must be expected to satisfy the user demand without greatly affecting battery lifetime. To address this requirement, this work introduces progressive selfishness, an adaptive and scalable energy-aware algorithm for opportunistic networks used in the context of mobile data offloading. The paper evaluates the performance of progressive selfishness in terms of both application throughput and energy consumption via extensive trace-driven simulations of realistic pedestrian behavior. The evaluation considers two modes of nodal cooperation: full and limited, with respect to the percentage of nodes in the system that adopt progressive selfishness. The paper demonstrates that under full cooperation the proposed algorithm is robust against the distributions of node density and initial content availability. The results show that in certain scenarios progressive selfishness achieves up to 85% energy savings during opportunistic downloads while sacrificing less than 1% in application throughput. Furthermore, the study demonstrates that in terms of total energy consumption (by both cellular and opportunistic downloads) in dense environments the performance of progressive selfishness is comparable to downloading contents directly from a mobile network. Finally, the paper shows that progressive selfishness is robust against the presence of non-cooperative nodes in the system, and that in certain scenarios the system-level performance does not deteriorate significantly under limited cooperation even when 50% of the nodes in the system do not adhere to the specifics of the algorithm.

Place, publisher, year, edition, pages
Elsevier, 2016. Vol. 84, 84-95 p.
Keyword [en]
mobile data offloading, selfishness, duty cycling, energy savings, opportunistic networking
National Category
URN: urn:nbn:se:kth:diva-176472DOI: 10.1016/j.comcom.2016.02.008ScopusID: 2-s2.0-84962157148OAI: diva2:867561

QC 20160429

Available from: 2015-11-05 Created: 2015-11-05 Last updated: 2016-04-29Bibliographically approved
In thesis
1. System Design for Opportunistic Networks
Open this publication in new window or tab >>System Design for Opportunistic Networks
2015 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Device-to-device communication has been suggested as a complement to traditional cellular networks as a means of offloading cellular traffic. In this thesis we explore a solution for device-to-device communication based on opportunistic content distribution in a content-centric network. Communication opportunities arise as mobile nodes roam around in an area and occasionally enter in direct communication range with one another. We consider a node to be a pedestrian equipped with a mobile device and explore the properties of opportunistic communication in the context of content dissemination in urban areas.

The contributions of this thesis lie in three areas. We first study human mobility as one of the main enablers of opportunistic communication. We introduce traces collected from a realistic pedestrian mobility simulator and demonstrate that the performance of opportunistic networks is not very sensitive to the accurate estimation of the probability distributions of mobility parameters. However, capturing the space in which mobility occurs may be of high importance. Secondly, we design and implement a middleware for opportunistic content-centric networking, and we evaluate it via a small-scale testbed, as well as through extensive simulations. We conclude that energy-saving mechanisms should be part of the middleware design, while caching should be considered only as an add-on feature. Thirdly, we present and evaluate three different energy-saving mechanisms in the context of opportunistic networking: a dual-radio architecture, an asynchronous duty-cycling scheme, and an energy-aware algorithm which takes into account node selfishness. We evaluate our proposals analytically and via simulations. We demonstrate that when a critical mass of participants is available, the performance of the opportunistic network is comparable to downloading contents directly via the cellular network in terms of energy consumption while offloading large traffic volumes from the operator.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2015. vi, 59 p.
TRITA-EE, ISSN 1653-5146 ; 2015:104
opportunistic communication, system design, mobility, energy-saving mechanisms, device-to-device communication, mobile data offloading
National Category
Research subject
Electrical Engineering
urn:nbn:se:kth:diva-176479 (URN)978-91-7595-778-4 (ISBN)
Public defence
2015-12-11, Sal F3, Lindstedtsvägen 26, KTH, Stockholm, 09:00 (English)

QC 20151120

Available from: 2015-11-20 Created: 2015-11-05 Last updated: 2015-12-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Kouyoumdjieva, Sylvia T.Karlsson, Gunnar
By organisation
Communication NetworksACCESS Linnaeus Centre
In the same journal
Computer Communications

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 304 hits
ReferencesLink to record
Permanent link

Direct link