IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i11p909243.html
   My bibliography  Save this article

A Dynamic and Energy-Efficient Clustering Algorithm in Large-Scale Mobile Sensor Networks

Author

Listed:
  • Changlin Ma
  • Nian Liu
  • Yuan Ruan

Abstract

Random mobility and energy constraint are two main factors affecting system performance in mobile sensor networks, which cause many difficulties to system design. It is necessary to develop high-efficiency algorithms and protocols for mobile sensor networks to adapt to dynamic network environment and energy limitation. In this paper, a new clustering algorithm based on residual energy difference ratio is presented to improve system performance. Firstly, it is an energy-efficient algorithm. The residual energy of sensor nodes and average residual energy of system are considered in the residual energy difference ratio, which effectively avoid the nodes with low residual energy being selected as cluster heads. An energy-optimal scheme is used in cluster formation phase to minimize energy consumption. Secondly, it is a dynamic algorithm. The system dynamically clusters the sensor nodes according to the data transmission delays. It makes the whole system adapt to the random mobility of sensor nodes. The NS2 software is used to simulate the new clustering algorithm. The simulation experiments can verify the validity of the proposed theory.

Suggested Citation

  • Changlin Ma & Nian Liu & Yuan Ruan, 2013. "A Dynamic and Energy-Efficient Clustering Algorithm in Large-Scale Mobile Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 909243-9092, November.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:909243
    DOI: 10.1155/2013/909243
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/909243
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/909243?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:909243. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.