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

Changlin Ma, Nian Liu and Yuan Ruan

International Journal of Distributed Sensor Networks, 2013, vol. 9, issue 11, 909243

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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2013/909243 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:9:y:2013:i:11:p:909243

DOI: 10.1155/2013/909243

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().