skip to main content
research-article

One step forward: Linking wireless self-organizing network validation techniques with formal testing approaches

Published:04 February 2011Publication History
Skip Abstract Section

Abstract

Wireless self-organizing networks (WSONs) have attracted considerable attention from the network research community; however, the key for their success is the rigorous validation of the properties of the network protocols. Applications of risk or those demanding precision (like alert-based systems) require a rigorous and reliable validation of deployed network protocols. While the main goal is to ensure the reliability of the protocols, validation techniques also allow the establishment of their correctness regarding the related protocols' requirements. Nevertheless, even if different communities have carried out intensive research activities on the validation domain, WSONs still raise new issues for and challenging constraints to these communities. We thus, advocate the use of complementary techniques coming from different research communities to efficiently address the validation of WSON protocols. The goal of this tutorial is to present a comprehensive review of the literature on protocol engineering techniques and to discuss difficulties imposed by the characteristics of WSONs on the protocol engineering community. Following the formal and nonformal classification of techniques, we provide a discussion about components and similarities of existing protocol validation approaches. We also investigate how to take advantage of such similarities to obtain complementary techniques and outline new challenges.

References

  1. ETSI. 2007. Methods for testing and specification (MTS); The testing and test control notation version 3; part 1: Ttcn-3 core language, v3.2.1. Tech. rep., 873-1, ETSI, Sophia Antipolis, France.Google ScholarGoogle Scholar
  2. ISO. 1994. Information technology—open systems interconnection—conformance testing methodology and framework--part 1: General concepts. Tech. rep., 9646-1, ISO, Genewa, Switzerland.Google ScholarGoogle Scholar
  3. Abdesslem, F. B., Iannone, L., M. D. de Amorim, K. O., Solis, I., and Fdida, S. 2007. A prototyping environment for wireless multihop networks. In Proceedings of the Asian Internet Engineering Conference (AINTEC). 38--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Alur, R. and Dill, D. 1990. Automata for modeling real-time systems. In Proceedings of the International Colloquium on Automata, Languages and Programming. Vol. 443. 321--335. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Andel, T. R. and Yasinsac, A. 2006. On the credibility of manet simulations. IEEE Comput. 39, 7, 48--54. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Bagrodia, R. and Takai, M. 1999. Position paper on validation of network simulation models. In Proceedings of the DARPA/NIST Network Simulation Validation Workshop.Google ScholarGoogle Scholar
  7. Balci, O. 1997. Verification, validation and accreditation of simulation models. In Procedings of the 29th Conference on Winter Simulation. 135--141. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ballarini, P. and Miller, A. 2006. (Towards) model checking medium access control for sensor networks. In Proceedings of the 2nd IEEE International Symposium on Leveraging Applications of Formal Methods. 256--262. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Bayse, E., Cavalli, A., Núñez, M., and Zaïdi, F. 2005. A passive testing approach based on invariants: Application to the wap. Computer Netw. 48, 247--266. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Benbadis, F., de Amorim, M. D., and Fdida, S. 2005. Elip: Embedded location information protocol. In Proceedings of the IFIP Networking Conference. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Bhargavan, K., Gunter, C. A., Kim, M., Lee, I., Obradovic, D., Sokolsky, O., and Viswanathan, M. 2002a. Verisim: Formal analysis of network simulations. IEEE Trans. Softw. Eng. 28, 2, 129--145. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Bhargavan, K., Obradovic, D., and Gunter, C. A. 2002b. Formal verification of standards for distance vector routing protocols. J. ACM 49, 4, 538--576. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Bianchi, G. 2000. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J. Select. Areas Comm. 18, 3, 535--547. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Boehms, B. 1988. A spiral model of software development and enhancement. In IEEE Comput. 21. 61--72. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Bolch, G., Greiner, S., de Meer, H., and Trivedi, K. S. 2006. Queueing Networks and Markov Chains. John Wiley and Sons, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Boorstyn, R., Kershenbaum, A., Maglaris, B., and Sahin, V. 1987. Throughput analysis in multihop CSMA packet radio networks. IEEE Trans. Comm. 35, 3, 267--274.Google ScholarGoogle ScholarCross RefCross Ref
  17. Borujerdi, M. M. and Mirzababaei, S. M. 2004. Formal verification of a multicast protocol in mobile networks. Int. J. Signal Proc. 1, 4, 212--218.Google ScholarGoogle Scholar
  18. Bütow, M., Mestern, M., Schapiro, C., and Kritzinger, P. S. 1996. Performance modelling with the formal specification language sdl. In Proceedings of the 16th International Conference on Formal Description Techniques: Theory, application and tools. Chapman & Hall, Ltd., London, U.K., 213--228. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Cavalli, A., Mederreg, A., Zaïdi, F., Combes, P., Monin, W., Castanet, R., MacKaya, M., and Lauren&ctilde;ot, P. 2004. A multi-services and multi-protocol validation platform—experimentation results. In Proceedings of the 16th IFIP International Conference on Testing of Communication Systems. Lectures Notes in Computer Science, vol. 2978, Springer, Berlin, Germany, 17--32.Google ScholarGoogle ScholarCross RefCross Ref
  20. Cavin, D., Sasson, Y., and Schiper, A. 2002. On the accuracy of MANET simulators. In Proceedings of the 2nd ACM International Workshop on Principles of Mobile Computing (POMC). 38--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Chakrabarti, A., Chatterjee, K., Henzinger, T., Kupferman, O., and Majumdar, R. 2005. Verifying quantitative properties using bound functions. In Proceedings of Correct Hardware Design and Verification Methods (CHARME). 50--64. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Chaudet, C., Lassous, I. G., Thierry, E., and Gaujal, B. 2004. Study of the impact of asymmetry and carrier sense mechanism in ieee 802.11 multi-hops networks through a basic case. In Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks. 1--7. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Chiyangwa, S. and Kwiatkowska, M. 2005. A timing analysis of AODV. In Proceedings of the 7th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems. Lecture Notes in Computer Science, vol. 3535. Springer-Verlag, Berlin, Germany, 306--321. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Christmann, D., Becker, P., Gotzhein, R., and Kuhn, T. 2008. Model-driven development of a MAC layer for ad-hoc networks with SDL. In Proceedings of 1st Workshop on ITU System Design Languages.Google ScholarGoogle Scholar
  25. Clarke, E. M. and Emerson, E. A. 1981. Synthesis of synchronization skeletons for branching time temporal logic. In Proceedings of the 1st Workshop on Logic of Programs. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Clarke, E. M., Grumberg, O., and Peled, D. A. 1999. Model Checking. MIT Press, Cambridge, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Clausen, T. and Jacquet, P. 2003. RFC3626: Optimized link state routing protocol (OLSR). www.ietf.org. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Puasuareanu, C. S., Robby, and Zheng, H. 2000. Bandera: extracting finite-state models from Java source code. In Proceedings of the International Conference on Software Engineering. 439--448. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Curren, D. 2005. A survey of simulation in sensor networks. Tech. rep. University of Binghamton, Binghamton, NY. www.cs.binghamton.edu/~kang/teaching/cs580s/david.pdf.Google ScholarGoogle Scholar
  30. da Silva, A. P. C. 2006. Computational methods for markov reward models. Ph.D. dissertation, Federal University of Rio de JaneiroBonn, Rio de Janeiro, Brazil.Google ScholarGoogle Scholar
  31. da Silva, A. P. C., Leäo, R. M. M., and de Souza e Silva, E. 2004. An efficient approximate technique for solving fluid models. SIGMETRICS Perform. Eval. Rev. 32, 2, 6--8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Das, S. and Dill, D. L. 2002. Counter-example based predicate discovery in predicate abstraction. In Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design. Lecture Notes in Computer Science, vol. 2517. Springer-Verlag, Berlin, Germany, 19--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. de Alfaro, L., Faella, M., and Stoelinga, M. I. A. 2004. Linear and branching metrics for quantitative transition systems. Lecture Notes in Computer Science vol. 3142. Springer-Verlag, Berlin, Germany, 97--109.Google ScholarGoogle Scholar
  34. de Renesse, R. and Aghvami, A. H. 2004. Formal verification of ad hoc routing protocols using spin model checker. In Proceedings of the 12th Mediterranean Electrotechnical Conference.Google ScholarGoogle Scholar
  35. de Souza e Silva, E. and Gail, H. 2000. Transient Solutions for Markov Chains. In W. Grassmann, Ed., Kluwer, Dordrecht, The Netherlands.Google ScholarGoogle Scholar
  36. Doucet, A., de Freitas, N., and Gordon, N. 2001. Sequential Monte Carlo Methods in Practice. John Wiley and Sons, New York, NY.Google ScholarGoogle Scholar
  37. Eisner, C. 2005. Formal verification of software source code through semi-automatic modelling. Softw. Syst. Model. 4, 1, 14--31.Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Elwalid, A. I. and Mitra, D. 1992. Fluid models for the analysis and design of statistical multiplexing with loss priorities on multiple classes of bursty traffic. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. 415--425. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Emerson, E. A. 1990. Temporal and Modal Logic. MIT Press, Cambridge, MA.Google ScholarGoogle Scholar
  40. Engler, D. and Musuvathi, M. 2004. Static analysis versus software model checking for bug finding. In Proceedings of the 5th International Conference on Verification, Model checking and Abstract Interpretation. 191--210.Google ScholarGoogle Scholar
  41. Fehnker, A., Fruth, M., and McIver, A. 2007. Graphical modelling for simulation and formal analysis of wireless network protocols. In Proceedings of the Workshop on Methods, Models and Tools for Fault Tolerance at the 7th International Conference on Integrated Formal Methods (IFM). 80--87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Fehnker, A. and Gao, P. 2006. Formal verification and simulation for performance analysis for probabilistic broadcast protocols. Lecture Notes in Computer Science, vol. 4104. Springer-Verlag, Berlin, Germany, 128--141. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. Fernández-Iglesias, M. J., Burguillo-Rial, J. C., F. J. González-Casta n., and Llamas-Nistal, M. 2005. Wireless protocol testing and validation supported by formal methods: A hands-on report. J. Syst. Softw. 75, 1-2, 139--154. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Garetto, M., Giaccone, P., and Leonardi, E. 2007. Capacity scaling in delay tolerant networks with heterogeneous mobile nodes. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing. 15--17. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Garetto, M., Giaccone, P., and Leonardi, E. 2008a. Capacity scaling of sparse mobile ad hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. 206--210.Google ScholarGoogle Scholar
  46. Garetto, M., Salonidis, T., and Knightly, E. 2006. Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. 1--13.Google ScholarGoogle Scholar
  47. Garetto, M., Salonidis, T., and Knightly, E. W. 2008b. Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks. IEEE/ACM Trans. Netw. 16, 4, 864--877. Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Girod, L., Elson, J., Cerpa, A., Stathopoulos, T., Ramanathan, N., and Estrin, D. 2004a. Emstar: A software environment for developing and deploying wireless sensor networks. In Proceedings of USENIX General Track. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Girod, L., Stathopoulos, T., Ramanathan, N., Elson, J., Estrin, D., Osterweil, E., and Schoellhammer, T. 2004b. A system for simulation, emulation, and deployment of heterogeneous sensor networks. In Proceedings of the ACM SIGOPS International Conference on Embedded Networked Sensor Systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Glässer, U. and Gu, Q.-P. 2005. Formal description and analysis of a distributed location service for mobile ad hoc networks. Theor. Comput. Sci. 336, 2-3, 285--309. Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Godary, K., Augé-Blum, I., and Mignotte, A. 2004. Sdl and timed Petri nets versus uppaal for the validation of embedded architecture in automative. In Proceedings of the 1st Forum on Specification and Design Languages (FDL).Google ScholarGoogle Scholar
  52. Godefroid, P. 1997. Model checking for programming languages using Verisoft. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, 174--186. Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Grossglauser, M. and Tse, D. 2002. Mobility increases the capacity of ad-hoc wireless networks. IEEE/ACM Trans. Netw. 10, 4, 477--486. Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Gunter, E. and Peled, D. 2005. Model checking, testing and verification working together. Form. Aspects Comput. 17, 2, 201--221. Google ScholarGoogle ScholarCross RefCross Ref
  55. Hansson, H. and Jonsson, B. 1994. A logic for reasoning about time and reliability. Form. Aspects Comput. 6, 5, 512--535.Google ScholarGoogle ScholarCross RefCross Ref
  56. Havelund, K. and Pressburger, T. 2000. Model checking Java programs using Java pathfinder. Softw. Tools Tech. Trans. 2, 4, 366--381.Google ScholarGoogle ScholarCross RefCross Ref
  57. Heck, E. 1996. Performance evaluation of formally specified systems—the intergration of SDL with hit. Ph.D. dissertation, University of Dortmund, Dortmund, Germany.Google ScholarGoogle Scholar
  58. Hoffman, L. 2008. In search of dependable design. Comm. ACM 51, 7, 14--16. Google ScholarGoogle ScholarDigital LibraryDigital Library
  59. HOL. 2005. http://www.cl.cam.ac.uk/Research/HVG/HOL/.Google ScholarGoogle Scholar
  60. Holzmann, G. J. 1991. Design and Validation of Computer Networks. Prentice-Hall International Editions, Englewood Cliffs, NJ. Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. Holzmann, G. J. 2003. The SPIN Model Checker. Addison-Wesley, Reading, MA.Google ScholarGoogle Scholar
  62. ITU-T 1996. Message Sequence Charts (MSC'96). ITU-T, Geneva, Switzerland.Google ScholarGoogle Scholar
  63. Jacobson, I., Booch, G., and Rumbaugh, J. 1999. The Unified Software Development Process. Addison-Wesley, Reading, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  64. Javier, E. and Raymond, P. 2005. The lucky language reference manual. Tech. rep. TR-2004-06, Verimag, Giéres, France.Google ScholarGoogle Scholar
  65. Jeffries, R. and Ambler, S. W. 2002. Agile Modeling. Jon Wiley & Sons, New York, NY.Google ScholarGoogle Scholar
  66. Jones, V., Rensink, A., Ruys, T., Brinksma, E., and van Halteren, A. 2004. A formal MDA approach for mobile health systems. In Proceedings of the 2nd European Workshop on Model Driven Architecture with an emphasis on Methodologies and Transformations. 28--35.Google ScholarGoogle Scholar
  67. Keshav, S. 1988. REAL: A network simulator. Tech. rep. 88/472. University of California, Berkeley, Berkeley, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  68. Kiess, W. and Mauvea, M. 2007. A survey on real-world implementations of mobile ad-hoc networks. Ad Hoc Netw. 5, 3, 538--576. Google ScholarGoogle ScholarDigital LibraryDigital Library
  69. Kim, M., Viswanathan, M., Ben-Abdallah, H., Kannan, S., Lee, I., and Sokolsky, O. 1999. Formally specified monitoring of temporal properties. In Proceedings of the 11th Euromicro Conference on Real-Time Systems. 1--14.Google ScholarGoogle Scholar
  70. Kindler, E. 1994. Safety and liveness properties: A survey. Bull. Eur. Assoc. Theor. Comput. Sci. 53, 268--272.Google ScholarGoogle Scholar
  71. Kleinrock, L. 1975. Queueing Systems. Wiley-Interscience, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  72. Kropff, M., Krop, T., Hollick, M., Mogre, P. S., and Steinmetz, R. 2006. A survey on real world and emulation testbeds for mobile ad hoc networks. In Proceedings of the 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM).Google ScholarGoogle Scholar
  73. Kurkowski, S., Camp, T., and Colagrosso, M. 2005. MANET simulation studies: the incredibles. ACM SIGMOBILE Mob. Comput. Comm. Rev. 9, 4, 50--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  74. Kwiatkowska, M., Norman, G., and Parker, D. 2005. Probabilistic model checking and power-aware computing. In In Proceedings of the 7th International Workshop on Performability Modeling of Computer and Communication Systems (PMCCS).Google ScholarGoogle Scholar
  75. Kwiatkowska, M., Norman, G., Segala, R., and Sproston, J. 2002a. Automatic verification of real-time systems with discrete probability distributions. Theor. Comput. Sci. 282, 101--150. Google ScholarGoogle ScholarDigital LibraryDigital Library
  76. Kwiatkowska, M., Norman, G., and Sproston, J. 2002b. Probabilitic model checking of the ieee 802.11 wireless local area network protocol. In Proceedings of the 2nd Joint International Workshop on Process Algebra and Probabilitics Methods, Performance Modeling and Verification. 169--187. Google ScholarGoogle ScholarDigital LibraryDigital Library
  77. Kwon, S. M. and Kim, J. S. 2008. Coverage ratio in the wireless sensor networks using monte carlo simulation. In Proceedings of the 4th International Conference on Networked Computing and Advanced Information Management. 235--238. Google ScholarGoogle ScholarDigital LibraryDigital Library
  78. Lahiri, S. K. 2004. Unbounded system verification using decision procedure and predicate abstraction. Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  79. Lahiri, S. K. and Bryant, R. E. 2005. UCLID-PA homepage: Verification tool for UCLID models using predicate abstraction. Carnegie Mellon University, Pittsburgh, PA.Google ScholarGoogle Scholar
  80. Lahiri, S. K. and Bryant, R. E. 2007. Predicate abstraction with indexed predicates. ACM Trans. Computat. Log. 9, 1, 4. Google ScholarGoogle ScholarDigital LibraryDigital Library
  81. Larsen, K. G., Petterson, P., and Yi, W. 1997. Uppaal in a nutshell. Int. J. Softw. Tools Techn. Trans. 1, 2, 134--152.Google ScholarGoogle ScholarDigital LibraryDigital Library
  82. Leao, R. M. M., de Souza e Silva, E., and Diniz, M. C. 2001. Traffic engineering using reward models. In Proceedings of the International Teletraffic Congress. 1101--1112.Google ScholarGoogle Scholar
  83. Lin, T., Midkiff, S., and Park, J. 2003. A framework for wireless ad hoc routing protocols. In Proceedings of the IEEE Wireless Communications and Networking Conf. (WCNC). 1162--1167.Google ScholarGoogle Scholar
  84. Lundgren, H., Nordström, E., and Tschudin, C. 2002. Coping with communication gray zones in ieee 802.11b based ad hoc networks. In Proceedings of the 5th ACM international workshop on Wireless Mobile Multimedia. 49--55. Google ScholarGoogle ScholarDigital LibraryDigital Library
  85. Maag, S., Grepet, C., and Cavalli, A. 2008. A formal validation methodology for manet routing protocols based on nodes' self similarity. Comp. Comm. 31, 4, 827--841. Google ScholarGoogle ScholarDigital LibraryDigital Library
  86. Maag, S. and Zaidi, F. 2006. Testing methodology for an ad hoc routing protocol. In Proceedings of the ACM International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks. 48--55. Google ScholarGoogle ScholarDigital LibraryDigital Library
  87. Maag, S. and Zaidi, F. 2007. A step-wise validation approach for a wireless routing protocol. Posts, Telecomm. Inform. Tech. J. 1, 34--40.Google ScholarGoogle Scholar
  88. Macker, J. P., Chao, W., and Weston, J. W. 2003. A low-cost, IP-based mobile network emulator (MNE). Tech. rep. ADA464904. Naval Research Lab, Washington, D.C.Google ScholarGoogle Scholar
  89. Mandel, L. and Pouzet, M. 2005. ReactiveML, a reactive extension to ML. In Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP). Google ScholarGoogle ScholarDigital LibraryDigital Library
  90. Manna, Z., Bjørner, N. S., Browne, A., Colón, M., Finkbeiner, B., Pichora, M., Sipma, H. B., and Uribe, T. E. 1999. An update on STeP: Deductive-algorithmic verification of reactive systems. In Tool Support for System Specification, Development and Verification, R. Berghammer and Y. Lakhnech, Eds. Advances in Computing Science. Springer-Verlag, Berlin, Germany, 174--188.Google ScholarGoogle Scholar
  91. Markov, A. 1971. Extension of the Limit Theorems of Probability Theory to a Sum of Variables Connected in a Chain. Markov Chains. John Wiley and Sons, New York, NY.Google ScholarGoogle Scholar
  92. Martin, J. 1990. RAD, Rapid Application Development. MacMillan Publishing Co, New York, NY.Google ScholarGoogle Scholar
  93. McIver, A. 2006. Quantitative mu-calculus analysis of power management in wireless networks. In Proceedings of the 3rd International Theoretical Aspects of Computing. 50--64. Google ScholarGoogle ScholarDigital LibraryDigital Library
  94. McIver, A. K. and Fehnker, A. 2006. Formal techniques for the analysis of wireless networks. In Proceedings of the 2nd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation. 263--270. Google ScholarGoogle ScholarDigital LibraryDigital Library
  95. Merouane, K., Grepet, C., and Maag, S. 2007. A methodology for interoperability testing of a manet routing protocol. In Proceedings of the 3rd International Conference on Wireless and Mobile Communications. IEEE Computer Society Press, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  96. Mitschele-Thiel, A. and Müller-Clostermann, B. 1999. Performance engineering of sdl/msc systems. Comp. Netw. ISDN Syst. 31, 17, 1801--1816. Google ScholarGoogle ScholarDigital LibraryDigital Library
  97. Perkins, C., Belding-Royer, E., and Das, S. 2003. Rfc 3561: ad hoc on-demand distance vector (AODV) routing. IETF Tech. rep. www.ietf.org. Google ScholarGoogle ScholarDigital LibraryDigital Library
  98. Peterson, J. L. 1977. Petri nets. ACM Comp. Surv. 9, 3, 223--252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  99. Peterson, J. L. 1981. Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs, NJ. Google ScholarGoogle ScholarDigital LibraryDigital Library
  100. Petri, C. A. 1962. Kommunikation mit automaten. Ph.D. dissertation, University of Bonn, Bonn, Germany.Google ScholarGoogle Scholar
  101. Petriu, D. and Woodside, M. 2002. Software performance models from systems scenarios in use case maps. In Proceedings of the 12th International Conference on Performance Evaluation: Modelling Techniques and Tools. Springer Verlag, Berlin, Germany, 1--8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  102. Pizzonia, M. and Rimondini, M. 2008. Easy emulation of complex networks on inexpensive hardware. In Proceedings of the 4th International Conf. on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM). Google ScholarGoogle ScholarDigital LibraryDigital Library
  103. Plateau, B. and Atif, K. 1991. Stockastic automata network of modeling parallel systems. IEEE Trans. Softw. Eng. 17, 10, 1093--1108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  104. Pnueli, A. 1981. A temporal logic of programs. Theor. Comp. Sci. 13, 1, 45--60.Google ScholarGoogle ScholarCross RefCross Ref
  105. Puzar, M. and Plagemann, T. 2005. NEMAN: A network emulator for mobile ad-hoc networks. Tech. rep. TR321. Department of Informatcis, University of Oslo, Oslo, Norway.Google ScholarGoogle Scholar
  106. Ray, S., Starobinski, D., and Carruthers, J. B. 2005. Performance of wireless networks with hidden nodes: A queuing-theoretic analysis. J. Comp. Comm. (Special Issue on the Performance Issues of Wireless LANs, PANs and Ad Hoc Networks. 28, 10, 1179--1192. Google ScholarGoogle ScholarDigital LibraryDigital Library
  107. Rimondini, M. 2007. Emulation of computer networks with Netkit. Tech. rep. TR RT-DIA-113-2007. University of Roma Tre, Rome, Italy.Google ScholarGoogle Scholar
  108. Royce, W. W. 1987. Managing the development of large software systems: concepts and techniques. In Proceedings of the International Conference on Software Engineering Table of Contents. 328--338. Google ScholarGoogle ScholarDigital LibraryDigital Library
  109. Rubinstein, R. Y. and Kroese, D. P. 2007. Simulation and the Monte Carlo Method. John Wiley & Sons, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  110. Rutten, J., M.Kwiatkowska, Norman, G., and Parker, D. 2004. Mathematical techniques for analysing concurrent and probabilitics systems. CRM Monograph Series 23. American Mathematical Society, Providence, RI.Google ScholarGoogle Scholar
  111. Samper, L., Maraninchi, F., Mounier, L., and Mandel, L. 2006. Glonemo: Global and accurate formal models for the analysis of ad-hoc sensor networks. In Proceedings of the 1st International Conference on Integrated Internet Ad hoc and Sensor Networks. Google ScholarGoogle ScholarDigital LibraryDigital Library
  112. Sgroi, M., da Silva, J. L., Bernardinis, F. D., Burghardt, F., Sangiovanni-Vincentelli, A., and Rabaey, J. 2000. Designing wireless protocols: Methodology and applications. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing. 3726--3729. Google ScholarGoogle ScholarDigital LibraryDigital Library
  113. Spivey, J. M. and Spivey, M. 1996. An Introduction to Logic Programming Through Prolog. Prentice Hall, Englewood Cliffs, NJ. Google ScholarGoogle ScholarDigital LibraryDigital Library
  114. Steppler, M. and Lott, M. 1997. Speet—SDL performance evaluation tool. In Proceedings of SDL'97. 53--67.Google ScholarGoogle Scholar
  115. Sterling, L. and Shapiro, E. 1994. The Art of Prolog. MIT Press, Cambridge, MA.Google ScholarGoogle Scholar
  116. Tan, C. L. and Pink, S. 2000. Mobicast: a multicast scheme for wireless networks. Mobilz Netw. Appl. 5, 4, 259--271. Google ScholarGoogle ScholarDigital LibraryDigital Library
  117. Tickoo, O. and Sikdar, B. 2004. Queueing analysis and delay mitigation in IEEE 802.11 random access MAC based wireless networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies. 7--11.Google ScholarGoogle Scholar
  118. Vahdat, A. and Becker, D. 2000. Epidemic routing for partially-connected ad hoc networks. Tech. rep. Duke University, Durham, NC.Google ScholarGoogle Scholar
  119. Verilog. 1997. ObjectGEODE Simulator.Google ScholarGoogle Scholar
  120. Vliet, H. V. 1999. Sotware Engineering: Principles and Practice (2nd Edition). Wiley, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  121. Wang, Y. and Xiong, M. 2005. Monte Carlo simulation of leach protocol for wireless sensor networks. In Proceedings of the 6th International Conference on Parallel and Distributed Computing Applications and Technologies. 85--88. Google ScholarGoogle ScholarDigital LibraryDigital Library
  122. Watteyne, T., Auge-Blum, I., and Ubeda, S. 2005. Formal QoS validation approach on a real-time MAC protocol for wireless sensor networks. Tech. Rep. 5782, RR-5782. INRIA, Rocquencourt, France.Google ScholarGoogle Scholar
  123. Wei, M., Dubois, F., Vincent, D., and Combes, P. 2003. Looking for better integration of design and performance engineering. In Proceedings of SDL 2003: System Design, Springer, Berlin, Germany, 1--17. Google ScholarGoogle ScholarDigital LibraryDigital Library
  124. Wibling, O. 2005. Ad hoc routing protocol validation. M.S. thesis. Uppsala University, Uppsala, Sweden.Google ScholarGoogle Scholar
  125. Xu, N., Rangwala, S., Chintalapudi, K., Ganesan, D., Broad, A., Govindan, R., and Estrin, D. 2004. A wireless sensor network for structural monitoring. In Proceedings of the ACM SIGOPS International Conference on Embedded Networked Sensor Systems. 13--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  126. Zaïdi, F., Cavalli, A., and Bayse, E. 2009. Network protocol interoperability testing based on contextual. In Proceedings of the 24th Annual ACM Symposium on Applied Computing. 321--327. TO be published. Google ScholarGoogle ScholarDigital LibraryDigital Library
  127. Zakkuidin, I., Hawkins, T., and Moffat, N. 2005. Towards a game theoretic understanding of ad hoc routing. Electron. Notes Theor. Comp. Sci. 119, 1, 67--92. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. One step forward: Linking wireless self-organizing network validation techniques with formal testing approaches

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Computing Surveys
        ACM Computing Surveys  Volume 43, Issue 2
        January 2011
        276 pages
        ISSN:0360-0300
        EISSN:1557-7341
        DOI:10.1145/1883612
        Issue’s Table of Contents

        Copyright © 2011 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 4 February 2011
        • Accepted: 1 April 2009
        • Revised: 1 January 2009
        • Received: 1 July 2008
        Published in csur Volume 43, Issue 2

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader