Journal Article10.1109/TMC.2013.89
MobiTribe: Cost Efficient Distributed User Generated Content Sharing on Smartphones
29
TL;DR: An algorithm for grouping devices into tribes for content replication among intended content consumers and serve it using low-cost network connections is developed and shown to lower monetary and energy costs for users compared to non-mobile-optimized distributed systems irrespective of the content demand model.
read more
Abstract: Distributed social networking services show promise to solve data ownership and privacy problems associated with centralized approaches. Smartphones could be used for hosting and sharing users data in a distributed manner, if the associated high communication costs and battery usage issues of the distributed systems could be mitigated. We propose a novel mechanism for reducing these costs to a level comparable with centralized systems by using a connectivity aware replication strategy. We develop an algorithm for grouping devices into tribes for content replication among intended content consumers and serve it using low-cost network connections. We evaluate the performance of the algorithm using three real world trace data sets. The results show that a persistent low-cost network availability can be achieved with an average of two replicas per content. Additionally, cellular bandwidth consumption and energy consumption of users are evaluated analytically using user content creation and consumption modeling. The results show that the proposed mechanism lowers monetary and energy costs for users compared to non-mobile-optimized distributed systems irrespective of the content demand model.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
How talkative is your mobile device?: an experimental study of Wi-Fi probe requests
Julien Freudiger
- 22 Jun 2015
TL;DR: This work quantify Wi-Fi probe requests' threat to privacy by conducting an experimental study of the most popular smartphones in different settings, and evaluates a commercially deployed MAC address randomization mechanism and demonstrates a simple method to re-identify anonymized probes.
A Survey of Opportunistic Offloading
TL;DR: A comprehensive review of the research field from a multi-dimensional view based on application goal, realizing approach, offloading direction, etc, and presents a complete introductory guide to the researches relevant to opportunistic offloading.
144
Motion Mode Recognition for Indoor Pedestrian Navigation Using Portable Devices
TL;DR: The performance of the motion mode recognition module was examined on different types of mobile computing devices, including various brands of smartphones, tablets, smartwatches, and smartglasses, and the results obtained showed the capability of enhancing positioning performance.
95
Blockchain for Industry 5.0: Vision, Opportunities, Key Enablers, and Future Directions
01 Jan 2022
TL;DR: In this article , the authors present a first-of-its-kind survey on blockchain as a security enabler in Industry 5.0 applications based on a descriptive survey methodology and research questions.
A Blockchain Platform for User Data Sharing Ensuring User Control and Incentives
Ajay Kumar Shrestha,Julita Vassileva,Ralph Deters +2 more
- 22 Oct 2020
TL;DR: A new platform for user modeling with blockchains that allows users to share data without losing control and ownership of it and applied to the domain of travel booking is proposed.
References
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
8.7K
A new approach to the maximum-flow problem
TL;DR: An alternative method based on the preflow concept of Karzanov, which runs as fast as any other known method on dense graphs, achieving an O(n) time bound on an n-vertex graph and faster on graphs of moderate density.
A new approach to the maximum flow problem
Andrew V. Goldberg,Robert E. Tarjan +1 more
- 01 Nov 1986
TL;DR: By incorporating the dynamic tree data structure of Sleator and Tarjan, a version of the algorithm running in O(nm log(n'/m)) time on an n-vertex, m-edge graph is obtained, as fast as any known method for any graph density and faster on graphs of moderate density.
Energy consumption in mobile phones: a measurement study and implications for network applications
Niranjan Balasubramanian,Aruna Balasubramanian,Arun Venkataramani +2 more
- 04 Nov 2009
TL;DR: TailEnder is developed, a protocol that reduces energy consumption of common mobile applications and aggressively prefetches several times more data and improves user-specified response times while consuming less energy.
1.2K