近來，許多學者已投入許多時間在DTN的研究上面。有許多有趣的路由已被發展。但是，對於零知識路由的發展，則不但沒有突破性的發展，甚至連新的想法都很少被提出。特別是在資源受限而且訊息複製量也要限制的情況。因為沒有足夠的知識作為選擇路徑的策略。所以顯得特別的困難。
在本篇論文，先對隨意移動網路的現況與發展作探討，接著討論更具挑戰性的延時容忍網路(DTN)。最後，再嘗試由生活中有趣的例子，來做為發展的靈感。而提出在零知識的場景下，新的路由方法。我們知道，在奧林匹克運動會場上，四百公尺接力賽的平均個人速度往往比單人跑百米的速度更快！本人試著將這種特性引入到零知識的路由場景中：藉著「接力傳遞消息」應該會比「單一人傳遞消息」會有更好的效果，來提昇訊息投遞率，並且減少重覆訊息的數量！本文已發展出一個有趣的方法，稱為「OOPFE」，而且已經用NS2模擬器來驗證。結果顯示，新的路由特別適合在網路場景較大，或是源節點的移動速度較慢的場景。更進一步，本人也研究此路由在遇到封包丟失問題時，對路由效能的影響情形。並且，也應用佇列派翠網路(QPN, Queueing Petri Net)的工具，塑造路由方法的模式，來觀察DTN路由方法，在隨意移動模式下，兩個重要的評估尺度。

Recently, many scholars have invested a lot of times in a hot research topic, DTNs.  There are many interesting routing protocols be developed.  However, about zero-knowledge routing, fewer breakthroughs can make their ways for novel developments.  Especially in resource-restricted and limited the amount of replication messages, there are extremely difficulties to design routing strategies for selecting a suitable path based on insufficient knowledge.  In this paper, we observe the situation in daily life to get an inspiration for development idea.  In the 400-meter relay race of the World Olympic Game, the average speed is faster than that of the individual 400-meters race.  I have tried to use the characteristics and further research by the way of “relay-delivering message” to tackle the tradeoff for increasing the delivery ratio and decreasing the number of duplication in the zero-knowledge scenarios.  I have developed an interesting method, named “OOPFE”, and have used NS2 simulator to verify.  Furthermore, I have studied the reasons of impact routing performance about packet drop problems.  The results show that the new routing method suitable for the size of network scenarios is bigger or the speed of source node is slower.  At last, I also use the tools of “Queueing Petri Net” to build the model of the different routing method and to observe two important metrics for random waypoint mobility in DTNs.

