Advertisement

Self-organization of Wireless Networks Through Declarative Local Communication

(Extended Abstract)
  • Stéphane Grumbach
  • Jia-liang Lu
  • Wenwu Qu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4805)

Abstract

The use of declarative query languages has been proposed recently to express communication protocols. This approach, known as declarative networking, is very promising since it results in very simple programs, which are very easy to use. In this paper, we pursue this approach and show how to express the FISCO protocol using less than 40 simple declarative rules. FISCO was designed for self-configuration and self-organisation of large scale multi-hop wireless networks. The declarative modeling of FISCO has important practical and theoretical consequences. First of all, it results in an implementation much more compact than the initial one which used several thousands code lines, it is easy to use and modify, and enjoys verifiable properties, such as correctness and termination. Second, since FISCO targets large scale networks, its scalability is its first requirement. We show that the good scalability of this protocol follows from the fact that it relies mainly on local distributed processes, which can be expressed using first-order queries. Unlike previous proposals for declarative networking which rely on recursive query languages, we show that first-order queries thus offer a high potential for network protocols.

Keywords

Query Language Linear Logic Conjunctive Query Data Intensive Application Virtual Backbone 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AAHM05]
    Abiteboul, S., Abrams, Z., Haar, S., Milo, T.: Diagnosis of asynchronous discrete event systems: datalog to the rescue! In: Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems, Baltimore, Maryland, USA, ACM Press, New York (2005)Google Scholar
  2. [AKS+03]
    Alonso, G., Kranakis, E., Sawchuk, C., Wattenhofer, R., Widmayer, P.: Probabilistic protocols for node discovery in ad hoc @multi-channel broadcast networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, Springer, Heidelberg (2003)Google Scholar
  3. [BBGR03]
    Bejerano, Y., Breitbart, Y., Garofalakis, M.N., Rastogi, R.: Physical topology discovery for large multi-subnet networks. In: INFOCOM (2003)Google Scholar
  4. [BBO+05]
    Bejerano, Y., Breitbart, Y., Orda, A., Rastogi, R., Sprintson, A.: Algorithms for computing qos paths with restoration. IEEE/ACM Trans. Netw. 13(3) (2005)Google Scholar
  5. [Gir87]
    Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50, 1–102 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  6. [LCG+06]
    Loo, B.T., Condie, T., Garofalakis, M.N., Gay, D.E., Hellerstein, J.M., Maniatis, P., Ramakrishnan, R., Roscoe, T., Stoica, I.: Declarative networking: language, execution and optimization. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 27-29, ACM Press, New York (2006)Google Scholar
  7. [LCH+05]
    Loo, B.T., Condie, T., Hellerstein, J.M., Maniatis, P., Roscoe, T., Stoica, I.: Implementing declarative overlays. In: Proceedings of the 20th ACM Symposium on Operating Systems Principles 2005, SOSP 2005, Brighton, UK, ACM Press, New York (2005)Google Scholar
  8. [LHSR05]
    Loo, B.T., Hellerstein, J.M., Stoica, I., Ramakrishnan, R.: Declarative routing: extensible routing with declarative queries. In: Proceedings of the ACM SIGCOMM 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Philadelphia, Pennsylvania, USA, ACM Press, New York (2005)Google Scholar
  9. [LVBD07]
    Lu, J.-L., Valois, F., Barthel, D., Dohler, M.: Fisco: A fully integrated scheme of self-configuration and self-organization for wsn. In: IEEE/WCNC (2007)Google Scholar
  10. [MFHH05]
    Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: Tinydb: an acquisitional query processing system for sensor networks. ACM Trans. Database Syst 30(1) (2005)Google Scholar
  11. [MTV93]
    Masseron, M., Tollu, C., Vauzeilles, J.: Generating plans in linear logic i. actions as proofs. Theor. Comput. Sci. 113(2), 349–370 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  12. [Net]
  13. [PJFY04]
    Perich, F., Joshi, A., Finin, T.W., Yesha, Y.: On data management in pervasive computing environments. IEEE Trans. Knowl. Data Eng. 16(5), 621–634 (2004)CrossRefGoogle Scholar
  14. [RH06]
    Reiss, F., Hellerstein, J.M.: Declarative network monitoring with an underprovisioned query processor. In: ICDE (2006)Google Scholar
  15. [SMW05]
    Srivastava, U., Munagala, K., Widom, J.: Operator placement for in-network stream query processing. In: PODS 2005, pp. 250–258 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Stéphane Grumbach
    • 1
  • Jia-liang Lu
    • 2
  • Wenwu Qu
    • 3
  1. 1.INRIA-LIAMA Institute of Automation, BeijingChina
  2. 2.INRIA ARES, INSA LyonFrance
  3. 3.CAS USTC BeijingChina

Personalised recommendations