Abstract
Enlightened by the congestion linkage in the traditional Internet, the novel concept of bottleneck node is proposed in this paper, which is crucial to the lifetime of the wireless sensor network deployed randomly. Due to the computation complexity and the operational deployment, the quasi-bottleneck node is presented to replace the theoretical bottleneck node in the practical scenario. Theoretical analysis shows the probability of the presence of quasi-bottleneck nodes stands at high level and an algorithm to find out this kind of nodes is presented. Simulation proves the correctness of the algorithm and shows the effect of these nodes on the network behavior, such as energy consumption and packet lost rate. At last, two effective solutions to decrease the energy consumption of the quasi-bottleneck nodes are presented.
The work is supported partly by Nokia (China) Research Center, the Collaborative Construction Program of Beijing Municipal Commission of Education (XK100130438), Natural Science Foundation of China under Grant No. 90204003 and No.60402012, the Postdoctoral Science Foundation of China under Grant No.2003034111.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hill, J., Szewczyk, R., et al.: System architecture directions for networked sensors. In: Proceedings of Architectural Support for Programming Languages and Operating Systems-IX. ACM, New York (2000)
Shih, E., Cho, S., et al.: Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks. In: Proceedings of ACM MobiCom 2001 (2001)
Xu, L., et al.: Computer Mathematics of Modern Mathematics Handbook. Huazhong University of Science and Technology Press, P. 539
Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1(4), 397–413 (1993)
Massoulie, L., Roberts, J.: Bandwidth sharing: Objectives and algorithms. In: Proceedings of IEEE Infocom 1999 (1999)
Hu, N., Li (Erran), L., Mao, Z.M., Steenkiste, P., Wang, J.: A Measurement Study of Internet Bottlenecks. In: Proceeding of IEEE Infocom 2005 (2005)
Kalpakis, K., Dasgupta, K., Namjoshi, P.: Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks. Computer Networks 42(6), 697–716 (2003)
Krishnamachari, B., Estrin, D., Wicker, S.: The Impact of Data Aggregation inWireless Sensor Networks. In: International Workshop on Distributed Event-Based Systems (DEBS 2002), Vienna, Austria (July 2002)
NS-2 simulator, http://www.isi.edu/nsnam
Intanagonwiwat, C., et al.: Directed Diffusion for Wireless Sensor Networking. IEEE/ACM Transactions on Networking, WOL, 11(1) (February 2003)
Lee, J.-J., et al.: Impact of Energy Depletion and Reliability on Wireless Sensor Network Connectivity. In: SPIE Defense & Security Symposium (April 2004)
Sibley, G.T., Rahimi, M.H., Sukhatme, G.S.: Robomote: A tiny mobile robot platform for large-scale ad-hoc sensor networks. In: Proceedings of the IEEE International Conference on Robotics 158 and Automation, ICRA 2002 (2002)
Wang, G., Cao, G., La Porta, T., Zhang, W.: Sensor Relocation in Mobile Sensor Networks. In: Proceeding of IEEE Infocom 2005 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tian, L., Xie, D., Zhang, L., Cheng, S. (2006). Quasi-Bottleneck Nodes: A Potential Threat to the Lifetime of Wireless Sensor Networks. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds) Advanced Web and Network Technologies, and Applications. APWeb 2006. Lecture Notes in Computer Science, vol 3842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610496_31
Download citation
DOI: https://doi.org/10.1007/11610496_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31158-4
Online ISBN: 978-3-540-32435-5
eBook Packages: Computer ScienceComputer Science (R0)