skip to main content
10.1145/1644038.1644046acmconferencesArticle/Chapter ViewAbstractPublication PagessensysConference Proceedingsconference-collections
research-article

Bursty traffic over bursty links

Published:04 November 2009Publication History

ABSTRACT

Accurate estimation of link quality is the key to enable efficient routing in wireless sensor networks. Current link estimators focus mainly on identifying long-term stable links for routing. They leave out a potentially large set of intermediate links offering significant routing progress. Fine-grained analysis of link qualities reveals that such intermediate links are bursty, i.e., stable in the short term.

In this paper, we use short-term estimation of wireless links to accurately identify short-term stable periods of transmission on bursty links. Our approach allows a routing protocol to forward packets over bursty links if they offer better routing progress than long-term stable links. We integrate a Short Term Link Estimator and its associated routing strategy with a standard routing protocol for sensor networks. Our evaluation reveals an average of 19% and a maximum of 42% reduction in the overall transmissions when routing over long-range bursty links. Our approach is not tied to any specific routing protocol and integrates seamlessly with existing routing protocols and link estimators.

References

  1. D. Aguayo, J. Bicket, S. Biswas, G. Judd, and R. Morris. Link-level measurements from an 802.11b mesh network. SIGCOMM Comput. Commun. Rev., 34(4):121--132, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. G. W. Allen, P. Swieskowski, and M. Welsh. Motelab: a wireless sensor network testbed. In IPSN '05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Becher, O. Landsiedel, G. Kunz, and K. Wehrle. Towards short-term link quality estimation. In Hot Emnets, 2008.Google ScholarGoogle Scholar
  4. S. Biswas and R. Morris. Exor: opportunistic multi-hop routing for wireless networks. SIGCOMM Comput. Commun. Rev., 35(4):133--144, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Cerpa, J. L. Wong, L. Kuang, M. Potkonjak, and D. Estrin. Statistical model of lossy links in wireless sensor networks. In IPSN 05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Cerpa, J. L. Wong, M. Potkonjak, and D. Estrin. Temporal properties of low power wireless links: modeling and implications on multi-hop routing. In MobiHoc '05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Fonseca, O. Gnawali, K. Jamieson, and P. Levis. Four-bit wireless link estimation. In HotNets, 2007.Google ScholarGoogle Scholar
  8. R. Fonseca, S. Ratnasamy, J. Zhao, C. T. Ee, D. E. Culler, S. Shenker, and I. Stoica. Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In NSDI '05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Gay, P. Levis, R. von Behren, M. Welsh, E. Brewer, and D. Culler. The nesc language: A holistic approach to networked embedded systems. In ACM SIGPLAN PLDI, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. O. Gnawali, R. Fonseca, K. Jamieson, D. Moss, and P. Levis. Collection tree protocol. In SenSys '09, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Govindan and D. Estrin. Directed diffusion: a scalable and robust communication paradigm for sensor networks. In Proceedings of the sixth annual international conference on Mobile computing and networking, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. V. Handziski, A. Köpke, A. Willig, and A. Wolisz. Twist: a scalable and reconfigurable testbed for wireless indoor experiments with sensor networks. In REALMAN '06, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. He, S. Krishnamurthy, J. A. Stankovic, T. Abdelzaher, L. Luo, R. Stoleru, T. Yan, L. Gu, J. Hui, and B. Krogh. Energy-efficient surveillance system using wireless sensor networks. In MobiSys '04, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. Jiao, L. Schwiebert, and B. Xu. On modeling the packet error statistics in bursty channels. In IEEE LCN '02, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, pages 153--181. Kluwer Academic Publishers, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  16. A. Köpke, A. Willig, and H. Karl. Chaotic maps as parsimonious bit error models of wireless channels. In INFOCOM, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  17. K. G. Langendoen. Apples, oranges, and testbeds. In IEEE MASS, 2006.Google ScholarGoogle Scholar
  18. K. Lorincz and M. Welsh. Motetrack: A robust, decentralized approach to rf-based location tracking. In Springer Personal and Ubiquitous Computing, Special Issue on Location and Context-Awareness, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. C. E. Perkins, E. M. Royer, and S. R. Das. Ad hoc on-demand distance vector (aodv) routing. In 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. Polastre, R. Szewczyk, and D. Culler. Telos: enabling ultra-low power wireless research. In IPSN '05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. K. Ramachandran, I. Sheriff, E. Belding, and K. Almeroth. Routing Stability in Static Wireless Mesh Networks. Springer: Lecture Notes in Computer Science, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  22. F. Rodrigo, O. Gnawali, K. Jamieson, S. Kim, P. Levis, and A. Wo. The collection tree protocol. In TinyOS Enhancement Proposal, TEP 123, 2006.Google ScholarGoogle Scholar
  23. C. Sharp, S. Schaffert, A. Woo, N. Sastry, C. Karlof, S. Sastry, and D. Culler. Design and implementation of a sensor network system for vehicle tracking and autonomous interception. In EWSN, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  24. K. Srinivasan, P. Dutta, A. Tavakoli, and P. Levis. Some implications of low power wireless to ip networking. In HotOS V, 2006.Google ScholarGoogle Scholar
  25. K. Srinivasan, P. Dutta, A. Tavakoli, and P. Levis. Understanding the causes of packet delivery success and failure in dense wireless sensor networks. In SenSys '06, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. K. Srinivasan, M. A. Kazandjieva, S. Agarwal, and P. Levis. The β-factor: measuring wireless link burstiness. In SenSys '08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. K. Srinivasan and P. Levis. Rssi is under appreciated. In Emnets, 2006.Google ScholarGoogle Scholar
  28. M. Welsh, G. W. Allen, K. Lorincz, O. Marcillo, J. Johnson, M. Ruiz, and J. Lees. Sensor networks for high-resolution monitoring of volcanic activity. In SOSP '05, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. G. Wittenburg, K. Terfloth, F. L. Villafuerte, T. Naumowicz, H. Ritter, and J. H. Schiller. Fence monitoring - experimental evaluation of a use case for wireless sensor networks. In EWSN, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. A. Woo and D. Culler. Evaluation of efficient link reliability estimators for low-power wireless networks. Technical Report UCB/CSD-03-1270, EECS Department, University of California, Berkeley, 2003.Google ScholarGoogle Scholar
  31. A. Woo, T. Tong, and D. Culler. Taming the underlying challenges of reliable multihop routing in sensor networks. In SenSys '03, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Bursty traffic over bursty links

        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
        • Published in

          cover image ACM Conferences
          SenSys '09: Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
          November 2009
          438 pages
          ISBN:9781605585192
          DOI:10.1145/1644038

          Copyright © 2009 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 November 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate174of867submissions,20%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader