COVERAGE PROBLEM IN HETEROGENEOUS WIRELESS SENSOR NETWORKS

A heterogeneous wireless sensor network consists of different types of nodes in sequence. Some of these nodes have high process powers and significant energy, which are called the manager nodes or super-nodes. The second type nodes, which have normal process power, are only used as monitoring nodes or act as relay nodes in the path to the manager nodes are called the normal nodes. In this paper, an energy-aware algorithm is presented for the optimum selection of sensor and relay groups that are used for monitoring and sending messages from goals in point coverage, using the competition between the nodes. This algorithm is effective in decreasing the energy consumption of the network and increasing its life-time. Moreover, providing that no node saves the information about the routing table and relay nodes; therefore, it will have less complexity and overload