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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Trigoni, N., Yao, Y., Demers, A., Gehrke, J., Rajaraman, R.: Wave Scheduling and Routing in Sensor Networks. ACM Trans. on Sensor Networks 3 (2007)
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)
Ergen, S.C., Varaiya, P.: TDMA Scheduling Algorithms for Sensor Networks. Technical Report, Department of EECS, University of California, Berkeley (2005)
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)
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)
Ramanathan, S.: A Unified Framework and Algorithm for Channel Assignment in Wireless Networks. Wireless Networks 5, 81–94 (1999)
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)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights 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)