A Novel Mobile Agent Based Energy Efficient Data Gather Algorithm for Wireless Sensor Networks

Xiujian Gu

doi:10.1109/iceict.2019.8846407

2019-01-01

PRE

DOI：10.1109/iceict.2019.8846407

原文链接

原文求助

摘要

En 中文

In wireless sensor networks (WSNs), complicated network topology has become a promising research in terms of routing protocols. Clustering technology is an efficient approach to balancing battery consumption of sensor devices in the entire sensing field. In this paper, we adopt an uneven clustering method to slow down the dead rate of sensor nodes especially in vicinity of base station. During the phase of data transmission, we insert a mobile agent (MA) that takes charge of data gather in network model, which can alleviate the overload problem of cluster heads (CHs). Moreover, we take single hop and multiple hops hybrid mechanism to forward packets and design an optimal migratory route for mobile agent, our proposed algorithm mainly combines greedy selection strategy and Hamilton loop algorithm, and the experimental consequences show that our scheme is superior to other algorithms in energy dissipation and packet delivery latency.

Keyword:

Wireless sensor networks

Uneven clustering

Mobile agent

Greedy strategy

Hamilton loop algorithm