Mobile Agent Routing Algorithm Based on Improved Ant Colony Algorithm
Clicks: 315
ID: 60524
2013
At the present stage wireless sensor network exists some deficiencies such as finite energy, limited communication capability, multi-hop routing and dynamic topology. In addition too many nodes which are distributed intensively influence also performance of wireless sensor network. Besides distributed optimization problem always impact to efficiency of the network. For data processing and routing selection of wireless sensor network, a new routing algorithm based on mobile agent and ant colony optimization is proposed in the paper. The ant colony algorithm is improved and optimized in the paper. The algorithm can balance between routing efficiency and node loading. So on the one part the computing capability of sensor node and efficiency of data processing are improved. On the other part redundant data and communication consumption are reduced so that life expectancy of sensor is extended. Simulation experiments show that the new routing algorithm could solve the problems of wireless sensor network, and it has good practice application effect.
| Reference Key |
yueshun2013mobilesensors
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Yueshun, He;Ping, Du; |
| Journal | sensors & transducers |
| Year | 2013 |
| DOI | DOI not found |
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.