Pioneering the Establishment of the Foundations of the Internet of Things

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9295)

Abstract

In the Internet of Things era, every one of over a trillion everyday items will include at least some ability to store and process information. And, more important, to share that information over the global Internet with the other trillion items. In order to support this technological evolution, among the first problems that were addressed by the research community was that of basic network communication as existing, conventional (Internet-like) networking approaches were either unworkable or impractical. One of the solutions proposed is the so-called “Support Approach” that was proposed in 2000 and rigorously studied using a combination of theoretical and practical research. In this paper we present the main findings and we comment on the research methodology that led to these results.

References

  1. 1.
    Ajtai, M., Komlos, J., Szemeredi, E.: Deterministic simulation in logspace. In: 19th Annual Symposium on Theory of Computing, ACM, 1987, pp. 132–140Google Scholar
  2. 2.
    Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs (1999). http://stat-www.berkeley.edu/users/aldous/book.html
  3. 3.
    Alon, N., Chung, F.R.K.: Explicit construction of linear sized tolerant networks. Discrete Math. 72, 15–19 (1998)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bamis, A., Boukerche, A., Chatzigiannakis, I., Nikoletseas, S.E.: A mobility sensitive approach for efficient routing in ad hoc mobile networks. In: Alba, E., Chiasserini, C-F., Abu-Ghazaleh, N.B., Lo Cigno, R. (eds.) Proceedings of the 9th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2006, Terromolinos, Spain, October 2–6, pp. 357–364. ACM (2006)Google Scholar
  5. 5.
    Bamis, A., Boukerche, A., Chatzigiannakis, I., Nikoletseas, S.E.: A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks. Comput. Netw. 52(1), 130–154 (2008)CrossRefMATHGoogle Scholar
  6. 6.
    Broch, J., Johnson, D.B., Maltz, D.A.: The dynamic source routing protocol for mobile ad-hoc networks. In: Technica report, IETF, Internet Draft, December 1998. draft-ietf-manet-dsr-01. txtGoogle Scholar
  7. 7.
    Burleigh, S., Hooke, A., Torgerson, L., Fall, K., Cerf, V., Durst, B., Scott, K., Weiss, H.: Delay-tolerant networking: an approach to interplanetary internet. IEEE Commun. Mag. 41(6), 128–136 (2003)CrossRefGoogle Scholar
  8. 8.
    Busch, C., Tirthapura, S.: Analysis of link reversal routing algorithms. SIAM J. Comput. 35(2), 305–326 (2005)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, B., Scott, K., Fall, K., Weiss, H.: Delay-tolerant networking architecture. In: Technical report, The IETF Trust (2007)Google Scholar
  10. 10.
    Chatzigiannakis, I.: Design and analysis of distributed algorithms for basic communication in ad-hoc mobile networks. Ph.D. dissertation, Department of Computer Engineering and Informatics, University of Patras, Greece, May 2003Google Scholar
  11. 11.
    Chatzigiannakis, I.: Communication in ad hoc mobile networks using random walks. Encyclopedia of Algorithms, Springer, Heidelberg (2008)Google Scholar
  12. 12.
    Chatzigiannakis, I., Kokkinos, P., Zaroliagis, C.: Synthesizing routing protocols for ad-hoc mobile networks. In: 12th Annual International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2004), Poster Paper, pp. 24–27 (2004)Google Scholar
  13. 13.
    Chatzigiannakis, I., Nikoletseas, S.E., Paspallis, N., Spirakis, P.G., Zaroliagis, C.D.: An experimental study of basic communication protocols in ad-hoc mobile networks. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, p. 159. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  14. 14.
    Chatzigiannakis, I., Nikoletseas, S.E., Spirakis, P.G.: Analysis and experimental evaluation of an innovative and efficient routing protocol for ad-hoc mobile networks. In: Näher, S., Wagner, D. (eds.) WAE 2000. LNCS, vol. 1982, pp. 99–110. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  15. 15.
    Chatzigiannakis, I., Nikoletseas, S.E., Spirakis, P.G.: An efficient communication strategy for Ad-hoc mobile networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 285–299. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  16. 16.
    Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: An efficient routing protocol for hierarchical ad-hoc mobile networks. In: 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, 2001, IPDPS Workshops (2001)Google Scholar
  17. 17.
    Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: On the average and worst-case efficiency of some new distributed communication and control algorithms for ad-hoc mobile networks. In: 1st ACM International Annual Workshop on Principles of Mobile Computing (POMC 2001), pp. 1–19 (2001)Google Scholar
  18. 18.
    Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Self-organizing ad-hoc mobile networks: the problem of end-to-end communication. In: 20th ACM Annual Symposium on Principles of Distributed Computing (PODC 2001), pp. 320–322 (2001)Google Scholar
  19. 19.
    Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Distributed communication algorithms for ad hoc mobile networks. J. Parallel Distrib. Comput. (JPDC) 63(1), 58–74 (2003). (Special Issue on Wireless and Mobile Ad-hoc Networking and Computing, edited by Boukerche, A.)CrossRefMATHGoogle Scholar
  20. 20.
    Gafni, E., Bertsekas, D.P.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Trans. Commun. 29(1), 11–18 (1981)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Haas, Z.J., Pearlman, M.R.: The performance of a new routing protocol for the reconfigurable wireless networks. In: International Conference on Communications, IEEE (1998)Google Scholar
  22. 22.
    Haas, Z.J., Pearlman, M.R: The zone routing protocol (ZRP) for ad-hoc networks. In: Technical report, IETF, Internet Draft, June 1999. draft-zone-routing-protocol-02. txtGoogle Scholar
  23. 23.
    Hatzis, K.P., Pentaris, G.P., Spirakis, P.G., Tampakas, V.T., Tan, R.B.: Fundamental control algorithms in mobile networks. In: 11th Annual Symposium on Parallel Algorithms and Architectures (SPAA 1999), pp. 251–260. ACM (1999)Google Scholar
  24. 24.
    Holland, G., Vaidya, N.: Analysis of TCP performance over mobile ad hoc networks. In: 5th ACM/IEEE Annual International Conference on Mobile Computing (MOBICOM 1999), pp. 219–230 (1999)Google Scholar
  25. 25.
    Imielinski, T., Korth, H.F.: Mobile Computing. Kluwer Academic Publishers, Dordrecht (1996) CrossRefGoogle Scholar
  26. 26.
    Sushant, J., Kevin, F., Rabin, P., Routing in a delay tolerant network. In: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (New York, NY, USA), SIGCOMM 2004, pp. 145–158. ACM (2004)Google Scholar
  27. 27.
    Kao, M.-Y. (ed.): Encyclopedia of Algorithms. Springer, Heidelberg (2008) MATHGoogle Scholar
  28. 28.
    Pearlman, M., Haas, Z.: Determining the optimal configuration for the zone routing protocol. IEEE J. Sel. Areas Commun. 17(8), 1395–1414 (2003)CrossRefGoogle Scholar
  29. 29.
    Perkins, C.E., Royer, E.M.: Ad-hoc on demand distance vector (AODV) routing. In: 2nd IEEE Annual Workshop on Mobile Computing Systems and Applications, 1999, pp. 90–100 (1999)Google Scholar
  30. 30.
    Spirakis, P., Zaroliagis, C.: Distributed algorithm engineering. Experimental Algorithmics, pp. 197–228 (2002)Google Scholar
  31. 31.
    Szemeredi, E.: Regular partitions of graphs, Colloques Internationaux C. N. R. S 260, pp. 399–401 (1976). Problemes Combinatoires et Theorie des GraphesGoogle Scholar
  32. 32.
    Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. In: Technical report, Duke University, 2000, Technical Report CS-200006 (2000)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Sapienza University of RomeRomeItaly
  2. 2.Computer Technology Institute & Press “Diophantus”PatrasGreece

Personalised recommendations