Seed-Based Data Dissemination in Campus MSNets

doi:10.13190/j.jbupt.2017.02.016

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2017, Vol. 40 ›› Issue (2): 97-101.doi: 10.13190/j.jbupt.2017.02.016

• Reports • Previous Articles Next Articles

Seed-Based Data Dissemination in Campus MSNets

WANG Qing-shan^1,2, TANG Ying¹, WANG Qi¹, WANG Di¹, CHEN Li-jun¹

1. School of Mathematics, Hefei University of Technology, Hefei 230009, China;
2. Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China

Received:2016-08-27 Online:2017-04-28 Published:2017-04-26

Abstract

Abstract: In mobile social networks (MSNets), the packet is propagated through the intermittently connectivity which is established when two human-carried wireless-enabled devices are within communication range of each other. In order to use the intermittently connectivity to disseminate the packet, a seed-based data dissemination (SDD) algorithm was proposed in campus MSNets. The main idea is to choose a seed node for each community and use the seed node in data dissemination. Simulations show that, compared with the Epidemic algorithm, the publish/subscribe system and social groups based routing, SDD algorithm could reduce network overhead significantly, and near to the maximum delivery ratio obtained by the Epidemic algorithm.

Key words: data dissemination, student schedule, network overhead, mobile social networks

CLC Number:

TP393

WANG Qing-shan, TANG Ying, WANG Qi, WANG Di, CHEN Li-jun. Seed-Based Data Dissemination in Campus MSNets[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2017, 40(2): 97-101.

References

[1] Zhu Ying, Xu Bin, Shi Xinghua, et al. A survey of social-based routing in delay tolerant networks:positive and negative social effects[J]. IEEE Communications Surveys & Tutorials, 2013, 15(1):387-401.
[2] Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks[R]. Duke University, 2000.
[3] Lindgren A, Doria A, Schelén O. Probabilistic routing in intermittently connected networks[J]. Acm Sigmobile Mobile Computing and Communications Review, 2003, 7(3):239-254.
[4] 陶桦, 许艺凡, 王笑笑, 等. 一种运行轨迹驱动的移动自组织网络路由算法[J]. 北京邮电大学学报, 2014, 37(6):125-128. Tao Hua, Xu Yifan, Wang Xiaoxiao, et al. A trace-driven routing algorithm in mobile ad hoc networks[J]. Journal of Beijing University of Posts and Telecommunications, 2014, 37(6):125-128.
[5] Hui P, Crowcroft J. How small labels create big improvements[C]//2007 IEEE PerCom Workshop on Smart Environments. Hawaii:IEEE Press, 2007:65-70.
[6] Abdelkader T, Naik K, Nayak A, et al. SGBR:a routing protocol for delay tolerant networks using social grouping[J]. IEEE Trans on Parallel and Distributed Systems, 2013, 24(12):2472-2481.
[7] Gao W, Cao G H, Porta T L, et al. On exploiting transient social contact patterns for data forwarding in delay-tolerant networks[J]. IEEE Trans on Mobile Computing, 2013, 12(1):151-165.
[8] Zhao Y X, Wu J. Socially-aware publish/subscribe system for human networks[C]//2010 IEEE Wireless Communications and Networking Conference (WCNC). Francisco, USA:IEEE Press, 2010:1-6.
[9] Lin C J, Chen C W, Chou C F. Preference-aware content dissemination in opportunistic mobile social networks[C]//2012 IEEE International Conference on Computer Communications (INFOCOM). Orlando:IEEE Press, 2012:1960-1968.
[10] Wei Kaimin, Guo Song, Zeng Deze, et al. Exploiting small world properties for message forwarding in delay tolerant networks[J]. IEEE Trans on Computers, 2015, 64(10):2809-2818.
[11] Srinivasan V, Motani M, Ooi W T. Analysis and implications of student contact patterns derived from campus schedules[C]//200612^th Annual International Conference on Mobile Computing and Networking (MobiCom). Los Angeles:ACM, 2006:86-97.

[1]	. Multi-user-oriented SWIPT-MEC Task Hierarchical Processing Offloading Mechanism [J]. Journal of Beijing University of Posts and Telecommunications, 0, (): 0-0.
[2]	. An Optimization Scheme of Edge Caching for Panorama Video based on DQN [J]. Journal of Beijing University of Posts and Telecommunications, 0, (): 0-0.
[3]	. Deterministic Scheduling and Routing Joint Intelligent Optimization Scheme in Computing First Network [J]. Journal of Beijing University of Posts and Telecommunications, 2023, 46(2): 9-14.
[4]	. Service Networking Over Hyper-WAN Integrated Distributed Cloud：Vision and Key Technologies [J]. Journal of Beijing University of Posts and Telecommunications, 2023, 46(2): 1-8.
[5]	. Reaserch of On-Board Edge DNN Inference Strategies For LEO Satellite Networks [J]. Journal of Beijing University of Posts and Telecommunications, 2023, 46(2): 57-63.
[6]	. Multicast Service Chain Deployment and Adjustment Method under User Dynamic Access [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(6): 55-61.
[7]	. Trusted predictive cache architecture for Internet of vehicles privacy protection combined with blockchain [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(6): 145-150.
[8]	TIAN Zhongda, PAN Xinpeng. Network Traffic Prediction Using Wavelet Denoising and Optimized Support Vector Machine [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(5): 79-84.
[9]	LIU Linlan, SONG Xiuyang, CHEN Yubin. Link Prediction in Opportunistic Networks Based on Network Representation Learning [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 64-69,103.
[10]	XI Heran, ZHU Jinghua, LI Jinbao. Edge-Cloud Collaborative Worker Recruitment Algorithm in Mobile Crowd Sensing System [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 77-83.
[11]	LI Jingbo, MA Li, MA Dongchao, FU Yingxun, LI Yang. SDN-Based Integrated Convergent Network Routing Scheduling Mechanism [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 84-90.
[12]	. SDN-based integrated convergent network routing scheduling mechanism [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 98-104.
[13]	. Edge-Cloud Collaborative Worker Recruitment Algorithm in Mobile Crowd Sensing System [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 91-97.
[14]	. Node importance evaluation in multiplex heterogeneous networks based on graph embedding [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 1-76.
[15]	LIU Likun, QIU Tie, XU Tianyi, CHEN Ning, WAN Zhiguo. User Fine-Grained Reliability and Truth Estimate Model on Mobile Crowdsensing [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(4): 70-76.

Seed-Based Data Dissemination in Campus MSNets

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments