TY - GEN
T1 - Mutually Exclusive Data Dissemination in the Mobile Publish/Subscribe System
AU - Wang, Ning
AU - Wu, Jie
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/1/11
Y1 - 2017/1/11
N2 - The topic-based mobile publish/subscribe (pub/sub) system has shown the potential applications in many scenarios, e.g., product coupon distribution. In this paper, we focus on the budget-constrained data dissemination services with a pre-determinated total amount of copy. A mobile user may subscribe data under different topics, but receiving a copy in any topic is enough. This is the mutually exclusive delivery requirement in many scenarios. In light of the different amounts of data and the different popularity levels of data in each topic, deciding which data should be forwarded to mobile users becomes an important problem. This paper aims to design an efficient data dissemination scheme in the aforementioned scenario, which minimizes the maximum dissemination delay, and incurs small communication overhead at the same time. We start with the offline message dissemination problem, and the corresponding optimal solution is proposed. Later, we consider the online situation, and propose a distributed data forwarding algorithm, which considers both the amount of data in different topics, mobile users' subscription, and their data forwarding abilities, respectively. The real trace driven experiments show that the proposed scheme achieves a good performance.
AB - The topic-based mobile publish/subscribe (pub/sub) system has shown the potential applications in many scenarios, e.g., product coupon distribution. In this paper, we focus on the budget-constrained data dissemination services with a pre-determinated total amount of copy. A mobile user may subscribe data under different topics, but receiving a copy in any topic is enough. This is the mutually exclusive delivery requirement in many scenarios. In light of the different amounts of data and the different popularity levels of data in each topic, deciding which data should be forwarded to mobile users becomes an important problem. This paper aims to design an efficient data dissemination scheme in the aforementioned scenario, which minimizes the maximum dissemination delay, and incurs small communication overhead at the same time. We start with the offline message dissemination problem, and the corresponding optimal solution is proposed. Later, we consider the online situation, and propose a distributed data forwarding algorithm, which considers both the amount of data in different topics, mobile users' subscription, and their data forwarding abilities, respectively. The real trace driven experiments show that the proposed scheme achieves a good performance.
UR - http://www.scopus.com/inward/record.url?scp=85013296188&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85013296188&partnerID=8YFLogxK
U2 - 10.1109/MASS.2016.020
DO - 10.1109/MASS.2016.020
M3 - Conference contribution
AN - SCOPUS:85013296188
T3 - Proceedings - 2016 IEEE 13th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2016
SP - 75
EP - 83
BT - Proceedings - 2016 IEEE 13th International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2016
Y2 - 10 October 2016 through 13 October 2016
ER -