Skip to main content

On Maximizing the Throughput of Convergecast in Wireless Sensor Networks

  • Conference paper
Advances in Grid and Pervasive Computing (GPC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5036))

Included in the following conference series:

Abstract

A primary task of wireless sensor networks is collecting environmental information. In most cases, a sink node is responsible for collecting data from all sensor nodes. The radio congestion around the sink becomes the main bottleneck to maximizing the throughput of the convergecast. A general strategy to alleviating the problem is to schedule the communications among sensors to avoid interference. In this paper, we consider both routing structures and communication schedules for optimizing the scheduling length. We show that the shortest-length conflict-free scheduling is equivalent to finding a minimal vertex coloring. To solve the schedule problem, a virtual-node expansion is proposed to handle the relay operations in convergecast, and then coloring algorithms are used to obtain the communication schedule. However, scheduling only solves part of the problem. Routing structures will also affect the scheduling quality. The disjoint-strips routing is thus proposed to leverage possible parallel transmissions in convergecast. The proposed algorithms are evaluated through simulations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TinyDB: An acquisitional query processing system for sensor networks. ACM Trans. on Database Systems 30 (2005)

    Google Scholar 

  2. Rajendran, V., Obraczka, K., Garcia-Luna-Aceves, J.J.: Energy-efficient collision-free me-dium access control for wireless sensor networks. In: Proc. of the International Conf. on Embedded Networked Sensor Systems (2003)

    Google Scholar 

  3. Hohlt, B., Doherty, L., Brewer, E.: Flexible Power Scheduling for Sensor Networks. In: Proc. of the Third International Symposium on Information Processing in Sensor Networks (2004)

    Google Scholar 

  4. Rhee, I., Warrier, A., Aia, M., Min, J.: Z-MAC: A hybrid MAC for wireless sensor networks. In: Proc. of the 3rd International Conf. on Embedded Networked Sensor Systems (2005)

    Google Scholar 

  5. Trigoni, N., Yao, Y., Demers, A., Gehrke, J., Rajaraman, R.: Wave Scheduling and Routing in Sensor Networks. ACM Trans. on Sensor Networks 3 (2007)

    Google Scholar 

  6. Ahn, G.-S., Hong, S.G., Miluzzo, E., Campbell, A.T., Cuomo, F.: Funneling-MAC: A localized, sink-oriented MAC for boosting fidelity in sensor networks. In: Proc. of the International Conf. on Embedded Networked Sensor Systems (2006)

    Google Scholar 

  7. Ergen, S.C., Varaiya, P.: TDMA Scheduling Algorithms for Sensor Networks. Technical Report, Department of EECS, University of California, Berkeley (2005)

    Google Scholar 

  8. Mao, J., Wu, Z., Wu, X.: A TDMA Scheduling Scheme for Many-to-one Communications in Wireless Sensor Networks. Computer Communications 30, 863–872 (2007)

    Article  Google Scholar 

  9. Chen, X., Hu, X., Zhu, J.: Minimum Data Aggregation Time Problem in Wireless Sensor Networks. In: Proc. of the International Conf. on Mobile Ad-hoc and Sensor Networks (2005)

    Google Scholar 

  10. Ramanathan, S.: A Unified Framework and Algorithm for Channel Assignment in Wireless Networks. Wireless Networks 5, 81–94 (1999)

    Article  Google Scholar 

  11. Li, X.-Y., Wang, Y.: Simple Heuristics and PTASs for Intersection Graphs in Wireless Ad Hoc Networks. In: Proc. of the International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (2002)

    Google Scholar 

  12. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple Heuristics for Unit Disk Graphs. Networks 25, 59–68 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  13. Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L.: Impact of Interference on Multi-hop Wire-less Network Performance. In: Proc. of the Annual International Conf. on Mobile Computing and Networking (2003)

    Google Scholar 

  14. Transier, M., Füβler, H., Mauve, M., Widmer, J., Effelsberg, W.: Dynamic Load Balancing for Position-based Routing. In: Proc. of the Conf. on Emerging Network Experiment and Technology (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Song Wu Laurence T. Yang Tony Li Xu

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lai, NL., King, CT., Lin, CH. (2008). On Maximizing the Throughput of Convergecast in Wireless Sensor Networks. In: Wu, S., Yang, L.T., Xu, T.L. (eds) Advances in Grid and Pervasive Computing. GPC 2008. Lecture Notes in Computer Science, vol 5036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68083-3_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68083-3_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68081-9

  • Online ISBN: 978-3-540-68083-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics