|Table of Contents|

Routing algorithm for delay tolerant networks based on social scale

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2014年04期
Page:
512-517
Research Field:
Publishing date:

Info

Title:
Routing algorithm for delay tolerant networks based on social scale
Author(s):
Xiao Fu123Sun Guoxia1Xu Jia12Jiang Lingyun12Wang Ruchuan123
1.College of Computer,Nanjing University of Posts and Telecommunications,Nanjing 210003,China; 2.Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks,Nanjing 210003,China; 3.Key Lab of Broadband Wireless Communication and Sensor
Keywords:
delay tolerant network routing protocol social scale data transmission delivery probability
PACS:
TP393.04
DOI:
-
Abstract:
In order to solve the network load increasing problem due to multiple copies in traditional route protocol based on probability,a novel routing algorithm based on social scale is proposed here.By defining nodes' social scale as delay degree and effectiveness according to nodes' local information, message is forwarded rapidly by selecting relay node with lower social delay degree,and scheduling management of message forward queue is calculated based on nodes' social validity.The experimental results prove that this algorithm can effectively reduce network load while message delivery ratio is well retained.

References:

[1] Utku G,Acer G P,Hay D,et al.Timely data delivery in realistic bus network[J].IEEE Transactions on Vehicular Technology,2012,61(3):1251-1265.
[2]Mei A,Stefa J.Give2Get:Forwarding in social mobile wireless networks of selfish individuals[J].IEEE Transactions on Dependable Secure Computing,2012,9(4):569-582.
[3]Rahim M S,Casari P,Guerra F,et al.On the perfor-mance of delay-tolerant routing protocols in underwater networks[A].Proceedings of IEEE Oceans Conference[C].Washington D C,USA:IEEE,2011:1-7.
[4]Pham T M,Fdida S.DTN support for news dissemina-tion in an urban area[J].Computer Networks,2012,56(9):2276-2291.
[5]Fall K.A delay-tolerant network architecture for challenged Internets[A].ACM SIGCOMM[C].New York,USA:ACM,2003:27-34.
[6]Vahdat A,Becker D.Epidemic routing for partially connected ad hoc networks[R].Duck University:Technical Report CS-200006,2000:36-51.
[7]Zhang H,Shen H,Tan Y.Optimal energy balanced data gathering in wireless sensor networks[A].International Parallel and Distributed Processing Symposium[C].Washington D C,USA:IEEE,2007:1-10.
[8]Lindgren A,Doria A,Schelen O.Probabilistic routing in intermittently connected networks[A].First Interna-tional Workshop on Service Assurance with Partial and Intermittent Resources[C].Berlin,Germany:Springer Berlin Heidelberg,2004,3126:239-254.
[9]Pan H,Jon C,Ekio Y.BUBBLE Rap:Social-based forwarding in delay-tolerant Networks[J].IEEE Transactions on Mobile Computing,2011,10(11):1576-1589.
[10]Bulut E,Szymanski B K.Friendship based routing in delay tolerant mobile social networks[A].Proceedings of IEEE Global Telecommunications Conference(GLOBECOM)[C].Washington D C,USA:IEEE,2010:1-5.
[11]Gao W,Cao G.On exploiting transient contact patterns for data forwarding in delay-tolerant networks[J].IEEE Transactions on Mobile Computing,2013,12(1):151-165.
[12]Wang G,Yang Y,Song X,et al.Research for delay tolerant network node similarity-based on social network[J].Journal of Computational Information Systems,2013,13(9):5189-5195.
[13]张振京,金志刚,舒炎泰.基于节点运动预测的社会性DTN高效路由[J].计算机学报,2013,36(3):626-635.
Zhang Zhenjing,Jin Zhigang,Shu Yantai.Efficient routing in social DTN based on nodes' movement predic-tion[J].Chinese Journal of Computers,2013,36(3):626-635.
[14]Paolo M,Sabina G,Elena P,et al.CRAWDAD trace set unimi/pmtr/txt(V.2008-12-01)[EB/OL].http://crawdad.cs.dartmouth.Edu/unimi/pmtr/txt,December 2008.
[15]The ONE 1.4.1[EB/OL].http://www.netlab.tkk.fi/tutkimus/dtn/theone/.Nokia Research Center(Finland),2010.

Memo

Memo:
-
Last Update: 2014-08-31