CAMF: Context-Aware Message Forwarding in Mobile Social Networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 26, Issue 8, 2015, Pages 2178-2187

  Wei, Kaimin ^a   Dong, Mianxiong ^b   Ota, Kaoru ^c   Xu, Ke ^a  

^a BEIHANG UNIVERSITY   (China)

^b NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

^c MURORAN INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

forwarding profit maximization; forwarding receiving capability; knapsack problem; Mobile social networks

Indexed keywords

COMBINATORIAL OPTIMIZATION; PROFITABILITY;

FORWARDING/RECEIVING CAPABILITY; KNAPSACK PROBLEMS; MESSAGE FORWARDING; MOBILE SOCIAL NETWORKS; MULTIPLE KNAPSACK PROBLEM; PROFIT MAXIMIZATION; ROUTING PERFORMANCE; TRACE DRIVEN SIMULATION;

SOCIAL NETWORKING (ONLINE);

EID: 84937425876     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2014.2346212     Document Type: Article

References (25)

1. H. Zhou, J. Wu, H. Zhao, S. Tang, C. Chen, and J. Chen, "Incentive-driven and freshness-Aware content dissemination in selfish opportunistic mobile networks," in Proc. 10th Int. Conf. Mobile Ad-Hoc Sen. Syst., 2013, pp. 333-341.
2. X. Liang, X. Li, T. H. Luan, R. Lu, X. Lin, and X. Shen, "Moralitydriven data forwarding with privacy preservation in mobile social networks," IEEE Trans. Veh. Technol., vol. 61, no. 7, pp. 3209-3222, Sep. 2012.
3. K. Wei, R. Duan, G. Shi, and K. Xu, "Distribution of inter-contact time: An analysis-based on social relationships," J. Commun. Netw., vol. 15, no. 5, pp. 504-513, 2013.
4. J. Fan, J. Chen, Y. Du, W. Gao, J. Wu, and Y. Sun, "Geocommunitybased broadcasting for data dissemination in mobile social networks," IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 4, pp. 734-743, Apr. 2013.
5. H. Zhu, X. Lin, R. Lu, S. Member, Y. Fan, and X. (sherman) Shen, "SMART: A secure multilayer credit-based incentive scheme for delay-tolerant networks," IEEE Trans. Veh. Technol., vol. 58, no. 8, pp. 4628-4639, Oct. 2009.
6. Y. Li, P. Hui, D. Jin, L. Su, and L. Zeng, "Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks," IEEE Commun. Lett., vol. 14, no. 11, pp. 1026-1028, Nov. 2010.
7. Q. Li, W. Gao, S. Zhu, and G. Cao, "A routing protocol for socially selfish delay tolerant networks," Ad Hoc Netw., vol. 10, no. 8, pp. 1619-1632, 2012.
8. L. Wei, Z. Cao, and H. Zhu, "Mobigame: A user-centric reputation based incentive protocol for delay/disruption tolerant networks," in Proc. IEEE Int. Conf. Global Commun. Conf., 2011, pp. 1-5.
9. Z. Li and H. Shen, "Game-theoretic analysis of cooperation incentive strategies in mobile ad hoc networks," IEEE Trans. Mobile Comput., vol. 11, no. 8, pp. 1287-1303, Aug. 2012.
10. M. Dong, K. Ota, M. Lin, Z. Tang, S. Du, and H. Zhu, " UAVassisted data gathering in wireless sensor networks," J. Supercomput., pp. 1-14, 2014, http://dx.doi.org/10.1007/s11227-014-1161-6.
11. B. B. Chen and M. C. Chan, "MobiCent: A credit-based incentive system for disruption tolerant network," in Proc. 29th Conf. Inf. Commun., 2010, pp. 875-883.
12. J. Zhou and Z. Cao, "TIS: A threshold incentive scheme for secure and reliable data forwarding in vehicular delay tolerant networks," in Proc. IEEE Int. Conf. Global Commun. Conf., Dec. 2012, pp. 985-990.
13. K. Wei, X. Liang, and K. Xu, "A survey of social-Aware routing protocols in delay tolerant networks: Applications, taxonomy and design-related issues," IEEE Commun. Surveys Tuts, vol. 16, no. 1, pp. 556-578, First Quarter 2014.
14. P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap: Social-based forwarding in delay tolerant networks," in Proc. 9th ACM Int. Symp. Mobile Ad Hoc Netw. Comput., 2008, pp. 241-250.
15. Y. Cao, Z. Sun, N. Wang, F. Yao, and H. S. Cruickshank, "Converge-And-diverge: A geographic routing for delay/disruption-tolerant networks using a delegation replication approach," IEEE Trans. Veh. Technol., vol. 62, no. 5, pp. 2339-2343, Jun. 2013.
16. A. Mei, G. Morabito, P. Santi, and J. Stefa, "Social-Aware stateless forwarding in pocket switched networks," in Proc. 30th IEEE Int. Conf. Comput. Commun., 2011, pp. 251-255.
17. L. Zhang and S. Geng, "The complexity of 0/1 multi-knapsack problem," J. Comput. Sci. Technol., vol. 1, no. 5, pp. 46-50, 1986.
18. W. B. Frakes and R. A. Baeza-Yates, Eds., Information Retrieval: Data Structures Algorithms. Englewood Cliffs, NJ, USA: Prentice-Hall, 1992.
19. A. Keränen, J. Ott, and T. Kärkkäinen, "The ONE simulator for DTN protocol evaluation," in Proc. 3rd Int. Conf. Simul. Tools Techn., 2009. p. 55.
20. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, "CRAWDAD trace cambridge/haggle/imote/infocom," Jan. 2006.
21. A. Mei and J. Stefa, "SWIM: A simple model to generate small mobile worlds," in Proc. 28th IEEE Int. Conf. Comput. Commun., 2009, pp. 2106-2113.
22. P. Hui, K. Xu, V. Li, J. Crowcroft, V. Latora, and P. Lio, "Selfishness, altruism and message spreading in mobile social networks," in Proc. 28th IEEE Int. Conf. Comput. Commun., Apr. 2009, pp. 1-6.
23. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in Proc. 7th ACM SIGCOMM Conf. Internet Meas., 2007, pp. 29-42.
24. E. Gilbert and K. Karahalios, "Predicting tie strength with social media," in Proc. SIGCHI Conf. Human Factors Comput. Syst., 2009, pp. 211-220.
25. A. Vahdat and D. Becker, "Epidemic routing for partiallyconnected ad hoc networks," CS Dept., Duke Univ., Durham, NC, USA, Tech. Rep. CS-2000-06, 2002.