@article{MAKHILLAJIT20181726720,
    title = {Dynamic Lifetime Approximation Based Cluster Head Selection for
Efficient Data Aggregation in Wireless Sensor Network},
    journal = {Asian Journal of Information Technology},
    volume = {17},
    number = {2},
    pages = {119-123},
    year = {2018},
    issn = {1682-3915},
    doi = {ajit.2018.119.123},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2018.119.123},
    author = {Vijay Kumar and},
    keywords = {Cluster based routing,data aggregation,lifetime estimation,pertinent route weight,WSN,collection},
    abstract = {The Wireless Sensor Network (WSN) is used in many domains and data collection is one among
them. The WSN can be deployed anywhere on the battlefield for data collection. To perform data collection,
lot more methods has been recommended but suffers to achieve the performance in saturation. To improve the
performance in data collection and to maximize the lifetime of the sensor network, a dynamic lifetime
approximation algorithm is discussed in this study. The proposed method selects the cluster head each time
based on energy, the frequency of data transmission, some neighbors and number of transmissions involved.
The proposed method computes the Pertinent Lifetime Weight (PLW) and Pertinent Route Weight (PRW) using
the factors mentioned above and the cluster head selection is performed. Based on a computed value of
pertinent route weight the method selects a single route to perform data aggregation. This approach improves
the lifetime and performance of aggregation of data in WSN.}
    }