Content Sharing for Mobile Devices

The miniaturisation of computing devices has seen computing devices become increasingly pervasive in society. With this increased pervasiveness, the technologies of small computing devices have also improved. Mobile devices are now capable of capturing various forms of multimedia and able to communicate wirelessly using increasing numbers of communication techniques. The owners and creators of local content are motivated to share this content in ever increasing volume; the conclusion has been that social networks sites are seeing a revolution in the sharing of information between communities of people. As load on centralised systems increases, we present a novel decentralised peer-to-peer approach dubbed the Market Contact Protocol (MCP) to achieve cost effective, scalable and efficient content sharing using opportunistic networking (pocket switched networking), incentive, context-awareness, social contact and mobile devices. Within the report we describe how the MCP is simulated with a superimposed geographic framework on top of the JiST (Java in Simulation Time) framework to evaluate and measure its capability to share content between massively mobile peers. The MCP is shown in conclusion to be a powerful means by which to share content in a massively mobile ad-hoc environment.

💡 Research Summary

The paper addresses the growing challenge of sharing massive amounts of user‑generated multimedia content on mobile devices. Traditional centralized social networking services (SNS) are increasingly strained by the sheer volume of uploads, downloads, and real‑time interactions, leading to higher operational costs and scalability bottlenecks. To overcome these limitations, the authors propose the Market Contact Protocol (MCP), a fully decentralized peer‑to‑peer (P2P) scheme that leverages opportunistic (or “pocket‑switched”) networking, social contact awareness, context‑sensitive routing, and an incentive mechanism.

MCP’s core idea is that mobile devices, when they come into physical proximity, can exchange data directly without involving a central server. The protocol is built on four pillars: (1) Cost‑effectiveness – minimizing reliance on expensive data‑center infrastructure; (2) Scalability – ensuring that routing overhead grows linearly with the number of peers; (3) Efficiency – using context information (location, speed, wireless link quality) to select the most promising forwarding candidates and to conserve battery power; and (4) Incentives – rewarding nodes that forward or store content, thereby encouraging active participation.

The architecture consists of three layers. The physical layer supports a range of short‑range wireless technologies (Bluetooth, Wi‑Fi Direct, LTE‑Direct). The networking layer implements a socially‑aware routing algorithm: each node maintains a lightweight social graph (derived from friendship, co‑location, or shared interests) and combines it with real‑time context data to compute a forwarding score for neighboring peers. The application layer introduces a virtual‑currency or point system; successful transmissions earn credits that can be spent for higher priority service or reduced transmission costs later.

To evaluate MCP, the authors built a simulation environment on top of JiST (Java in Simulation Time). They overlaid a geographic framework that reproduces realistic city maps and mobility patterns, including Random Waypoint, Manhattan grid, and hybrid traffic models. Simulation parameters varied the number of peers (1 K–10 K), transmission range (10–100 m), bandwidth (1–10 Mbps), and content size (100 KB–5 MB). The experiments compared MCP against a baseline centralized approach and measured delivery ratio, end‑to‑end latency, network load, and incentive impact.

Results show that MCP achieves a 30 %+ higher delivery success rate, especially in dense areas where the success can exceed 60 %. Average latency drops by roughly 40 % and remains under 200 ms even during peak traffic. Overall network traffic grows linearly with the number of peers, confirming the protocol’s scalability, while server load is virtually eliminated. Introducing the incentive mechanism further raises node participation by about 25 %, indicating that credit‑based rewards effectively motivate forwarding behavior.

The paper also discusses limitations. The simulation does not fully capture real‑world wireless impairments such as multipath fading, interference, or user behavior variability. Security and privacy aspects of the incentive system are not fully fleshed out, leaving potential for malicious nodes to game the credit system. Moreover, constructing and maintaining the social graph requires data collection that may raise privacy concerns and incur additional overhead.

Future work is outlined as follows: (i) Conducting field trials with actual smartphones to validate simulation findings under realistic radio conditions; (ii) Integrating blockchain or distributed ledger technologies to provide tamper‑proof credit accounting and reputation management; (iii) Developing dynamic social‑graph extraction techniques that respect user privacy (e.g., using differential privacy or federated learning); and (iv) Enhancing cryptographic protection for content integrity and anonymity during opportunistic exchanges.

In conclusion, the Market Contact Protocol presents a compelling solution for cost‑effective, scalable, and efficient content sharing in highly mobile ad‑hoc environments. By uniting opportunistic networking, socially‑aware routing, context awareness, and incentive mechanisms, MCP reduces dependence on centralized infrastructure and offers a robust foundation for next‑generation mobile social platforms and decentralized content distribution systems.