TABLE OF CONTENTS
LIST OF FIGURES	VII
LIST OF TABLES	XI
Chapter 1 Introduction	- 1 -
1.1 Routing problems in DTNs and Motivation	- 2 -
1.2 Contributions	- 3 -
1.3 Thesis Structure	- 4 -
Chapter 2 Related Works	- 5 -
2.1 Introduce the wireless Ad Hoc Networks	- 5 -
2.1.1 The concepts and features in MANET	- 5 -
2.1.2 The applications in mobile ad hoc network	- 8 -
2.1.3 The major research institutions and new application areas in mobile ad hoc network	- 10 -
2.2 The routing protocols in mobile ad hoc network)	- 11 -
2.3 The concepts and features in DTNs	- 16 -
2.3.1 The problems in DTNs	- 16 -
2.3.2 Applications must be afraid of delay in DTNs	- 17 -
2.3.3 Applications and features in DTNs	- 18 -
2.3.4 The application of common features and characteristics in DTNs	- 20 -
2.3.5 The simple classification based on different numbers of copy messages in DTN	- 22 -
2.4 The routing algorithm in DTNs	- 23 -
2.4.1 "Direct Transfer" routing method and wireless sensor networks	- 23 -
2.4.2 First contact routing and two-hop routing	- 24 -
2.4.3 The exchange mechanism in epidemic routing	- 25 -
2.4.4 Probability associated with the routing protocol	- 26 -
2.4.5 Adapter mechanism associated routing	- 27 -
2.4.6 Compare the flooding problems between MANETs and the epidemic routing in DTNs	- 28 -
2.4.6.1 The differences in scenarios	- 28 -
2.4.6.2 The differences in methods	- 29 -
2.4.6.3 There are different present for broadcast storm problem	- 29 -
2.4.6.4 The metrics are different	- 30 -
2.4.6.5 The major problems occur in Epidemic DTN-routing	- 30 -
Chapter 3: From the viewpoints of distributed system to discuss the routing problem and the design idea of this thesis	- 32 -
3.1 The CAP Theorem in distributed system	- 32 -
3.2 Attention to Availability and Partition Tolerance	- 34 -
3.3 Multi-copy, consistency, single-copy and Head-of-Line blocking problems	- 36 -
3.3.1 Multi-copy and don't need consistency problem	- 36 -
3.3.2 Resolve the single-copy and HOL problems	- 36 -
3.3.3 The interesting issues between single-copy and multi-copy	- 38 -
Chapter 4 OOP and OOPFE-Routing Scheme	- 39 -
4.1 OOP-Routing Scheme	- 39 -
4.1.1 The 1’st step, OB (One Broadcast) process	- 40 -
4.1.2 The 2’nd step, OC (One Copy) process	- 41 -
4.1.3 The 3’rd step, PS (Persistent Storage) process	- 41 -
4.2 OOPFE-Routing Method	- 41 -
4.3 The algorithm of OOPFE-Routing	- 42 -
4.3.1 Algorithm-part A: Processing the received packet	- 42 -
4.3.2 Algorithm-part B: Achieve anti-entropy session	- 45 -
Chapter 5 Network Simulator, Visualization tools and Mobile pattern generator	- 46 -
5.1 About NS2	- 46 -
5.2 NS2 wireless simulator architecture	- 48 -
5.3 The process flow of NS2	- 49 -
5.4 The usage of NS2	- 50 -
5.5 The visualization tools: Nam	- 51 -
5.6 Random Waypoint Model mobility generator inNS2	- 52 -
5.6.1 Mobile Mobility	- 52 -
5.6.2 The Mobile Mobility generator: Setdest	- 53 -
Chapter 6 Simulation and performance evaluation	- 54 -
6.1 RWP Mobility Model	- 54 -
6.2 Simulation setup	- 55 -
6.3 Result	- 56 -
Chapter 7 Analysis for OOPFE-Routing	- 63 -
7.1 In 1’st phase (OB)	- 63 -
7.2 In 2’nd phase (OC)	- 64 -
7.3 In 3’rd phase (PS)	- 66 -
7.4 Compare with Two-Hop Routing	- 66 -
Chapter 8 Using NS2 to Analyze the Packet Drop Problem	- 68 -
8.1 Introduction of Packet Drop Problem	- 68 -
8.1.1 The problem of buffer queue in DTN	- 68 -
8.1.2 Packet drop problems	- 69 -
8.1.3 Dropped packets in ns2	- 71 -
8.2 Basic compare with tradition routing method	- 72 -
8.3 Advance compare the result in hop-limit is 20	- 72 -
8.4 Conclusions	- 79 -
Chapter 9 Using QPN to model two important metrics of routing protocol in DTN	- 81 -
9.1 What’s PN (Petri Nets)?  What’s QPN?	- 81 -
9.1.1 The define of Petri Nets	- 81 -
9.1.2 The network model of Petri Nets	- 82 -
9.1.3 Queueing theory (Queueing Models)	- 84 -
9.1.4 QPN is Queueing model + Petri Net model	- 85 -
9.1.5 The current simulation tool of QPN	- 86 -
9.1.6 The related researches to use PN Model in Ad-Hoc Networks	- 87 -
9.2 Using QPN to model routing in RWP mobility	- 87 -
9.2.1 Random Waypoint mobility	- 87 -
9.2.2 The definition of IMT and CT	- 88 -
9.2.3 System Model	- 89 -
9.2.4 To get and analyze the parameters for the IMT and CT in DTN	- 89 -
9.2.4.1 To compare the literatures with our simulation results for IMT	- 89 -
9.2.4.2 To compare the literatures with our simulation results for CT	- 91 -
9.2.5 Using QPN to express the IMT and CT	- 92 -
9.3 Using QPN to model the Direct-Routing in DTN	- 94 -
9.3.1 Consider the link time will be insufficient and need a retransmission mechanism	- 95 -
9.3.2 Don’t consider the link time will be insufficient	- 98 -
9.4 Using QPN to model two known multi-hop routing in DTN	- 101 -
9.4.1 Using QPN to model 2Hop Routing in DTN	- 101 -
9.4.2 Using QPN to model Epidemic Routing in DTN	- 104 -
9.5 Using QPN to model OOPFE Routing in DTN	- 107 -
9.5.1 First case, we consider no any neighbor node in “One broadcast” process	- 107 -
9.5.1.1 The basic Markov state transition diagram for OOPFE routing	- 108 -
9.5.1.2 The method to transfer the Markov state transition diagram into QPN for Latency	- 109 -
9.5.1.3 The method to simulate the Delivery ratio in QPN	- 112 -
9.5.2 Second case, we consider the numbers of neighbor nodes in “One broadcast” process	- 119 -
9.5.2.1 The basic Markov state transition diagram for OOPFE routing	- 119 -
9.5.2.2 The method to transfer the Markov state transition diagram of OOPFE routing into QPN for Latency	- 121 -
9.6 Small Conclusion and Future works	- 123 -
Chapter 10 Discussion in OOPFE-Routing	- 125 -
Chapter 11 Conclusions & Future Work	- 128 -
References	- 129 -

