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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Tian, L., Xie, D., Zhang, L., & Cheng, S. (2006). Quasi-bottleneck nodes: A potential threat to the lifetime of wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3842 LNCS, pp. 241–248). Springer Verlag. https://doi.org/10.1007/11610496_31
Mendeley helps you to discover research relevant for your work.