Abstract
This paper introduces a novel interval scheduling and congestion control scheme in wireless sensor networks. Wireless sensor network is an event based system with several sensor nodes. Reliable event detection at the sink is based on collective information provided by sensor nodes. But due to the unreliable nature of wireless communication, it is hard to guarantee the end-to-end reliability and timeliness. Hence, we propose a novel dynamic congestion control scheme that ensures the reliable delivery of packets to a base station, and that minimizes congestion within sensor network. This solution includes a congestion control component that serves the purpose of minimizing congestion by burst traffic, data concentration, and link failure. And to achieve energy efficiency, reliability, and timeliness, we introduce the concept of dynamic interval scheduling algorithm that optimizes the data delivery ratio and energy usage for communication.
This is a preview of subscription content, log in via an institution to check access.
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
Wan, C., Eisenman, S.B., Campbell, A.T.: CODA: Congestion Detection and Avoidance in Sensor Networks. In: First ACM conference on Embedded Networked Sensor Systems (November 2003)
Lindsey, S., et al.: Data Gathering in Sensor Networks Using the Energy Delay Metric. IEEE Trans. Parallel and Distrib. Syst., A(13), 924–935 (2002)
Badrinath, B.R., Srivastava, M., Mills, K., Scholtz, J., Sollins, K.: Special issue on smart spaces and environments. IEEE Personal Communications (October 2000)
Estrin, D., Govindan, R., Heidemann, J.: Embedding the Internet. Communications of the ACM 43(5), 39–41 (2000) (Special issue guest editors)
Lindsey, S., Raghavendra, C., Sivalingam, K.: Data gathering in sensor networks using the energy delay metric. In: International Workshop on Parallel and Distributed Computing: Issues in Wireless Networks and Mobile Computing, San Francisco, USA (April 2001)
Cao, Q., Abdelzaher, T.: Scalable logical coordinates framework for routing in wireless sensor networks. ACM Transactions on Sensor Networks 2(4) (November 2006)
Chang, J.-H., Tassiulas, L.: Maximum lifetime routing in wireless sensor networks. IEEE/ACM Transactions on Networking 12(4) (August 2004)
Sohrabi, K., Gao, J., Ailawadhi, V., Pottie, G.J.: Protocols for self-organization of a wireless sensor network. Personal Communications, IEEE 7(5) (October 2000)
Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad-hoc routing. IEEE/ACM Transaction on Networking 14(3), 479–491 (2006)
Kyasanur, P., Choudhury, R.R., Gupta, I.: Smart gossip: an adaptive gossip-based broadcasting service for sensor networks. In: IEEE International Conference on Mobile Ad-hoc and Sensor Systems (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, SM., Han, SM., Lee, GW., Huh, EN. (2009). A Dynamic Interval Scheduling and Congestion Control Scheme for Sensor Networks. In: Ślęzak, D., Kim, Th., Chang, A.CC., Vasilakos, T., Li, M., Sakurai, K. (eds) Communication and Networking. FGCN 2009. Communications in Computer and Information Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10844-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-10844-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10843-3
Online ISBN: 978-3-642-10844-0
eBook Packages: Computer ScienceComputer Science (R0)