Quasi-Bottleneck nodes: a potential threat to the lifetime of wireless sensor networks

Authors:
Le Tian;Dongliang Xie;Lei Zhang;Shiduan Cheng
Affiliations:
State Key Lab of Networking and Switching, Beijing University of Posts & Communications, Beijing, China;State Key Lab of Networking and Switching, Beijing University of Posts & Communications, Beijing, China;State Key Lab of Networking and Switching, Beijing University of Posts & Communications, Beijing, China;State Key Lab of Networking and Switching, Beijing University of Posts & Communications, Beijing, China
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 6
Cited 1

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
System architecture directions for networked sensors

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Directed diffusion for wireless sensor networking

IEEE/ACM Transactions on Networking (TON)
The Impact of Data Aggregation in Wireless Sensor Networks

ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

DAR: An energy-balanced data-gathering scheme for wireless sensor networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.