Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or morenumber of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage,processing power. They have wireless capabilities to monitor physical or environmental conditions. Thispaper compared the performance analysis of some existing routing protocols for target trackingapplication with proposed hierarchical binary tree structure to store the routing information. The sensedinformation is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparentnode) which deployed using complete binary tree data structure. This reduces traffic implosion andgeographical overlapping. Simulation result showed improved network lifetime by 20%, target detectionprobability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routingefficiency. We have evaluated our proposed algorithm using NS2.
展开▼
