|Table of Contents|

Mapping model of network scenarios and routing metrics in DTN


Research Field:
Publishing date:


Mapping model of network scenarios and routing metrics in DTN
Qin ZhenzhenWang YuhaoWu Tingting
Information Engineering School,Nanchang University,Nanchang 330031,China
delay tolerant networks network scenarios classifications routing metrics k-means clustering algorithm temporal graph Floyd algorithm network delivery rate
Aiming to accelerate the long-term network delivery rate and improve network transmission performance of delay tolerant networks(DTN),a mapping model of network scenarios and routing metrics is proposed here.A network scenarios classification method based on k-means clustering algorithm is proposed by taking real standard trace datasets as samples and analyzing DTN network characteristics.The network delivery rate in time to live(TTL)is computed using the temporal graph and Floyd algorithm.A mapping model of network scenarios and routing metrics is constructed using the destructive analysis method.The simulation results verify the validity of the model proposed here.


[1] Fall K.A delay-tolerant network architecture for challenged internets[J].Conference on Applications,2003,33(4):27-34.
Pan Daru,Lin Mu,Chen Liangjie,et al.Multiple-copy opportunistic network routing based on transitivity[J].Journal of Nanjing University of Science and Technology,2012,36(4):573-578.
[3]Conti M,Giordano S.Mobile ad hoc networking:Milestones,challenges,and new research directions[J].IEEE Communications Magazine,2014,52(1):85-96.
[5]Polat B K,Sachdeva P,Ammar M H,et al.Message ferries as generalized dominating sets in intermittently connected mobile networks[J].Pervasive and Mobile Computing,2011,7(2):189-205.
[6]Vahdat A,Becker D.Epidemic routing for partially connected ad hoc networks(technical report CS-200006)[R].Durham,North Carolina,USA:Duke University,2000.
[7]Spyropoulos T,Psounis K,Raghavendra C S.Spray and wait:An efficient routing scheme for intermittently connected mobile networks[C]//Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking.New York,NY,USA:ACM,2005:252-259.
[8]Lindgren A,Doria A,Schelén O.Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,7(3):19-20.
[9]Spyropoulos T,Psounis K,Raghavendra C S.Spray and focus:Efficient mobility-assisted routing for heterogeneous and correlated mobility[C]//Fifth Annual IEEE International Conference on Pervasive Computing and Communications.White Plains,NY,USA:IEEE,2007:79-85.
[10]Pan H,Crowcroft J,Yoneki E.Bubble rap:Social-based forwarding in delay tolerant networks[J].IEEE Transactions on Mobile Computing,2011,10(11):1576-1589.
[11]Daly E M,Haahr M.Social network analysis for routing in disconnected delay-tolerant MANETs[C]//Proceedings of the 8th ACM International Symposium on Mobile ad Hoc Networking and Computing.New York,NY,USA:ACM,2007:32-40.
[12]Stanley W,Katherine F.社会网络分析:方法与应用[M].陈禹,孙彩虹,译.北京:中国人民大学出版社,2012.
[13]Martínez-López B,Perez A M,Sánchez-Vizcaíno J M.Social network analysis.Review of general concepts and use in preventive veterinary medicine[J].Transboundary & Emerging Disease,2009,56(4):109-20.
[14]Kostakos V.Temporal graphs[J].Physica A:Statistical Mechanics and its Applications,2009,388(6):1007-1023.
[15]Nicosia V,Tang J,Mascolo C,et al.Graph metrics for temporal networks[J].Understanding Complex Systems,2013:15-40.
[16]Onnela J P,Saramäki J,Hyvönen J,et al.Analysis of a large-scale weighted network of one-to-one human communication[J].New Journal of Physics,2007,9(26):1-25.
[17]Mtibaa A,Chaintreau A,Massouliev L,et al.Diameter of opportunistic mobile networks[C]//Proceedings of the 2007 ACM Conference on Emerging Network Experiment and Technology,CoNEXT 2007.New York,NY,USA:ACM,2007:1-23.
[18]Keränen A,Ott J,Kärkkäinen T.The ONE simulator for DTN protocol evaluation[C]//Proceeding Simutools'09.Proceedings of the 2nd International Conference on Simulation Tools and Techniques.Brussels,Belgium:ICST,2009:1-10.


Last Update: 2016-06-30