參考文獻 |
[1] S. Basagni, M. Conti, S. Giordano, and I. Stojmenovic, Mobile Ad Hoc networking: the cutting edge directions. John Wiley & Sons, 2013, vol. 35.
[2] P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, “Optimized link state routing protocol for ad hoc networks,” in Proc. IEEE Int. Multi Topic Conf., Lahore, Pakistan, 2001, pp. 62–68.
[3] C.E.PerkinsandE.M.Royer,“Ad-hocon-demanddistancevectorrouting,”inProc.IEEEWorkshoponMobile Computing Systems and Applications (WMCSA’99), Feb. 25–26, 1999, pp. 90–100.
[4] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks,” in Mobile Computing, ser. The Kluwer International Series in Engineering and Computer Science. Springer US, 1996, vol. 353, pp. 153–181.
[5] P. R. Pereira, A. Casaca, J. J. P. C. Rodrigues, V. N. G. J. Soares, J. Triay, and C. Cervello-Pastor, “From delay- tolerant networks to vehicular delay-tolerant networks,” IEEE Commun. Surveys Tuts., vol. 14, no. 4, pp. 1166– 1182, 2012.
[6] M. Y. S. Uddin, H. Ahmadi, T. Abdelzaher, and R. Kravets, “A low-energy, multi-copy inter-contact routing protocol for disaster response networks,” in Proc. IEEE SECON’09, Rome, Italy, Jun. 22–26, 2009.
[7] T. Spyropoulos, R. N. B. Rais, T. Turletti, K. Obraczka, and A. Vasilakos, “Routing for disruption tolerant networks: taxonomy and design,” Wirel. Netw., vol. 16, pp. 2349–2370, September 2010.
[8] Y. Cao and Z. Sun, “Routing in delay/disruption tolerant networks: A taxonomy, survey and challenges,” IEEE Commun. Surveys Tuts., vol. 15, no. 2, pp. 654–677, 2013.
[9] K. Fall, “A delay-tolerant network architecture for challenged internets,” in Proc. ACM SIGCOMM’03, Karl- sruhe, Germany, Aug. 25–29 2003, pp. 27–34.
[10] A. Krifa, C. Barakat, and T. Spyropoulos, “Message drop and scheduling in dtns: Theory and practice,” IEEE Trans. Mobile Comput., vol. 11, no. 9, pp. 1470–1483, Sep. 2012.
[11] A. Elwhishi, P.-H. Ho, K.Naik, and B. Shihada, “A novel message scheduling framework for delay tolerant networks routing,” IEEE Trans. Parallel Distrib. Syst, vol. 24, no. 5, pp. 871–880, May 2013.
[12] A.VahdatandD.Becker,“Epidemicroutingforpartiallyconnectedadhocnetworks,”DukeUniversity,Tech. Rep. CS-200006, 2000.
[13] A. Lindgren, A. Doria, and O. Scheln, “Probabilistic routing in intermittently connected networks,” SIGMO- BILE Mobile Computing and Communications Review, vol. 7, no. 3, pp. 19–20, Jul. 2003.
[14] A.F.Lindgren,A.Doria,E.Davies,andS.Grasic,“Probabilisticroutingprotocolforintermittentlyconnected networks,” RFC 6693, Aug. 2012.
[15] S. Grasic, E. Davies, A. Lindgren, and A. Doria, “The evolution of a DTN routing protocol - PRoPHETv2,” in Proc. ACM CHANTS’11, Las Vegas, Nevada, USA, Sep. 19–23, 2011, pp. 27–30.
[16] A.LindgrenandK.S.Phanse,“Evaluationofqueueingpoliciesandforwardingstrategiesforroutingininter- mittently connected networks,” in Proc. Int. Conf. Commun. Syst. Software and Middleware, Jan. 8–12, 2006, pp. 1–10.
[17] S. Sati, C. Probst, and K. Graffi, “Implementing forward and drop policies for improving prophet’s routing performance,” in Proc. 12th Int. Conf. Mobile Ad-Hoc and Sensor Networks (MSN’16), Dec 2016, pp. 236–242.
[18] L. Leela-amornsin and H. Esaki, “Heuristic congestion control for message deletion in delay tolerant net- work,” in Proc. 3rd Conf. Smart Spaces and 10th Int. Conf. Next Generation Wired/Wireless networking, S. Balandin, R. Dunaytsev, and Y. Koucheryavy, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 287–298.
[19] S. Rashid, Q. Ayub, M. S. M. Zahid, and A. Abdullah, “Message drop control buffer management policy for dtn routing protocols,” Wireless Pers. Commun., vol. 72, no. 1, pp. 653–669, 2013.
[20] M. Kim and D. Kotz, “Periodic properties of user mobility and access-point popularity,” Personal Ubiquitous Comput., vol. 11, no. 6, pp. 465–479, Aug. 2007.
[21] E. Cho, S. A. Myers, and J. Leskovec, “Friendship and mobility: user movement in location-based social net- works,” in Proc. ACM SIGKDD KDD’11, San Diego, California, USA, 2011, pp. 1082–1090.
[22] S.MoonandA.Helmy,“Understandingperiodicityandregularityofnodalencountersinmobilenetworks:A spectral analysis,” in Proc. IEEE GLOBECOM’10, Miami, USA, Dec. 6–10, 2010.
[23] Z. Wang, M. A. Nascimento, and M. H. MacGregor, “Discovering periodic patterns of nodal encounters in mobile networks,” Pervasive Mob. Comput., vol. 9, no. 6, pp. 892 – 912, 2013.
[24] C. Song, Z. Qu, N. Blumm, and A.-L. Barabsi, “Limits of predictability in human mobility,” Science, vol. 327, no. 5968, pp. 1018–1021, 2010.
[25] G.Smith,R.Wieser,J.Goulding,andD.Barrack,“Arefinedlimitonthepredictabilityofhumanmobility,”in Proc. IEEE Int. Conf. Pervasive Computing and Communications (PerCom’14), Mar. 2014, pp. 88–94.
[26] X. Zhang, G. Neglia, J. Kurose, and D. Towsley, “Performance modeling of epidemic routing,” Computer Net- works, vol. 51, no. 10, pp. 2867–2891, Jul. 2007.
[27] J.Burgess,B.Gallagher,D.Jensen,andB.N.Levine,“Maxprop:Routingforvehicle-baseddisruption-tolerant networks,” in Proc. IEEE INFOCOM, Barcelona, Catalunya, SPAIN, Apr. 23–29, 2006.
[28] K. Shin and S. Kim, “Enhanced buffer management policy that utilises message properties for delay-tolerant networks,” IET Communications, vol. 5, no. 6, pp. 753–759, Apr. 2011.
[29] Y.Liu,J.Wang,S.Zhang,andH.Zhou,“Abuffermanagementschemebasedonmessagetransmissionstatus in delay tolerant networks,” in Proc. IEEE GLOBECOM’11, Houston, Texas, USA, Dec. 5–9, 2011.
[30] J. F. Naves, I. M. Moraes, and C. Albuquerque, “Lps and lrf: Efficient buffer management policies for delay and disruption tolerant networks,” in Proc. IEEE Conf. Local Computer Networks (LCN’12), Clearwater, Florida, USA, Oct. 22–25, 2012, pp. 368–375.
[31] D.Wu,J.Zhou,P.Zhang,andR.Wang,“Intelligentdynamicalbufferschedulingmechanismforintermittently connected mobile network,” Wireless Pers. Commun., vol. 73, no. 3, pp. 1269–1288, 2013.
[32] K. Wei, S. Guo, D. Zeng, and K. Xu, “A multi-attribute decision making approach to congestion control in delay tolerant networks,” in Proc. IEEE ICC’14, Syndey, Australla, Jun. 10–14, 2014, pp. 2742–2747.
[33] K. Wang, H. Guo, L. Shu, and B. Liu, “An improved congestion control algorithm based on social awareness in delay tolerant networks,” in Proc. IEEE ICC’14, Syndey, Australla, Jun. 10–14, 2014, pp. 1773–1777.
[34] Y. Li, L. Zhao, Z. Liu, and Q. Liu, “N-drop: Congestion control strategy under epidemic routing in dtn,” in Proc. Int. Conf. Wireless Commun. and Mobile Computing: Connecting the World Wirelessly (IWCMC’09). New York, NY, USA: ACM, 2009, pp. 457–460.
[35] A. Balasubramanian, B. N. Levine, and A. Venkataramani, “Dtn routing as a resource allocation problem,” in Proc. ACM SIGCOMM’07, Kyoto, Japan, Aug. 27–31, 2007, pp. 373–384.
[36] A.Krifa,C.Barakat,andT.Spyropoulos,“Optimalbuffermanagementpoliciesfordelaytolerantnetworks,” in Proc. IEEE SECON’08, San Francisco, California, USA, Jun. 16–20, 2008, pp. 260–268.
[37] Y.Li,M.Qian,D.Jin,L.Su,andL.Zeng,“Adaptiveoptimalbuffermanagementpoliciesforrealisticdtn,”in Proc. IEEE GLOBECOM’09, Honolulu, Hawaii, USA, Nov. 30–Dec. 4, 2009.
[38] I. Rahmouni, M. E. Kamili, M. R. E. Fenni, L. Omari, and A. Kobbane, “Optimal buffer management policies in dtns: A pomdp approach,” in Proc. IEEE ICC’14, Syndey, Australla, Jun. 10–14, 2014, pp. 94–99.
[39] H.WuandH.Ma,“Dsvm:Abuffermanagementstrategyforvideotransmissioninopportunisticnetworks,” in Proc. IEEE ICC’13, Budapest, Hungary, Jun. 9–13, 2013, pp. 2990–2994.
[40] E.BulutandB.K.Szymanski,“Exploitingfriendshiprelationsforefficientroutinginmobilesocialnetworks,” IEEE Trans. Parallel Distrib. Syst, vol. 23, no. 12, pp. 2254–2265, Dec. 2012.
[41] P.Matzakos,T.Spyropoulos,andC.Bonnet,“Jointschedulingandbuffermanagementpoliciesfordtnappli- cations of different traffic classes,” IEEE Trans. Mobile Comput., vol. PP, no. 99, pp. 1–1, 2018.
[42] T.Le,H.Kalantarian,andM.Gerla,“Abuffermanagementstrategybasedonpower-lawdistributedcontacts in delay tolerant networks,” in Proc. 25th Int. Conf. on Computer Commun. and Networks (ICCCN), Aug 2016, pp. 1–8.
[43] A. Krifa, C. Barakat, and T. Spyropoulos, “An optimal joint scheduling and drop policy for delay tolerant networks,” in Proc. IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoW- MoM’08), Newport Beach, CA, USA, Jun. 23–26, 2008.
[44] Y. Li, X. Li, Q. Liu, and Z. Liu, “E-PROPHET: A novel routing protocol for intermittently connected wireless networks,” in Proc. Int. Conf. Wireless Commun. and Mobile Computing, Leipzig, Germany, Jun. 21-24, 2009, pp. 452–456.
[45] H.J.Lee,J.C.Nam,W.K.Seo,Y.Z.Cho,andS.H.Lee,“EnhancedPRoPHETroutingprotocolthatconsiders contact duration in dtns,” in Proc. Int. Conf. Inform. Networking, Cambodia, Jan. 2015, pp. 523–524.
[46] C.Yu,Z.Tu,D.Yao,F.Lu,andH.Jin,“Probabilisticroutingalgorithmbasedoncontactdurationandmessage redundancy in delay tolerant network,” Int. J. Commun. Syst., 2015.
[47] T.-K.Huang,C.-K.Lee,andL.-J.Chen,“PRoPHET+:AnadaptivePRoPHET-basedroutingprotocolforoppor- tunistic network,” in Proc. 24th IEEE Int. Conf. Advanced Inform. Networking and Applicat., Perth, WA, Australia, Apr. 20–23, 2010, pp. 112–119.
[48] K.Wang,Y.Zhang,L.Shu,C.Zhu,andM.Gao,“Napr:Anodeactivity-basedprobabilisticroutingalgorithm in delay tolerant-mobile sensor networks,” in Proc. IEEE ICC’15, Jun. 2015, pp. 7002–7006.
[49] B. B. Bista and D. B. Rawat, “EA-PRoPHET: An energy aware PRoPHET-based routing protocol for delay tolerant networks,” in Proc. 31st IEEE Int. Conf. Advanced Inform. Networking and Applicat. (AINA’17), Mar. 2017, pp. 670–677.
[50] A. E. Ouadrhiri, I. Rahmouni, M. E. Kamili, and I. Berrada, “Controlling messages for probabilistic routing protocols in delay-tolerant networks,” in Proc. IEEE Symp. Comput. and Commun. (ISCC’14), June 2014, pp. 1–6.
[51] X.Wang,R.He,B.Lin,andY.Wang,“Probabilisticroutingbasedontwo-hopinformationindelay/disruption tolerant networks,” J. Elect. Comput. Eng., vol. 2015, Jan. 2015.
[52] S. Jain, K. Fall, and R. Patra, “Routing in a delay tolerant network,” in Proc. ACM SIGCOMM’04, Portland, Oregon, USA, Aug. 30 – Sep. 3, 2004, pp. 145–158.
[53] S. Merugu, M. Ammar, and E. Zegura, “Routing in space and time in networks with predictable mobility,” College of Computing, Georgia Institute of Technology, Tech. Rep. GIT-CC-04-07, 2004.
[54] Z. Wang, M. A. Nascimento, and M. MacGregor, “Towards end-to-end routing for periodic mobile objects,” in Proc. ACM Int. Symp. Design and Anal. Intelligent Veh. Networks and Applicat. (DIVANet’11), Miami, Florida, USA, 2011, pp. 61–68.
[55] Z. Wang, M. A. Nascimento, and M. H. MacGregor, “Optimal encounter-based routing via objects with peri- odic behaviours,” in Proc. IEEE Conf. Local Computer Networks Workshops, Edmonton, Canada, Sep. 8–11, 2014, pp. 730–737.
[56] C.LiuandJ.Wu,“Practicalroutinginacyclicmobispace,”IEEE/ACMTrans.Netw.,vol.19,no.2,pp.369–382, Apr. 2011.
[57] C. Caini, H. Cruickshank, S. Farrell, and M. Marchese, “Delay- and disruption-tolerant networking (DTN): An alternative solution for future satellite networking applications,” Proc. IEEE, vol. 99, no. 11, pp. 1980–1997, Nov. 2011.
[58] J. Mukherjee and B. Ramamurthy, “Communication technologies and architectures for space network and interplanetary internet,” IEEE Commun. Surveys Tuts., vol. 15, no. 2, pp. 881–897, 2013.
[59] S. Batabyal and P. Bhaumik, “Mobility models, traces and impact of mobility on opportunistic routing algo- rithms: A survey,” IEEE Commun. Surveys Tuts., vol. 17, no. 3, pp. 1679–1707, 2015.
[60] P. Hui and J. Crowcroft, “Predictability of human mobility and its impact on forwarding,” in Proc. Int. Conf. Commun. and Networking in China, Aug. 2008, pp. 543–547.
[61] W.-J. Hsu, T. Spyropoulos, K. Psounis, and A. Helmy, “Modeling spatial and temporal dependencies of user mobility in wireless mobile networks,” IEEE/ACM Trans. Netw., vol. 17, no. 5, pp. 1564–1577, Oct. 2009.
[62] M. J. Williams, R. M. Whitaker, and S. M. Allen, “There and back again: Detecting regularity in human en- counter communities,” IEEE Trans. Mobile Comput., vol. PP, no. 99, pp. 1–1, 2016.
[63] W.Gao,G.Cao,T.L.Porta,andJ.Han,“Onexploitingtransientsocialcontactpatternsfordataforwardingin delay-tolerant networks,” IEEE Trans. Mobile Comput., vol. 12, no. 1, pp. 151–165, Jan. 2013.
[64] N. Eagle and A. (Sandy) Pentland, “Reality mining: Sensing complex social systems,” Personal Ubiquitous Comput., vol. 10, no. 4, pp. 255–268, Mar. 2006.
[65] A. Guerrieri, I. Carreras, F. D. Pellegrini, D. Miorandi, and A. Montresor, “Distributed estimation of global parameters in delay-tolerant networks,” Compu. Commun., vol. 33, no. 13, pp. 1472–1482, 2010.
[66] A. Kera ?nen, J. Ott, and T. Ka ?rkka ?inen, “The one simulator for dtn protocol evaluation,” in Proc. Int. Conf. Simulation Tools and Techn., 2009.
[67] J.Scott,R.Gass,J.Crowcroft,P.Hui,C.Diot,andA.Chaintreau,“CRAWDADdatasetcambridge/haggle(v. 2009-05-29),” Downloaded from http://crawdad.org/cambridge/haggle/20090529/, May 2009.
[68] D. M. W. Powers, “Evaluation: From precision, recall and f-measure to roc., informedness, markedness & correlation,” Journal of Machine Learning Technologies, vol. 2, no. 1, pp. 37–63, 2011.
[69] Z.Li,J.Wang,andJ.Han,“ePeriodicity:Miningeventperiodicityfromincompleteobservations,”IEEETrans. Knowl. Data Eng., vol. 27, no. 5, pp. 1219–1232, May 2015.
[70] T.Guan,K.-r.Wang,andS.-p.Zhang,“Arobustperiodicityminingmethodfromincompleteandnoisyobser- vations based on relative entropy,” International Journal of Machine Learning and Cybernetics, vol. 8, no. 1, pp. 283–293, Feb. 2017.
[71] M.Vlachos,P.Yu,andV.Castelli,“Onperiodicitydetectionandstructuralperiodicsimilarity,”inProc.SIAM Int. Conf. Data Mining, 2005.
[72] Q. Yuan, J. Shang, X. Cao, C. Zhang, X. Geng, and J. Han, “Detecting multiple periods and periodic patterns in event time sequences,” in Proc. ACM Int. Conf. Information and Knowledge Management (CIKM’17), Singapore, Nov. 2017, pp. 617–626.
[73] N. Eagle and A. S. Pentland, “Crawdad dataset mit/reality (v. 20050701),” downloaded from https://crawdad.org/mit/reality/20050701/blueaware, Jul. 2005.
[74] M. Piorkowski, N. SarafijanovicDjukic, and M. Grossglauser, “Crawdad dataset epfl/mobility (v. 20090224),” downloaded from https://crawdad.org/epfl/mobility/20090224, Feb. 2009.
[75] J. Burgess, J. Zahorjan, R. Mahajan, B. N. Levine, A. Balasubramanian, A. Venkataramani, Y. Zhou, B. Croft, N. Banerjee, M. Corner, and D. Towsley, “Crawdad dataset umass/diesel (v. 20080914),” downloaded from https://crawdad.org/umass/diesel/20080914/transfer, Sep. 2008.
[76] 3GPP,“Feasibilitystudyforproximityservices(prose),”3rdGenerationPartnershipProject(3GPP),Tech.Rep. TR 22.803, 2013.
[77] 5GAA,“Thecaseforcellularv2xforsafetyandcooperativedriving,”5GAutomotiveAssociation,Tech.Rep., 2016.
[78] S. T. Kouyoumdjieva and G. Karlsson, “From opportunistic networks to 3gpp network-independent device- to-device communication,” GetMobile: Mobile Comp. and Comm., vol. 20, no. 2, pp. 22–26, Oct. 2016.
[79] P. Garcia Lopez, A. Montresor, D. Epema, A. Datta, T. Higashino, A. Iamnitchi, M. Barcellos, P. Felber, and E. Riviere, “Edge-centric computing: Vision and challenges,” SIGCOMM Comput. Commun. Rev., vol. 45, no. 5, pp. 37–42, Sep. 2015.
[80] M. Amadeo, C. Campolo, J. Quevedo, D. Corujo, A. Molinaro, A. Iera, R. L. Aguiar, and A. V. Vasilakos, “Information-centric networking for the internet of things: challenges and opportunities,” IEEE Netw., vol. 30, no. 2, pp. 92–100, 2016.
[81] C. Sarros, S. Diamantopoulos, S. Rene, I. Psaras, A. Lertsinsrubtavee, C. Molina-Jimenez, P. Mendes, R. Sofia, A. Sathiaseelan, G. Pavlou, J. Crowcroft, and V. Tsaoussidis, “Connecting the edges: A universal, mobile- centric, and opportunistic communications architecture,” IEEE Commun. Mag., vol. 56, no. 2, pp. 136–143, Feb 2018.
[82] E. Borgia, R. Bruno, and A. Passarella, “Making opportunistic networks in iot environments ccn-ready: A performance evaluation of the mobccn protocol,” Compu. Commun., vol. 123, pp. 81–96, 2018. |