SOFA: Communication in Extreme Wireless Sensor Networks

  • Marco Cattani
  • Marco Zuniga
  • Matthias Woehrle
  • Koen Langendoen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8354)

Abstract

Sensor networks can nowadays deliver 99.9% of their data with duty cycles below 1%. This remarkable performance is, however, dependent on some important underlying assumptions: low traffic rates, medium size densities and static nodes. In this paper, we investigate the performance of these same resource-constrained devices, but under scenarios that present extreme conditions: high traffic rates, high densities and mobility. To cope with these stringent requirements, we propose a novel communication protocol named SOFA (Stop On First Ack). SOFA utilizes opportunistic anycast to drastically reduce the rendezvous times of asynchronous duty cycled nodes –long rendezvous times are the key limitation of protocols operating under high densities and high traffic conditions. SOFA is also stateless, which makes it resilient to mobility. We implemented SOFA in the Contiki OS and tested it both in simulation and on a 100-node testbed. Our results show that SOFA reliably communicates in mobile networks with extreme densities (hundreds of nodes) and higher traffic rates (packets per second) while maintaining a low duty cycle (≈2%). Under these extreme conditions, current duty cycled protocols collapse.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boano, C., Zuniga, M.: JAG: Reliable and Predictable Wireless Agreement under External Radio Interference. In: IEEE 33rd Real-Time Systems Symposium (RTSS), pp. 315–326 (2012)Google Scholar
  2. 2.
    Boyd, S., Ghosh, A.: Gossip algorithms: Design, analysis and applications. In: 24th Annual Joint Conf. of the IEEE Computer and Communications Societies, IFOCOM 2005, pp. 1653–1664 (2005)Google Scholar
  3. 3.
    Buettner, M., Yee, G., Anderson, E.: X-MAC: a short preamble MAC protocol for duty-cycled wireless sensor networks. In: Sensys 2006 4th Int. Conf. on Embedded Networked Sensor Systems, pp. 307–320 (2006)Google Scholar
  4. 4.
    Demers, A., Greene, D., Hauser, C.: Epidemic algorithms for replicated database maintenance. In: Sixth ACM Symposium on Principles of Distributed Computing, pp. 1–12 (1987)Google Scholar
  5. 5.
    Dutta, P., Dawson-Haggerty, S., Chen, Y., Liang, C.-J.M., Terzis, A.: Design and evaluation of a versatile and efficient receiver-initiated link layer for low-power wireless. In: Sensys 2010 8th ACM Conference on Embedded Networked Sensor Systems, pp. 1–14. ACM Press (2010)Google Scholar
  6. 6.
    Dutta, P., Musaloiu-E, R., Stoica, I., Terzis, A.: Wireless ACK collisions not considered harmful. In: HotNets-VII The Seventh Workshop on Hot Topics in Networks (2008)Google Scholar
  7. 7.
    El-Hoiydi, A.: WiseMAC: an ultra low power MAC protocol for the downlink of infrastructure wireless sensor networks. In: ISCC 2004 Ninth Int. Symp. on Computers and Communications, pp. 244–251 (2004)Google Scholar
  8. 8.
    Ferrari, F., Zimmerling, M., Thiele, L., Mottola, L.: The low-power wireless bus. In: 10th Conf. on Embedded Networked Sensor Systems (Sensys), pp. 1–14 (2012)Google Scholar
  9. 9.
    Gnawali, O., Fonseca, R., Jamieson, K.: Collection tree protocol. In: Sensys 2009 7th ACM Conf. on Embedded Networked Sensor Systems, pp. 1–14 (2009)Google Scholar
  10. 10.
    Landsiedel, O., Ghadimi, E., Duquennoy, S., Johansson, M.: Low Power, Low Delay: Opportunistic Routing meets Duty Cycling. In: IPSN 2012 11th Int. Conf. on Information Processing in Sensor Networks, pp. 185–196 (2012)Google Scholar
  11. 11.
    Loukas, A., Zuniga, M., Woehrle, M., Cattani, M., Langendoen, K.: Think globally, act locally: on the reshaping of information landscapes. In: IPSN 2012 12th Int. Conf. on Information Processing in Sensor Networks, pp. 265–276 (2013)Google Scholar
  12. 12.
    Moss, D., Levis, P.: Box-MACs: Exploiting physical and link layer boundaries in low-power networking. Computer Systems Laboratory Stanford University (2008)Google Scholar
  13. 13.
    Sarwate, A.D., Dimakis, A.G.: The Impact of Mobility on Gossip Algorithms. IEEE Transactions on Information Theory 58(3), 1731–1742 (2012)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Shah, D.: Gossip algorithms. In: Found. and Trends in Networking, pp. 1–125 (2009)Google Scholar
  15. 15.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and Wait: An Efficient Routing Scheme for intermittently connected mobile networks. In: SIGCOMM 2005 Workshop on Delay-tolerant Networking, pp. 252–259 (2005)Google Scholar
  16. 16.
    Sun, Y., Gurewitz, O.: RI-MAC: a receiver-initiated asynchronous duty cycle MAC protocol for dynamic traffic loads in wireless sensor networks. In: SenSys 2008 6th ACM Conf. on Embedded Network Sensor Systems, pp. 1–14 (2008)Google Scholar
  17. 17.
    Tang, L., Sun, Y., Gurewitz, O., Johnson, D.B.: EM-MAC: a dynamic multichannel energy-efficient MAC protocol for wireless sensor networks. In: Twelfth Int. Symp. on Mobile Ad Hoc Networking and Computing (MobiHoc), vol. 11, pp. 23:1–23:11 (2011)Google Scholar
  18. 18.
    Zuniga, M., Krishnamachari, B.: An analysis of unreliability and asymmetry in low-power wireless links. ACM Trans. on Sensor Networks 3(2), 7 (2007)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Marco Cattani
    • 1
  • Marco Zuniga
    • 1
  • Matthias Woehrle
    • 1
  • Koen Langendoen
    • 1
  1. 1.Delft University of TechnologyDelftThe Netherlands

Personalised recommendations