LIST OF FIGURES
Figure 1. A classification of the method of zero-knowledge routing	- 2 -
Figure 2. Example of the intermittent connect network	- 3 -
Figure 3. The classification of the famous ad hoc routing protocols	- 12 -
Figure 4. The more detail classification of the famous ad hoc routing protocols	- 13 -
Figure 5. The classification of the ad hoc clustering algorithm routing methods	- 15 -
Figure 6. Anti-entropy session	- 25 -
Figure 7. HOL problem and Persistent storage	- 37 -
Figure 8. A New message is entering the system	- 39 -
Figure 9. OB process, only one broadcast	- 39 -
Figure 10. OC process, only one copy	- 40 -
Figure 11. PS process, hold on the message in PS	- 40 -
Figure 12. A challenge problem in OC-process	- 41 -
Figure 13. The architecture of the ns2 wireless simulator	- 48 -
Figure 14. ns2 simulation process flow	- 50 -
Figure 15. Scenario snapshots for RWP Model (The Epidemic-Routing is Running)	- 54 -
Figure 16. Simulation results in RWP Model (Dist.=40m, 6 Hop-limit)	- 58 -
Figure 17. The simulation results for different hop-limit in RWP Model (Dist.=40m)	- 59 -
Figure 18. The simulation results of the average numbers of hop count in different hop-count limit (RWP Model, Dist.=40m)	- 62 -
Figure 19. Average number of neighbors in source node	- 64 -
Figure 20. Area can be copied in Two-Hop Routing	- 67 -
Figure 21. Area can be copied in OOPFE-Routing	- 67 -
Figure 22. Three types of packet-drop-problems	- 70 -
Figure 23. Simulation results in RWP Model (Dist.=40m, 20 Hops)	- 74 -
Figure 24. Compare the detail reasons in the collision reason	- 76 -
Figure 25. Compare  the numbers of Drop-By-ARP in four different routings	- 76 -
Figure 26. The Hop-count for Packet-ID from 1 to 30 in different routing	- 78 -
Figure 27. The Hop-count for Packet-ID from 1951 to 1980 in different routing	- 78 -
Figure 28. The basic units of Petri Nets	- 82 -
Figure 29. A brief description for Enabled and Marking in Petri Net	- 83 -
Figure 30. A simple Firing Example	- 83 -
Figure 31. A simple schematic diagram of Queueing Model	- 84 -
Figure 32. The composition of Queue Place	- 86 -
Figure 33. The mobile schematic graphics of Random Waypoint Mobility	- 88 -
Figure 34. The mean First IMT of 50 nodes in ns2 simulation	- 91 -
Figure 35. The mean CT of 50 nodes in ns2 simulation	- 92 -
Figure 36. The lifetime distribution of CT of 50 nodes in ns2 simulation. (The approximate relative average is 16 m/s)	- 92 -
Figure 37. The simple simulation for mobile model in QPME	- 94 -
Figure 38 (a) (b) (c) (d). Consider the impact on Link time in QPN	- 98 -
Figure 39. The result includes the "Never Meet Ratio" of QPN	- 100 -
Figure 40. Using the Probe of QMEP to catch the statistical results of Latency	- 100 -
Figure 41. Two-hop multi-copy protocol transition diagram of the Markov chain for the number of copies	- 102 -
Figure 42.  The experiment of 2Hop (N=3+1) in QPME. The Latency is 409	- 103 -
Figure 43.  The experiment of 2Hop (N=6+1) in QPME. The Latency is 300	- 104 -
Figure 44. Unrestricted multi-copy protocol: transition diagram of the Markov chain for the number of copies	- 104 -
Figure 45. The experiment of Epidemic (N=6+1) in QPME. The Latency is 261	- 105 -
Figure 46. To compare the values of theory with our simulation in QPME for 2Hop-routing and Epidemic routing.	- 107 -
Figure 47. The Markov chain transition diagram and omit “One broadcast” process in OOPFE routing	- 109 -
Figure 48(a). Another equivalent Petri Net expression for 2Hop.  The N = 2 +1. And Imt1, Imt2 set 1λ, 2λ, 3λ	- 111 -
Figure 48(b). Another equivalent Petri Net expression for 2Hop.  N =3 +1. And Imt1, Imt2, Imt3 set 1λ, 2λ, 3λ	- 112 -
Figure 49(a). Using QPME to express the Delivery ratio for 2Hop routing.  The value of msgTTL sets to twice of the average inter-meeting times.  It is 968.  The results of Latency fell to 358.56 from 482.24	- 113 -
Figure 49(b). Using QPME to express the Delivery ratio for 2Hop routing.  The results of Delivery ratio fell to 0.87	- 114 -
Figure 49(c). Using QPME to express the Delivery ratio for 2Hop routing.  The value of msgTTL sets to 2000 sec.  The results of Latency fell to 0.9913	- 115 -
Figure 50(a). Using QPME to express the Delivery ratio for Direct-routing.  The value of msgTTL sets to 2000	- 118 -
Figure 50(b). Using QPME to express the Delivery ratio for Direct-routing.  The value of msgTTL sets to twice of IMT	- 119 -
Figure 51. The Markov chain transition diagram and consider “One broadcast” process in OOPFE routing.  The number of m in this figure is neighbor’s nodes; the range is from 0 to 1	- 121 -
Figure 52. Using QPME to observe the Latency in OOPFE routing	- 123 -
Figure 53. Including 26 nodes whose speed can be randomly selected from 0.1 to 0.2m/sec	- 126 -

