Interest-Aware Delivery for Mobile Social Networks: A TRACE-driven Approach

Ahmed Helmy

Home/Archive/arXiv

arXiv · 1812.06518

Interest-Aware Delivery for Mobile Social Networks: A TRACE-driven Approach

Ahmed Helmy

View original source ↗Read source document ↗Export metadata ↓

Abstract

We envision future mobile networks to be human-centric supporting interest-aware delivery, where an interest maybe based on behavior, such as mobility pattern, location, or web browsing (or user profile) such as affiliation, attributes, or activity. An essential capability in future networks will be the ability to provide scalable group communication. Current communication paradigms, including unicast and multicast, require explicit identification of destination nodes (through node IDs or group membership protocols), while directory services translate logical, interest-specific queries into destination IDs where parties are then connected using interest-oblivious protocols. The power and scalability of such paradigms is quite limited in the context of future, highly dynamic mobile social networks, where it is desirable in many scenarios to support implicit membership based on interest. In such scenarios, membership in interest-groups is not explicitly expressed by users, it is rather autonomously inferred by network protocols based on behavioral profiles. This removes the dependence on third parties (via directory lookup), the need for explicit expression of interest (or human intervention), and minimizes delivery overhead to uninterested users. While existing types of social networks will likely evolve in the context of mobile networks, we provide a novel paradigm of communication, deviating significantly from existing approaches and subsequently enabling qualitatively different capabilities for future services in mobile societies. In addition, our services and protocol design philosophy begins by analyzing the context in which the service is to be deployed, unlike most existing wireless networking approaches of designing general purpose protocols.

Explore related subjects

cs.SI cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ahmed Helmy. 2018-12-16. Interest-Aware Delivery for Mobile Social Networks: A TRACE-driven Approach. https://arxiv.org/abs/1812.06518

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

User Influence Analysis Based on Blogs

Rumor and word of mouth spread at the same speed as the highway of information diffusion in the age of the internet. Social networks play quite an important role in the huge internet. Nowadays, social networks have become indispensable in our lives, especially for the government and enterprises. A social network becomes a complex information diffusion network with users working as nodes and the relationships between users working as the vehicle. In this paper, we propose three kinds of algorithms for computing user influence based on the behavior of a user's forwarding microblogs and the symbol of @ in microblogs. We evaluate the effectiveness of the algorithms by comparing the results of our work with the training data in the dataset, and in the end, it proves that our algorithms work well.

cs.SI↗

arXiv2026

Location transparency reduces activity by accounts misrepresenting their location on X

Concerns about inauthentic accounts, including foreign actors posing as domestic voices, are central to debates about online discourse. Yet, little is known about accounts with inaccurate location claims and how they behave when discrepancies between their claimed and actual locations become publicly visible. In November 2025, X introduced an "About this account" feature that discloses each account's platform-inferred location of operation. We leverage this intervention in a large-scale quasi-experimental study of 8,200 politically engaged accounts claiming a U.S. location, comparing accounts whose disclosed locations matched versus contradicted their claims across 1.3 million posts and 3.6 million replies over 21 weeks. Before disclosure, location-mismatched accounts posted more misleading, scam-related, and cryptocurrency-related content, but showed no distinctive partisan leaning. Difference-in-differences estimates show that disclosure reduced the posting activity of location-mismatched accounts by 13.1% with the largest declines among accounts revealed to be in Africa (29.2%) and Asia (24.4%), and among accounts with VPN flags, username changes, or scam- and crypto-heavy content. Additionally, the decline in their replies was concentrated in interactions with U.S.-based recipients (10.3%), whereas replies to non-U.S.-based recipients showed no statistically significant change. Conversely, there was no significant change in average audience engagement with their posts. Location transparency thus works primarily by inducing restraint among the disclosed accounts rather than by shifting audience behaviour, and the accounts it constrains look at least as much like cross-border fraud as foreign political influence.

cs.SI↗

arXiv2026

Diffusion-Induced Spatial Attention Overlapping Community Detection

Detection of overlapping communities is essential for modelling networks in which nodes participate simultaneously in multiple structural or functional groups. Existing graph neural network approaches commonly rely on local message passing, which can obscure community boundaries through smoothing and limit the representation of structurally relevant long-range dependencies. We introduce Diffusion-Induced Spatial Attention Community Detection (DISCO), a deep-learning framework that combines a structural prior derived from influence spreading dynamics, sparse multi-head attention, and non-negative community-affiliation learning. The prior identifies candidate interactions beyond immediate graph neighbours and biases attention according to their structural proximity, while a Bernoulli-Poisson edge-reconstruction objective enables overlapping community inference from node attributes and structural profiles, or both. Benchmark experiments show that DISCO performs competitively against established graph convolutional and graph attention approaches across different input configurations. To demonstrate its practical applicability, we present a proof-of-concept cybersecurity use case in which changes between community assignments inferred from consecutive communication-network snapshots provide an interpretable anomaly signal. Temporal community similarity identifies structural deviations, while node-level contributions help locate the devices associated with them. DISCO therefore provides both a flexible method for overlapping community detection and a foundation for analysing structural change in dynamic networks.

cs.SI↗