抽象的な

A Power - Balancing Approach for Coverage Time Optimization in Clustered Networks

S.Thirunavukkarasu Dr.K.P.Kaliyamurthie

The rapid transition to nano scale ICs has led to the integration of high performance processors and high speed, digital wireless communication circuits. For a large WSN (Wireless Sensor Network), sensors are often hierarchically organized into clusters, each having its own cluster head (CH). Within a cluster, sensors transmit data to their CH, which in turn forwards the data to the sink, either directly or through a multi hop path through other intermediate CHs. The coverage time of the network is defined as the time until one of the CHs runs out of battery, resulting in an incomplete coverage of the sensing region. The maximization of the coverage time for a clustered wireless sensor network by optimal balancing of power consumption among cluster heads (CHs). Clustering significantly reduces the energy consumption of individual sensors, but it also increases the communication burden on CHs. To investigate this tradeoff, the analytical model incorporates both the intra and the inter cluster traffic. Using a Rayleigh fading channel model for inter-cluster communications, we provide optimal power allocation strategies that guarantee (in a probabilistic sense) an upper bound on the end-to-end (inter-CH) path reliability. Our allocation strategies account for the interaction between routing and clustering by considering the impacts of intra- and intercluster traffic at each CH. Two mechanisms are proposed for achieving balanced power consumption: the routingaware optimal cluster planning and the clustering-aware optimal random relay. For both mechanisms, the problem is formulated as a signomial optimization, which can be efficiently solved using generalized geometric programming.