| 摘要(英) |
In delay tolerant network environment, no fixed data routing path exists, and due to the limitation of node density and transmission distance, seriously affect the operation of the packet routing mechanism, therefore the traditional network routing protocol is not suitable for use in delay tolerant network. To improve data transmission performance, delay tolerant routing is designed mostly by increasing the quantity of packet copies, or designed when connecting with the encounter node, evaluate the utility value to select favorable transfer node, with these methods to increase the packet delivery ratio or to reduce the delay of packet transmission. However, excessive packet copies and the additional recorded node data needed for selecting transfer node, will lead to a waste of network resources. In this paper, we use Epidemic, PRoPHET, Spray and Wait, DARS routing and Random walk, Random waypoint, TVCM, SLAW mobility models to simulate, and also use NCU-Trace to trace human’s real movement footmark, to compare the transfer performance of each router under different mobility models. In this paper, not only discuss packet delivery rate, packet transmission cost, packet latency rate, but also discuss the use status of buffer, the relationship between drop packet and routing node; and packet survival time in Buffer. In DARS routing, also discuss the packet handoff problem and the affect of Buffer toward DARS routing. These data let us know in delay tolerant network, packet copies and delivery are affected by which parameter settings in different routing mechanism, therefore can provide us as reference basis for better performance routing mechanism design in the future.
|
| 參考文獻 |
[1] Kevin Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” In Proceedings of ACM SIGCOMM’03, pages 27–34, August 2003.
[2] Sushant Jain, Kevin Fall, and Rabin Patra, “Routing in a Delay Tolerant Network,” In Proceedings of ACM SIGCOMM Computer Communication Review, vol. 34, no.4, pages 145–158, August 2004.
[3] DTN Research Group, http://www.ietf.org/rfc/rfc4838.txt
[4] Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra, “Spray and Wait: an Efficient Routing Scheme for Intermittently Connected Mobile Networks,” In Proceedings of ACM SIGCOMM Workshop on Delay-Tolerant Networking, pages 252–259, 2005.
[5] Xin Wang, Yantai Shu, Zhigang Jin, Qingfen Pan, and Bu Sung Lee, “Adaptive Randomized Epidemic Routing for Disruption Tolerant Networks,” In Proceedings of Mobile Ad-hoc and Sensor Networks, pages 424–429, December 2009.
[6] Amin Vahdat, and David Becker, “Epidemic Routing for Partially-Connected Ad Hoc Networks,” Duke University, Tech. Rep. CS-200006, April 2000.
[7] Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra, “Spray and Wait: an Efficient Routing Scheme for Intermittently Connected Mobile Networks,” In Proceedings of ACM SIGCOMM Workshop on Delay-Tolerant Networking, pages 252–259, 2005..
[8] Samuel C. Nelson, Mehedi Bakht, and Robin Kravets, “Encounter-Based Routing in DTNs,” In Proceedings of IEEE INFOCOM’09, pages 846–854, April 2009.
[9] Nathanael Thompson, Samuel C. Nelson, Mehedi Bakht, Tarek Abdelzaher, and Robin Kravets, “Retiring Replicants: Congestion Control for Intermittently-Connected Networks,” In Proceedings of IEEE INFOCOM’10, pages 1–9, March 2010.
[10] P.Juang,H.Oki,Y.Wang,M.Martonosi,L.S.Peh,andD.Rubenstein,“Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet,” SIGOPS Oper. Syst. Rev., vol. 36, pp. 96–107, Oct. 2002.
[11] Y.Li,M.Qian,D.Jin,L.Su,andL.Zeng,“Adaptiveoptimal managementpolicies for realistic dtn,” in Proceedings of IEEE Global Telecommunications Conference, pp. 1 –5, 30 2009-dec. 4 2009.
[12] Anders Lindgren, Avri Doria, and Olov Schelén, “Probabilistic Routing in Intermittently Connected Networks,” ACM SIGMOBILE Mobile Computing and Communications Review, vol.7, no.3, pages 19–20, 2003.
[13] Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra, “Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility,” In Proceedings of IEEE Pervasive Computing and Communications Workshops, pages 79–85, March 2007.
[14] John Burgess, Brian Gallagher, David Jensen, and Brian Neil Levine, “MaxProp: Routing for Vehicle-based Disruption-Tolerant Networking,” In Proceedings of IEEE INFOCOM’06, pages 398–408, April 2006.
[15] Camp, Tracy, Jeff Boleng, and Vanessa Davies. "A survey of mobility models for ad hoc network research." Wireless communications and mobile computing 2.5 (2002): 483-502.
[16] Yoon, Jungkeun, Mingyan Liu, and Brian Noble. "Random waypoint considered harmful." INFOCOM 2003. twenty-second annual joint conference of the IEEE computer and communications. IEEE societies. Vol. 2. IEEE, 2003.
[17] Hsu, Wei-Jen, et al. "Modeling spatial and temporal dependencies of user mobility in wireless mobile networks." IEEE/ACM Transactions on Networking (ToN) 17.5 (2009): 1564-1577.
[18] Lee, Kyunghan, et al. "Slaw: A new mobility model for human walks." INFOCOM 2009, IEEE. IEEE, 2009.
[19] ALAJEELY, Majeed; DOSS, Robin. Comparative Study of Routing Protocols for Opportunistic Networks. In: ICST 2013: Proceedings of the 7th International Conference on Sensing Technology. IEEE, 2013. p. 209-214.D
[20] MASSRI, Khalil; VERNATA, Alessandro; VITALETTI, Andrea. Routing protocols for delay tolerant networks: a quantitative evaluation. In: Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks. ACM, 2012. p. 107-114
[21] JAIN, Akhilesh, et al. Distributing jobs in Delay-Tolerant Networks: Is optimization worth it?. In: Recent Trends in Information Technology (ICRTIT), 2014 International Conference on. IEEE, 2014. p. 1-5.
[22] Shally1, Harminder Singh Bindra2, Mamta Garg3 “PERFORMANCE EVALUATION OF RAPID AND SPRAY-AND-WAIT DTN ROUTING PROTOCOLS UNDER BLACK HOLE ATTACK” IJRET: International Journal of Research in Engineering and Technology Volume: 03 Issue: 01 | Jan-2014,
[23] Hu, Chih-Lin, and Bing-Jung Hsieh. "A density-aware routing scheme in delay tolerant networks." Proceedings of the 27th Annual ACM Symposium on Applied Computing. ACM, 2012.
[24] M. C. Gonz ́alez, C. A. Hidalgo, and A.-L. Barab ́asi, “Understanding individual human mobility patterns,” Nature, vol. 453, no. 7196, pp. 779–782, 2008.
[25] I. Rhee, M. S. S. Hong, K. Lee, S. J. Kim, and S. Chong, “On the levy-walk nature of human mobility,” IEEE/ACM Transactions on Networking, vol. 19, pp. 630–643, Jun 2011.
[26] M. Kim, D. Kotz, and S. Kim, “Extracting a mobility model from real user traces,” in Proceedings of IEEE INFOCOM, pp. 1–13, April 2006.
[27] Keränen, Ari, Jörg Ott, and Teemu Kärkkäinen. "The ONE simulator for DTN protocol evaluation." Proceedings of the 2nd international conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 2000
|
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit