A social similarity-aware multicast routing protocol in delay tolerant networks Online publication date: Tue, 29-Jul-2014
by Xia Deng; Jianxin Wang; Yao Liu; Le Chang
International Journal of Simulation and Process Modelling (IJSPM), Vol. 8, No. 4, 2013
Abstract: In delay tolerant networks (DTNs), multicast is widely adopted for emergency notifications in crisis environment and data scattering under military rescue situations, as it has better robustness and resource utilisation. Although the topology of DTNs usually changes quickly, they also demonstrate relatively stable social characteristics, e.g., the social similarity. In this paper, a social similarity-aware multicast routing protocol (SSM) is proposed, in which the social similarity is quantified as the probability of the encounter of two nodes in the future based on the number of common neighbours in the history. We propose and evaluate four measuring metrics (i.e., max, min, average and median) on such probability in multicast scenarios, and nodes with higher such similarity metrics are selected in priority to construct the forwarding group during the data replication process. Simulation results show that SSM can effectively improve the data delivery ratio and reduce the overhead at the same time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Simulation and Process Modelling (IJSPM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook