Location of Repository

Emergence in the security of protocols for mobile ad-hoc networks

By Ioannis Pavlosoglou


This thesis is concerned with the study of secure wireless routing protocols, which have been deployed for the purpose of exchanging information in an adhoc networking enviromnent.\ud A discrete event simulator is developed, utilising an adaptive systems modelling approach and emergence that aims to assess networking protocols in the presence of adversarial behaviour. The model is used in conjunction with the characteristics that routing protocols have and also a number of cryptographic primitives that can be deployed in order to safeguard the information being exchanged. It is shown that both adversarial behaviour, as well as protocol descriptions can be described in a way that allows for them to be treated as input on the machine level.\ud Within the system, the output generated selects the fittest protocol design capable of withstanding one or more particular type of attacks. As a result, a number of new and improved protocol specifications are presented and benchmarked against conventional metrics, such as throughput, latency and delivery criteria. From this process, an architecture for designing wireless routing protocols based on a number of security criteria is presented, whereupon the decision of using particular characteristics in a specification has been passed onto the machine level

Topics: TK
OAI identifier: oai:wrap.warwick.ac.uk:1193

Suggested articles



  1. (2002). 802.11 Wireless Networks: The Definitive Guide",
  2. A chain is no stronger than its weakest link: Double decay analysis of phylogenetic hypotheses", doi
  3. A distributed Routing Algorithm for Mobile Wireless Networks", doi
  4. A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms", doi
  5. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks", doi
  6. (2001). A JCA-based implementation framework for threshold cryptography", doi
  7. A Logic of Authentication", doi
  8. A method for obtaining digital signatures and public-key cryptosystems", doi
  9. (2003). A methodology for model-checking ad-hoc networks" doi
  10. (2002). A new kind of science", Wolfram media Inc., doi
  11. (1998). A performance Comparison of Multi-hop Wireless Ad Hoc Network Routing Protocols", doi
  12. A performance comparison of the Temporally Ordered Routing Algorithm (TORA) and Ideal Link-state routing", doi
  13. A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks", doi
  14. (2000). A Survey on Security Issues in Wireless Networks",
  15. (1994). A taxonomy of replay attacks", doi
  16. A view of telecommunications network evolution", doi
  17. Access Control: The Neglected Frontier",
  18. (2003). Ad hoc network security, " doi
  19. (2003). Ad hoc network security", doi
  20. (2002). Ad hoc on-demand distance vector routing", doi
  21. (1999). Ad-hoc On-Demand Distance Vector Routing", doi
  22. Ad-Hoc On-Demand Distance Vector Routing", MILCOM'97 panel on Ad-Hoc Networks, doi
  23. (1978). Advances in Packet Radio Technology" doi
  24. (1998). An adaptive multi-agent routing algorithm inspired by ants behaviour",
  25. (2001). An analysis of the Wired Equivalent Privacy protocol, Black Hat briefings,
  26. (1996). An efficient routing Algorithm for Mobile Wireless Networks", doi
  27. (1997). An Internet MANET Encapsulation Protocol (IMEP) Specification",
  28. (1987). An Intrusion-detection Model", doi
  29. (1998). Ant colonies for adaptive routing in packet-switched communications networks". doi
  30. (2000). Ant colony optimization for the total weighted tardiness problem7, doi
  31. Ant colony System: A Cooperative Learning Approach to the Travelling Salesman Problem7',
  32. Antbased Load Balancing in Telecommunications Networks", doi
  33. (1997). AntNet: a mobile agents approach to adaptive routing",
  34. AntNet: Distributed Stigmergetic Control for Communications Networks",
  35. (2000). Ants at Work: how an insect society is organized" doi
  36. ANTS: Agents, networks, trees and subgraphs", doi
  37. Applied Cryptography: Protocols, Algorithms and Source Code in C", 2 nd edition,
  38. (1992). Applying formal methods to the analysis of a key management protocol",
  39. (2001). ARA - The Ant-Colony Based Routing Algorithm for MANETs", doi
  40. (2002). Ariadne: A Secure OnDemand Routing Protocol for Ad Hoc Networks", doi
  41. (1997). Associativity-Based Routing for Ad-Hoc Mobile Networks", doi
  42. be Improved? Complexity Trade-Os with the Digital Signature Standard", doi
  43. (2003). Beyond Fear", Copernicus Books,
  44. (1997). Bucket hashing with small key size, Advances in Cryptology" doi
  45. (2002). Building secure software: how to avoid security problems the right way", Addison-Wesley (London),
  46. (2001). Cellular Automata: A Discrete Universe", World Scientific, doi
  47. CODEX: a robust and secure secret distribution system", doi
  48. Cooperative Routing in Mobile Ad hoc Networks: Current Efforts Against Malice and Selfishness",
  49. (2001). Cryptography DecrypteX',
  50. (1987). Data Networks",
  51. (2004). Denial of Service Resilience in Ad Hoc Networks", doi
  52. Department of Commerce, National Institute of Standards and Technology, "Digital Signature Standard", Federal Information Processing Standard (FIPS)
  53. (2002). Design of Rijndael: Aes - the Advanced Encryption Standard (Information Security doi
  54. (2002). Developing distributed and e-commerce applications"
  55. (1996). Diffie-hellman oracles", doi
  56. (2002). Disappearing Cryptography: Information Hiding -Steganography and Watermarking", 2nd Edition,
  57. (1992). Distributed Optimization by Ant Colonies", doi
  58. (1996). Dynamic source routing in ad hoc wireless networks", doi
  59. Efficient graph search by a smell-oriented vertex process.
  60. Emergence", Science Board Meeting 2003, Santa Fe Institute,
  61. (1962). Flows in Networks", doi
  62. (1997). Formal verification and analysis of a routing protocol for ad hoc networks"
  63. Formal verification of standards for distance vector routing protocols" doi
  64. (1996). Fundamentals of Algorithmics",
  65. (2002). Genetic basis for queen-worker dimorphism in a social insect", doi
  66. (1997). Handbook of Applied Cryptography", doi
  67. (2002). Hardening Cisco Routers",
  68. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers", doi
  69. IEEE P802.11 Wireless LANs Unsafe at any key size: An analysis of the WEP encapsulation,
  70. Improving the Performance of Reliable Transport Protocols in Mobile Computing Environments", doi
  71. Information Hiding -A Survey", doi
  72. Institution of Electrical and Electronic Engineers (IEEE), "Wireless LAN Medium Access Control (MAC) and Physical layer (PHY) specification",
  73. Integration of security in network routing protocols", doi
  74. (2001). Intercepting mobile communications: the insecurity of 802.11, doi
  75. (2000). Introduction to feedback control theory", doi
  76. (1985). Introduction to mathematical control theory", 2 nd edition,
  77. Key Agreement in Ad Hoc Networks", doi
  78. (1996). Keying hash functions for message authenticatioif ', doi
  79. La cryptographie militaire (military cryptography)",
  80. (1999). MANET Authentication Architecture", Internet draft (draft-jacobs-imep-auth-arch-Oltxt),
  81. Mitigating Byzantine Attacks in Ad Hoc Wireless Networks", doi
  82. (1999). Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations", doi
  83. (1998). Mobile ad hoc networking and the IETF", doi
  84. (1997). Mobile Agents for Adaptive Routing, doi
  85. (1998). Mobile agents for adaptive routing", doi
  86. (1999). Multicast operation of the ad-hoc on-demand distance vector routing protocol. doi
  87. (1994). Network Intrusion Detection", doi
  88. (1988). Network layer Protocols with Byzantine Robustness",
  89. (1976). New Directions in Cryptography", doi
  90. New hash functions and their use in authentication and set equality", doi
  91. (2004). New Secure Routing in Ad Hoc Networks: Study and Evaluation of Proposed Schemes",
  92. (1999). of Standards and Technology, "Data Encryption Standard (DES)",
  93. (1995). of Standards and Technology, "Secure Hash Standard",
  94. (1996). On the complexity of breaking the DiffieHellman protocol",
  95. (2003). On the utility of distributed cryptography in P2P and MANETs: the case of membership control", doi
  96. One-way hash functions and DES", doi
  97. (1998). Perfectly One-Way Probabilistic Hash Functions", doi
  98. (2004). Permutation operations in cipher design", doi
  99. (2001). PKCS#1 v. 2.1: RSA Cryptography Standard, doi
  100. (2003). Practical Cryptography",
  101. (1935). Principles of Gestalt Psychology", doi
  102. (2003). Protecting applications with transient authentication7',
  103. (1996). Protocols for adaptive wireless and mobile computing", doi
  104. (2003). Provably Secure Competitive Routing against Proactive Byzantine Adversaries Via Reinforcement Learning",
  105. (2003). Real 802.11 Security: Wi-Fi Protected Access and 802.1 li",
  106. (1990). Reasoning about Belief in Cryptographic Protocols, " doi
  107. (1997). Routing in Clustered Multihop, Mobile Wireless Networks", doi
  108. (1995). Routing in Communication Networks",
  109. (2000). Routing Security in Ad Hoc Networks", doi
  110. Routing security in wireless ad hoc networks" doi
  111. (2002). Routing Techniques for Wireless Ad Hoc Networks - Classification and Comparison",
  112. (2003). Rushing attacks and defense in wireless ad hoc network routing protocols", doi
  113. (2000). Secrets and Lies", doi
  114. (2003). Secure coding: principles and practices", O'Reilly
  115. (2002). Secure Communications: Applications and Management",
  116. (2001). Secure Hash Standard (draft)",
  117. Securing Ad Hoc Networks", doi
  118. (1997). Securing DistanceVector Routing Protocols", doi
  119. (2002). Securing the Internet routing infrastructure", doi
  120. (1997). Securing the Nimrod Routing Architecture", Prac.
  121. (2002). Security for Ubiquitous Computing", doi
  122. (2000). Security in Ad Hoc Networks",
  123. (2001). Security of the WEP algoritha',
  124. (1998). Serpent: A proposal for the Advanced Encryption Standard", doi
  125. (1997). Shared tree wireless network multicast", doi
  126. (1999). Specification of the Bluetooth System",
  127. (2003). Study of distance vector routing protocols for mobile ad hoc networks, " doi
  128. (2000). Technical Summary of IrDA DATA and IrDA CONTROL",
  129. (1998). Temporary Ordered Routing Algorithm (TORA) Version I: Functional specification",
  130. (2003). Termite: Emergent Ad-Hoc Networking", doi
  131. The Ant System: Optimization by a colony of cooperating agents" doi
  132. The DARPA Packet Radio Network Protocols", doi
  133. (2000). The Diffie-Hellman protocol. Designs, Codes, and Cryptography 19", KluwerAcademic Publishers,
  134. (1999). The IEEE 802.11 Handbook: A Designer's Companion", Standards Information Network
  135. The MD4 message digest algorithtW', doi
  136. (1992). The MD5 message-digest algorithm", Internet Engineering Task Force (IETF), RFC 1321, doi
  137. (1998). The Performance of Query Control Schemes for the Zone Routing Protocol" doi
  138. (2001). The Tao of IETF: A Novice's Guide to the Internet Engineering Task Force", doi
  139. (1999). The twofish encryption algorithm :a 128-bit block cipher",
  140. (1998). The Zone Routing Protocol (ZRP) for Ad Hoc Networks",
  141. Threshold cryptography", doi
  142. (1989). Threshold Cryptosystems", doi
  143. (1998). Towards a Calculus of Secure Mobile Computations",
  144. Universal hash functions, doi
  145. (1989). Universal One-way Hash Functions and their Cryptographic Applications", 21 st doi
  146. (1998). Universal wireless personal communications", Artech House, doi
  147. (2004). Visualization of Wormholes in Sensor Networks" doi
  148. (1997). Wireless ATM and ad-hoc networks, protocols and architectures", doi
  149. (2002). Wormhole detection in wireless ad hoc networks", doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.