Localized detection of bottleneck nodes and qunatification of criticality in a wireless sensor networks

Wireless Sensor Network is an adhoc network having nodes with constraints like less memory and processing capability. Nodes work without knowledge of their position in the network. After random deployment of nodes, some of the nodes are in critical position as they connect one group of sensor nodes to another. If these nodes are removed from the network it may lead to partitioning of network. Most of the routing protocols identify a node as a bottleneck node depending upon residual energy of the node. The nodes consume considerable amount of energy before they identify themselves as bottleneck nodes. We propose an alternative method to detect the bottleneck nodes in the network just after their deployment, so energy may saved in these bottleneck nodes to increase lifetime of a wireless sensor network. This method also quantify criticality of the nodes in the network.