A New Approach to the Bottleneck Problem in Wireless Sensor Network
Abstract
“Bottleneck Nodes” are those connect two or more areas alone with the reason of the deployment．Due to those particular positions, the data transferred between areas will surely go through those nodes. And then the lifetime of those nodes will obviously less than other nodes. Once those nodes are dead, the network would be divided to several unconnected parts and it means the network can not support the application any more. It is really a challenge to find out those nodes with sensor’s limited capability of calculation. [1] presents a new concept “quasi—Bottleneck Nodes” , and a distributed algorithm to find out all the “quasi—Bottleneck Nodes”.
In this paper, we will prove that “quasi—Bottleneck Nodes” arithmetic is not optimal, and then we will base the concept described in [1], and present a new concept “two-Hop quasi Bottleneck Nodes”, also we will give the new algorithm and prove that its cost is in .Besides that we will realize a simple simulator for experiment in this paper. The simulator aims at simulating both algorithms and holding a contrast between both algorithms.
