Distributed Bottleneck Node Detection in Wireless Sensor Network

• Published in: 2010 10th IEEE International Conference on Computer and Information Technology pp. 218 - 224
• Main Authors: Haosong Gou, Younghwan Yoo
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2010
• Subjects: Algorithm design and analysis; Bottleneck Detection; Complexity theory; Distributed Detection; Energy Efficiency; Neck; Relays; Sensors; Transmitters; Wireless Sensor Network; Wireless sensor networks
• ISBN: 1424475473; 9781424475476
• DOI: 10.1109/CIT.2010.73

Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to the special property and difference from the traditional wireless network, the lifetime of the whole network is the most important aspect. The bottleneck nodes widely exist in WSNs and lead to decrease the lifetime of the whole network. In order to find out the bottleneck nodes, the traditional centralized bottleneck detection method MINCUT has been proposed as a solution for WSNs. However they are impractical for the net-works which have a huge number of nodes. This paper first proposes a distributed algorithm which can lower the algorithm complexity and find out the bottleneck nodes quickly. We also give two simple suggestions to solve the bottleneck problem. The simulation results and analysis show that our algorithm achieves much better performance and our solutions can relax the bottleneck problem, resulting in the prolonging of the network lifetime.