LIST OF TABLES
Table I. Simulation Model Parameters	- 55 -
Table II. Simulation Network Parameters	- 55 -
Table III. After sending 1980 messages, the numbers of received packets of the traditional routing methods	- 72 -
Table IV. The different packet loss reasons comparison table of 4 different routing protocols	- 76 -
Table V. The values of theory and the values of experimental in QPME for the numbers of nodes are from 2 to 7 in two routing method	- 106 -
Table VI. Compare the Latency and Delivery Ratio changes between the msgTTL are twice of IMT or 2000 for 2Hop routing. (N=2+1, at this time, Epidemic and 2hop are same.)	- 114 -
Table VII. Observe the changes of Latency and Delivery ratio for the values of msgTTL is 2*484.3 and 2000 in 2Hop routing.  ( Note: the distribution of msgTTLis Uniform)	- 116 -
Table VIII. Observe the changes of Latency and Delivery ratio for the values of msgTTL is 2*484.3 and 2000 in Direct-routing	- 117 -
Table IX. OOPFE routing, N=3+1, observe the Latency	- 122 -
Table X. Compare four different Routing methods from four indicators	- 126 -

[1]	A Nagaraju, S Ramachandram, “Adaptive partial dominating set algorithm for mobile ad-hoc networks,” ACM, COMPUTE '09: Proceedings of the 2nd Bangalore Annual Compute Conference on 2nd Bangalore Annual Compute Conference, January 2009.
[2]	A. Al Hanbali, A. A. Kherani, and P. Nain., “Simple models for the performance evaluation of a class of two-hop relay protocols,” In Proceedings IFIP Networking, Atlanta, GA, USA, May 2007.
[3]	A.Lindgren, A. Doria, and O. Schelen, “Probabilistic routing in intermittently connected networks”, SIGMOBILE Mobile Comput.  Commun. Rev., Vol. 7, no. 3, pp. 19-20, 2003.
[4]	A.Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks", Tech. Rep. CS-2000-06, Department of C.S., Duke University, Durham, NC, USA, July 2000.
[5]	Abey Abraham; Jebapriya S, "Routing strategies in Delay Tolerant Networks: a Survey", International Journal of Computer Applications(0975-8887), Vol. 42, No.19, pp.44-48, March 2012.
[6]	Acharya, H.B.; Shah, H.N.; Venkataraman, V.;, "Delay Tolerant Networks: A Retrospective," IEEE, Next Generation Mobile Applications, Services and Technologies, 2009. NGMAST '09. Third International Conference on 15-18 Sept. 2009 Page(s):309 - 314
[7]	Benenson Z., “An algorithmic framework for robust access control in wireless sensor networks,” In:Proc of the 2nd European Workshop on Wireless Sensor Networks (EWSN). Istanbul, Turkey,2005:158-165.  
[8]	Bentaleb Abdelhak, Hicham Lakhlef, Jean Frederic Myoupo, "Dynamic Source Routing with Delay and Bandwidth Guarantees for Mobile Ad Hoc Networks", JCIS, Vol. 2, No. 1, pp. 47-58, 2012.
[9]	Biradar, Rajashree.V.; Patil, V.C.;, "Classification and Comparison of Routing Techniques in Wireless Ad Hoc Networks," IEEE, Ad Hoc and Ubiquitous Computing, 2006. ISAUHC '06. International Symposium on,20-23 Dec. 2006 Page(s):7 - 12.
[10]	Bishop R., “A survey of intelligent vehicle applications worldwide,” In:Proc of IEEE intelligent vehicles symposium 2000, Dearborn, MI, USA, 2000:25-30. 
[11]	Braden  R,  “Requirements  for  Internet  Hosts  - Communication  Layers”,  Internet RFC 1122, October 1989.
[12]	Bums B, Brock O, “MV routing and capacity building in disruption tolerant networks,” In:Proc of lEEE INFOCOM 2005, Miami, FL, 2005. 
[13]	Bums B, Brock O, Levine B N., “Autonomous enhancement of disruption tolerant networks,” In: Proc of IEEE Intemational Conferenceon Robotics and Automation, 2006. 
[14]	Burgess, J.; Gallagher, B.; Jensen, D.; Levine, B. N., “MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks,”   INFOCOM 2006, 25th IEEE International Conference on Computer Communications, pp. 1–11, 2006.
[15]	C. Xiong, T. Murata, and J. Tsai, “Modeling and simulation of routing protocol for mobile ad hoc networks using colored Petri nets,”  in  CRPIT  ’02:  Proceedings  of  the  Conference  on  Application and Theory of Petri Nets: Formal Methods in Software Engineering and Defence Systems, 2002, pp. 145–153.
[16]	C. Zhang and M. Zhou, “A stochastic petri net-approach to modeling and analysis of ad hoc network,” in ITRE ’03: Proceedings of the International Conference on Information Technology: Research and Education, 2003, pp. 152–156.
[17]	Car G A, Adams A. E., “ACMENet: an under water acoustic sensor network for real-time environmental monitoring in coastal areas,” IEEE Proc. Radar, Sonar, and Nav,  2006, 1 53(4):365-380.  
[18]	Daly E M, Haahr M, "The challenges of disconnected delay-tolerant MANETs,"  Ad Hoc Networks, 20108(4): 241～250. 
[19]	E. Brewer, M. Demmer, B. Du, M. Ho, M. Kam, S. Nedevschi, J. Pal, R. Patra, S. Surana, and K. Fall., “The case for technology in developing regions,”  IEEE Computer, 38 :pp. 25–38, May 2005.
[20]	E.P.Jones; P.A.Ward Su, “Routing Strategies for Delay-Tolerant Networks”, ACM Computer Communication Review (CCR) (2006).
[21]	Elizabeth M. Royer ,  Chai-Keong Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Communications.  April 1999.
[22]	Eric A. Brewer. Towards robust distributed systems. (Invited Talk) Principles of Distributed Computing , Portland, Oregon, July 200 
[23]	Fall K, "A delay-tolerant network architecture for challenged Internets," Proceedings of SIGCOMM’03, 2003, pp. 27～34. 
[24]	Fall, K.; Farrell, S.;, "DTN: an architectural retrospective," IEEE, Selected Areas in Communications, IEEE Journal on, Volume 26,  Issue 5,  June 2008 Page(s):828 - 836.
[25]	Foo K, Atkins K, Collins T, et a1., “A routing and channel-access approach for an ad hoc underwater acoustic network,” In:Proc of IEEE Oceans 2004. 2:789-795.  
[26]	Forrest Warthman., ”Delay-tolerant networks (DTNs) : A tutorial,” http ://www.dtnrg.org/wiki/Docs, Mar. 2003.
[27]	Fox and E. Brewer, .”Harvest, yield, and scalable tolerant systems,” in In Proceedings of HotOS-VII, 1999.
[28]	Haas, J. , “A new routing protocol for the reconfigurable wireless networks,” Proc. of IEEE 6th International Conference on Universal Personal Communications 97, pp. 562–566, 1997
[29]	Haas, Z.J., Pearlman, M.R. and Samar, P. , "Zone Routing Protocol (ZRP)," IETF Internet Draft, draft-ietf-manet-zrp-04.txt, http://tools.ietf.org/html/draft-ietf-manet-zone-zrp-00 , July 2002.
[30]	Haas, Z.J.; Halpern, J.Y.; Li Li;, “Gossip-based ad hoc routing,” INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE Volume:3, Page(s): 1707 - 1716 vol.3, 2002.
[31]	Haigang Gong, Lingfei Yu, Fulong Xu, "A Data Delivery Protocol with Periodic Sleep for Delay Tolerant Mobile Sensor Networks", JCIT: Journal of Convergence Information Technology, Vol. 7, No. 16, pp. 36 -43, 2012.
[32]	Haizheng Yu, Hong Bian, Yuanju Huo, "Social Computing for Routing in Delay Tolerant Networks," JCIT: Journal of Convergence Information Technology, Vol. 7, No. 17, pp. 409 - 415, 2012.
[33]	Hany Samuel, Weihua Zhuang, Bruno Preiss, "DTN based dominating set routing technique for mobile ad hoc networks," ICST, QShine '08: Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, July 2008.
[34]	Hong-Yen Yang; Chia-Hung Lin; Ming-Jer Tsai;, "Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks," Mobile Computing, IEEE Transactions on, Volume 7,  Issue 4,  April 2008 Page(s):444 - 457.
[35]	IETF Working Group: Mobile Ad hoc Networks(manet),  http://www.ietf.org/html.charters/manet-charter.html. 
[36]	J. Ott and D. Kutscher, “ Drive-thru internet : IEEE 802.11b for automobile users,”  In Proc. of IEEE infocom, Hong Kong, Mar. 2004.
[37]	JinQi  Zhu,  Ming  Liu,  HaiGang  Gong,  “Selective  Replication-Based  Data  Delivery  for  Delay  Tolerant Mobile Sensor Networks”, Journal of Software, Vol. 20, no.8, pp.2227-2240, 2009.
[38]	Jiun-Ting Jiang, Po-Zung Chen, “OOP: A Novel Routing Protocol based on One-Broadcast One-Copy Persistent-Storage in Delay Tolerant Mobile Ad Hoc Networks”, NCS2011: National Computer Symposium, Workshop-2.MW, pp. 216-227, Dec, 2011.
[39]	John Burgess, Brian Gallagher, David Jensen, and Brian Neil Levine, “MaxProp : Routing for Vehicle-Based Disruption-Tolerant Networks,” In Proc. of IEEE infocom, Barcelona, Spain, April 2006.
[40]	John J., Janet D., “The DARPA packet radio network protocols,” In:Proc of the IEEE,  1987, 5(1):21-327. 
[41]	Julio C. Navas, Tomasz Imielinski, "GeoCast—geographic addressing and routing," ,Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking, Pages 66 - 76,1997.
[42]	K. Sridhar and M. C. Chan, “Modeling link lifetime data with parametric regression models in MANETs,” IEEE Communications Letters, vol. 13, no. 12, pp. 983–985, 2009.
[43]	KE SHI, “Semi-Probabilistic Routing in Intermittently Connected Mobile Ad  Hoc Networks,” Journal of Information Science and Engineering, Vol. 26 No. 5, pp. 1677-1693, September 2010.
[44]	Kevin Fall, "A delay-tolerant network architecture for challenged internets," In Proc. ACM, SIGCOMM, Karlsruhe, Germany, pp.27-34, August 2003.
[45]	Khaled H, Kevin A, Belding R E., “Delay tolerant mobile networks (DTMNs): controlled flooding schemes in sparse mobile networks,” In: Proc of the IFIP Networking. Waterloo, Canada, 2005.
[46]	Kraus S., Lin R., Shavvit Y.,  “On self-interested agents in vehicular networks with car-to-car gossiping,”  IEEE Transactions on Vehicular Technology. 2008, 57(6): 3319-3332 
[47]	Laneman J N, Womell G W, Tse and D N., “An efficient protocol for realizing cooperative diversity in wireless networks,” In:Proc of IEEE ISIT, Washington, DC, 2001:294. 301. 
[48]	Levorato M, Tomasin S, Casari P, et a1., “Analysis of spatial multiplexing for cross-layer design of MIMO ad hoc networks,” In:Proc of IEEE VTC-2006, 2006, 3:1146. 1150. 
[49]	Luo J, Blum R S, Cimini L J, et a1., “Decode-and-forward cooperative diversity with power allocation in wireless networks,” IEEE Transactions on Wireless Communications, 2007, 6(3):793-799. 
[50]	Mamoun Hussein Mamoun, "A New DSR Routing Protocol for MANET." JCIT, Vol. 4, No. 4, pp. 27 - 30, 2009.
[51]	Markose Thomas, Suhas Phand, Arobinda Gupta, "Using group structures for efficient routing in delay tolerant networks," Elsevier Science Publishers B. V., Ad Hoc Networks , Volume 7 Issue 2, March 2009.
[52]	Mohammad Ali Jabraeil Jamalia, Tahere Khosravi, “Validation of Ad hoc On-demand Multipath Distance Vector Using Colored Petri Nets,” International Conference on Computer and Software Modeling IPCSIT vol.14 (2011) IACSIT Press, Singapore, pp30-36.
[53]	Narasimhan R., “Spatial multiplexing with transmit antenna and constellation selection for correlated MIMO fading channels,” IEEE Trans on Signal Processing, 2003, 51(1 1):2829-2838.  
[54]	Nosratinia A, Hunter T E, Hedayat A., ”Cooperative communication in wireless networks,” IEEE Communication Magazine, 2004, 10:74-80. 
[55]	P. Mundur, M. Seligman, G. Lee, ”Epidemic routing with immunity in Delay Tolerant Networks”, Military Communications Conference, pp1-7, 2008. 
[56]	P. Prasad, B. Singh and A. Sahoo., ”Validation of Routing Protocol for Mobile Ad- Hoc Networks using Colored Petri Nets,” A thesis subiItted in partial fulfillment of the requirements, 2009.
[57]	P. Yang, M. Chuah, "Performance evaluations of data-centric information retrieval schemes for DTNs," Publisher: Elsevier North-Holland, Inc.,Computer Networks: The International Journal of Computer and Telecommunications Networking , Volume 53 Issue 4,March 2009.
[58]	P. Yao, E. Krohne, and T. Camp. , “Performance Comparison of Geocast Routing Protocols for a MANET,” In Proceedings of IEEE Infocom 2002, New York, USA, 2002.
[59]	Partan J, Kurose J, Levine BN., “A survey of practical issues in underwater networks,”  In:Proc of the First ACM International Workshop on Underwater Networks, 2006: 17-24.  
[60]	Philo Juang, Hidekazu Oki, Yong Wang, Margaret Martonosi, Li-Shiuan Peh, and Daniel Rubenstein. ,”Energy-efficient computing for wildlife tracking : Design tradeoffs and early experiences with zebranet,” In the Tenth International Conference on Architectural Support for Programming Languages and Operating Systems ASPLOS-X, San Jose, CA, Oct. 2002.
[61]	Qi Chen, Daniel Jiang, Vikas Taliwal, Luca Delgrossi, "IEEE 802.11 based vehicular communication simulation design for NS-2," ACM, VANET '06: Proceedings of the 3rd international workshop on Vehicular ad hoc networks, September 2006
[62]	R.  Zeng,  C.  Lin,  Y.  Jiang,  X.  Chu,  and  F.  Liu,  “Performance analysis of data management in sensor data storage via stochastic petri  nets,”  in  GLOBECOM  ’10:  Proceedings  of  the  IEEE  Global Telecommunications Conference, 2010, pp. 1–5.
[63]	R. Groenevelt, “Stochastic models for mobile ad hoc networks,” Ph.D. dissertation, University of Nice Sophia Antipolis, 2005. 
[64]	Robin Groenevelt, Philippe Nain, Ger Koole, “The message delay in mobile ad hoc networks”, Elsevier Science, Performance Evaluation-Performance 2005 archive, Vol. 62, Issue 1-4, October, pp. 210-228, 2005.
[65]	Runcai Huang; Yiwen Zhuang; Qiying Cao;, "Simulation and Analysis of Protocols in Ad Hoc Network," IEEE, Electronic Computer Technology, 2009 International Conference on, 20-22 Feb. 2009 Page(s):169 - 173.
[66]	S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss. Delay tolerant networking : an approach to interplanetary internet. IEEE Communi- cations Magazine, 41 :pp. 128–136, June 2003.
[67]	S. Kounev and A. Buchmann, “SimQPN: A tool and methodology for analyzing queueing petri net models by means of simulation,” Performance Evaluation, vol. 63, pp. 364–394, 2006.
[68]	Samuel, H.; Weihua Zhuang; Preiss, B.;, "Routing over Interconnected Heterogeneous Wireless Networks with Intermittent Connections," Communications, 2008. ICC '08. IEEE International Conference on, 19-23 May 2008 Page(s):2282 - 2286
[69]	Shih-Yang Yang, Jiun-Ting Jiang, Po-Zung Chen,  “A new routing method to integrate the delivery predictability of prophet-routing with oop-routing in delay tolerant networks”, International conference on Internet studies, NETs2012, August 2012.
[70]	Shih-Yang Yang, Jiun-Ting Jiang, Po-Zung Chen,  “OOPFE: A New Routing Method to Use the Rule of First Encounter within OOP-Routing in Delay Tolerant Mobile Ad Hoc Networks”, ICCNT2012: 8th International Conference on Computing and Networking Technology (INC, ICCIS and ICMIC),  pp. 399-404, Aug. 27-29, 2012.
[71]	Sun J. Z., “Mobile ad hoc Networking: an essential technology for pervasive computing,” In: Proc of International Conferences on Info-tech and Info-net, Beijing, 2001 (ICII 2001), 3:316-321.  
[72]	Sundaresan K, Sivalumar R, Ingrain MA, et a1., “Medium access control in ad hoe networks with MIMO Links: optimization considerations and algorithms,” IEEE Trans on Mobile Computing, 2004, 3(4):350‧365.  
[73]	Sushant Jain, Kevin Fall, Rabin Patra, "Routing in a delay tolerant network”, ACM SIGCOMM'04, Proceedings of the 2004 conference on applications, technologies, architectures, and protocols for computer communications, pp. 145-158, 2004.
[74]	T. Camp, J.Boleng, and V.Davies, “A survey of mobility models for ad hoc network research,” WCMC: Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, Vol. 2, No. 5, pp. 483-502, 2002.
[75]	T. Small and Z. J. Haas., “The shared wireless infostation model : A new ad hoc networking paradigm,” In Proc. ACM MobiHoc, Anapolis, MD, USA, June 2003.
[76]	T.Spyropoulos, K. Psounis, and C. S. Raghavendra, “Efficient routing in intermittently connected mobile networks: The single-copy case”, IEEE Trans. Networking, Vol. 16, no. 1, pp. 63 - 76 , Feb. 2008. 
[77]	T.Spyropoulos, K. Psounis, C.S. Raghavendra, ETH Zurich, ZurichEfficient, "Efficient routing in intermittently connected mobile networks:the multiple-copy case”,  Networking, IEEE/ACM Transactions on, Vol. 16 , issue 1, pp. 77-90 ,Feb. 2008.
[78]	Ting-Kai Huang, Chia-Keng Lee, Ling-Jyh Chen, “PRoPHET+: An Adaptive PRoPHET-Based Routing Protocol for Opportunistic Network”, 24th IEEE International Conference on Advanced Information Networking & Applications pp. 112–119, 2010.
[79]	V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss, “Delay–Tolerant Networking Architecture,” Internet RFC 4838, April 2007.  Delay-Tolerant Networking Architecture.  http://www.ietf.org/rfc/rfc4838.txt.  Digital Object Identifier 10.1109/JSAC.2008.080609.  April 2007.
[80]	Veeramani Mahendran, Rajkishan Gunasekaran, C. Siva Ram Murthy, "Performance Modeling of Delay-Tolerant Network Routing via Queueing Petri Nets," IEEE Transactions on Mobile Computing, 21 Feb. 2013.
[81]	Vinod Kone,  Atanu Roy Chowdhary,  Sukumar Nandi “A Caching Mechanism To Improve The Reliability Of Multicasting In Multihop MANET,” http://cs.ucsb.edu/~vinod/pubs/adcom05.pdf.
[82]	William Stallings, “High-Speed Networks Tcp/ip and atm design principles,” Prentice-Hall International, Inc. ISBN 0-13-904954-1,  1998.
[83]	Wu Y, Chou P, Kung S Y., “Minimum-energy multicast in mobile ad hoc networks using network coding,” IEEE Transactions on Communications, 2005, 53(11):1906. 1918. 
[84]	Wu Y, Chou P, Zhang Q, et a1., “Network planning in wireless ad hoc networks: across-Layer approach,” IEEE Journal on Selected Areas on Communications, 2005, 23(1):136-150. 
[85]	X. Hong, M. Gerla, G. Pei, C. Chiang, A group mobility model for ad hoc wireless networks, in: Proceedings of MSWiM’99, 2nd ACM International Workshop on Modeling and Simulation of Wireless and Mobile Systems, Seattle, USA, August 1999, pp. 53–60. 
[86]	Xiaoting Sun, Xiaodong Lin,  Pin-Han Ho, “Secure vehicular communications based on group signature and id-based signature scheme,” In:Proc of International Conference on Communications,  Glasgow, Scotland, 2007:1539-1545.  
[87]	Xin Wang; Yantai Shu; Zhigang Jin; Qingfen Pan; Bu Sung Lee;, “Adaptive Randomized Epidemic Routing for Disruption Tolerant Networks,” Mobile Ad-hoc and Sensor Networks, 2009. MSN '09. 5th International Conference on, Page(s): 424 – 429, 2009.
[88]	Yongsheng Fu; Xinyu Wang; Shanping Li; “Construction K-Dominating Set with Multiple Relaying Technique in Wireless Mobile Ad Hoc Networks,” IEEE Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on Volume 2, 6-8 Jan. 2009 Page(s):42–46
[89]	Yu, J.Y.; Chong, P.H.J.;, "A survey of clustering schemes for mobile ad hoc networks," Communications Surveys & Tutorials, IEEE, Volume 7,  Issue 1,  First Qtr. 2005 Page(s):32 - 48.
[90]	Zahra Alishahi, Javad Mirabedini,Marjan Kuchaki Rafsanjani, “A new method for improving security in MANETs AODV Protocol,” in Management Science Letters 2, 2012 pp. 2271–2280.
[91]	Ze Li; Haiying Shen;, "Probabilistic Routing with Multi-Copies in Delay Tolerant Networks," IEEE, Distributed Computing Systems Workshops, 2008. ICDCS '08. 28th International Conference on, 17-20 June 2008 Page(s):471 – 476.
[92]	Zhang J, Fan P., “On network coding in wireless ad-hoc networks,” International Journal of Ad Hoc and Ubiquitous Computing, 2007, 2(3):140-148. 
[93]	Zhang Z S., ”Routing in intermittently connected mobile ad hoe networks and delay tolerant networks overview and challenges,”  Communications Surveys & Tutorials, 2006, 8(1):24-37. 
[94]	Zhou Tao, Xu Hong-bing, Liu Ming, "Grid-Based Selective Replication Adaptive Data Delivery Scheme for Delay Tolerant Sensor Networks", JDCTA: International Journal of Digital Content Technology and its Applications, Vol. 6, No. 1, pp. 57-66, 2012.
[95]	Zhou Tao, Xu Hong-bing, Liu Ming, "Grid-Based Selective Replication Adaptive Data Delivery Scheme for Delay Tolerant Sensor Networks," JDCTA, Vol. 6, No. 1, pp. 57-66, 2012.
[96]	Zhuoqun Li; Lingfen Sun; Ifeachor, E.C.;, “WSN10-5: Adaptive Multi-Copy Routing for Intermittently Connected Mobile Ad Hoc Networks,” Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE ,Page(s): 1 – 6, 2006.
[97]	Zygmunt J. Haas, Marc R. Pearlman, "ZRP: a hybrid framework for routing in Ad Hoc networks," Addison-Wesley Longman Publishing Co., Inc.  Boston, MA, USA ,ISBN:0-201-30976-9 ,Ad hoc networking book contents, Pages: 221 - 253, 2001.