Featurecast: Lightweight Data-Centric Communications for Wireless Sensor Networks

  • Michał Król
  • Franck Rousseau
  • Andrzej Duda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8965)


We introduce the concept of Featurecast with addressing and routing based on node features defined as predicates. For instance, we can send a packet to the address composed of features {temperature and Room D} to reach all nodes with a temperature sensor located in Room D. Each node constructs its address from the set of its features and disseminates it in the network so that intermediate nodes can build routing tables. In this way, a node can send a packet to a set of nodes matching given features. Our experiments and evaluation of this scheme show very good performance compared to Logical Neighborhoods (LN) and IP multicast with respect to the memory footprint and message overhead.


wireless sensor networks data-centric routing multicast IPv6 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Huang, Q., Lu, C., Roman, G.C.: Spatiotemporal Multicast in Sensor Networks. In: Proc. ACM SenSys, pp. 205–217. ACM, New York (2003)Google Scholar
  2. 2.
    Flury, R., Wattenhofer, R.: Routing, Anycast, and Multicast for Mesh and Sensor Networks. In: IEEE INFOCOM (2007)Google Scholar
  3. 3.
    Su, L., Ding, B., Yang, Y., Abdelzaher, T.F., Cao, G., Hou, J.C.: oCast: Optimal Multicast Routing Protocol for Wireless Sensor Networks. In: Proc. of ICNP, pp. 151–160 (2009)Google Scholar
  4. 4.
    Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed Diffusion: a Scalable and Robust Communication Paradigm for Sensor Networks. In: Proc. of MOBICOM, pp. 56–67 (2000)Google Scholar
  5. 5.
    Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed Diffusion for Wireless Sensor Networking. IEEE/ACM Trans. Netw. 11, 2–16 (2003)CrossRefGoogle Scholar
  6. 6.
    Hebden, P., Pearce, A.: Data-Centric Routing Using Bloom Filters in Wireless Sensor Networks. In: Proc. of ICISIP 2006, pp. 72–78 (2006)Google Scholar
  7. 7.
    Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., Levis, P.: Collection tree protocol. In: Proc. ACM SenSys, Berkeley, CA, USA (2009)Google Scholar
  8. 8.
    Winter, T., et al.: RPL: IPv6 Routing Protocol for Low power and Lossy Networks. RFC 6550, IETF (2012)Google Scholar
  9. 9.
    Dunkels, A., Grönvall, B., Voigt, T.: Contiki—a Lightweight and Flexible Operating System for Tiny Networked Sensors. In: IEEE EMNETS, Tampa, Florida, USA (2004)Google Scholar
  10. 10.
    Rahman, A., Dijk, E.: Group Communication for CoAP. IETF draft-ietf-core-groupcomm-07 (2013)Google Scholar
  11. 11.
    Mottola, L., Picco, G.: Logical Neighborhoods: A Programming Abstraction for Wireless Sensor Networks. In: Proc. IEEE DCOSS (2006)Google Scholar
  12. 12.
    Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking Named Content. In: Proceedings of CoNEXT 2009, pp. 1–12. ACM, New York (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Michał Król
    • 1
  • Franck Rousseau
    • 1
  • Andrzej Duda
    • 1
  1. 1.CNRS Grenoble Informatics Laboratory UMR 5217Grenoble Institute of TechnologySaint Martin d’HèresFrance

Personalised recommendations